src/HOL/Recdef.thy
author wenzelm
Fri Mar 28 19:43:54 2008 +0100 (2008-03-28)
changeset 26462 dac4e2bce00d
parent 23742 d6349ac8b153
child 26748 4d51ddd6aa5c
permissions -rw-r--r--
avoid rebinding of existing facts;
     1 (*  Title:      HOL/Recdef.thy
     2     ID:         $Id$
     3     Author:     Konrad Slind and Markus Wenzel, TU Muenchen
     4 *)
     5 
     6 header {* TFL: recursive function definitions *}
     7 
     8 theory Recdef
     9 imports Wellfounded_Relations FunDef
    10 uses
    11   ("Tools/TFL/casesplit.ML")
    12   ("Tools/TFL/utils.ML")
    13   ("Tools/TFL/usyntax.ML")
    14   ("Tools/TFL/dcterm.ML")
    15   ("Tools/TFL/thms.ML")
    16   ("Tools/TFL/rules.ML")
    17   ("Tools/TFL/thry.ML")
    18   ("Tools/TFL/tfl.ML")
    19   ("Tools/TFL/post.ML")
    20   ("Tools/recdef_package.ML")
    21 begin
    22 
    23 lemma tfl_eq_True: "(x = True) --> x"
    24   by blast
    25 
    26 lemma tfl_rev_eq_mp: "(x = y) --> y --> x";
    27   by blast
    28 
    29 lemma tfl_simp_thm: "(x --> y) --> (x = x') --> (x' --> y)"
    30   by blast
    31 
    32 lemma tfl_P_imp_P_iff_True: "P ==> P = True"
    33   by blast
    34 
    35 lemma tfl_imp_trans: "(A --> B) ==> (B --> C) ==> (A --> C)"
    36   by blast
    37 
    38 lemma tfl_disj_assoc: "(a \<or> b) \<or> c == a \<or> (b \<or> c)"
    39   by simp
    40 
    41 lemma tfl_disjE: "P \<or> Q ==> P --> R ==> Q --> R ==> R"
    42   by blast
    43 
    44 lemma tfl_exE: "\<exists>x. P x ==> \<forall>x. P x --> Q ==> Q"
    45   by blast
    46 
    47 use "Tools/TFL/casesplit.ML"
    48 use "Tools/TFL/utils.ML"
    49 use "Tools/TFL/usyntax.ML"
    50 use "Tools/TFL/dcterm.ML"
    51 use "Tools/TFL/thms.ML"
    52 use "Tools/TFL/rules.ML"
    53 use "Tools/TFL/thry.ML"
    54 use "Tools/TFL/tfl.ML"
    55 use "Tools/TFL/post.ML"
    56 use "Tools/recdef_package.ML"
    57 setup RecdefPackage.setup
    58 
    59 lemmas [recdef_simp] =
    60   inv_image_def
    61   measure_def
    62   lex_prod_def
    63   same_fst_def
    64   less_Suc_eq [THEN iffD2]
    65 
    66 lemmas [recdef_cong] =
    67   if_cong let_cong image_cong INT_cong UN_cong bex_cong ball_cong imp_cong
    68 
    69 lemmas [recdef_wf] =
    70   wf_trancl
    71   wf_less_than
    72   wf_lex_prod
    73   wf_inv_image
    74   wf_measure
    75   wf_pred_nat
    76   wf_same_fst
    77   wf_empty
    78 
    79 end