src/HOL/Recdef.thy
author paulson
Wed Jul 25 17:58:26 2001 +0200 (2001-07-25)
changeset 11454 7514e5e21cb8
parent 11284 981ea92a86dd
child 11533 0c0d2332e8f0
permissions -rw-r--r--
Hilbert restructuring: Wellfounded_Relations no longer needs Hilbert_Choice
     1 (*  Title:      HOL/Recdef.thy
     2     ID:         $Id$
     3     Author:     Konrad Slind and Markus Wenzel, TU Muenchen
     4 
     5 TFL: recursive function definitions.
     6 *)
     7 
     8 theory Recdef = Wellfounded_Relations + Datatype
     9 files
    10   ("../TFL/utils.ML")
    11   ("../TFL/usyntax.ML")
    12   ("../TFL/dcterm.ML")
    13   ("../TFL/thms.ML")
    14   ("../TFL/rules.ML")
    15   ("../TFL/thry.ML")
    16   ("../TFL/tfl.ML")
    17   ("../TFL/post.ML")
    18   ("Tools/recdef_package.ML"):
    19 
    20 lemma tfl_eq_True: "(x = True) --> x"
    21   by blast
    22 
    23 lemma tfl_rev_eq_mp: "(x = y) --> y --> x";
    24   by blast
    25 
    26 lemma tfl_simp_thm: "(x --> y) --> (x = x') --> (x' --> y)"
    27   by blast
    28 
    29 lemma tfl_P_imp_P_iff_True: "P ==> P = True"
    30   by blast
    31 
    32 lemma tfl_imp_trans: "(A --> B) ==> (B --> C) ==> (A --> C)"
    33   by blast
    34 
    35 lemma tfl_disj_assoc: "(a \\<or> b) \\<or> c == a \\<or> (b \\<or> c)"
    36   by simp
    37 
    38 lemma tfl_disjE: "P \\<or> Q ==> P --> R ==> Q --> R ==> R"
    39   by blast
    40 
    41 lemma tfl_exE: "\\<exists>x. P x ==> \\<forall>x. P x --> Q ==> Q"
    42   by blast
    43 
    44 use "../TFL/utils.ML"
    45 use "../TFL/usyntax.ML"
    46 use "../TFL/dcterm.ML"
    47 use "../TFL/thms.ML"
    48 use "../TFL/rules.ML"
    49 use "../TFL/thry.ML"
    50 use "../TFL/tfl.ML"
    51 use "../TFL/post.ML"
    52 use "Tools/recdef_package.ML"
    53 setup RecdefPackage.setup
    54 
    55 lemmas [recdef_simp] =
    56   inv_image_def
    57   measure_def
    58   lex_prod_def
    59   same_fst_def
    60   less_Suc_eq [THEN iffD2]
    61 
    62 lemmas [recdef_cong] = if_cong image_cong
    63 
    64 lemma let_cong [recdef_cong]:
    65     "M = N ==> (!!x. x = N ==> f x = g x) ==> Let M f = Let N g"
    66   by (unfold Let_def) blast
    67 
    68 lemmas [recdef_wf] =
    69   wf_trancl
    70   wf_less_than
    71   wf_lex_prod
    72   wf_inv_image
    73   wf_measure
    74   wf_pred_nat
    75   wf_same_fst
    76   wf_empty
    77 
    78 end