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