src/HOL/HOL.thy
author wenzelm
Mon Dec 28 21:47:32 2015 +0100 (2015-12-28)
changeset 61955 e96292f32c3c
parent 61941 31f2105521ee
child 62151 dc4c9748a86e
permissions -rw-r--r--
former "xsymbols" syntax is used by default, and ASCII replacement syntax with print mode "ASCII";
clasohm@923
     1
(*  Title:      HOL/HOL.thy
wenzelm@11750
     2
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
wenzelm@11750
     3
*)
clasohm@923
     4
wenzelm@60758
     5
section \<open>The basis of Higher-Order Logic\<close>
clasohm@923
     6
nipkow@15131
     7
theory HOL
haftmann@30929
     8
imports Pure "~~/src/Tools/Code_Generator"
wenzelm@46950
     9
keywords
wenzelm@52432
    10
  "try" "solve_direct" "quickcheck" "print_coercions" "print_claset"
wenzelm@52432
    11
    "print_induct_rules" :: diag and
haftmann@47657
    12
  "quickcheck_params" :: thy_decl
nipkow@15131
    13
begin
wenzelm@2260
    14
wenzelm@48891
    15
ML_file "~~/src/Tools/misc_legacy.ML"
wenzelm@48891
    16
ML_file "~~/src/Tools/try.ML"
wenzelm@48891
    17
ML_file "~~/src/Tools/quickcheck.ML"
wenzelm@48891
    18
ML_file "~~/src/Tools/solve_direct.ML"
wenzelm@48891
    19
ML_file "~~/src/Tools/IsaPlanner/zipper.ML"
wenzelm@48891
    20
ML_file "~~/src/Tools/IsaPlanner/isand.ML"
wenzelm@48891
    21
ML_file "~~/src/Tools/IsaPlanner/rw_inst.ML"
wenzelm@48891
    22
ML_file "~~/src/Provers/hypsubst.ML"
wenzelm@48891
    23
ML_file "~~/src/Provers/splitter.ML"
wenzelm@48891
    24
ML_file "~~/src/Provers/classical.ML"
wenzelm@48891
    25
ML_file "~~/src/Provers/blast.ML"
wenzelm@48891
    26
ML_file "~~/src/Provers/clasimp.ML"
wenzelm@48891
    27
ML_file "~~/src/Tools/eqsubst.ML"
wenzelm@48891
    28
ML_file "~~/src/Provers/quantifier1.ML"
wenzelm@48891
    29
ML_file "~~/src/Tools/atomize_elim.ML"
wenzelm@48891
    30
ML_file "~~/src/Tools/cong_tac.ML"
wenzelm@58826
    31
ML_file "~~/src/Tools/intuitionistic.ML" setup \<open>Intuitionistic.method_setup @{binding iprover}\<close>
wenzelm@48891
    32
ML_file "~~/src/Tools/project_rule.ML"
wenzelm@48891
    33
ML_file "~~/src/Tools/subtyping.ML"
wenzelm@48891
    34
ML_file "~~/src/Tools/case_product.ML"
wenzelm@48891
    35
wenzelm@30165
    36
wenzelm@58659
    37
ML \<open>Plugin_Name.declare_setup @{binding extraction}\<close>
wenzelm@58659
    38
wenzelm@58659
    39
ML \<open>
wenzelm@58659
    40
  Plugin_Name.declare_setup @{binding quickcheck_random};
wenzelm@58659
    41
  Plugin_Name.declare_setup @{binding quickcheck_exhaustive};
wenzelm@58659
    42
  Plugin_Name.declare_setup @{binding quickcheck_bounded_forall};
wenzelm@58659
    43
  Plugin_Name.declare_setup @{binding quickcheck_full_exhaustive};
wenzelm@58659
    44
  Plugin_Name.declare_setup @{binding quickcheck_narrowing};
wenzelm@58659
    45
\<close>
wenzelm@58659
    46
ML \<open>
wenzelm@58659
    47
  Plugin_Name.define_setup @{binding quickcheck}
wenzelm@58659
    48
   [@{plugin quickcheck_exhaustive},
wenzelm@58659
    49
    @{plugin quickcheck_random},
wenzelm@58659
    50
    @{plugin quickcheck_bounded_forall},
wenzelm@58659
    51
    @{plugin quickcheck_full_exhaustive},
wenzelm@58659
    52
    @{plugin quickcheck_narrowing}]
wenzelm@58659
    53
\<close>
wenzelm@58659
    54
wenzelm@58659
    55
wenzelm@60758
    56
subsection \<open>Primitive logic\<close>
wenzelm@11750
    57
wenzelm@60758
    58
subsubsection \<open>Core syntax\<close>
wenzelm@2260
    59
wenzelm@60758
    60
setup \<open>Axclass.class_axiomatization (@{binding type}, [])\<close>
wenzelm@36452
    61
default_sort type
wenzelm@60758
    62
setup \<open>Object_Logic.add_base_sort @{sort type}\<close>
haftmann@25460
    63
wenzelm@55383
    64
axiomatization where fun_arity: "OFCLASS('a \<Rightarrow> 'b, type_class)"
wenzelm@55383
    65
instance "fun" :: (type, type) type by (rule fun_arity)
wenzelm@55383
    66
wenzelm@55383
    67
axiomatization where itself_arity: "OFCLASS('a itself, type_class)"
wenzelm@55383
    68
instance itself :: (type) type by (rule itself_arity)
haftmann@25460
    69
wenzelm@7357
    70
typedecl bool
clasohm@923
    71
wenzelm@11750
    72
judgment
wenzelm@60759
    73
  Trueprop      :: "bool \<Rightarrow> prop"                   ("(_)" 5)
clasohm@923
    74
wenzelm@46973
    75
axiomatization
wenzelm@61955
    76
  implies       :: "[bool, bool] \<Rightarrow> bool"           (infixr "\<longrightarrow>" 25)  and
wenzelm@60759
    77
  eq            :: "['a, 'a] \<Rightarrow> bool"               (infixl "=" 50)  and
wenzelm@60759
    78
  The           :: "('a \<Rightarrow> bool) \<Rightarrow> 'a"
wenzelm@46973
    79
wenzelm@11750
    80
consts
wenzelm@7357
    81
  True          :: bool
wenzelm@7357
    82
  False         :: bool
wenzelm@61955
    83
  Not           :: "bool \<Rightarrow> bool"                   ("\<not> _" [40] 40)
haftmann@38795
    84
wenzelm@61955
    85
  conj          :: "[bool, bool] \<Rightarrow> bool"           (infixr "\<and>" 35)
wenzelm@61955
    86
  disj          :: "[bool, bool] \<Rightarrow> bool"           (infixr "\<or>" 30)
haftmann@38555
    87
wenzelm@61955
    88
  All           :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "\<forall>" 10)
wenzelm@61955
    89
  Ex            :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "\<exists>" 10)
wenzelm@61955
    90
  Ex1           :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "\<exists>!" 10)
clasohm@923
    91
wenzelm@19656
    92
wenzelm@60758
    93
subsubsection \<open>Additional concrete syntax\<close>
wenzelm@2260
    94
wenzelm@61955
    95
abbreviation not_equal :: "['a, 'a] \<Rightarrow> bool"  (infixl "\<noteq>" 50)
wenzelm@61955
    96
  where "x \<noteq> y \<equiv> \<not> (x = y)"
wenzelm@19656
    97
wenzelm@21210
    98
notation (output)
wenzelm@61955
    99
  eq  (infix "=" 50) and
wenzelm@61955
   100
  not_equal  (infix "\<noteq>" 50)
wenzelm@61955
   101
wenzelm@61955
   102
notation (ASCII output)
wenzelm@19656
   103
  not_equal  (infix "~=" 50)
wenzelm@19656
   104
wenzelm@61955
   105
notation (ASCII)
wenzelm@61955
   106
  Not  ("~ _" [40] 40) and
wenzelm@61955
   107
  conj  (infixr "&" 35) and
wenzelm@61955
   108
  disj  (infixr "|" 30) and
wenzelm@61955
   109
  implies  (infixr "-->" 25) and
wenzelm@61955
   110
  not_equal  (infixl "~=" 50)
wenzelm@19656
   111
wenzelm@19656
   112
abbreviation (iff)
wenzelm@61955
   113
  iff :: "[bool, bool] \<Rightarrow> bool"  (infixr "\<longleftrightarrow>" 25)
wenzelm@61955
   114
  where "A \<longleftrightarrow> B \<equiv> A = B"
wenzelm@19656
   115
wenzelm@60759
   116
syntax "_The" :: "[pttrn, bool] \<Rightarrow> 'a"  ("(3THE _./ _)" [0, 10] 10)
wenzelm@60759
   117
translations "THE x. P" \<rightleftharpoons> "CONST The (\<lambda>x. P)"
wenzelm@60758
   118
print_translation \<open>
wenzelm@52143
   119
  [(@{const_syntax The}, fn _ => fn [Abs abs] =>
wenzelm@46125
   120
      let val (x, t) = Syntax_Trans.atomic_abs_tr' abs
wenzelm@46125
   121
      in Syntax.const @{syntax_const "_The"} $ x $ t end)]
wenzelm@61799
   122
\<close>  \<comment> \<open>To avoid eta-contraction of body\<close>
clasohm@923
   123
wenzelm@46125
   124
nonterminal letbinds and letbind
clasohm@923
   125
syntax
wenzelm@60759
   126
  "_bind"       :: "[pttrn, 'a] \<Rightarrow> letbind"              ("(2_ =/ _)" 10)
wenzelm@60759
   127
  ""            :: "letbind \<Rightarrow> letbinds"                 ("_")
wenzelm@60759
   128
  "_binds"      :: "[letbind, letbinds] \<Rightarrow> letbinds"     ("_;/ _")
wenzelm@60759
   129
  "_Let"        :: "[letbinds, 'a] \<Rightarrow> 'a"                ("(let (_)/ in (_))" [0, 10] 10)
clasohm@923
   130
wenzelm@46125
   131
nonterminal case_syn and cases_syn
wenzelm@46125
   132
syntax
wenzelm@60759
   133
  "_case_syntax" :: "['a, cases_syn] \<Rightarrow> 'b"  ("(case _ of/ _)" 10)
wenzelm@61955
   134
  "_case1" :: "['a, 'b] \<Rightarrow> case_syn"  ("(2_ \<Rightarrow>/ _)" 10)
wenzelm@60759
   135
  "" :: "case_syn \<Rightarrow> cases_syn"  ("_")
wenzelm@60759
   136
  "_case2" :: "[case_syn, cases_syn] \<Rightarrow> cases_syn"  ("_/ | _")
wenzelm@61955
   137
syntax (ASCII)
wenzelm@61955
   138
  "_case1" :: "['a, 'b] \<Rightarrow> case_syn"  ("(2_ =>/ _)" 10)
nipkow@13763
   139
wenzelm@61955
   140
notation (ASCII)
wenzelm@61955
   141
  All  (binder "ALL " 10) and
wenzelm@61955
   142
  Ex  (binder "EX " 10) and
wenzelm@61955
   143
  Ex1  (binder "EX! " 10)
wenzelm@2372
   144
wenzelm@21524
   145
notation (HOL)
wenzelm@21524
   146
  All  (binder "! " 10) and
wenzelm@21524
   147
  Ex  (binder "? " 10) and
wenzelm@21524
   148
  Ex1  (binder "?! " 10)
wenzelm@7238
   149
wenzelm@7238
   150
wenzelm@60758
   151
subsubsection \<open>Axioms and basic definitions\<close>
wenzelm@2260
   152
wenzelm@46973
   153
axiomatization where
wenzelm@46973
   154
  refl: "t = (t::'a)" and
wenzelm@46973
   155
  subst: "s = t \<Longrightarrow> P s \<Longrightarrow> P t" and
wenzelm@60759
   156
  ext: "(\<And>x::'a. (f x ::'b) = g x) \<Longrightarrow> (\<lambda>x. f x) = (\<lambda>x. g x)"
wenzelm@61799
   157
    \<comment> \<open>Extensionality is built into the meta-logic, and this rule expresses
paulson@15380
   158
         a related property.  It is an eta-expanded version of the traditional
wenzelm@60758
   159
         rule, and similar to the ABS rule of HOL\<close> and
paulson@6289
   160
wenzelm@11432
   161
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
clasohm@923
   162
wenzelm@46973
   163
axiomatization where
wenzelm@60759
   164
  impI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<longrightarrow> Q" and
wenzelm@60759
   165
  mp: "\<lbrakk>P \<longrightarrow> Q; P\<rbrakk> \<Longrightarrow> Q" and
paulson@15380
   166
wenzelm@60759
   167
  iff: "(P \<longrightarrow> Q) \<longrightarrow> (Q \<longrightarrow> P) \<longrightarrow> (P = Q)" and
wenzelm@60759
   168
  True_or_False: "(P = True) \<or> (P = False)"
paulson@15380
   169
clasohm@923
   170
defs
wenzelm@60759
   171
  True_def:     "True      \<equiv> ((\<lambda>x::bool. x) = (\<lambda>x. x))"
wenzelm@60759
   172
  All_def:      "All P     \<equiv> (P = (\<lambda>x. True))"
wenzelm@60759
   173
  Ex_def:       "Ex P      \<equiv> \<forall>Q. (\<forall>x. P x \<longrightarrow> Q) \<longrightarrow> Q"
wenzelm@60759
   174
  False_def:    "False     \<equiv> (\<forall>P. P)"
wenzelm@60759
   175
  not_def:      "\<not> P       \<equiv> P \<longrightarrow> False"
wenzelm@60759
   176
  and_def:      "P \<and> Q     \<equiv> \<forall>R. (P \<longrightarrow> Q \<longrightarrow> R) \<longrightarrow> R"
wenzelm@60759
   177
  or_def:       "P \<or> Q     \<equiv> \<forall>R. (P \<longrightarrow> R) \<longrightarrow> (Q \<longrightarrow> R) \<longrightarrow> R"
wenzelm@60759
   178
  Ex1_def:      "Ex1 P     \<equiv> \<exists>x. P x \<and> (\<forall>y. P y \<longrightarrow> y = x)"
clasohm@923
   179
wenzelm@46973
   180
definition If :: "bool \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'a" ("(if (_)/ then (_)/ else (_))" [0, 0, 10] 10)
wenzelm@60759
   181
  where "If P x y \<equiv> (THE z::'a. (P = True \<longrightarrow> z = x) \<and> (P = False \<longrightarrow> z = y))"
clasohm@923
   182
wenzelm@46973
   183
definition Let :: "'a \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b"
wenzelm@46973
   184
  where "Let s f \<equiv> f s"
haftmann@38525
   185
haftmann@38525
   186
translations
wenzelm@60759
   187
  "_Let (_binds b bs) e"  \<rightleftharpoons> "_Let b (_Let bs e)"
wenzelm@60759
   188
  "let x = a in e"        \<rightleftharpoons> "CONST Let a (\<lambda>x. e)"
haftmann@38525
   189
wenzelm@46973
   190
axiomatization undefined :: 'a
haftmann@22481
   191
wenzelm@46973
   192
class default = fixes default :: 'a
wenzelm@4868
   193
wenzelm@11750
   194
wenzelm@60758
   195
subsection \<open>Fundamental rules\<close>
haftmann@20944
   196
wenzelm@60758
   197
subsubsection \<open>Equality\<close>
haftmann@20944
   198
wenzelm@60759
   199
lemma sym: "s = t \<Longrightarrow> t = s"
wenzelm@18457
   200
  by (erule subst) (rule refl)
paulson@15411
   201
wenzelm@60759
   202
lemma ssubst: "t = s \<Longrightarrow> P s \<Longrightarrow> P t"
wenzelm@18457
   203
  by (drule sym) (erule subst)
paulson@15411
   204
wenzelm@60759
   205
lemma trans: "\<lbrakk>r = s; s = t\<rbrakk> \<Longrightarrow> r = t"
wenzelm@18457
   206
  by (erule subst)
paulson@15411
   207
wenzelm@60759
   208
lemma trans_sym [Pure.elim?]: "r = s \<Longrightarrow> t = s \<Longrightarrow> r = t"
wenzelm@40715
   209
  by (rule trans [OF _ sym])
wenzelm@40715
   210
wenzelm@58826
   211
lemma meta_eq_to_obj_eq:
wenzelm@60759
   212
  assumes meq: "A \<equiv> B"
haftmann@20944
   213
  shows "A = B"
haftmann@20944
   214
  by (unfold meq) (rule refl)
paulson@15411
   215
wenzelm@61799
   216
text \<open>Useful with \<open>erule\<close> for proving equalities from known equalities.\<close>
haftmann@20944
   217
     (* a = b
paulson@15411
   218
        |   |
paulson@15411
   219
        c = d   *)
wenzelm@60759
   220
lemma box_equals: "\<lbrakk>a = b; a = c; b = d\<rbrakk> \<Longrightarrow> c = d"
paulson@15411
   221
apply (rule trans)
paulson@15411
   222
apply (rule trans)
paulson@15411
   223
apply (rule sym)
paulson@15411
   224
apply assumption+
paulson@15411
   225
done
paulson@15411
   226
wenzelm@60758
   227
text \<open>For calculational reasoning:\<close>
nipkow@15524
   228
wenzelm@60759
   229
lemma forw_subst: "a = b \<Longrightarrow> P b \<Longrightarrow> P a"
nipkow@15524
   230
  by (rule ssubst)
nipkow@15524
   231
wenzelm@60759
   232
lemma back_subst: "P a \<Longrightarrow> a = b \<Longrightarrow> P b"
nipkow@15524
   233
  by (rule subst)
nipkow@15524
   234
paulson@15411
   235
wenzelm@60758
   236
subsubsection \<open>Congruence rules for application\<close>
paulson@15411
   237
wenzelm@61799
   238
text \<open>Similar to \<open>AP_THM\<close> in Gordon's HOL.\<close>
wenzelm@60759
   239
lemma fun_cong: "(f :: 'a \<Rightarrow> 'b) = g \<Longrightarrow> f x = g x"
paulson@15411
   240
apply (erule subst)
paulson@15411
   241
apply (rule refl)
paulson@15411
   242
done
paulson@15411
   243
wenzelm@61799
   244
text \<open>Similar to \<open>AP_TERM\<close> in Gordon's HOL and FOL's \<open>subst_context\<close>.\<close>
wenzelm@60759
   245
lemma arg_cong: "x = y \<Longrightarrow> f x = f y"
paulson@15411
   246
apply (erule subst)
paulson@15411
   247
apply (rule refl)
paulson@15411
   248
done
paulson@15411
   249
wenzelm@60759
   250
lemma arg_cong2: "\<lbrakk>a = b; c = d\<rbrakk> \<Longrightarrow> f a c = f b d"
paulson@15655
   251
apply (erule ssubst)+
paulson@15655
   252
apply (rule refl)
paulson@15655
   253
done
paulson@15655
   254
wenzelm@60759
   255
lemma cong: "\<lbrakk>f = g; (x::'a) = y\<rbrakk> \<Longrightarrow> f x = g y"
paulson@15411
   256
apply (erule subst)+
paulson@15411
   257
apply (rule refl)
paulson@15411
   258
done
paulson@15411
   259
wenzelm@60758
   260
ML \<open>fun cong_tac ctxt = Cong_Tac.cong_tac ctxt @{thm cong}\<close>
paulson@15411
   261
wenzelm@32733
   262
wenzelm@60758
   263
subsubsection \<open>Equality of booleans -- iff\<close>
paulson@15411
   264
wenzelm@60759
   265
lemma iffI: assumes "P \<Longrightarrow> Q" and "Q \<Longrightarrow> P" shows "P = Q"
wenzelm@21504
   266
  by (iprover intro: iff [THEN mp, THEN mp] impI assms)
paulson@15411
   267
wenzelm@60759
   268
lemma iffD2: "\<lbrakk>P = Q; Q\<rbrakk> \<Longrightarrow> P"
wenzelm@18457
   269
  by (erule ssubst)
paulson@15411
   270
wenzelm@60759
   271
lemma rev_iffD2: "\<lbrakk>Q; P = Q\<rbrakk> \<Longrightarrow> P"
wenzelm@18457
   272
  by (erule iffD2)
paulson@15411
   273
wenzelm@21504
   274
lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P"
wenzelm@21504
   275
  by (drule sym) (rule iffD2)
wenzelm@21504
   276
wenzelm@21504
   277
lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P"
wenzelm@21504
   278
  by (drule sym) (rule rev_iffD2)
paulson@15411
   279
paulson@15411
   280
lemma iffE:
wenzelm@60759
   281
  assumes major: "P = Q"
wenzelm@60759
   282
    and minor: "\<lbrakk>P \<longrightarrow> Q; Q \<longrightarrow> P\<rbrakk> \<Longrightarrow> R"
wenzelm@18457
   283
  shows R
wenzelm@18457
   284
  by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
paulson@15411
   285
paulson@15411
   286
wenzelm@60758
   287
subsubsection \<open>True\<close>
paulson@15411
   288
paulson@15411
   289
lemma TrueI: "True"
wenzelm@21504
   290
  unfolding True_def by (rule refl)
paulson@15411
   291
wenzelm@60759
   292
lemma eqTrueI: "P \<Longrightarrow> P = True"
wenzelm@18457
   293
  by (iprover intro: iffI TrueI)
paulson@15411
   294
wenzelm@60759
   295
lemma eqTrueE: "P = True \<Longrightarrow> P"
wenzelm@21504
   296
  by (erule iffD2) (rule TrueI)
paulson@15411
   297
paulson@15411
   298
wenzelm@60758
   299
subsubsection \<open>Universal quantifier\<close>
paulson@15411
   300
wenzelm@60759
   301
lemma allI: assumes "\<And>x::'a. P x" shows "\<forall>x. P x"
wenzelm@21504
   302
  unfolding All_def by (iprover intro: ext eqTrueI assms)
paulson@15411
   303
wenzelm@60759
   304
lemma spec: "\<forall>x::'a. P x \<Longrightarrow> P x"
paulson@15411
   305
apply (unfold All_def)
paulson@15411
   306
apply (rule eqTrueE)
paulson@15411
   307
apply (erule fun_cong)
paulson@15411
   308
done
paulson@15411
   309
paulson@15411
   310
lemma allE:
wenzelm@60759
   311
  assumes major: "\<forall>x. P x"
wenzelm@60759
   312
    and minor: "P x \<Longrightarrow> R"
wenzelm@21504
   313
  shows R
wenzelm@21504
   314
  by (iprover intro: minor major [THEN spec])
paulson@15411
   315
paulson@15411
   316
lemma all_dupE:
wenzelm@60759
   317
  assumes major: "\<forall>x. P x"
wenzelm@60759
   318
    and minor: "\<lbrakk>P x; \<forall>x. P x\<rbrakk> \<Longrightarrow> R"
wenzelm@21504
   319
  shows R
wenzelm@21504
   320
  by (iprover intro: minor major major [THEN spec])
paulson@15411
   321
paulson@15411
   322
wenzelm@60758
   323
subsubsection \<open>False\<close>
wenzelm@21504
   324
wenzelm@60758
   325
text \<open>
wenzelm@61799
   326
  Depends upon \<open>spec\<close>; it is impossible to do propositional
wenzelm@21504
   327
  logic before quantifiers!
wenzelm@60758
   328
\<close>
paulson@15411
   329
wenzelm@60759
   330
lemma FalseE: "False \<Longrightarrow> P"
wenzelm@21504
   331
  apply (unfold False_def)
wenzelm@21504
   332
  apply (erule spec)
wenzelm@21504
   333
  done
paulson@15411
   334
wenzelm@60759
   335
lemma False_neq_True: "False = True \<Longrightarrow> P"
wenzelm@21504
   336
  by (erule eqTrueE [THEN FalseE])
paulson@15411
   337
paulson@15411
   338
wenzelm@60758
   339
subsubsection \<open>Negation\<close>
paulson@15411
   340
paulson@15411
   341
lemma notI:
wenzelm@60759
   342
  assumes "P \<Longrightarrow> False"
wenzelm@60759
   343
  shows "\<not> P"
wenzelm@21504
   344
  apply (unfold not_def)
wenzelm@21504
   345
  apply (iprover intro: impI assms)
wenzelm@21504
   346
  done
paulson@15411
   347
wenzelm@60759
   348
lemma False_not_True: "False \<noteq> True"
wenzelm@21504
   349
  apply (rule notI)
wenzelm@21504
   350
  apply (erule False_neq_True)
wenzelm@21504
   351
  done
paulson@15411
   352
wenzelm@60759
   353
lemma True_not_False: "True \<noteq> False"
wenzelm@21504
   354
  apply (rule notI)
wenzelm@21504
   355
  apply (drule sym)
wenzelm@21504
   356
  apply (erule False_neq_True)
wenzelm@21504
   357
  done
paulson@15411
   358
wenzelm@60759
   359
lemma notE: "\<lbrakk>\<not> P; P\<rbrakk> \<Longrightarrow> R"
wenzelm@21504
   360
  apply (unfold not_def)
wenzelm@21504
   361
  apply (erule mp [THEN FalseE])
wenzelm@21504
   362
  apply assumption
wenzelm@21504
   363
  done
paulson@15411
   364
wenzelm@21504
   365
lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P"
wenzelm@21504
   366
  by (erule notE [THEN notI]) (erule meta_mp)
paulson@15411
   367
paulson@15411
   368
wenzelm@60758
   369
subsubsection \<open>Implication\<close>
paulson@15411
   370
paulson@15411
   371
lemma impE:
wenzelm@60759
   372
  assumes "P \<longrightarrow> Q" P "Q \<Longrightarrow> R"
wenzelm@60759
   373
  shows R
wenzelm@23553
   374
by (iprover intro: assms mp)
paulson@15411
   375
wenzelm@60759
   376
(* Reduces Q to P \<longrightarrow> Q, allowing substitution in P. *)
wenzelm@60759
   377
lemma rev_mp: "\<lbrakk>P; P \<longrightarrow> Q\<rbrakk> \<Longrightarrow> Q"
nipkow@17589
   378
by (iprover intro: mp)
paulson@15411
   379
paulson@15411
   380
lemma contrapos_nn:
wenzelm@60759
   381
  assumes major: "\<not> Q"
wenzelm@60759
   382
      and minor: "P \<Longrightarrow> Q"
wenzelm@60759
   383
  shows "\<not> P"
nipkow@17589
   384
by (iprover intro: notI minor major [THEN notE])
paulson@15411
   385
paulson@15411
   386
(*not used at all, but we already have the other 3 combinations *)
paulson@15411
   387
lemma contrapos_pn:
paulson@15411
   388
  assumes major: "Q"
wenzelm@60759
   389
      and minor: "P \<Longrightarrow> \<not> Q"
wenzelm@60759
   390
  shows "\<not> P"
nipkow@17589
   391
by (iprover intro: notI minor major notE)
paulson@15411
   392
wenzelm@60759
   393
lemma not_sym: "t \<noteq> s \<Longrightarrow> s \<noteq> t"
haftmann@21250
   394
  by (erule contrapos_nn) (erule sym)
haftmann@21250
   395
wenzelm@60759
   396
lemma eq_neq_eq_imp_neq: "\<lbrakk>x = a; a \<noteq> b; b = y\<rbrakk> \<Longrightarrow> x \<noteq> y"
haftmann@21250
   397
  by (erule subst, erule ssubst, assumption)
paulson@15411
   398
paulson@15411
   399
wenzelm@60758
   400
subsubsection \<open>Existential quantifier\<close>
paulson@15411
   401
wenzelm@60759
   402
lemma exI: "P x \<Longrightarrow> \<exists>x::'a. P x"
paulson@15411
   403
apply (unfold Ex_def)
nipkow@17589
   404
apply (iprover intro: allI allE impI mp)
paulson@15411
   405
done
paulson@15411
   406
paulson@15411
   407
lemma exE:
wenzelm@60759
   408
  assumes major: "\<exists>x::'a. P x"
wenzelm@60759
   409
      and minor: "\<And>x. P x \<Longrightarrow> Q"
paulson@15411
   410
  shows "Q"
paulson@15411
   411
apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
nipkow@17589
   412
apply (iprover intro: impI [THEN allI] minor)
paulson@15411
   413
done
paulson@15411
   414
paulson@15411
   415
wenzelm@60758
   416
subsubsection \<open>Conjunction\<close>
paulson@15411
   417
wenzelm@60759
   418
lemma conjI: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> P \<and> Q"
paulson@15411
   419
apply (unfold and_def)
nipkow@17589
   420
apply (iprover intro: impI [THEN allI] mp)
paulson@15411
   421
done
paulson@15411
   422
wenzelm@60759
   423
lemma conjunct1: "\<lbrakk>P \<and> Q\<rbrakk> \<Longrightarrow> P"
paulson@15411
   424
apply (unfold and_def)
nipkow@17589
   425
apply (iprover intro: impI dest: spec mp)
paulson@15411
   426
done
paulson@15411
   427
wenzelm@60759
   428
lemma conjunct2: "\<lbrakk>P \<and> Q\<rbrakk> \<Longrightarrow> Q"
paulson@15411
   429
apply (unfold and_def)
nipkow@17589
   430
apply (iprover intro: impI dest: spec mp)
paulson@15411
   431
done
paulson@15411
   432
paulson@15411
   433
lemma conjE:
wenzelm@60759
   434
  assumes major: "P \<and> Q"
wenzelm@60759
   435
      and minor: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> R"
wenzelm@60759
   436
  shows R
paulson@15411
   437
apply (rule minor)
paulson@15411
   438
apply (rule major [THEN conjunct1])
paulson@15411
   439
apply (rule major [THEN conjunct2])
paulson@15411
   440
done
paulson@15411
   441
paulson@15411
   442
lemma context_conjI:
wenzelm@60759
   443
  assumes P "P \<Longrightarrow> Q" shows "P \<and> Q"
wenzelm@23553
   444
by (iprover intro: conjI assms)
paulson@15411
   445
paulson@15411
   446
wenzelm@60758
   447
subsubsection \<open>Disjunction\<close>
paulson@15411
   448
wenzelm@60759
   449
lemma disjI1: "P \<Longrightarrow> P \<or> Q"
paulson@15411
   450
apply (unfold or_def)
nipkow@17589
   451
apply (iprover intro: allI impI mp)
paulson@15411
   452
done
paulson@15411
   453
wenzelm@60759
   454
lemma disjI2: "Q \<Longrightarrow> P \<or> Q"
paulson@15411
   455
apply (unfold or_def)
nipkow@17589
   456
apply (iprover intro: allI impI mp)
paulson@15411
   457
done
paulson@15411
   458
paulson@15411
   459
lemma disjE:
wenzelm@60759
   460
  assumes major: "P \<or> Q"
wenzelm@60759
   461
      and minorP: "P \<Longrightarrow> R"
wenzelm@60759
   462
      and minorQ: "Q \<Longrightarrow> R"
wenzelm@60759
   463
  shows R
nipkow@17589
   464
by (iprover intro: minorP minorQ impI
paulson@15411
   465
                 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
paulson@15411
   466
paulson@15411
   467
wenzelm@60758
   468
subsubsection \<open>Classical logic\<close>
paulson@15411
   469
paulson@15411
   470
lemma classical:
wenzelm@60759
   471
  assumes prem: "\<not> P \<Longrightarrow> P"
wenzelm@60759
   472
  shows P
paulson@15411
   473
apply (rule True_or_False [THEN disjE, THEN eqTrueE])
paulson@15411
   474
apply assumption
paulson@15411
   475
apply (rule notI [THEN prem, THEN eqTrueI])
paulson@15411
   476
apply (erule subst)
paulson@15411
   477
apply assumption
paulson@15411
   478
done
paulson@15411
   479
wenzelm@45607
   480
lemmas ccontr = FalseE [THEN classical]
paulson@15411
   481
wenzelm@60759
   482
(*notE with premises exchanged; it discharges \<not> R so that it can be used to
paulson@15411
   483
  make elimination rules*)
paulson@15411
   484
lemma rev_notE:
wenzelm@60759
   485
  assumes premp: P
wenzelm@60759
   486
      and premnot: "\<not> R \<Longrightarrow> \<not> P"
wenzelm@60759
   487
  shows R
paulson@15411
   488
apply (rule ccontr)
paulson@15411
   489
apply (erule notE [OF premnot premp])
paulson@15411
   490
done
paulson@15411
   491
paulson@15411
   492
(*Double negation law*)
wenzelm@60759
   493
lemma notnotD: "\<not>\<not> P \<Longrightarrow> P"
paulson@15411
   494
apply (rule classical)
paulson@15411
   495
apply (erule notE)
paulson@15411
   496
apply assumption
paulson@15411
   497
done
paulson@15411
   498
paulson@15411
   499
lemma contrapos_pp:
wenzelm@60759
   500
  assumes p1: Q
wenzelm@60759
   501
      and p2: "\<not> P \<Longrightarrow> \<not> Q"
wenzelm@60759
   502
  shows P
nipkow@17589
   503
by (iprover intro: classical p1 p2 notE)
paulson@15411
   504
paulson@15411
   505
wenzelm@60758
   506
subsubsection \<open>Unique existence\<close>
paulson@15411
   507
paulson@15411
   508
lemma ex1I:
wenzelm@60759
   509
  assumes "P a" "\<And>x. P x \<Longrightarrow> x = a"
wenzelm@60759
   510
  shows "\<exists>!x. P x"
wenzelm@23553
   511
by (unfold Ex1_def, iprover intro: assms exI conjI allI impI)
paulson@15411
   512
wenzelm@60758
   513
text\<open>Sometimes easier to use: the premises have no shared variables.  Safe!\<close>
paulson@15411
   514
lemma ex_ex1I:
wenzelm@60759
   515
  assumes ex_prem: "\<exists>x. P x"
wenzelm@60759
   516
      and eq: "\<And>x y. \<lbrakk>P x; P y\<rbrakk> \<Longrightarrow> x = y"
wenzelm@60759
   517
  shows "\<exists>!x. P x"
nipkow@17589
   518
by (iprover intro: ex_prem [THEN exE] ex1I eq)
paulson@15411
   519
paulson@15411
   520
lemma ex1E:
wenzelm@60759
   521
  assumes major: "\<exists>!x. P x"
wenzelm@60759
   522
      and minor: "\<And>x. \<lbrakk>P x; \<forall>y. P y \<longrightarrow> y = x\<rbrakk> \<Longrightarrow> R"
wenzelm@60759
   523
  shows R
paulson@15411
   524
apply (rule major [unfolded Ex1_def, THEN exE])
paulson@15411
   525
apply (erule conjE)
nipkow@17589
   526
apply (iprover intro: minor)
paulson@15411
   527
done
paulson@15411
   528
wenzelm@60759
   529
lemma ex1_implies_ex: "\<exists>!x. P x \<Longrightarrow> \<exists>x. P x"
paulson@15411
   530
apply (erule ex1E)
paulson@15411
   531
apply (rule exI)
paulson@15411
   532
apply assumption
paulson@15411
   533
done
paulson@15411
   534
paulson@15411
   535
wenzelm@60758
   536
subsubsection \<open>Classical intro rules for disjunction and existential quantifiers\<close>
paulson@15411
   537
paulson@15411
   538
lemma disjCI:
wenzelm@60759
   539
  assumes "\<not> Q \<Longrightarrow> P" shows "P \<or> Q"
paulson@15411
   540
apply (rule classical)
wenzelm@23553
   541
apply (iprover intro: assms disjI1 disjI2 notI elim: notE)
paulson@15411
   542
done
paulson@15411
   543
wenzelm@60759
   544
lemma excluded_middle: "\<not> P \<or> P"
nipkow@17589
   545
by (iprover intro: disjCI)
paulson@15411
   546
wenzelm@60758
   547
text \<open>
haftmann@20944
   548
  case distinction as a natural deduction rule.
wenzelm@60759
   549
  Note that @{term "\<not> P"} is the second case, not the first
wenzelm@60758
   550
\<close>
wenzelm@27126
   551
lemma case_split [case_names True False]:
wenzelm@60759
   552
  assumes prem1: "P \<Longrightarrow> Q"
wenzelm@60759
   553
      and prem2: "\<not> P \<Longrightarrow> Q"
wenzelm@60759
   554
  shows Q
paulson@15411
   555
apply (rule excluded_middle [THEN disjE])
paulson@15411
   556
apply (erule prem2)
paulson@15411
   557
apply (erule prem1)
paulson@15411
   558
done
wenzelm@27126
   559
wenzelm@60759
   560
(*Classical implies (\<longrightarrow>) elimination. *)
paulson@15411
   561
lemma impCE:
wenzelm@60759
   562
  assumes major: "P \<longrightarrow> Q"
wenzelm@60759
   563
      and minor: "\<not> P \<Longrightarrow> R" "Q \<Longrightarrow> R"
wenzelm@60759
   564
  shows R
paulson@15411
   565
apply (rule excluded_middle [of P, THEN disjE])
nipkow@17589
   566
apply (iprover intro: minor major [THEN mp])+
paulson@15411
   567
done
paulson@15411
   568
wenzelm@60759
   569
(*This version of \<longrightarrow> elimination works on Q before P.  It works best for
paulson@15411
   570
  those cases in which P holds "almost everywhere".  Can't install as
paulson@15411
   571
  default: would break old proofs.*)
paulson@15411
   572
lemma impCE':
wenzelm@60759
   573
  assumes major: "P \<longrightarrow> Q"
wenzelm@60759
   574
      and minor: "Q \<Longrightarrow> R" "\<not> P \<Longrightarrow> R"
wenzelm@60759
   575
  shows R
paulson@15411
   576
apply (rule excluded_middle [of P, THEN disjE])
nipkow@17589
   577
apply (iprover intro: minor major [THEN mp])+
paulson@15411
   578
done
paulson@15411
   579
paulson@15411
   580
(*Classical <-> elimination. *)
paulson@15411
   581
lemma iffCE:
wenzelm@60759
   582
  assumes major: "P = Q"
wenzelm@60759
   583
      and minor: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> R" "\<lbrakk>\<not> P; \<not> Q\<rbrakk> \<Longrightarrow> R"
wenzelm@60759
   584
  shows R
paulson@15411
   585
apply (rule major [THEN iffE])
nipkow@17589
   586
apply (iprover intro: minor elim: impCE notE)
paulson@15411
   587
done
paulson@15411
   588
paulson@15411
   589
lemma exCI:
wenzelm@60759
   590
  assumes "\<forall>x. \<not> P x \<Longrightarrow> P a"
wenzelm@60759
   591
  shows "\<exists>x. P x"
paulson@15411
   592
apply (rule ccontr)
wenzelm@23553
   593
apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"])
paulson@15411
   594
done
paulson@15411
   595
paulson@15411
   596
wenzelm@60758
   597
subsubsection \<open>Intuitionistic Reasoning\<close>
wenzelm@12386
   598
wenzelm@12386
   599
lemma impE':
wenzelm@60759
   600
  assumes 1: "P \<longrightarrow> Q"
wenzelm@60759
   601
    and 2: "Q \<Longrightarrow> R"
wenzelm@60759
   602
    and 3: "P \<longrightarrow> Q \<Longrightarrow> P"
wenzelm@12937
   603
  shows R
wenzelm@12386
   604
proof -
wenzelm@12386
   605
  from 3 and 1 have P .
wenzelm@12386
   606
  with 1 have Q by (rule impE)
wenzelm@12386
   607
  with 2 show R .
wenzelm@12386
   608
qed
wenzelm@12386
   609
wenzelm@12386
   610
lemma allE':
wenzelm@60759
   611
  assumes 1: "\<forall>x. P x"
wenzelm@60759
   612
    and 2: "P x \<Longrightarrow> \<forall>x. P x \<Longrightarrow> Q"
wenzelm@12937
   613
  shows Q
wenzelm@12386
   614
proof -
wenzelm@12386
   615
  from 1 have "P x" by (rule spec)
wenzelm@12386
   616
  from this and 1 show Q by (rule 2)
wenzelm@12386
   617
qed
wenzelm@12386
   618
wenzelm@12937
   619
lemma notE':
wenzelm@60759
   620
  assumes 1: "\<not> P"
wenzelm@60759
   621
    and 2: "\<not> P \<Longrightarrow> P"
wenzelm@12937
   622
  shows R
wenzelm@12386
   623
proof -
wenzelm@12386
   624
  from 2 and 1 have P .
wenzelm@12386
   625
  with 1 show R by (rule notE)
wenzelm@12386
   626
qed
wenzelm@12386
   627
wenzelm@60759
   628
lemma TrueE: "True \<Longrightarrow> P \<Longrightarrow> P" .
wenzelm@60759
   629
lemma notFalseE: "\<not> False \<Longrightarrow> P \<Longrightarrow> P" .
dixon@22444
   630
dixon@22467
   631
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE
wenzelm@15801
   632
  and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
wenzelm@15801
   633
  and [Pure.elim 2] = allE notE' impE'
wenzelm@15801
   634
  and [Pure.intro] = exI disjI2 disjI1
wenzelm@12386
   635
wenzelm@12386
   636
lemmas [trans] = trans
wenzelm@12386
   637
  and [sym] = sym not_sym
wenzelm@15801
   638
  and [Pure.elim?] = iffD1 iffD2 impE
wenzelm@11750
   639
wenzelm@11438
   640
wenzelm@60758
   641
subsubsection \<open>Atomizing meta-level connectives\<close>
wenzelm@11750
   642
haftmann@28513
   643
axiomatization where
haftmann@28513
   644
  eq_reflection: "x = y \<Longrightarrow> x \<equiv> y" (*admissible axiom*)
haftmann@28513
   645
wenzelm@60759
   646
lemma atomize_all [atomize]: "(\<And>x. P x) \<equiv> Trueprop (\<forall>x. P x)"
wenzelm@12003
   647
proof
wenzelm@60759
   648
  assume "\<And>x. P x"
wenzelm@60759
   649
  then show "\<forall>x. P x" ..
wenzelm@9488
   650
next
wenzelm@60759
   651
  assume "\<forall>x. P x"
wenzelm@60759
   652
  then show "\<And>x. P x" by (rule allE)
wenzelm@9488
   653
qed
wenzelm@9488
   654
wenzelm@60759
   655
lemma atomize_imp [atomize]: "(A \<Longrightarrow> B) \<equiv> Trueprop (A \<longrightarrow> B)"
wenzelm@12003
   656
proof
wenzelm@60759
   657
  assume r: "A \<Longrightarrow> B"
wenzelm@60759
   658
  show "A \<longrightarrow> B" by (rule impI) (rule r)
wenzelm@9488
   659
next
wenzelm@60759
   660
  assume "A \<longrightarrow> B" and A
wenzelm@23553
   661
  then show B by (rule mp)
wenzelm@9488
   662
qed
wenzelm@9488
   663
wenzelm@60759
   664
lemma atomize_not: "(A \<Longrightarrow> False) \<equiv> Trueprop (\<not> A)"
paulson@14749
   665
proof
wenzelm@60759
   666
  assume r: "A \<Longrightarrow> False"
wenzelm@60759
   667
  show "\<not> A" by (rule notI) (rule r)
paulson@14749
   668
next
wenzelm@60759
   669
  assume "\<not> A" and A
wenzelm@23553
   670
  then show False by (rule notE)
paulson@14749
   671
qed
paulson@14749
   672
wenzelm@60759
   673
lemma atomize_eq [atomize, code]: "(x \<equiv> y) \<equiv> Trueprop (x = y)"
wenzelm@12003
   674
proof
wenzelm@60759
   675
  assume "x \<equiv> y"
wenzelm@60759
   676
  show "x = y" by (unfold \<open>x \<equiv> y\<close>) (rule refl)
wenzelm@10432
   677
next
wenzelm@10432
   678
  assume "x = y"
wenzelm@60759
   679
  then show "x \<equiv> y" by (rule eq_reflection)
wenzelm@10432
   680
qed
wenzelm@10432
   681
wenzelm@60759
   682
lemma atomize_conj [atomize]: "(A &&& B) \<equiv> Trueprop (A \<and> B)"
wenzelm@12003
   683
proof
wenzelm@28856
   684
  assume conj: "A &&& B"
wenzelm@60759
   685
  show "A \<and> B"
wenzelm@19121
   686
  proof (rule conjI)
wenzelm@19121
   687
    from conj show A by (rule conjunctionD1)
wenzelm@19121
   688
    from conj show B by (rule conjunctionD2)
wenzelm@19121
   689
  qed
wenzelm@11953
   690
next
wenzelm@60759
   691
  assume conj: "A \<and> B"
wenzelm@28856
   692
  show "A &&& B"
wenzelm@19121
   693
  proof -
wenzelm@19121
   694
    from conj show A ..
wenzelm@19121
   695
    from conj show B ..
wenzelm@11953
   696
  qed
wenzelm@11953
   697
qed
wenzelm@11953
   698
wenzelm@12386
   699
lemmas [symmetric, rulify] = atomize_all atomize_imp
wenzelm@18832
   700
  and [symmetric, defn] = atomize_all atomize_imp atomize_eq
wenzelm@12386
   701
wenzelm@11750
   702
wenzelm@60758
   703
subsubsection \<open>Atomizing elimination rules\<close>
krauss@26580
   704
wenzelm@60759
   705
lemma atomize_exL[atomize_elim]: "(\<And>x. P x \<Longrightarrow> Q) \<equiv> ((\<exists>x. P x) \<Longrightarrow> Q)"
krauss@26580
   706
  by rule iprover+
krauss@26580
   707
wenzelm@60759
   708
lemma atomize_conjL[atomize_elim]: "(A \<Longrightarrow> B \<Longrightarrow> C) \<equiv> (A \<and> B \<Longrightarrow> C)"
krauss@26580
   709
  by rule iprover+
krauss@26580
   710
wenzelm@60759
   711
lemma atomize_disjL[atomize_elim]: "((A \<Longrightarrow> C) \<Longrightarrow> (B \<Longrightarrow> C) \<Longrightarrow> C) \<equiv> ((A \<or> B \<Longrightarrow> C) \<Longrightarrow> C)"
krauss@26580
   712
  by rule iprover+
krauss@26580
   713
wenzelm@60759
   714
lemma atomize_elimL[atomize_elim]: "(\<And>B. (A \<Longrightarrow> B) \<Longrightarrow> B) \<equiv> Trueprop A" ..
krauss@26580
   715
krauss@26580
   716
wenzelm@60758
   717
subsection \<open>Package setup\<close>
haftmann@20944
   718
wenzelm@51314
   719
ML_file "Tools/hologic.ML"
wenzelm@51314
   720
wenzelm@51314
   721
wenzelm@60758
   722
subsubsection \<open>Sledgehammer setup\<close>
blanchet@35828
   723
wenzelm@60758
   724
text \<open>
blanchet@35828
   725
Theorems blacklisted to Sledgehammer. These theorems typically produce clauses
blanchet@35828
   726
that are prolific (match too many equality or membership literals) and relate to
blanchet@35828
   727
seldom-used facts. Some duplicate other rules.
wenzelm@60758
   728
\<close>
blanchet@35828
   729
wenzelm@57963
   730
named_theorems no_atp "theorems that should be filtered out by Sledgehammer"
blanchet@35828
   731
blanchet@35828
   732
wenzelm@60758
   733
subsubsection \<open>Classical Reasoner setup\<close>
wenzelm@9529
   734
wenzelm@60759
   735
lemma imp_elim: "P \<longrightarrow> Q \<Longrightarrow> (\<not> R \<Longrightarrow> P) \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
wenzelm@26411
   736
  by (rule classical) iprover
wenzelm@26411
   737
wenzelm@60759
   738
lemma swap: "\<not> P \<Longrightarrow> (\<not> R \<Longrightarrow> P) \<Longrightarrow> R"
wenzelm@26411
   739
  by (rule classical) iprover
wenzelm@26411
   740
wenzelm@60759
   741
lemma thin_refl: "\<And>X. \<lbrakk>x = x; PROP W\<rbrakk> \<Longrightarrow> PROP W" .
haftmann@20944
   742
wenzelm@60758
   743
ML \<open>
wenzelm@42799
   744
structure Hypsubst = Hypsubst
wenzelm@42799
   745
(
wenzelm@21218
   746
  val dest_eq = HOLogic.dest_eq
haftmann@21151
   747
  val dest_Trueprop = HOLogic.dest_Trueprop
haftmann@21151
   748
  val dest_imp = HOLogic.dest_imp
wenzelm@26411
   749
  val eq_reflection = @{thm eq_reflection}
wenzelm@26411
   750
  val rev_eq_reflection = @{thm meta_eq_to_obj_eq}
wenzelm@26411
   751
  val imp_intr = @{thm impI}
wenzelm@26411
   752
  val rev_mp = @{thm rev_mp}
wenzelm@26411
   753
  val subst = @{thm subst}
wenzelm@26411
   754
  val sym = @{thm sym}
wenzelm@22129
   755
  val thin_refl = @{thm thin_refl};
wenzelm@42799
   756
);
wenzelm@21671
   757
open Hypsubst;
haftmann@21151
   758
wenzelm@42799
   759
structure Classical = Classical
wenzelm@42799
   760
(
wenzelm@26411
   761
  val imp_elim = @{thm imp_elim}
wenzelm@26411
   762
  val not_elim = @{thm notE}
wenzelm@26411
   763
  val swap = @{thm swap}
wenzelm@26411
   764
  val classical = @{thm classical}
haftmann@21151
   765
  val sizef = Drule.size_of_thm
haftmann@21151
   766
  val hyp_subst_tacs = [Hypsubst.hyp_subst_tac]
wenzelm@42799
   767
);
haftmann@21151
   768
wenzelm@58826
   769
structure Basic_Classical: BASIC_CLASSICAL = Classical;
wenzelm@33308
   770
open Basic_Classical;
wenzelm@60758
   771
\<close>
wenzelm@22129
   772
wenzelm@60758
   773
setup \<open>
wenzelm@35389
   774
  (*prevent substitution on bool*)
wenzelm@58826
   775
  let
wenzelm@58826
   776
    fun non_bool_eq (@{const_name HOL.eq}, Type (_, [T, _])) = T <> @{typ bool}
wenzelm@58826
   777
      | non_bool_eq _ = false;
wenzelm@58826
   778
    fun hyp_subst_tac' ctxt =
wenzelm@58826
   779
      SUBGOAL (fn (goal, i) =>
wenzelm@58826
   780
        if Term.exists_Const non_bool_eq goal
wenzelm@58826
   781
        then Hypsubst.hyp_subst_tac ctxt i
wenzelm@58826
   782
        else no_tac);
wenzelm@58826
   783
  in
wenzelm@58826
   784
    Context_Rules.addSWrapper (fn ctxt => fn tac => hyp_subst_tac' ctxt ORELSE' tac)
wenzelm@58826
   785
  end
wenzelm@60758
   786
\<close>
haftmann@21009
   787
haftmann@21009
   788
declare iffI [intro!]
haftmann@21009
   789
  and notI [intro!]
haftmann@21009
   790
  and impI [intro!]
haftmann@21009
   791
  and disjCI [intro!]
haftmann@21009
   792
  and conjI [intro!]
haftmann@21009
   793
  and TrueI [intro!]
haftmann@21009
   794
  and refl [intro!]
haftmann@21009
   795
haftmann@21009
   796
declare iffCE [elim!]
haftmann@21009
   797
  and FalseE [elim!]
haftmann@21009
   798
  and impCE [elim!]
haftmann@21009
   799
  and disjE [elim!]
haftmann@21009
   800
  and conjE [elim!]
haftmann@21009
   801
haftmann@21009
   802
declare ex_ex1I [intro!]
haftmann@21009
   803
  and allI [intro!]
haftmann@21009
   804
  and exI [intro]
haftmann@21009
   805
haftmann@21009
   806
declare exE [elim!]
haftmann@21009
   807
  allE [elim]
haftmann@21009
   808
wenzelm@60758
   809
ML \<open>val HOL_cs = claset_of @{context}\<close>
mengj@19162
   810
wenzelm@60759
   811
lemma contrapos_np: "\<not> Q \<Longrightarrow> (\<not> P \<Longrightarrow> Q) \<Longrightarrow> P"
wenzelm@20223
   812
  apply (erule swap)
wenzelm@20223
   813
  apply (erule (1) meta_mp)
wenzelm@20223
   814
  done
wenzelm@10383
   815
wenzelm@18689
   816
declare ex_ex1I [rule del, intro! 2]
wenzelm@18689
   817
  and ex1I [intro]
wenzelm@18689
   818
paulson@41865
   819
declare ext [intro]
paulson@41865
   820
wenzelm@12386
   821
lemmas [intro?] = ext
wenzelm@12386
   822
  and [elim?] = ex1_implies_ex
wenzelm@11977
   823
haftmann@20944
   824
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
haftmann@20973
   825
lemma alt_ex1E [elim!]:
haftmann@20944
   826
  assumes major: "\<exists>!x. P x"
haftmann@20944
   827
      and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R"
haftmann@20944
   828
  shows R
haftmann@20944
   829
apply (rule ex1E [OF major])
haftmann@20944
   830
apply (rule prem)
wenzelm@59499
   831
apply assumption
wenzelm@59499
   832
apply (rule allI)+
wenzelm@60758
   833
apply (tactic \<open>eresolve_tac @{context} [Classical.dup_elim @{context} @{thm allE}] 1\<close>)
wenzelm@22129
   834
apply iprover
wenzelm@22129
   835
done
haftmann@20944
   836
wenzelm@60758
   837
ML \<open>
wenzelm@42477
   838
  structure Blast = Blast
wenzelm@42477
   839
  (
wenzelm@42477
   840
    structure Classical = Classical
wenzelm@42802
   841
    val Trueprop_const = dest_Const @{const Trueprop}
wenzelm@42477
   842
    val equality_name = @{const_name HOL.eq}
wenzelm@42477
   843
    val not_name = @{const_name Not}
wenzelm@42477
   844
    val notE = @{thm notE}
wenzelm@42477
   845
    val ccontr = @{thm ccontr}
wenzelm@42477
   846
    val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac
wenzelm@42477
   847
  );
wenzelm@42477
   848
  val blast_tac = Blast.blast_tac;
wenzelm@60758
   849
\<close>
haftmann@20944
   850
haftmann@20944
   851
wenzelm@60758
   852
subsubsection \<open>THE: definite description operator\<close>
lp15@59504
   853
lp15@59504
   854
lemma the_equality [intro]:
lp15@59504
   855
  assumes "P a"
wenzelm@60759
   856
      and "\<And>x. P x \<Longrightarrow> x = a"
lp15@59504
   857
  shows "(THE x. P x) = a"
lp15@59504
   858
  by (blast intro: assms trans [OF arg_cong [where f=The] the_eq_trivial])
lp15@59504
   859
lp15@59504
   860
lemma theI:
wenzelm@60759
   861
  assumes "P a" and "\<And>x. P x \<Longrightarrow> x = a"
lp15@59504
   862
  shows "P (THE x. P x)"
lp15@59504
   863
by (iprover intro: assms the_equality [THEN ssubst])
lp15@59504
   864
wenzelm@60759
   865
lemma theI': "\<exists>!x. P x \<Longrightarrow> P (THE x. P x)"
lp15@59504
   866
  by (blast intro: theI)
lp15@59504
   867
lp15@59504
   868
(*Easier to apply than theI: only one occurrence of P*)
lp15@59504
   869
lemma theI2:
wenzelm@60759
   870
  assumes "P a" "\<And>x. P x \<Longrightarrow> x = a" "\<And>x. P x \<Longrightarrow> Q x"
lp15@59504
   871
  shows "Q (THE x. P x)"
lp15@59504
   872
by (iprover intro: assms theI)
lp15@59504
   873
wenzelm@60759
   874
lemma the1I2: assumes "\<exists>!x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)"
lp15@59504
   875
by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)]
lp15@59504
   876
           elim:allE impE)
lp15@59504
   877
wenzelm@60759
   878
lemma the1_equality [elim?]: "\<lbrakk>\<exists>!x. P x; P a\<rbrakk> \<Longrightarrow> (THE x. P x) = a"
lp15@59504
   879
  by blast
lp15@59504
   880
wenzelm@60759
   881
lemma the_sym_eq_trivial: "(THE y. x = y) = x"
lp15@59504
   882
  by blast
lp15@59504
   883
lp15@59504
   884
wenzelm@60758
   885
subsubsection \<open>Simplifier\<close>
wenzelm@12281
   886
wenzelm@60759
   887
lemma eta_contract_eq: "(\<lambda>s. f s) = f" ..
wenzelm@12281
   888
wenzelm@12281
   889
lemma simp_thms:
wenzelm@60759
   890
  shows not_not: "(\<not> \<not> P) = P"
wenzelm@60759
   891
  and Not_eq_iff: "((\<not> P) = (\<not> Q)) = (P = Q)"
wenzelm@12937
   892
  and
wenzelm@60759
   893
    "(P \<noteq> Q) = (P = (\<not> Q))"
wenzelm@60759
   894
    "(P \<or> \<not>P) = True"    "(\<not> P \<or> P) = True"
wenzelm@12281
   895
    "(x = x) = True"
haftmann@32068
   896
  and not_True_eq_False [code]: "(\<not> True) = False"
haftmann@32068
   897
  and not_False_eq_True [code]: "(\<not> False) = True"
haftmann@20944
   898
  and
wenzelm@60759
   899
    "(\<not> P) \<noteq> P"  "P \<noteq> (\<not> P)"
wenzelm@60759
   900
    "(True = P) = P"
haftmann@20944
   901
  and eq_True: "(P = True) = P"
wenzelm@60759
   902
  and "(False = P) = (\<not> P)"
haftmann@20944
   903
  and eq_False: "(P = False) = (\<not> P)"
haftmann@20944
   904
  and
wenzelm@60759
   905
    "(True \<longrightarrow> P) = P"  "(False \<longrightarrow> P) = True"
wenzelm@60759
   906
    "(P \<longrightarrow> True) = True"  "(P \<longrightarrow> P) = True"
wenzelm@60759
   907
    "(P \<longrightarrow> False) = (\<not> P)"  "(P \<longrightarrow> \<not> P) = (\<not> P)"
wenzelm@60759
   908
    "(P \<and> True) = P"  "(True \<and> P) = P"
wenzelm@60759
   909
    "(P \<and> False) = False"  "(False \<and> P) = False"
wenzelm@60759
   910
    "(P \<and> P) = P"  "(P \<and> (P \<and> Q)) = (P \<and> Q)"
wenzelm@60759
   911
    "(P \<and> \<not> P) = False"    "(\<not> P \<and> P) = False"
wenzelm@60759
   912
    "(P \<or> True) = True"  "(True \<or> P) = True"
wenzelm@60759
   913
    "(P \<or> False) = P"  "(False \<or> P) = P"
wenzelm@60759
   914
    "(P \<or> P) = P"  "(P \<or> (P \<or> Q)) = (P \<or> Q)" and
wenzelm@60759
   915
    "(\<forall>x. P) = P"  "(\<exists>x. P) = P"  "\<exists>x. x = t"  "\<exists>x. t = x"
nipkow@31166
   916
  and
wenzelm@60759
   917
    "\<And>P. (\<exists>x. x = t \<and> P x) = P t"
wenzelm@60759
   918
    "\<And>P. (\<exists>x. t = x \<and> P x) = P t"
wenzelm@60759
   919
    "\<And>P. (\<forall>x. x = t \<longrightarrow> P x) = P t"
wenzelm@60759
   920
    "\<And>P. (\<forall>x. t = x \<longrightarrow> P x) = P t"
nipkow@17589
   921
  by (blast, blast, blast, blast, blast, iprover+)
wenzelm@13421
   922
wenzelm@60759
   923
lemma disj_absorb: "(A \<or> A) = A"
paulson@14201
   924
  by blast
paulson@14201
   925
wenzelm@60759
   926
lemma disj_left_absorb: "(A \<or> (A \<or> B)) = (A \<or> B)"
paulson@14201
   927
  by blast
paulson@14201
   928
wenzelm@60759
   929
lemma conj_absorb: "(A \<and> A) = A"
paulson@14201
   930
  by blast
paulson@14201
   931
wenzelm@60759
   932
lemma conj_left_absorb: "(A \<and> (A \<and> B)) = (A \<and> B)"
paulson@14201
   933
  by blast
paulson@14201
   934
wenzelm@12281
   935
lemma eq_ac:
haftmann@57512
   936
  shows eq_commute: "a = b \<longleftrightarrow> b = a"
haftmann@57512
   937
    and iff_left_commute: "(P \<longleftrightarrow> (Q \<longleftrightarrow> R)) \<longleftrightarrow> (Q \<longleftrightarrow> (P \<longleftrightarrow> R))"
haftmann@57512
   938
    and iff_assoc: "((P \<longleftrightarrow> Q) \<longleftrightarrow> R) \<longleftrightarrow> (P \<longleftrightarrow> (Q \<longleftrightarrow> R))" by (iprover, blast+)
haftmann@57512
   939
lemma neq_commute: "a \<noteq> b \<longleftrightarrow> b \<noteq> a" by iprover
wenzelm@12281
   940
wenzelm@12281
   941
lemma conj_comms:
wenzelm@60759
   942
  shows conj_commute: "(P \<and> Q) = (Q \<and> P)"
wenzelm@60759
   943
    and conj_left_commute: "(P \<and> (Q \<and> R)) = (Q \<and> (P \<and> R))" by iprover+
wenzelm@60759
   944
lemma conj_assoc: "((P \<and> Q) \<and> R) = (P \<and> (Q \<and> R))" by iprover
wenzelm@12281
   945
paulson@19174
   946
lemmas conj_ac = conj_commute conj_left_commute conj_assoc
paulson@19174
   947
wenzelm@12281
   948
lemma disj_comms:
wenzelm@60759
   949
  shows disj_commute: "(P \<or> Q) = (Q \<or> P)"
wenzelm@60759
   950
    and disj_left_commute: "(P \<or> (Q \<or> R)) = (Q \<or> (P \<or> R))" by iprover+
wenzelm@60759
   951
lemma disj_assoc: "((P \<or> Q) \<or> R) = (P \<or> (Q \<or> R))" by iprover
wenzelm@12281
   952
paulson@19174
   953
lemmas disj_ac = disj_commute disj_left_commute disj_assoc
paulson@19174
   954
wenzelm@60759
   955
lemma conj_disj_distribL: "(P \<and> (Q \<or> R)) = (P \<and> Q \<or> P \<and> R)" by iprover
wenzelm@60759
   956
lemma conj_disj_distribR: "((P \<or> Q) \<and> R) = (P \<and> R \<or> Q \<and> R)" by iprover
wenzelm@12281
   957
wenzelm@60759
   958
lemma disj_conj_distribL: "(P \<or> (Q \<and> R)) = ((P \<or> Q) \<and> (P \<or> R))" by iprover
wenzelm@60759
   959
lemma disj_conj_distribR: "((P \<and> Q) \<or> R) = ((P \<or> R) \<and> (Q \<or> R))" by iprover
wenzelm@12281
   960
wenzelm@60759
   961
lemma imp_conjR: "(P \<longrightarrow> (Q \<and> R)) = ((P \<longrightarrow> Q) \<and> (P \<longrightarrow> R))" by iprover
wenzelm@60759
   962
lemma imp_conjL: "((P \<and> Q) \<longrightarrow> R) = (P \<longrightarrow> (Q \<longrightarrow> R))" by iprover
wenzelm@60759
   963
lemma imp_disjL: "((P \<or> Q) \<longrightarrow> R) = ((P \<longrightarrow> R) \<and> (Q \<longrightarrow> R))" by iprover
wenzelm@12281
   964
wenzelm@61799
   965
text \<open>These two are specialized, but \<open>imp_disj_not1\<close> is useful in \<open>Auth/Yahalom\<close>.\<close>
wenzelm@60759
   966
lemma imp_disj_not1: "(P \<longrightarrow> Q \<or> R) = (\<not> Q \<longrightarrow> P \<longrightarrow> R)" by blast
wenzelm@60759
   967
lemma imp_disj_not2: "(P \<longrightarrow> Q \<or> R) = (\<not> R \<longrightarrow> P \<longrightarrow> Q)" by blast
wenzelm@12281
   968
wenzelm@60759
   969
lemma imp_disj1: "((P \<longrightarrow> Q) \<or> R) = (P \<longrightarrow> Q \<or> R)" by blast
wenzelm@60759
   970
lemma imp_disj2: "(Q \<or> (P \<longrightarrow> R)) = (P \<longrightarrow> Q \<or> R)" by blast
wenzelm@12281
   971
wenzelm@60759
   972
lemma imp_cong: "(P = P') \<Longrightarrow> (P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<longrightarrow> Q) = (P' \<longrightarrow> Q'))"
haftmann@21151
   973
  by iprover
haftmann@21151
   974
wenzelm@60759
   975
lemma de_Morgan_disj: "(\<not> (P \<or> Q)) = (\<not> P \<and> \<not> Q)" by iprover
wenzelm@60759
   976
lemma de_Morgan_conj: "(\<not> (P \<and> Q)) = (\<not> P \<or> \<not> Q)" by blast
wenzelm@60759
   977
lemma not_imp: "(\<not> (P \<longrightarrow> Q)) = (P \<and> \<not> Q)" by blast
wenzelm@60759
   978
lemma not_iff: "(P \<noteq> Q) = (P = (\<not> Q))" by blast
wenzelm@60759
   979
lemma disj_not1: "(\<not> P \<or> Q) = (P \<longrightarrow> Q)" by blast
wenzelm@61799
   980
lemma disj_not2: "(P \<or> \<not> Q) = (Q \<longrightarrow> P)"  \<comment> \<open>changes orientation :-(\<close>
wenzelm@12281
   981
  by blast
wenzelm@60759
   982
lemma imp_conv_disj: "(P \<longrightarrow> Q) = ((\<not> P) \<or> Q)" by blast
wenzelm@12281
   983
wenzelm@60759
   984
lemma iff_conv_conj_imp: "(P = Q) = ((P \<longrightarrow> Q) \<and> (Q \<longrightarrow> P))" by iprover
wenzelm@12281
   985
wenzelm@12281
   986
wenzelm@60759
   987
lemma cases_simp: "((P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> Q)) = Q"
wenzelm@61799
   988
  \<comment> \<open>Avoids duplication of subgoals after \<open>split_if\<close>, when the true and false\<close>
wenzelm@61799
   989
  \<comment> \<open>cases boil down to the same thing.\<close>
wenzelm@12281
   990
  by blast
wenzelm@12281
   991
wenzelm@60759
   992
lemma not_all: "(\<not> (\<forall>x. P x)) = (\<exists>x. \<not> P x)" by blast
wenzelm@60759
   993
lemma imp_all: "((\<forall>x. P x) \<longrightarrow> Q) = (\<exists>x. P x \<longrightarrow> Q)" by blast
wenzelm@60759
   994
lemma not_ex: "(\<not> (\<exists>x. P x)) = (\<forall>x. \<not> P x)" by iprover
wenzelm@60759
   995
lemma imp_ex: "((\<exists>x. P x) \<longrightarrow> Q) = (\<forall>x. P x \<longrightarrow> Q)" by iprover
wenzelm@60759
   996
lemma all_not_ex: "(\<forall>x. P x) = (\<not> (\<exists>x. \<not> P x ))" by blast
wenzelm@12281
   997
blanchet@35828
   998
declare All_def [no_atp]
paulson@24286
   999
wenzelm@60759
  1000
lemma ex_disj_distrib: "(\<exists>x. P x \<or> Q x) = ((\<exists>x. P x) \<or> (\<exists>x. Q x))" by iprover
wenzelm@60759
  1001
lemma all_conj_distrib: "(\<forall>x. P x \<and> Q x) = ((\<forall>x. P x) \<and> (\<forall>x. Q x))" by iprover
wenzelm@12281
  1002
wenzelm@60758
  1003
text \<open>
wenzelm@61799
  1004
  \medskip The \<open>\<and>\<close> congruence rule: not included by default!
wenzelm@60758
  1005
  May slow rewrite proofs down by as much as 50\%\<close>
wenzelm@12281
  1006
wenzelm@12281
  1007
lemma conj_cong:
wenzelm@60759
  1008
    "(P = P') \<Longrightarrow> (P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<and> Q) = (P' \<and> Q'))"
nipkow@17589
  1009
  by iprover
wenzelm@12281
  1010
wenzelm@12281
  1011
lemma rev_conj_cong:
wenzelm@60759
  1012
    "(Q = Q') \<Longrightarrow> (Q' \<Longrightarrow> (P = P')) \<Longrightarrow> ((P \<and> Q) = (P' \<and> Q'))"
nipkow@17589
  1013
  by iprover
wenzelm@12281
  1014
wenzelm@61799
  1015
text \<open>The \<open>|\<close> congruence rule: not included by default!\<close>
wenzelm@12281
  1016
wenzelm@12281
  1017
lemma disj_cong:
wenzelm@60759
  1018
    "(P = P') \<Longrightarrow> (\<not> P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<or> Q) = (P' \<or> Q'))"
wenzelm@12281
  1019
  by blast
wenzelm@12281
  1020
wenzelm@12281
  1021
wenzelm@60758
  1022
text \<open>\medskip if-then-else rules\<close>
wenzelm@12281
  1023
haftmann@32068
  1024
lemma if_True [code]: "(if True then x else y) = x"
haftmann@38525
  1025
  by (unfold If_def) blast
wenzelm@12281
  1026
haftmann@32068
  1027
lemma if_False [code]: "(if False then x else y) = y"
haftmann@38525
  1028
  by (unfold If_def) blast
wenzelm@12281
  1029
wenzelm@60759
  1030
lemma if_P: "P \<Longrightarrow> (if P then x else y) = x"
haftmann@38525
  1031
  by (unfold If_def) blast
wenzelm@12281
  1032
wenzelm@60759
  1033
lemma if_not_P: "\<not> P \<Longrightarrow> (if P then x else y) = y"
haftmann@38525
  1034
  by (unfold If_def) blast
wenzelm@12281
  1035
wenzelm@60759
  1036
lemma split_if: "P (if Q then x else y) = ((Q \<longrightarrow> P x) \<and> (\<not> Q \<longrightarrow> P y))"
wenzelm@12281
  1037
  apply (rule case_split [of Q])
paulson@15481
  1038
   apply (simplesubst if_P)
paulson@15481
  1039
    prefer 3 apply (simplesubst if_not_P, blast+)
wenzelm@12281
  1040
  done
wenzelm@12281
  1041
wenzelm@60759
  1042
lemma split_if_asm: "P (if Q then x else y) = (\<not> ((Q \<and> \<not> P x) \<or> (\<not> Q \<and> \<not> P y)))"
paulson@15481
  1043
by (simplesubst split_if, blast)
wenzelm@12281
  1044
blanchet@35828
  1045
lemmas if_splits [no_atp] = split_if split_if_asm
wenzelm@12281
  1046
wenzelm@12281
  1047
lemma if_cancel: "(if c then x else x) = x"
paulson@15481
  1048
by (simplesubst split_if, blast)
wenzelm@12281
  1049
wenzelm@12281
  1050
lemma if_eq_cancel: "(if x = y then y else x) = x"
paulson@15481
  1051
by (simplesubst split_if, blast)
wenzelm@12281
  1052
wenzelm@60759
  1053
lemma if_bool_eq_conj: "(if P then Q else R) = ((P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> R))"
wenzelm@61799
  1054
  \<comment> \<open>This form is useful for expanding \<open>if\<close>s on the RIGHT of the \<open>\<Longrightarrow>\<close> symbol.\<close>
wenzelm@12281
  1055
  by (rule split_if)
wenzelm@12281
  1056
wenzelm@60759
  1057
lemma if_bool_eq_disj: "(if P then Q else R) = ((P \<and> Q) \<or> (\<not> P \<and> R))"
wenzelm@61799
  1058
  \<comment> \<open>And this form is useful for expanding \<open>if\<close>s on the LEFT.\<close>
lp15@59504
  1059
  by (simplesubst split_if) blast
wenzelm@12281
  1060
wenzelm@60759
  1061
lemma Eq_TrueI: "P \<Longrightarrow> P \<equiv> True" by (unfold atomize_eq) iprover
wenzelm@60759
  1062
lemma Eq_FalseI: "\<not> P \<Longrightarrow> P \<equiv> False" by (unfold atomize_eq) iprover
wenzelm@12281
  1063
wenzelm@60758
  1064
text \<open>\medskip let rules for simproc\<close>
schirmer@15423
  1065
wenzelm@60759
  1066
lemma Let_folded: "f x \<equiv> g x \<Longrightarrow> Let x f \<equiv> Let x g"
schirmer@15423
  1067
  by (unfold Let_def)
schirmer@15423
  1068
wenzelm@60759
  1069
lemma Let_unfold: "f x \<equiv> g \<Longrightarrow> Let x f \<equiv> g"
schirmer@15423
  1070
  by (unfold Let_def)
schirmer@15423
  1071
wenzelm@60758
  1072
text \<open>
ballarin@16999
  1073
  The following copy of the implication operator is useful for
ballarin@16999
  1074
  fine-tuning congruence rules.  It instructs the simplifier to simplify
ballarin@16999
  1075
  its premise.
wenzelm@60758
  1076
\<close>
berghofe@16633
  1077
wenzelm@60759
  1078
definition simp_implies :: "[prop, prop] \<Rightarrow> prop"  (infixr "=simp=>" 1) where
wenzelm@60759
  1079
  "simp_implies \<equiv> op \<Longrightarrow>"
berghofe@16633
  1080
wenzelm@18457
  1081
lemma simp_impliesI:
berghofe@16633
  1082
  assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
berghofe@16633
  1083
  shows "PROP P =simp=> PROP Q"
berghofe@16633
  1084
  apply (unfold simp_implies_def)
berghofe@16633
  1085
  apply (rule PQ)
berghofe@16633
  1086
  apply assumption
berghofe@16633
  1087
  done
berghofe@16633
  1088
berghofe@16633
  1089
lemma simp_impliesE:
wenzelm@25388
  1090
  assumes PQ: "PROP P =simp=> PROP Q"
berghofe@16633
  1091
  and P: "PROP P"
berghofe@16633
  1092
  and QR: "PROP Q \<Longrightarrow> PROP R"
berghofe@16633
  1093
  shows "PROP R"
berghofe@16633
  1094
  apply (rule QR)
berghofe@16633
  1095
  apply (rule PQ [unfolded simp_implies_def])
berghofe@16633
  1096
  apply (rule P)
berghofe@16633
  1097
  done
berghofe@16633
  1098
berghofe@16633
  1099
lemma simp_implies_cong:
wenzelm@60759
  1100
  assumes PP' :"PROP P \<equiv> PROP P'"
wenzelm@60759
  1101
  and P'QQ': "PROP P' \<Longrightarrow> (PROP Q \<equiv> PROP Q')"
wenzelm@60759
  1102
  shows "(PROP P =simp=> PROP Q) \<equiv> (PROP P' =simp=> PROP Q')"
berghofe@16633
  1103
proof (unfold simp_implies_def, rule equal_intr_rule)
berghofe@16633
  1104
  assume PQ: "PROP P \<Longrightarrow> PROP Q"
berghofe@16633
  1105
  and P': "PROP P'"
berghofe@16633
  1106
  from PP' [symmetric] and P' have "PROP P"
berghofe@16633
  1107
    by (rule equal_elim_rule1)
wenzelm@23553
  1108
  then have "PROP Q" by (rule PQ)
berghofe@16633
  1109
  with P'QQ' [OF P'] show "PROP Q'" by (rule equal_elim_rule1)
berghofe@16633
  1110
next
berghofe@16633
  1111
  assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
berghofe@16633
  1112
  and P: "PROP P"
berghofe@16633
  1113
  from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
wenzelm@23553
  1114
  then have "PROP Q'" by (rule P'Q')
berghofe@16633
  1115
  with P'QQ' [OF P', symmetric] show "PROP Q"
berghofe@16633
  1116
    by (rule equal_elim_rule1)
berghofe@16633
  1117
qed
berghofe@16633
  1118
haftmann@20944
  1119
lemma uncurry:
haftmann@20944
  1120
  assumes "P \<longrightarrow> Q \<longrightarrow> R"
haftmann@20944
  1121
  shows "P \<and> Q \<longrightarrow> R"
wenzelm@23553
  1122
  using assms by blast
haftmann@20944
  1123
haftmann@20944
  1124
lemma iff_allI:
haftmann@20944
  1125
  assumes "\<And>x. P x = Q x"
haftmann@20944
  1126
  shows "(\<forall>x. P x) = (\<forall>x. Q x)"
wenzelm@23553
  1127
  using assms by blast
haftmann@20944
  1128
haftmann@20944
  1129
lemma iff_exI:
haftmann@20944
  1130
  assumes "\<And>x. P x = Q x"
haftmann@20944
  1131
  shows "(\<exists>x. P x) = (\<exists>x. Q x)"
wenzelm@23553
  1132
  using assms by blast
haftmann@20944
  1133
haftmann@20944
  1134
lemma all_comm:
haftmann@20944
  1135
  "(\<forall>x y. P x y) = (\<forall>y x. P x y)"
haftmann@20944
  1136
  by blast
haftmann@20944
  1137
haftmann@20944
  1138
lemma ex_comm:
haftmann@20944
  1139
  "(\<exists>x y. P x y) = (\<exists>y x. P x y)"
haftmann@20944
  1140
  by blast
haftmann@20944
  1141
wenzelm@48891
  1142
ML_file "Tools/simpdata.ML"
wenzelm@60758
  1143
ML \<open>open Simpdata\<close>
wenzelm@42455
  1144
wenzelm@60758
  1145
setup \<open>
wenzelm@58826
  1146
  map_theory_simpset (put_simpset HOL_basic_ss) #>
wenzelm@58826
  1147
  Simplifier.method_setup Splitter.split_modifiers
wenzelm@60758
  1148
\<close>
wenzelm@42455
  1149
wenzelm@60759
  1150
simproc_setup defined_Ex ("\<exists>x. P x") = \<open>fn _ => Quantifier1.rearrange_ex\<close>
wenzelm@60759
  1151
simproc_setup defined_All ("\<forall>x. P x") = \<open>fn _ => Quantifier1.rearrange_all\<close>
wenzelm@21671
  1152
wenzelm@61799
  1153
text \<open>Simproc for proving \<open>(y = x) \<equiv> False\<close> from premise \<open>\<not> (x = y)\<close>:\<close>
wenzelm@24035
  1154
wenzelm@60758
  1155
simproc_setup neq ("x = y") = \<open>fn _ =>
wenzelm@24035
  1156
let
wenzelm@24035
  1157
  val neq_to_EQ_False = @{thm not_sym} RS @{thm Eq_FalseI};
wenzelm@24035
  1158
  fun is_neq eq lhs rhs thm =
wenzelm@24035
  1159
    (case Thm.prop_of thm of
wenzelm@24035
  1160
      _ $ (Not $ (eq' $ l' $ r')) =>
wenzelm@24035
  1161
        Not = HOLogic.Not andalso eq' = eq andalso
wenzelm@24035
  1162
        r' aconv lhs andalso l' aconv rhs
wenzelm@24035
  1163
    | _ => false);
wenzelm@24035
  1164
  fun proc ss ct =
wenzelm@24035
  1165
    (case Thm.term_of ct of
wenzelm@24035
  1166
      eq $ lhs $ rhs =>
wenzelm@43597
  1167
        (case find_first (is_neq eq lhs rhs) (Simplifier.prems_of ss) of
wenzelm@24035
  1168
          SOME thm => SOME (thm RS neq_to_EQ_False)
wenzelm@24035
  1169
        | NONE => NONE)
wenzelm@24035
  1170
     | _ => NONE);
wenzelm@24035
  1171
in proc end;
wenzelm@60758
  1172
\<close>
wenzelm@24035
  1173
wenzelm@60758
  1174
simproc_setup let_simp ("Let x f") = \<open>
wenzelm@24035
  1175
let
haftmann@28741
  1176
  fun count_loose (Bound i) k = if i >= k then 1 else 0
haftmann@28741
  1177
    | count_loose (s $ t) k = count_loose s k + count_loose t k
haftmann@28741
  1178
    | count_loose (Abs (_, _, t)) k = count_loose  t (k + 1)
haftmann@28741
  1179
    | count_loose _ _ = 0;
haftmann@28741
  1180
  fun is_trivial_let (Const (@{const_name Let}, _) $ x $ t) =
wenzelm@59628
  1181
    (case t of
wenzelm@59628
  1182
      Abs (_, _, t') => count_loose t' 0 <= 1
wenzelm@59628
  1183
    | _ => true);
wenzelm@59628
  1184
in
wenzelm@59628
  1185
  fn _ => fn ctxt => fn ct =>
wenzelm@59628
  1186
    if is_trivial_let (Thm.term_of ct)
wenzelm@59628
  1187
    then SOME @{thm Let_def} (*no or one ocurrence of bound variable*)
wenzelm@59628
  1188
    else
wenzelm@59628
  1189
      let (*Norbert Schirmer's case*)
wenzelm@59628
  1190
        val t = Thm.term_of ct;
wenzelm@59628
  1191
        val ([t'], ctxt') = Variable.import_terms false [t] ctxt;
wenzelm@59628
  1192
      in
wenzelm@59628
  1193
        Option.map (hd o Variable.export ctxt' ctxt o single)
wenzelm@59628
  1194
          (case t' of Const (@{const_name Let},_) $ x $ f => (* x and f are already in normal form *)
wenzelm@59628
  1195
            if is_Free x orelse is_Bound x orelse is_Const x
wenzelm@59628
  1196
            then SOME @{thm Let_def}
wenzelm@59628
  1197
            else
wenzelm@59628
  1198
              let
wenzelm@59628
  1199
                val n = case f of (Abs (x, _, _)) => x | _ => "x";
wenzelm@59628
  1200
                val cx = Thm.cterm_of ctxt x;
wenzelm@59628
  1201
                val xT = Thm.typ_of_cterm cx;
wenzelm@59628
  1202
                val cf = Thm.cterm_of ctxt f;
wenzelm@59628
  1203
                val fx_g = Simplifier.rewrite ctxt (Thm.apply cf cx);
wenzelm@59628
  1204
                val (_ $ _ $ g) = Thm.prop_of fx_g;
wenzelm@59628
  1205
                val g' = abstract_over (x, g);
wenzelm@59628
  1206
                val abs_g'= Abs (n, xT, g');
wenzelm@59628
  1207
              in
wenzelm@59628
  1208
                if g aconv g' then
wenzelm@59628
  1209
                  let
wenzelm@59628
  1210
                    val rl =
wenzelm@60781
  1211
                      infer_instantiate ctxt [(("f", 0), cf), (("x", 0), cx)] @{thm Let_unfold};
wenzelm@59628
  1212
                  in SOME (rl OF [fx_g]) end
wenzelm@59628
  1213
                else if (Envir.beta_eta_contract f) aconv (Envir.beta_eta_contract abs_g')
wenzelm@59628
  1214
                then NONE (*avoid identity conversion*)
wenzelm@59628
  1215
                else
wenzelm@59628
  1216
                  let
wenzelm@59628
  1217
                    val g'x = abs_g' $ x;
wenzelm@59628
  1218
                    val g_g'x = Thm.symmetric (Thm.beta_conversion false (Thm.cterm_of ctxt g'x));
wenzelm@59628
  1219
                    val rl =
wenzelm@60781
  1220
                      @{thm Let_folded} |> infer_instantiate ctxt
wenzelm@60781
  1221
                        [(("f", 0), Thm.cterm_of ctxt f),
wenzelm@60781
  1222
                         (("x", 0), cx),
wenzelm@60781
  1223
                         (("g", 0), Thm.cterm_of ctxt abs_g')];
wenzelm@59628
  1224
                  in SOME (rl OF [Thm.transitive fx_g g_g'x]) end
wenzelm@59628
  1225
              end
wenzelm@59628
  1226
          | _ => NONE)
wenzelm@59628
  1227
      end
wenzelm@60758
  1228
end\<close>
wenzelm@24035
  1229
haftmann@21151
  1230
lemma True_implies_equals: "(True \<Longrightarrow> PROP P) \<equiv> PROP P"
haftmann@21151
  1231
proof
wenzelm@23389
  1232
  assume "True \<Longrightarrow> PROP P"
wenzelm@23389
  1233
  from this [OF TrueI] show "PROP P" .
haftmann@21151
  1234
next
haftmann@21151
  1235
  assume "PROP P"
wenzelm@23389
  1236
  then show "PROP P" .
haftmann@21151
  1237
qed
haftmann@21151
  1238
nipkow@59864
  1239
lemma implies_True_equals: "(PROP P \<Longrightarrow> True) \<equiv> Trueprop True"
wenzelm@61169
  1240
  by standard (intro TrueI)
nipkow@59864
  1241
nipkow@59864
  1242
lemma False_implies_equals: "(False \<Longrightarrow> P) \<equiv> Trueprop True"
wenzelm@61169
  1243
  by standard simp_all
nipkow@59864
  1244
nipkow@60183
  1245
(* This is not made a simp rule because it does not improve any proofs
nipkow@60183
  1246
   but slows some AFP entries down by 5% (cpu time). May 2015 *)
nipkow@60169
  1247
lemma implies_False_swap: "NO_MATCH (Trueprop False) P \<Longrightarrow>
nipkow@60169
  1248
  (False \<Longrightarrow> PROP P \<Longrightarrow> PROP Q) \<equiv> (PROP P \<Longrightarrow> False \<Longrightarrow> PROP Q)"
nipkow@60169
  1249
by(rule swap_prems_eq)
nipkow@60169
  1250
haftmann@21151
  1251
lemma ex_simps:
wenzelm@60759
  1252
  "\<And>P Q. (\<exists>x. P x \<and> Q)   = ((\<exists>x. P x) \<and> Q)"
wenzelm@60759
  1253
  "\<And>P Q. (\<exists>x. P \<and> Q x)   = (P \<and> (\<exists>x. Q x))"
wenzelm@60759
  1254
  "\<And>P Q. (\<exists>x. P x \<or> Q)   = ((\<exists>x. P x) \<or> Q)"
wenzelm@60759
  1255
  "\<And>P Q. (\<exists>x. P \<or> Q x)   = (P \<or> (\<exists>x. Q x))"
wenzelm@60759
  1256
  "\<And>P Q. (\<exists>x. P x \<longrightarrow> Q) = ((\<forall>x. P x) \<longrightarrow> Q)"
wenzelm@60759
  1257
  "\<And>P Q. (\<exists>x. P \<longrightarrow> Q x) = (P \<longrightarrow> (\<exists>x. Q x))"
wenzelm@61799
  1258
  \<comment> \<open>Miniscoping: pushing in existential quantifiers.\<close>
haftmann@21151
  1259
  by (iprover | blast)+
haftmann@21151
  1260
haftmann@21151
  1261
lemma all_simps:
wenzelm@60759
  1262
  "\<And>P Q. (\<forall>x. P x \<and> Q)   = ((\<forall>x. P x) \<and> Q)"
wenzelm@60759
  1263
  "\<And>P Q. (\<forall>x. P \<and> Q x)   = (P \<and> (\<forall>x. Q x))"
wenzelm@60759
  1264
  "\<And>P Q. (\<forall>x. P x \<or> Q)   = ((\<forall>x. P x) \<or> Q)"
wenzelm@60759
  1265
  "\<And>P Q. (\<forall>x. P \<or> Q x)   = (P \<or> (\<forall>x. Q x))"
wenzelm@60759
  1266
  "\<And>P Q. (\<forall>x. P x \<longrightarrow> Q) = ((\<exists>x. P x) \<longrightarrow> Q)"
wenzelm@60759
  1267
  "\<And>P Q. (\<forall>x. P \<longrightarrow> Q x) = (P \<longrightarrow> (\<forall>x. Q x))"
wenzelm@61799
  1268
  \<comment> \<open>Miniscoping: pushing in universal quantifiers.\<close>
haftmann@21151
  1269
  by (iprover | blast)+
paulson@15481
  1270
wenzelm@21671
  1271
lemmas [simp] =
wenzelm@21671
  1272
  triv_forall_equality (*prunes params*)
nipkow@60143
  1273
  True_implies_equals implies_True_equals (*prune True in asms*)
nipkow@60183
  1274
  False_implies_equals (*prune False in asms*)
wenzelm@21671
  1275
  if_True
wenzelm@21671
  1276
  if_False
wenzelm@21671
  1277
  if_cancel
wenzelm@21671
  1278
  if_eq_cancel
wenzelm@21671
  1279
  imp_disjL
haftmann@20973
  1280
  (*In general it seems wrong to add distributive laws by default: they
haftmann@20973
  1281
    might cause exponential blow-up.  But imp_disjL has been in for a while
haftmann@20973
  1282
    and cannot be removed without affecting existing proofs.  Moreover,
wenzelm@60759
  1283
    rewriting by "(P \<or> Q \<longrightarrow> R) = ((P \<longrightarrow> R) \<and> (Q \<longrightarrow> R))" might be justified on the
haftmann@20973
  1284
    grounds that it allows simplification of R in the two cases.*)
wenzelm@21671
  1285
  conj_assoc
wenzelm@21671
  1286
  disj_assoc
wenzelm@21671
  1287
  de_Morgan_conj
wenzelm@21671
  1288
  de_Morgan_disj
wenzelm@21671
  1289
  imp_disj1
wenzelm@21671
  1290
  imp_disj2
wenzelm@21671
  1291
  not_imp
wenzelm@21671
  1292
  disj_not1
wenzelm@21671
  1293
  not_all
wenzelm@21671
  1294
  not_ex
wenzelm@21671
  1295
  cases_simp
wenzelm@21671
  1296
  the_eq_trivial
wenzelm@21671
  1297
  the_sym_eq_trivial
wenzelm@21671
  1298
  ex_simps
wenzelm@21671
  1299
  all_simps
wenzelm@21671
  1300
  simp_thms
wenzelm@21671
  1301
wenzelm@21671
  1302
lemmas [cong] = imp_cong simp_implies_cong
wenzelm@21671
  1303
lemmas [split] = split_if
haftmann@20973
  1304
wenzelm@60758
  1305
ML \<open>val HOL_ss = simpset_of @{context}\<close>
haftmann@20973
  1306
wenzelm@60761
  1307
text \<open>Simplifies @{term x} assuming @{prop c} and @{term y} assuming @{prop "\<not> c"}\<close>
haftmann@20944
  1308
lemma if_cong:
haftmann@20944
  1309
  assumes "b = c"
haftmann@20944
  1310
      and "c \<Longrightarrow> x = u"
haftmann@20944
  1311
      and "\<not> c \<Longrightarrow> y = v"
haftmann@20944
  1312
  shows "(if b then x else y) = (if c then u else v)"
haftmann@38525
  1313
  using assms by simp
haftmann@20944
  1314
wenzelm@60758
  1315
text \<open>Prevents simplification of x and y:
wenzelm@60758
  1316
  faster and allows the execution of functional programs.\<close>
haftmann@20944
  1317
lemma if_weak_cong [cong]:
haftmann@20944
  1318
  assumes "b = c"
haftmann@20944
  1319
  shows "(if b then x else y) = (if c then x else y)"
wenzelm@23553
  1320
  using assms by (rule arg_cong)
haftmann@20944
  1321
wenzelm@60758
  1322
text \<open>Prevents simplification of t: much faster\<close>
haftmann@20944
  1323
lemma let_weak_cong:
haftmann@20944
  1324
  assumes "a = b"
haftmann@20944
  1325
  shows "(let x = a in t x) = (let x = b in t x)"
wenzelm@23553
  1326
  using assms by (rule arg_cong)
haftmann@20944
  1327
wenzelm@60758
  1328
text \<open>To tidy up the result of a simproc.  Only the RHS will be simplified.\<close>
haftmann@20944
  1329
lemma eq_cong2:
haftmann@20944
  1330
  assumes "u = u'"
haftmann@20944
  1331
  shows "(t \<equiv> u) \<equiv> (t \<equiv> u')"
wenzelm@23553
  1332
  using assms by simp
haftmann@20944
  1333
haftmann@20944
  1334
lemma if_distrib:
haftmann@20944
  1335
  "f (if c then x else y) = (if c then f x else f y)"
haftmann@20944
  1336
  by simp
haftmann@20944
  1337
wenzelm@60758
  1338
text\<open>As a simplification rule, it replaces all function equalities by
wenzelm@60758
  1339
  first-order equalities.\<close>
haftmann@44277
  1340
lemma fun_eq_iff: "f = g \<longleftrightarrow> (\<forall>x. f x = g x)"
haftmann@44277
  1341
  by auto
haftmann@44277
  1342
wenzelm@17459
  1343
wenzelm@60758
  1344
subsubsection \<open>Generic cases and induction\<close>
wenzelm@17459
  1345
wenzelm@60758
  1346
text \<open>Rule projections:\<close>
wenzelm@60758
  1347
ML \<open>
wenzelm@32172
  1348
structure Project_Rule = Project_Rule
wenzelm@25388
  1349
(
wenzelm@27126
  1350
  val conjunct1 = @{thm conjunct1}
wenzelm@27126
  1351
  val conjunct2 = @{thm conjunct2}
wenzelm@27126
  1352
  val mp = @{thm mp}
wenzelm@59929
  1353
);
wenzelm@60758
  1354
\<close>
wenzelm@17459
  1355
wenzelm@59940
  1356
context
wenzelm@59940
  1357
begin
wenzelm@59940
  1358
wenzelm@59990
  1359
qualified definition "induct_forall P \<equiv> \<forall>x. P x"
wenzelm@59990
  1360
qualified definition "induct_implies A B \<equiv> A \<longrightarrow> B"
wenzelm@59990
  1361
qualified definition "induct_equal x y \<equiv> x = y"
wenzelm@59990
  1362
qualified definition "induct_conj A B \<equiv> A \<and> B"
wenzelm@59990
  1363
qualified definition "induct_true \<equiv> True"
wenzelm@59990
  1364
qualified definition "induct_false \<equiv> False"
haftmann@35416
  1365
wenzelm@59929
  1366
lemma induct_forall_eq: "(\<And>x. P x) \<equiv> Trueprop (induct_forall (\<lambda>x. P x))"
wenzelm@18457
  1367
  by (unfold atomize_all induct_forall_def)
wenzelm@11824
  1368
wenzelm@59929
  1369
lemma induct_implies_eq: "(A \<Longrightarrow> B) \<equiv> Trueprop (induct_implies A B)"
wenzelm@18457
  1370
  by (unfold atomize_imp induct_implies_def)
wenzelm@11824
  1371
wenzelm@59929
  1372
lemma induct_equal_eq: "(x \<equiv> y) \<equiv> Trueprop (induct_equal x y)"
wenzelm@18457
  1373
  by (unfold atomize_eq induct_equal_def)
wenzelm@18457
  1374
wenzelm@59929
  1375
lemma induct_conj_eq: "(A &&& B) \<equiv> Trueprop (induct_conj A B)"
wenzelm@18457
  1376
  by (unfold atomize_conj induct_conj_def)
wenzelm@18457
  1377
berghofe@34908
  1378
lemmas induct_atomize' = induct_forall_eq induct_implies_eq induct_conj_eq
berghofe@34908
  1379
lemmas induct_atomize = induct_atomize' induct_equal_eq
wenzelm@45607
  1380
lemmas induct_rulify' [symmetric] = induct_atomize'
wenzelm@45607
  1381
lemmas induct_rulify [symmetric] = induct_atomize
wenzelm@18457
  1382
lemmas induct_rulify_fallback =
wenzelm@18457
  1383
  induct_forall_def induct_implies_def induct_equal_def induct_conj_def
berghofe@34908
  1384
  induct_true_def induct_false_def
wenzelm@18457
  1385
wenzelm@11989
  1386
lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
wenzelm@11989
  1387
    induct_conj (induct_forall A) (induct_forall B)"
nipkow@17589
  1388
  by (unfold induct_forall_def induct_conj_def) iprover
wenzelm@11824
  1389
wenzelm@11989
  1390
lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
wenzelm@11989
  1391
    induct_conj (induct_implies C A) (induct_implies C B)"
nipkow@17589
  1392
  by (unfold induct_implies_def induct_conj_def) iprover
wenzelm@11989
  1393
wenzelm@59929
  1394
lemma induct_conj_curry: "(induct_conj A B \<Longrightarrow> PROP C) \<equiv> (A \<Longrightarrow> B \<Longrightarrow> PROP C)"
berghofe@13598
  1395
proof
wenzelm@59929
  1396
  assume r: "induct_conj A B \<Longrightarrow> PROP C"
wenzelm@59929
  1397
  assume ab: A B
wenzelm@59929
  1398
  show "PROP C" by (rule r) (simp add: induct_conj_def ab)
berghofe@13598
  1399
next
wenzelm@59929
  1400
  assume r: "A \<Longrightarrow> B \<Longrightarrow> PROP C"
wenzelm@59929
  1401
  assume ab: "induct_conj A B"
wenzelm@59929
  1402
  show "PROP C" by (rule r) (simp_all add: ab [unfolded induct_conj_def])
berghofe@13598
  1403
qed
wenzelm@11824
  1404
wenzelm@11989
  1405
lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
wenzelm@11824
  1406
berghofe@34908
  1407
lemma induct_trueI: "induct_true"
berghofe@34908
  1408
  by (simp add: induct_true_def)
wenzelm@11824
  1409
wenzelm@60758
  1410
text \<open>Method setup.\<close>
wenzelm@11824
  1411
wenzelm@58826
  1412
ML_file "~~/src/Tools/induct.ML"
wenzelm@60758
  1413
ML \<open>
wenzelm@32171
  1414
structure Induct = Induct
wenzelm@27126
  1415
(
wenzelm@27126
  1416
  val cases_default = @{thm case_split}
wenzelm@27126
  1417
  val atomize = @{thms induct_atomize}
berghofe@34908
  1418
  val rulify = @{thms induct_rulify'}
wenzelm@27126
  1419
  val rulify_fallback = @{thms induct_rulify_fallback}
berghofe@34988
  1420
  val equal_def = @{thm induct_equal_def}
berghofe@34908
  1421
  fun dest_def (Const (@{const_name induct_equal}, _) $ t $ u) = SOME (t, u)
berghofe@34908
  1422
    | dest_def _ = NONE
wenzelm@58957
  1423
  fun trivial_tac ctxt = match_tac ctxt @{thms induct_trueI}
wenzelm@27126
  1424
)
wenzelm@60758
  1425
\<close>
wenzelm@11824
  1426
wenzelm@48891
  1427
ML_file "~~/src/Tools/induction.ML"
nipkow@45014
  1428
wenzelm@60758
  1429
declaration \<open>
wenzelm@59940
  1430
  fn _ => Induct.map_simpset (fn ss => ss
berghofe@34908
  1431
    addsimprocs
wenzelm@61144
  1432
      [Simplifier.make_simproc @{context} "swap_induct_false"
wenzelm@61144
  1433
        {lhss = [@{term "induct_false \<Longrightarrow> PROP P \<Longrightarrow> PROP Q"}],
wenzelm@61144
  1434
         proc = fn _ => fn _ => fn ct =>
wenzelm@61144
  1435
          (case Thm.term_of ct of
wenzelm@61144
  1436
            _ $ (P as _ $ @{const induct_false}) $ (_ $ Q $ _) =>
wenzelm@61144
  1437
              if P <> Q then SOME Drule.swap_prems_eq else NONE
wenzelm@61144
  1438
          | _ => NONE),
wenzelm@61144
  1439
         identifier = []},
wenzelm@61144
  1440
       Simplifier.make_simproc @{context} "induct_equal_conj_curry"
wenzelm@61144
  1441
        {lhss = [@{term "induct_conj P Q \<Longrightarrow> PROP R"}],
wenzelm@61144
  1442
         proc = fn _ => fn _ => fn ct =>
wenzelm@61144
  1443
          (case Thm.term_of ct of
wenzelm@61144
  1444
            _ $ (_ $ P) $ _ =>
wenzelm@61144
  1445
              let
wenzelm@61144
  1446
                fun is_conj (@{const induct_conj} $ P $ Q) =
wenzelm@61144
  1447
                      is_conj P andalso is_conj Q
wenzelm@61144
  1448
                  | is_conj (Const (@{const_name induct_equal}, _) $ _ $ _) = true
wenzelm@61144
  1449
                  | is_conj @{const induct_true} = true
wenzelm@61144
  1450
                  | is_conj @{const induct_false} = true
wenzelm@61144
  1451
                  | is_conj _ = false
wenzelm@61144
  1452
              in if is_conj P then SOME @{thm induct_conj_curry} else NONE end
wenzelm@61144
  1453
            | _ => NONE),
wenzelm@61144
  1454
          identifier = []}]
wenzelm@54742
  1455
    |> Simplifier.set_mksimps (fn ctxt =>
wenzelm@54742
  1456
        Simpdata.mksimps Simpdata.mksimps_pairs ctxt #>
wenzelm@59940
  1457
        map (rewrite_rule ctxt (map Thm.symmetric @{thms induct_rulify_fallback}))))
wenzelm@60758
  1458
\<close>
berghofe@34908
  1459
wenzelm@60758
  1460
text \<open>Pre-simplification of induction and cases rules\<close>
berghofe@34908
  1461
wenzelm@59929
  1462
lemma [induct_simp]: "(\<And>x. induct_equal x t \<Longrightarrow> PROP P x) \<equiv> PROP P t"
berghofe@34908
  1463
  unfolding induct_equal_def
berghofe@34908
  1464
proof
wenzelm@59929
  1465
  assume r: "\<And>x. x = t \<Longrightarrow> PROP P x"
wenzelm@59929
  1466
  show "PROP P t" by (rule r [OF refl])
berghofe@34908
  1467
next
wenzelm@59929
  1468
  fix x
wenzelm@59929
  1469
  assume "PROP P t" "x = t"
berghofe@34908
  1470
  then show "PROP P x" by simp
berghofe@34908
  1471
qed
berghofe@34908
  1472
wenzelm@59929
  1473
lemma [induct_simp]: "(\<And>x. induct_equal t x \<Longrightarrow> PROP P x) \<equiv> PROP P t"
berghofe@34908
  1474
  unfolding induct_equal_def
berghofe@34908
  1475
proof
wenzelm@59929
  1476
  assume r: "\<And>x. t = x \<Longrightarrow> PROP P x"
wenzelm@59929
  1477
  show "PROP P t" by (rule r [OF refl])
berghofe@34908
  1478
next
wenzelm@59929
  1479
  fix x
wenzelm@59929
  1480
  assume "PROP P t" "t = x"
berghofe@34908
  1481
  then show "PROP P x" by simp
berghofe@34908
  1482
qed
berghofe@34908
  1483
wenzelm@59929
  1484
lemma [induct_simp]: "(induct_false \<Longrightarrow> P) \<equiv> Trueprop induct_true"
berghofe@34908
  1485
  unfolding induct_false_def induct_true_def
berghofe@34908
  1486
  by (iprover intro: equal_intr_rule)
berghofe@34908
  1487
wenzelm@59929
  1488
lemma [induct_simp]: "(induct_true \<Longrightarrow> PROP P) \<equiv> PROP P"
berghofe@34908
  1489
  unfolding induct_true_def
berghofe@34908
  1490
proof
wenzelm@59929
  1491
  assume "True \<Longrightarrow> PROP P"
wenzelm@59929
  1492
  then show "PROP P" using TrueI .
berghofe@34908
  1493
next
berghofe@34908
  1494
  assume "PROP P"
berghofe@34908
  1495
  then show "PROP P" .
berghofe@34908
  1496
qed
berghofe@34908
  1497
wenzelm@59929
  1498
lemma [induct_simp]: "(PROP P \<Longrightarrow> induct_true) \<equiv> Trueprop induct_true"
berghofe@34908
  1499
  unfolding induct_true_def
berghofe@34908
  1500
  by (iprover intro: equal_intr_rule)
berghofe@34908
  1501
wenzelm@59929
  1502
lemma [induct_simp]: "(\<And>x. induct_true) \<equiv> Trueprop induct_true"
berghofe@34908
  1503
  unfolding induct_true_def
berghofe@34908
  1504
  by (iprover intro: equal_intr_rule)
berghofe@34908
  1505
wenzelm@59929
  1506
lemma [induct_simp]: "induct_implies induct_true P \<equiv> P"
berghofe@34908
  1507
  by (simp add: induct_implies_def induct_true_def)
berghofe@34908
  1508
wenzelm@59929
  1509
lemma [induct_simp]: "x = x \<longleftrightarrow> True"
berghofe@34908
  1510
  by (rule simp_thms)
berghofe@34908
  1511
wenzelm@59940
  1512
end
wenzelm@18457
  1513
wenzelm@48891
  1514
ML_file "~~/src/Tools/induct_tacs.ML"
wenzelm@27126
  1515
haftmann@20944
  1516
wenzelm@60758
  1517
subsubsection \<open>Coherent logic\<close>
berghofe@28325
  1518
wenzelm@55632
  1519
ML_file "~~/src/Tools/coherent.ML"
wenzelm@60758
  1520
ML \<open>
wenzelm@32734
  1521
structure Coherent = Coherent
berghofe@28325
  1522
(
wenzelm@55632
  1523
  val atomize_elimL = @{thm atomize_elimL};
wenzelm@55632
  1524
  val atomize_exL = @{thm atomize_exL};
wenzelm@55632
  1525
  val atomize_conjL = @{thm atomize_conjL};
wenzelm@55632
  1526
  val atomize_disjL = @{thm atomize_disjL};
wenzelm@55632
  1527
  val operator_names = [@{const_name HOL.disj}, @{const_name HOL.conj}, @{const_name Ex}];
berghofe@28325
  1528
);
wenzelm@60758
  1529
\<close>
berghofe@28325
  1530
berghofe@28325
  1531
wenzelm@60758
  1532
subsubsection \<open>Reorienting equalities\<close>
huffman@31024
  1533
wenzelm@60758
  1534
ML \<open>
huffman@31024
  1535
signature REORIENT_PROC =
huffman@31024
  1536
sig
huffman@31024
  1537
  val add : (term -> bool) -> theory -> theory
wenzelm@51717
  1538
  val proc : morphism -> Proof.context -> cterm -> thm option
huffman@31024
  1539
end;
huffman@31024
  1540
wenzelm@33523
  1541
structure Reorient_Proc : REORIENT_PROC =
huffman@31024
  1542
struct
wenzelm@33523
  1543
  structure Data = Theory_Data
huffman@31024
  1544
  (
wenzelm@33523
  1545
    type T = ((term -> bool) * stamp) list;
wenzelm@33523
  1546
    val empty = [];
huffman@31024
  1547
    val extend = I;
wenzelm@33523
  1548
    fun merge data : T = Library.merge (eq_snd op =) data;
wenzelm@33523
  1549
  );
wenzelm@33523
  1550
  fun add m = Data.map (cons (m, stamp ()));
wenzelm@33523
  1551
  fun matches thy t = exists (fn (m, _) => m t) (Data.get thy);
huffman@31024
  1552
huffman@31024
  1553
  val meta_reorient = @{thm eq_commute [THEN eq_reflection]};
wenzelm@51717
  1554
  fun proc phi ctxt ct =
huffman@31024
  1555
    let
wenzelm@42361
  1556
      val thy = Proof_Context.theory_of ctxt;
huffman@31024
  1557
    in
huffman@31024
  1558
      case Thm.term_of ct of
wenzelm@33523
  1559
        (_ $ t $ u) => if matches thy u then NONE else SOME meta_reorient
huffman@31024
  1560
      | _ => NONE
huffman@31024
  1561
    end;
huffman@31024
  1562
end;
wenzelm@60758
  1563
\<close>
huffman@31024
  1564
huffman@31024
  1565
wenzelm@60758
  1566
subsection \<open>Other simple lemmas and lemma duplicates\<close>
haftmann@20944
  1567
wenzelm@60759
  1568
lemma ex1_eq [iff]: "\<exists>!x. x = t" "\<exists>!x. t = x"
haftmann@20944
  1569
  by blast+
haftmann@20944
  1570
wenzelm@60759
  1571
lemma choice_eq: "(\<forall>x. \<exists>!y. P x y) = (\<exists>!f. \<forall>x. P x (f x))"
haftmann@20944
  1572
  apply (rule iffI)
wenzelm@60759
  1573
  apply (rule_tac a = "\<lambda>x. THE y. P x y" in ex1I)
haftmann@20944
  1574
  apply (fast dest!: theI')
huffman@44921
  1575
  apply (fast intro: the1_equality [symmetric])
haftmann@20944
  1576
  apply (erule ex1E)
haftmann@20944
  1577
  apply (rule allI)
haftmann@20944
  1578
  apply (rule ex1I)
haftmann@20944
  1579
  apply (erule spec)
wenzelm@60759
  1580
  apply (erule_tac x = "\<lambda>z. if z = x then y else f z" in allE)
haftmann@20944
  1581
  apply (erule impE)
haftmann@20944
  1582
  apply (rule allI)
wenzelm@27126
  1583
  apply (case_tac "xa = x")
haftmann@20944
  1584
  apply (drule_tac [3] x = x in fun_cong, simp_all)
haftmann@20944
  1585
  done
haftmann@20944
  1586
haftmann@22218
  1587
lemmas eq_sym_conv = eq_commute
haftmann@22218
  1588
chaieb@23037
  1589
lemma nnf_simps:
wenzelm@58826
  1590
  "(\<not>(P \<and> Q)) = (\<not> P \<or> \<not> Q)" "(\<not> (P \<or> Q)) = (\<not> P \<and> \<not>Q)" "(P \<longrightarrow> Q) = (\<not>P \<or> Q)"
wenzelm@58826
  1591
  "(P = Q) = ((P \<and> Q) \<or> (\<not>P \<and> \<not> Q))" "(\<not>(P = Q)) = ((P \<and> \<not> Q) \<or> (\<not>P \<and> Q))"
chaieb@23037
  1592
  "(\<not> \<not>(P)) = P"
chaieb@23037
  1593
by blast+
chaieb@23037
  1594
wenzelm@60758
  1595
subsection \<open>Basic ML bindings\<close>
wenzelm@21671
  1596
wenzelm@60758
  1597
ML \<open>
wenzelm@22129
  1598
val FalseE = @{thm FalseE}
wenzelm@22129
  1599
val Let_def = @{thm Let_def}
wenzelm@22129
  1600
val TrueI = @{thm TrueI}
wenzelm@22129
  1601
val allE = @{thm allE}
wenzelm@22129
  1602
val allI = @{thm allI}
wenzelm@22129
  1603
val all_dupE = @{thm all_dupE}
wenzelm@22129
  1604
val arg_cong = @{thm arg_cong}
wenzelm@22129
  1605
val box_equals = @{thm box_equals}
wenzelm@22129
  1606
val ccontr = @{thm ccontr}
wenzelm@22129
  1607
val classical = @{thm classical}
wenzelm@22129
  1608
val conjE = @{thm conjE}
wenzelm@22129
  1609
val conjI = @{thm conjI}
wenzelm@22129
  1610
val conjunct1 = @{thm conjunct1}
wenzelm@22129
  1611
val conjunct2 = @{thm conjunct2}
wenzelm@22129
  1612
val disjCI = @{thm disjCI}
wenzelm@22129
  1613
val disjE = @{thm disjE}
wenzelm@22129
  1614
val disjI1 = @{thm disjI1}
wenzelm@22129
  1615
val disjI2 = @{thm disjI2}
wenzelm@22129
  1616
val eq_reflection = @{thm eq_reflection}
wenzelm@22129
  1617
val ex1E = @{thm ex1E}
wenzelm@22129
  1618
val ex1I = @{thm ex1I}
wenzelm@22129
  1619
val ex1_implies_ex = @{thm ex1_implies_ex}
wenzelm@22129
  1620
val exE = @{thm exE}
wenzelm@22129
  1621
val exI = @{thm exI}
wenzelm@22129
  1622
val excluded_middle = @{thm excluded_middle}
wenzelm@22129
  1623
val ext = @{thm ext}
wenzelm@22129
  1624
val fun_cong = @{thm fun_cong}
wenzelm@22129
  1625
val iffD1 = @{thm iffD1}
wenzelm@22129
  1626
val iffD2 = @{thm iffD2}
wenzelm@22129
  1627
val iffI = @{thm iffI}
wenzelm@22129
  1628
val impE = @{thm impE}
wenzelm@22129
  1629
val impI = @{thm impI}
wenzelm@22129
  1630
val meta_eq_to_obj_eq = @{thm meta_eq_to_obj_eq}
wenzelm@22129
  1631
val mp = @{thm mp}
wenzelm@22129
  1632
val notE = @{thm notE}
wenzelm@22129
  1633
val notI = @{thm notI}
wenzelm@22129
  1634
val not_all = @{thm not_all}
wenzelm@22129
  1635
val not_ex = @{thm not_ex}
wenzelm@22129
  1636
val not_iff = @{thm not_iff}
wenzelm@22129
  1637
val not_not = @{thm not_not}
wenzelm@22129
  1638
val not_sym = @{thm not_sym}
wenzelm@22129
  1639
val refl = @{thm refl}
wenzelm@22129
  1640
val rev_mp = @{thm rev_mp}
wenzelm@22129
  1641
val spec = @{thm spec}
wenzelm@22129
  1642
val ssubst = @{thm ssubst}
wenzelm@22129
  1643
val subst = @{thm subst}
wenzelm@22129
  1644
val sym = @{thm sym}
wenzelm@22129
  1645
val trans = @{thm trans}
wenzelm@60758
  1646
\<close>
wenzelm@21671
  1647
wenzelm@55239
  1648
ML_file "Tools/cnf.ML"
wenzelm@55239
  1649
wenzelm@21671
  1650
wenzelm@61799
  1651
section \<open>\<open>NO_MATCH\<close> simproc\<close>
hoelzl@58775
  1652
wenzelm@60758
  1653
text \<open>
hoelzl@58775
  1654
 The simplification procedure can be used to avoid simplification of terms of a certain form
wenzelm@60758
  1655
\<close>
hoelzl@58775
  1656
hoelzl@59779
  1657
definition NO_MATCH :: "'a \<Rightarrow> 'b \<Rightarrow> bool" where "NO_MATCH pat val \<equiv> True"
hoelzl@58830
  1658
hoelzl@59779
  1659
lemma NO_MATCH_cong[cong]: "NO_MATCH pat val = NO_MATCH pat val" by (rule refl)
hoelzl@58775
  1660
hoelzl@58830
  1661
declare [[coercion_args NO_MATCH - -]]
hoelzl@58830
  1662
wenzelm@60758
  1663
simproc_setup NO_MATCH ("NO_MATCH pat val") = \<open>fn _ => fn ctxt => fn ct =>
hoelzl@58775
  1664
  let
hoelzl@58775
  1665
    val thy = Proof_Context.theory_of ctxt
hoelzl@58775
  1666
    val dest_binop = Term.dest_comb #> apfst (Term.dest_comb #> snd)
hoelzl@58775
  1667
    val m = Pattern.matches thy (dest_binop (Thm.term_of ct))
hoelzl@58775
  1668
  in if m then NONE else SOME @{thm NO_MATCH_def} end
wenzelm@60758
  1669
\<close>
hoelzl@58775
  1670
wenzelm@60758
  1671
text \<open>
hoelzl@59779
  1672
  This setup ensures that a rewrite rule of the form @{term "NO_MATCH pat val \<Longrightarrow> t"}
hoelzl@58775
  1673
  is only applied, if the pattern @{term pat} does not match the value @{term val}.
wenzelm@60758
  1674
\<close>
hoelzl@58775
  1675
hoelzl@58775
  1676
wenzelm@61222
  1677
text\<open>Tagging a premise of a simp rule with ASSUMPTION forces the simplifier
wenzelm@61222
  1678
not to simplify the argument and to solve it by an assumption.\<close>
nipkow@61202
  1679
nipkow@61202
  1680
definition ASSUMPTION :: "bool \<Rightarrow> bool" where
nipkow@61202
  1681
"ASSUMPTION A \<equiv> A"
nipkow@61202
  1682
nipkow@61202
  1683
lemma ASSUMPTION_cong[cong]: "ASSUMPTION A = ASSUMPTION A"
nipkow@61202
  1684
by (rule refl)
nipkow@61202
  1685
nipkow@61202
  1686
lemma ASSUMPTION_I: "A \<Longrightarrow> ASSUMPTION A"
nipkow@61202
  1687
by(simp add: ASSUMPTION_def)
nipkow@61202
  1688
nipkow@61202
  1689
lemma ASSUMPTION_D: "ASSUMPTION A \<Longrightarrow> A"
nipkow@61202
  1690
by(simp add: ASSUMPTION_def)
nipkow@61202
  1691
wenzelm@61222
  1692
setup \<open>
nipkow@61202
  1693
let
nipkow@61202
  1694
  val asm_sol = mk_solver "ASSUMPTION" (fn ctxt =>
nipkow@61202
  1695
    resolve_tac ctxt [@{thm ASSUMPTION_I}] THEN'
nipkow@61202
  1696
    resolve_tac ctxt (Simplifier.prems_of ctxt))
nipkow@61202
  1697
in
nipkow@61202
  1698
  map_theory_simpset (fn ctxt => Simplifier.addSolver (ctxt,asm_sol))
nipkow@61202
  1699
end
wenzelm@61222
  1700
\<close>
nipkow@61202
  1701
nipkow@61202
  1702
wenzelm@60758
  1703
subsection \<open>Code generator setup\<close>
haftmann@30929
  1704
wenzelm@60758
  1705
subsubsection \<open>Generic code generator preprocessor setup\<close>
haftmann@31151
  1706
haftmann@53146
  1707
lemma conj_left_cong:
haftmann@53146
  1708
  "P \<longleftrightarrow> Q \<Longrightarrow> P \<and> R \<longleftrightarrow> Q \<and> R"
haftmann@53146
  1709
  by (fact arg_cong)
haftmann@53146
  1710
haftmann@53146
  1711
lemma disj_left_cong:
haftmann@53146
  1712
  "P \<longleftrightarrow> Q \<Longrightarrow> P \<or> R \<longleftrightarrow> Q \<or> R"
haftmann@53146
  1713
  by (fact arg_cong)
haftmann@53146
  1714
wenzelm@60758
  1715
setup \<open>
wenzelm@58826
  1716
  Code_Preproc.map_pre (put_simpset HOL_basic_ss) #>
wenzelm@58826
  1717
  Code_Preproc.map_post (put_simpset HOL_basic_ss) #>
wenzelm@58826
  1718
  Code_Simp.map_ss (put_simpset HOL_basic_ss #>
wenzelm@58826
  1719
  Simplifier.add_cong @{thm conj_left_cong} #>
wenzelm@58826
  1720
  Simplifier.add_cong @{thm disj_left_cong})
wenzelm@60758
  1721
\<close>
haftmann@31151
  1722
haftmann@53146
  1723
wenzelm@60758
  1724
subsubsection \<open>Equality\<close>
haftmann@24844
  1725
haftmann@38857
  1726
class equal =
haftmann@38857
  1727
  fixes equal :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@38857
  1728
  assumes equal_eq: "equal x y \<longleftrightarrow> x = y"
haftmann@26513
  1729
begin
haftmann@26513
  1730
bulwahn@45231
  1731
lemma equal: "equal = (op =)"
haftmann@38857
  1732
  by (rule ext equal_eq)+
haftmann@28346
  1733
haftmann@38857
  1734
lemma equal_refl: "equal x x \<longleftrightarrow> True"
haftmann@38857
  1735
  unfolding equal by rule+
haftmann@28346
  1736
haftmann@38857
  1737
lemma eq_equal: "(op =) \<equiv> equal"
haftmann@38857
  1738
  by (rule eq_reflection) (rule ext, rule ext, rule sym, rule equal_eq)
haftmann@30929
  1739
haftmann@26513
  1740
end
haftmann@26513
  1741
haftmann@38857
  1742
declare eq_equal [symmetric, code_post]
haftmann@38857
  1743
declare eq_equal [code]
haftmann@30966
  1744
wenzelm@60758
  1745
setup \<open>
wenzelm@51717
  1746
  Code_Preproc.map_pre (fn ctxt =>
wenzelm@61144
  1747
    ctxt addsimprocs
wenzelm@61144
  1748
      [Simplifier.make_simproc @{context} "equal"
wenzelm@61144
  1749
        {lhss = [@{term HOL.eq}],
wenzelm@61144
  1750
         proc = fn _ => fn _ => fn ct =>
wenzelm@61144
  1751
          (case Thm.term_of ct of
wenzelm@61144
  1752
            Const (_, Type (@{type_name fun}, [Type _, _])) => SOME @{thm eq_equal}
wenzelm@61144
  1753
          | _ => NONE),
wenzelm@61144
  1754
         identifier = []}])
wenzelm@60758
  1755
\<close>
haftmann@31151
  1756
haftmann@30966
  1757
wenzelm@60758
  1758
subsubsection \<open>Generic code generator foundation\<close>
haftmann@30929
  1759
wenzelm@60758
  1760
text \<open>Datatype @{typ bool}\<close>
haftmann@30929
  1761
haftmann@30929
  1762
code_datatype True False
haftmann@30929
  1763
haftmann@30929
  1764
lemma [code]:
haftmann@33185
  1765
  shows "False \<and> P \<longleftrightarrow> False"
haftmann@33185
  1766
    and "True \<and> P \<longleftrightarrow> P"
haftmann@33185
  1767
    and "P \<and> False \<longleftrightarrow> False"
haftmann@33185
  1768
    and "P \<and> True \<longleftrightarrow> P" by simp_all
haftmann@30929
  1769
haftmann@30929
  1770
lemma [code]:
haftmann@33185
  1771
  shows "False \<or> P \<longleftrightarrow> P"
haftmann@33185
  1772
    and "True \<or> P \<longleftrightarrow> True"
haftmann@33185
  1773
    and "P \<or> False \<longleftrightarrow> P"
haftmann@33185
  1774
    and "P \<or> True \<longleftrightarrow> True" by simp_all
haftmann@30929
  1775
haftmann@33185
  1776
lemma [code]:
haftmann@33185
  1777
  shows "(False \<longrightarrow> P) \<longleftrightarrow> True"
haftmann@33185
  1778
    and "(True \<longrightarrow> P) \<longleftrightarrow> P"
haftmann@33185
  1779
    and "(P \<longrightarrow> False) \<longleftrightarrow> \<not> P"
haftmann@33185
  1780
    and "(P \<longrightarrow> True) \<longleftrightarrow> True" by simp_all
haftmann@30929
  1781
wenzelm@60758
  1782
text \<open>More about @{typ prop}\<close>
haftmann@39421
  1783
haftmann@39421
  1784
lemma [code nbe]:
wenzelm@58826
  1785
  shows "(True \<Longrightarrow> PROP Q) \<equiv> PROP Q"
haftmann@39421
  1786
    and "(PROP Q \<Longrightarrow> True) \<equiv> Trueprop True"
haftmann@39421
  1787
    and "(P \<Longrightarrow> R) \<equiv> Trueprop (P \<longrightarrow> R)" by (auto intro!: equal_intr_rule)
haftmann@39421
  1788
haftmann@39421
  1789
lemma Trueprop_code [code]:
haftmann@39421
  1790
  "Trueprop True \<equiv> Code_Generator.holds"
haftmann@39421
  1791
  by (auto intro!: equal_intr_rule holds)
haftmann@39421
  1792
haftmann@39421
  1793
declare Trueprop_code [symmetric, code_post]
haftmann@39421
  1794
wenzelm@60758
  1795
text \<open>Equality\<close>
haftmann@39421
  1796
haftmann@39421
  1797
declare simp_thms(6) [code nbe]
haftmann@39421
  1798
haftmann@38857
  1799
instantiation itself :: (type) equal
haftmann@31132
  1800
begin
haftmann@31132
  1801
haftmann@38857
  1802
definition equal_itself :: "'a itself \<Rightarrow> 'a itself \<Rightarrow> bool" where
haftmann@38857
  1803
  "equal_itself x y \<longleftrightarrow> x = y"
haftmann@31132
  1804
haftmann@31132
  1805
instance proof
haftmann@38857
  1806
qed (fact equal_itself_def)
haftmann@31132
  1807
haftmann@31132
  1808
end
haftmann@31132
  1809
haftmann@38857
  1810
lemma equal_itself_code [code]:
haftmann@38857
  1811
  "equal TYPE('a) TYPE('a) \<longleftrightarrow> True"
haftmann@38857
  1812
  by (simp add: equal)
haftmann@31132
  1813
wenzelm@61076
  1814
setup \<open>Sign.add_const_constraint (@{const_name equal}, SOME @{typ "'a::type \<Rightarrow> 'a \<Rightarrow> bool"})\<close>
haftmann@31956
  1815
haftmann@38857
  1816
lemma equal_alias_cert: "OFCLASS('a, equal_class) \<equiv> ((op = :: 'a \<Rightarrow> 'a \<Rightarrow> bool) \<equiv> equal)" (is "?ofclass \<equiv> ?equal")
haftmann@31956
  1817
proof
haftmann@31956
  1818
  assume "PROP ?ofclass"
haftmann@38857
  1819
  show "PROP ?equal"
wenzelm@60758
  1820
    by (tactic \<open>ALLGOALS (resolve_tac @{context} [Thm.unconstrainT @{thm eq_equal}])\<close>)
wenzelm@60758
  1821
      (fact \<open>PROP ?ofclass\<close>)
haftmann@31956
  1822
next
haftmann@38857
  1823
  assume "PROP ?equal"
haftmann@31956
  1824
  show "PROP ?ofclass" proof
wenzelm@60758
  1825
  qed (simp add: \<open>PROP ?equal\<close>)
haftmann@31956
  1826
qed
haftmann@31956
  1827
wenzelm@61076
  1828
setup \<open>Sign.add_const_constraint (@{const_name equal}, SOME @{typ "'a::equal \<Rightarrow> 'a \<Rightarrow> bool"})\<close>
wenzelm@58826
  1829
wenzelm@60758
  1830
setup \<open>Nbe.add_const_alias @{thm equal_alias_cert}\<close>
haftmann@30929
  1831
wenzelm@60758
  1832
text \<open>Cases\<close>
haftmann@30929
  1833
haftmann@30929
  1834
lemma Let_case_cert:
haftmann@30929
  1835
  assumes "CASE \<equiv> (\<lambda>x. Let x f)"
haftmann@30929
  1836
  shows "CASE x \<equiv> f x"
haftmann@30929
  1837
  using assms by simp_all
haftmann@30929
  1838
wenzelm@60758
  1839
setup \<open>
wenzelm@58826
  1840
  Code.add_case @{thm Let_case_cert} #>
wenzelm@58826
  1841
  Code.add_undefined @{const_name undefined}
wenzelm@60758
  1842
\<close>
haftmann@30929
  1843
haftmann@54890
  1844
declare [[code abort: undefined]]
haftmann@30929
  1845
haftmann@38972
  1846
wenzelm@60758
  1847
subsubsection \<open>Generic code generator target languages\<close>
haftmann@30929
  1848
wenzelm@60758
  1849
text \<open>type @{typ bool}\<close>
haftmann@30929
  1850
haftmann@52435
  1851
code_printing
haftmann@52435
  1852
  type_constructor bool \<rightharpoonup>
haftmann@52435
  1853
    (SML) "bool" and (OCaml) "bool" and (Haskell) "Bool" and (Scala) "Boolean"
haftmann@52435
  1854
| constant True \<rightharpoonup>
haftmann@52435
  1855
    (SML) "true" and (OCaml) "true" and (Haskell) "True" and (Scala) "true"
haftmann@52435
  1856
| constant False \<rightharpoonup>
wenzelm@58826
  1857
    (SML) "false" and (OCaml) "false" and (Haskell) "False" and (Scala) "false"
haftmann@34294
  1858
haftmann@30929
  1859
code_reserved SML
haftmann@52435
  1860
  bool true false
haftmann@30929
  1861
haftmann@30929
  1862
code_reserved OCaml
haftmann@52435
  1863
  bool
haftmann@30929
  1864
haftmann@34294
  1865
code_reserved Scala
haftmann@34294
  1866
  Boolean
haftmann@34294
  1867
haftmann@52435
  1868
code_printing
haftmann@52435
  1869
  constant Not \<rightharpoonup>
haftmann@52435
  1870
    (SML) "not" and (OCaml) "not" and (Haskell) "not" and (Scala) "'! _"
haftmann@52435
  1871
| constant HOL.conj \<rightharpoonup>
haftmann@52435
  1872
    (SML) infixl 1 "andalso" and (OCaml) infixl 3 "&&" and (Haskell) infixr 3 "&&" and (Scala) infixl 3 "&&"
haftmann@52435
  1873
| constant HOL.disj \<rightharpoonup>
haftmann@52435
  1874
    (SML) infixl 0 "orelse" and (OCaml) infixl 2 "||" and (Haskell) infixl 2 "||" and (Scala) infixl 1 "||"
haftmann@52435
  1875
| constant HOL.implies \<rightharpoonup>
haftmann@52435
  1876
    (SML) "!(if (_)/ then (_)/ else true)"
haftmann@52435
  1877
    and (OCaml) "!(if (_)/ then (_)/ else true)"
haftmann@52435
  1878
    and (Haskell) "!(if (_)/ then (_)/ else True)"
haftmann@52435
  1879
    and (Scala) "!(if ((_))/ (_)/ else true)"
haftmann@52435
  1880
| constant If \<rightharpoonup>
haftmann@52435
  1881
    (SML) "!(if (_)/ then (_)/ else (_))"
haftmann@52435
  1882
    and (OCaml) "!(if (_)/ then (_)/ else (_))"
haftmann@52435
  1883
    and (Haskell) "!(if (_)/ then (_)/ else (_))"
haftmann@52435
  1884
    and (Scala) "!(if ((_))/ (_)/ else (_))"
haftmann@52435
  1885
haftmann@52435
  1886
code_reserved SML
haftmann@52435
  1887
  not
haftmann@52435
  1888
haftmann@52435
  1889
code_reserved OCaml
haftmann@52435
  1890
  not
haftmann@52435
  1891
haftmann@52435
  1892
code_identifier
haftmann@52435
  1893
  code_module Pure \<rightharpoonup>
haftmann@52435
  1894
    (SML) HOL and (OCaml) HOL and (Haskell) HOL and (Scala) HOL
haftmann@39026
  1895
wenzelm@60758
  1896
text \<open>using built-in Haskell equality\<close>
haftmann@30929
  1897
haftmann@52435
  1898
code_printing
haftmann@52435
  1899
  type_class equal \<rightharpoonup> (Haskell) "Eq"
haftmann@52435
  1900
| constant HOL.equal \<rightharpoonup> (Haskell) infix 4 "=="
haftmann@52435
  1901
| constant HOL.eq \<rightharpoonup> (Haskell) infix 4 "=="
haftmann@30929
  1902
wenzelm@60758
  1903
text \<open>undefined\<close>
haftmann@30929
  1904
haftmann@52435
  1905
code_printing
haftmann@52435
  1906
  constant undefined \<rightharpoonup>
haftmann@52435
  1907
    (SML) "!(raise/ Fail/ \"undefined\")"
haftmann@52435
  1908
    and (OCaml) "failwith/ \"undefined\""
haftmann@52435
  1909
    and (Haskell) "error/ \"undefined\""
haftmann@52435
  1910
    and (Scala) "!sys.error(\"undefined\")"
haftmann@52435
  1911
haftmann@30929
  1912
wenzelm@60758
  1913
subsubsection \<open>Evaluation and normalization by evaluation\<close>
haftmann@30929
  1914
wenzelm@60758
  1915
method_setup eval = \<open>
wenzelm@58826
  1916
  let
wenzelm@58826
  1917
    fun eval_tac ctxt =
wenzelm@58826
  1918
      let val conv = Code_Runtime.dynamic_holds_conv ctxt
wenzelm@58839
  1919
      in
wenzelm@58839
  1920
        CONVERSION (Conv.params_conv ~1 (K (Conv.concl_conv ~1 conv)) ctxt) THEN'
wenzelm@59498
  1921
        resolve_tac ctxt [TrueI]
wenzelm@58839
  1922
      end
wenzelm@58826
  1923
  in
wenzelm@58826
  1924
    Scan.succeed (SIMPLE_METHOD' o eval_tac)
wenzelm@58826
  1925
  end
wenzelm@60758
  1926
\<close> "solve goal by evaluation"
haftmann@30929
  1927
wenzelm@60758
  1928
method_setup normalization = \<open>
wenzelm@46190
  1929
  Scan.succeed (fn ctxt =>
wenzelm@46190
  1930
    SIMPLE_METHOD'
wenzelm@46190
  1931
      (CHANGED_PROP o
haftmann@55757
  1932
        (CONVERSION (Nbe.dynamic_conv ctxt)
wenzelm@59498
  1933
          THEN_ALL_NEW (TRY o resolve_tac ctxt [TrueI]))))
wenzelm@60758
  1934
\<close> "solve goal by normalization"
haftmann@30929
  1935
wenzelm@31902
  1936
wenzelm@60758
  1937
subsection \<open>Counterexample Search Units\<close>
haftmann@33084
  1938
wenzelm@60758
  1939
subsubsection \<open>Quickcheck\<close>
haftmann@30929
  1940
haftmann@33084
  1941
quickcheck_params [size = 5, iterations = 50]
haftmann@33084
  1942
haftmann@30929
  1943
wenzelm@60758
  1944
subsubsection \<open>Nitpick setup\<close>
blanchet@30309
  1945
wenzelm@59028
  1946
named_theorems nitpick_unfold "alternative definitions of constants as needed by Nitpick"
wenzelm@59028
  1947
  and nitpick_simp "equational specification of constants as needed by Nitpick"
wenzelm@59028
  1948
  and nitpick_psimp "partial equational specification of constants as needed by Nitpick"
wenzelm@59028
  1949
  and nitpick_choice_spec "choice specification of constants as needed by Nitpick"
wenzelm@30980
  1950
blanchet@41792
  1951
declare if_bool_eq_conj [nitpick_unfold, no_atp]
blanchet@41792
  1952
        if_bool_eq_disj [no_atp]
blanchet@41792
  1953
blanchet@29863
  1954
wenzelm@60758
  1955
subsection \<open>Preprocessing for the predicate compiler\<close>
haftmann@33084
  1956
wenzelm@59028
  1957
named_theorems code_pred_def "alternative definitions of constants for the Predicate Compiler"
wenzelm@59028
  1958
  and code_pred_inline "inlining definitions for the Predicate Compiler"
wenzelm@59028
  1959
  and code_pred_simp "simplification rules for the optimisations in the Predicate Compiler"
haftmann@33084
  1960
haftmann@33084
  1961
wenzelm@60758
  1962
subsection \<open>Legacy tactics and ML bindings\<close>
wenzelm@21671
  1963
wenzelm@60758
  1964
ML \<open>
wenzelm@58826
  1965
  (* combination of (spec RS spec RS ...(j times) ... spec RS mp) *)
wenzelm@58826
  1966
  local
wenzelm@58826
  1967
    fun wrong_prem (Const (@{const_name All}, _) $ Abs (_, _, t)) = wrong_prem t
wenzelm@58826
  1968
      | wrong_prem (Bound _) = true
wenzelm@58826
  1969
      | wrong_prem _ = false;
wenzelm@58826
  1970
    val filter_right = filter (not o wrong_prem o HOLogic.dest_Trueprop o hd o Thm.prems_of);
haftmann@61914
  1971
    fun smp i = funpow i (fn m => filter_right ([spec] RL m)) [mp];
wenzelm@58826
  1972
  in
wenzelm@59498
  1973
    fun smp_tac ctxt j = EVERY' [dresolve_tac ctxt (smp j), assume_tac ctxt];
wenzelm@58826
  1974
  end;
haftmann@22839
  1975
wenzelm@58826
  1976
  local
wenzelm@58826
  1977
    val nnf_ss =
wenzelm@58826
  1978
      simpset_of (put_simpset HOL_basic_ss @{context} addsimps @{thms simp_thms nnf_simps});
wenzelm@58826
  1979
  in
wenzelm@58826
  1980
    fun nnf_conv ctxt = Simplifier.rewrite (put_simpset nnf_ss ctxt);
wenzelm@58826
  1981
  end
wenzelm@60758
  1982
\<close>
wenzelm@21671
  1983
haftmann@38866
  1984
hide_const (open) eq equal
haftmann@38866
  1985
kleing@14357
  1986
end