src/HOL/Inductive.thy
author berghofe
Wed Jul 11 10:59:23 2007 +0200 (2007-07-11)
changeset 23734 0e11b904b3a3
parent 23708 b5eb0b4dd17d
child 24349 0dd8782fb02d
permissions -rw-r--r--
Added new package for inductive sets.
wenzelm@7700
     1
(*  Title:      HOL/Inductive.thy
wenzelm@7700
     2
    ID:         $Id$
wenzelm@10402
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@11688
     4
*)
wenzelm@10727
     5
wenzelm@11688
     6
header {* Support for inductive sets and types *}
lcp@1187
     7
nipkow@15131
     8
theory Inductive 
haftmann@23708
     9
imports FixedPoint Product_Type Sum_Type
haftmann@16417
    10
uses
wenzelm@10402
    11
  ("Tools/inductive_package.ML")
berghofe@23734
    12
  ("Tools/inductive_set_package.ML")
berghofe@13705
    13
  ("Tools/inductive_realizer.ML")
berghofe@12437
    14
  ("Tools/inductive_codegen.ML")
wenzelm@10402
    15
  ("Tools/datatype_aux.ML")
wenzelm@10402
    16
  ("Tools/datatype_prop.ML")
wenzelm@10402
    17
  ("Tools/datatype_rep_proofs.ML")
wenzelm@10402
    18
  ("Tools/datatype_abs_proofs.ML")
berghofe@13469
    19
  ("Tools/datatype_realizer.ML")
haftmann@19599
    20
  ("Tools/datatype_hooks.ML")
berghofe@22783
    21
  ("Tools/datatype_case.ML")
wenzelm@10402
    22
  ("Tools/datatype_package.ML")
berghofe@12437
    23
  ("Tools/datatype_codegen.ML")
nipkow@15131
    24
  ("Tools/primrec_package.ML")
nipkow@15131
    25
begin
wenzelm@10727
    26
berghofe@23734
    27
subsection {* Inductive predicates and sets *}
wenzelm@11688
    28
wenzelm@11688
    29
text {* Inversion of injective functions. *}
wenzelm@11436
    30
wenzelm@11436
    31
constdefs
wenzelm@11436
    32
  myinv :: "('a => 'b) => ('b => 'a)"
wenzelm@11436
    33
  "myinv (f :: 'a => 'b) == \<lambda>y. THE x. f x = y"
wenzelm@11436
    34
wenzelm@11436
    35
lemma myinv_f_f: "inj f ==> myinv f (f x) = x"
wenzelm@11436
    36
proof -
wenzelm@11436
    37
  assume "inj f"
wenzelm@11436
    38
  hence "(THE x'. f x' = f x) = (THE x'. x' = x)"
wenzelm@11436
    39
    by (simp only: inj_eq)
wenzelm@11436
    40
  also have "... = x" by (rule the_eq_trivial)
wenzelm@11439
    41
  finally show ?thesis by (unfold myinv_def)
wenzelm@11436
    42
qed
wenzelm@11436
    43
wenzelm@11436
    44
lemma f_myinv_f: "inj f ==> y \<in> range f ==> f (myinv f y) = y"
wenzelm@11436
    45
proof (unfold myinv_def)
wenzelm@11436
    46
  assume inj: "inj f"
wenzelm@11436
    47
  assume "y \<in> range f"
wenzelm@11436
    48
  then obtain x where "y = f x" ..
wenzelm@11436
    49
  hence x: "f x = y" ..
wenzelm@11436
    50
  thus "f (THE x. f x = y) = y"
wenzelm@11436
    51
  proof (rule theI)
wenzelm@11436
    52
    fix x' assume "f x' = y"
wenzelm@11436
    53
    with x have "f x' = f x" by simp
wenzelm@11436
    54
    with inj show "x' = x" by (rule injD)
wenzelm@11436
    55
  qed
wenzelm@11436
    56
qed
wenzelm@11436
    57
wenzelm@11436
    58
hide const myinv
wenzelm@11436
    59
wenzelm@11436
    60
wenzelm@11688
    61
text {* Package setup. *}
wenzelm@10402
    62
berghofe@23734
    63
theorems basic_monos =
haftmann@22218
    64
  subset_refl imp_refl disj_mono conj_mono ex_mono all_mono if_bool_eq_conj
wenzelm@11688
    65
  Collect_mono in_mono vimage_mono
wenzelm@11688
    66
  imp_conv_disj not_not de_Morgan_disj de_Morgan_conj
wenzelm@11688
    67
  not_all not_ex
wenzelm@11688
    68
  Ball_def Bex_def
wenzelm@18456
    69
  induct_rulify_fallback
wenzelm@11688
    70
berghofe@21018
    71
use "Tools/inductive_package.ML"
berghofe@21018
    72
setup InductivePackage.setup
berghofe@21018
    73
berghofe@23734
    74
theorems [mono] =
haftmann@22218
    75
  imp_refl disj_mono conj_mono ex_mono all_mono if_bool_eq_conj
berghofe@21018
    76
  imp_conv_disj not_not de_Morgan_disj de_Morgan_conj
berghofe@21018
    77
  not_all not_ex
berghofe@21018
    78
  Ball_def Bex_def
berghofe@21018
    79
  induct_rulify_fallback
berghofe@21018
    80
haftmann@20604
    81
lemma False_meta_all:
haftmann@20604
    82
  "Trueprop False \<equiv> (\<And>P\<Colon>bool. P)"
haftmann@20604
    83
proof
haftmann@20604
    84
  fix P
haftmann@20604
    85
  assume False
haftmann@20604
    86
  then show P ..
haftmann@20604
    87
next
haftmann@20604
    88
  assume "\<And>P\<Colon>bool. P"
wenzelm@23389
    89
  then show False .
haftmann@20604
    90
qed
haftmann@20604
    91
haftmann@20604
    92
lemma not_eq_False:
haftmann@20604
    93
  assumes not_eq: "x \<noteq> y"
haftmann@22886
    94
  and eq: "x \<equiv> y"
haftmann@20604
    95
  shows False
haftmann@20604
    96
  using not_eq eq by auto
haftmann@20604
    97
haftmann@20604
    98
lemmas not_eq_quodlibet =
haftmann@20604
    99
  not_eq_False [simplified False_meta_all]
haftmann@20604
   100
wenzelm@11688
   101
wenzelm@12023
   102
subsection {* Inductive datatypes and primitive recursion *}
wenzelm@11688
   103
wenzelm@11825
   104
text {* Package setup. *}
wenzelm@11825
   105
wenzelm@10402
   106
use "Tools/datatype_aux.ML"
wenzelm@10402
   107
use "Tools/datatype_prop.ML"
wenzelm@10402
   108
use "Tools/datatype_rep_proofs.ML"
wenzelm@10402
   109
use "Tools/datatype_abs_proofs.ML"
berghofe@22783
   110
use "Tools/datatype_case.ML"
berghofe@13469
   111
use "Tools/datatype_realizer.ML"
haftmann@19599
   112
haftmann@19599
   113
use "Tools/datatype_hooks.ML"
haftmann@19599
   114
wenzelm@10402
   115
use "Tools/datatype_package.ML"
wenzelm@7700
   116
setup DatatypePackage.setup
wenzelm@10402
   117
berghofe@12437
   118
use "Tools/datatype_codegen.ML"
berghofe@12437
   119
setup DatatypeCodegen.setup
berghofe@12437
   120
berghofe@13705
   121
use "Tools/inductive_realizer.ML"
berghofe@13705
   122
setup InductiveRealizer.setup
berghofe@13705
   123
berghofe@12437
   124
use "Tools/inductive_codegen.ML"
berghofe@12437
   125
setup InductiveCodegen.setup
berghofe@12437
   126
wenzelm@10402
   127
use "Tools/primrec_package.ML"
wenzelm@7700
   128
berghofe@23734
   129
use "Tools/inductive_set_package.ML"
berghofe@23734
   130
setup InductiveSetPackage.setup
berghofe@23734
   131
nipkow@23526
   132
text{* Lambda-abstractions with pattern matching: *}
nipkow@23526
   133
nipkow@23526
   134
syntax
nipkow@23529
   135
  "_lam_pats_syntax" :: "cases_syn => 'a => 'b"               ("(%_)" 10)
nipkow@23526
   136
syntax (xsymbols)
nipkow@23529
   137
  "_lam_pats_syntax" :: "cases_syn => 'a => 'b"               ("(\<lambda>_)" 10)
nipkow@23526
   138
nipkow@23529
   139
parse_translation (advanced) {*
nipkow@23529
   140
let
nipkow@23529
   141
  fun fun_tr ctxt [cs] =
nipkow@23529
   142
    let
nipkow@23529
   143
      val x = Free (Name.variant (add_term_free_names (cs, [])) "x", dummyT);
nipkow@23529
   144
      val ft = DatatypeCase.case_tr DatatypePackage.datatype_of_constr ctxt
nipkow@23529
   145
                 [x, cs]
nipkow@23529
   146
    in lambda x ft end
nipkow@23529
   147
in [("_lam_pats_syntax", fun_tr)] end
nipkow@23526
   148
*}
nipkow@23526
   149
nipkow@23526
   150
end