src/HOL/HOL.thy
author haftmann
Mon Sep 29 12:31:57 2008 +0200 (2008-09-29)
changeset 28400 89904cfd41c3
parent 28346 b8390cd56b8f
child 28513 b0b30fd6c264
permissions -rw-r--r--
polished code generator setup
clasohm@923
     1
(*  Title:      HOL/HOL.thy
clasohm@923
     2
    ID:         $Id$
wenzelm@11750
     3
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
wenzelm@11750
     4
*)
clasohm@923
     5
wenzelm@11750
     6
header {* The basis of Higher-Order Logic *}
clasohm@923
     7
nipkow@15131
     8
theory HOL
wenzelm@26957
     9
imports Pure
wenzelm@23163
    10
uses
wenzelm@23553
    11
  ("hologic.ML")
wenzelm@23171
    12
  "~~/src/Tools/IsaPlanner/zipper.ML"
wenzelm@23171
    13
  "~~/src/Tools/IsaPlanner/isand.ML"
wenzelm@23171
    14
  "~~/src/Tools/IsaPlanner/rw_tools.ML"
wenzelm@23171
    15
  "~~/src/Tools/IsaPlanner/rw_inst.ML"
haftmann@23263
    16
  "~~/src/Provers/project_rule.ML"
haftmann@23263
    17
  "~~/src/Provers/hypsubst.ML"
haftmann@23263
    18
  "~~/src/Provers/splitter.ML"
wenzelm@23163
    19
  "~~/src/Provers/classical.ML"
wenzelm@23163
    20
  "~~/src/Provers/blast.ML"
wenzelm@23163
    21
  "~~/src/Provers/clasimp.ML"
berghofe@28325
    22
  "~~/src/Provers/coherent.ML"
haftmann@23263
    23
  "~~/src/Provers/eqsubst.ML"
wenzelm@23163
    24
  "~~/src/Provers/quantifier1.ML"
wenzelm@23163
    25
  ("simpdata.ML")
wenzelm@25741
    26
  "~~/src/Tools/random_word.ML"
krauss@26580
    27
  "~~/src/Tools/atomize_elim.ML"
haftmann@24901
    28
  "~~/src/Tools/induct.ML"
wenzelm@27326
    29
  ("~~/src/Tools/induct_tacs.ML")
haftmann@24280
    30
  "~~/src/Tools/code/code_name.ML"
haftmann@24280
    31
  "~~/src/Tools/code/code_funcgr.ML"
haftmann@24280
    32
  "~~/src/Tools/code/code_thingol.ML"
haftmann@28054
    33
  "~~/src/Tools/code/code_printer.ML"
haftmann@24280
    34
  "~~/src/Tools/code/code_target.ML"
haftmann@28054
    35
  "~~/src/Tools/code/code_ml.ML"
haftmann@28054
    36
  "~~/src/Tools/code/code_haskell.ML"
haftmann@24166
    37
  "~~/src/Tools/nbe.ML"
haftmann@28400
    38
  ("~~/src/HOL/Tools/recfun_codegen.ML")
nipkow@15131
    39
begin
wenzelm@2260
    40
wenzelm@11750
    41
subsection {* Primitive logic *}
wenzelm@11750
    42
wenzelm@11750
    43
subsubsection {* Core syntax *}
wenzelm@2260
    44
wenzelm@14854
    45
classes type
wenzelm@12338
    46
defaultsort type
wenzelm@25494
    47
setup {* ObjectLogic.add_base_sort @{sort type} *}
haftmann@25460
    48
haftmann@25460
    49
arities
haftmann@25460
    50
  "fun" :: (type, type) type
haftmann@25460
    51
  itself :: (type) type
haftmann@25460
    52
wenzelm@12338
    53
global
clasohm@923
    54
wenzelm@7357
    55
typedecl bool
clasohm@923
    56
wenzelm@11750
    57
judgment
wenzelm@11750
    58
  Trueprop      :: "bool => prop"                   ("(_)" 5)
clasohm@923
    59
wenzelm@11750
    60
consts
wenzelm@7357
    61
  Not           :: "bool => bool"                   ("~ _" [40] 40)
wenzelm@7357
    62
  True          :: bool
wenzelm@7357
    63
  False         :: bool
wenzelm@3947
    64
  arbitrary     :: 'a
clasohm@923
    65
wenzelm@11432
    66
  The           :: "('a => bool) => 'a"
wenzelm@7357
    67
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
wenzelm@7357
    68
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
wenzelm@7357
    69
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
wenzelm@7357
    70
  Let           :: "['a, 'a => 'b] => 'b"
clasohm@923
    71
haftmann@22839
    72
  "op ="        :: "['a, 'a] => bool"               (infixl "=" 50)
haftmann@22839
    73
  "op &"        :: "[bool, bool] => bool"           (infixr "&" 35)
haftmann@22839
    74
  "op |"        :: "[bool, bool] => bool"           (infixr "|" 30)
haftmann@22839
    75
  "op -->"      :: "[bool, bool] => bool"           (infixr "-->" 25)
clasohm@923
    76
wenzelm@10432
    77
local
wenzelm@10432
    78
paulson@16587
    79
consts
paulson@16587
    80
  If            :: "[bool, 'a, 'a] => 'a"           ("(if (_)/ then (_)/ else (_))" 10)
wenzelm@2260
    81
wenzelm@19656
    82
wenzelm@11750
    83
subsubsection {* Additional concrete syntax *}
wenzelm@2260
    84
wenzelm@21210
    85
notation (output)
wenzelm@19656
    86
  "op ="  (infix "=" 50)
wenzelm@19656
    87
wenzelm@19656
    88
abbreviation
wenzelm@21404
    89
  not_equal :: "['a, 'a] => bool"  (infixl "~=" 50) where
wenzelm@19656
    90
  "x ~= y == ~ (x = y)"
wenzelm@19656
    91
wenzelm@21210
    92
notation (output)
wenzelm@19656
    93
  not_equal  (infix "~=" 50)
wenzelm@19656
    94
wenzelm@21210
    95
notation (xsymbols)
wenzelm@21404
    96
  Not  ("\<not> _" [40] 40) and
wenzelm@21404
    97
  "op &"  (infixr "\<and>" 35) and
wenzelm@21404
    98
  "op |"  (infixr "\<or>" 30) and
wenzelm@21404
    99
  "op -->"  (infixr "\<longrightarrow>" 25) and
wenzelm@19656
   100
  not_equal  (infix "\<noteq>" 50)
wenzelm@19656
   101
wenzelm@21210
   102
notation (HTML output)
wenzelm@21404
   103
  Not  ("\<not> _" [40] 40) and
wenzelm@21404
   104
  "op &"  (infixr "\<and>" 35) and
wenzelm@21404
   105
  "op |"  (infixr "\<or>" 30) and
wenzelm@19656
   106
  not_equal  (infix "\<noteq>" 50)
wenzelm@19656
   107
wenzelm@19656
   108
abbreviation (iff)
wenzelm@21404
   109
  iff :: "[bool, bool] => bool"  (infixr "<->" 25) where
wenzelm@19656
   110
  "A <-> B == A = B"
wenzelm@19656
   111
wenzelm@21210
   112
notation (xsymbols)
wenzelm@19656
   113
  iff  (infixr "\<longleftrightarrow>" 25)
wenzelm@19656
   114
wenzelm@19656
   115
wenzelm@4868
   116
nonterminals
clasohm@923
   117
  letbinds  letbind
clasohm@923
   118
  case_syn  cases_syn
clasohm@923
   119
clasohm@923
   120
syntax
wenzelm@11432
   121
  "_The"        :: "[pttrn, bool] => 'a"                 ("(3THE _./ _)" [0, 10] 10)
clasohm@923
   122
wenzelm@7357
   123
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
wenzelm@7357
   124
  ""            :: "letbind => letbinds"                 ("_")
wenzelm@7357
   125
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
wenzelm@7357
   126
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" 10)
clasohm@923
   127
wenzelm@9060
   128
  "_case_syntax":: "['a, cases_syn] => 'b"               ("(case _ of/ _)" 10)
wenzelm@9060
   129
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
wenzelm@7357
   130
  ""            :: "case_syn => cases_syn"               ("_")
wenzelm@9060
   131
  "_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
clasohm@923
   132
clasohm@923
   133
translations
nipkow@13764
   134
  "THE x. P"              == "The (%x. P)"
clasohm@923
   135
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
nipkow@1114
   136
  "let x = a in e"        == "Let a (%x. e)"
clasohm@923
   137
nipkow@13763
   138
print_translation {*
nipkow@13763
   139
(* To avoid eta-contraction of body: *)
nipkow@13763
   140
[("The", fn [Abs abs] =>
nipkow@13763
   141
     let val (x,t) = atomic_abs_tr' abs
nipkow@13763
   142
     in Syntax.const "_The" $ x $ t end)]
nipkow@13763
   143
*}
nipkow@13763
   144
wenzelm@12114
   145
syntax (xsymbols)
wenzelm@11687
   146
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ \<Rightarrow>/ _)" 10)
wenzelm@21524
   147
wenzelm@21524
   148
notation (xsymbols)
wenzelm@21524
   149
  All  (binder "\<forall>" 10) and
wenzelm@21524
   150
  Ex  (binder "\<exists>" 10) and
wenzelm@21524
   151
  Ex1  (binder "\<exists>!" 10)
wenzelm@2372
   152
wenzelm@21524
   153
notation (HTML output)
wenzelm@21524
   154
  All  (binder "\<forall>" 10) and
wenzelm@21524
   155
  Ex  (binder "\<exists>" 10) and
wenzelm@21524
   156
  Ex1  (binder "\<exists>!" 10)
wenzelm@6340
   157
wenzelm@21524
   158
notation (HOL)
wenzelm@21524
   159
  All  (binder "! " 10) and
wenzelm@21524
   160
  Ex  (binder "? " 10) and
wenzelm@21524
   161
  Ex1  (binder "?! " 10)
wenzelm@7238
   162
wenzelm@7238
   163
wenzelm@11750
   164
subsubsection {* Axioms and basic definitions *}
wenzelm@2260
   165
wenzelm@7357
   166
axioms
paulson@15380
   167
  eq_reflection:  "(x=y) ==> (x==y)"
clasohm@923
   168
paulson@15380
   169
  refl:           "t = (t::'a)"
paulson@6289
   170
paulson@15380
   171
  ext:            "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
paulson@15380
   172
    -- {*Extensionality is built into the meta-logic, and this rule expresses
paulson@15380
   173
         a related property.  It is an eta-expanded version of the traditional
paulson@15380
   174
         rule, and similar to the ABS rule of HOL*}
paulson@6289
   175
wenzelm@11432
   176
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
clasohm@923
   177
paulson@15380
   178
  impI:           "(P ==> Q) ==> P-->Q"
paulson@15380
   179
  mp:             "[| P-->Q;  P |] ==> Q"
paulson@15380
   180
paulson@15380
   181
clasohm@923
   182
defs
wenzelm@7357
   183
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
wenzelm@7357
   184
  All_def:      "All(P)    == (P = (%x. True))"
paulson@11451
   185
  Ex_def:       "Ex(P)     == !Q. (!x. P x --> Q) --> Q"
wenzelm@7357
   186
  False_def:    "False     == (!P. P)"
wenzelm@7357
   187
  not_def:      "~ P       == P-->False"
wenzelm@7357
   188
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
wenzelm@7357
   189
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
wenzelm@7357
   190
  Ex1_def:      "Ex1(P)    == ? x. P(x) & (! y. P(y) --> y=x)"
clasohm@923
   191
wenzelm@7357
   192
axioms
wenzelm@7357
   193
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
wenzelm@7357
   194
  True_or_False:  "(P=True) | (P=False)"
clasohm@923
   195
clasohm@923
   196
defs
haftmann@24219
   197
  Let_def:      "Let s f == f(s)"
paulson@11451
   198
  if_def:       "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)"
wenzelm@5069
   199
skalberg@14223
   200
finalconsts
skalberg@14223
   201
  "op ="
skalberg@14223
   202
  "op -->"
skalberg@14223
   203
  The
skalberg@14223
   204
  arbitrary
haftmann@22481
   205
haftmann@22481
   206
axiomatization
haftmann@22481
   207
  undefined :: 'a
haftmann@22481
   208
haftmann@22744
   209
axiomatization where
haftmann@22481
   210
  undefined_fun: "undefined x = undefined"
nipkow@3320
   211
wenzelm@19656
   212
haftmann@22481
   213
subsubsection {* Generic classes and algebraic operations *}
haftmann@22481
   214
haftmann@22481
   215
class default = type +
haftmann@24901
   216
  fixes default :: 'a
wenzelm@4868
   217
haftmann@22473
   218
class zero = type + 
haftmann@25062
   219
  fixes zero :: 'a  ("0")
haftmann@20713
   220
haftmann@22473
   221
class one = type +
haftmann@25062
   222
  fixes one  :: 'a  ("1")
haftmann@20713
   223
haftmann@20713
   224
hide (open) const zero one
haftmann@20590
   225
haftmann@22473
   226
class plus = type +
haftmann@25062
   227
  fixes plus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"  (infixl "+" 65)
wenzelm@11750
   228
haftmann@22473
   229
class minus = type +
haftmann@25762
   230
  fixes minus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"  (infixl "-" 65)
haftmann@25762
   231
haftmann@25762
   232
class uminus = type +
haftmann@25062
   233
  fixes uminus :: "'a \<Rightarrow> 'a"  ("- _" [81] 80)
haftmann@20590
   234
haftmann@22473
   235
class times = type +
haftmann@25062
   236
  fixes times :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"  (infixl "*" 70)
haftmann@20590
   237
haftmann@22473
   238
class inverse = type +
haftmann@20590
   239
  fixes inverse :: "'a \<Rightarrow> 'a"
haftmann@25062
   240
    and divide :: "'a \<Rightarrow> 'a \<Rightarrow> 'a"  (infixl "'/" 70)
wenzelm@21524
   241
haftmann@23878
   242
class abs = type +
haftmann@23878
   243
  fixes abs :: "'a \<Rightarrow> 'a"
wenzelm@25388
   244
begin
haftmann@23878
   245
wenzelm@21524
   246
notation (xsymbols)
wenzelm@21524
   247
  abs  ("\<bar>_\<bar>")
wenzelm@25388
   248
wenzelm@21524
   249
notation (HTML output)
wenzelm@21524
   250
  abs  ("\<bar>_\<bar>")
wenzelm@11750
   251
wenzelm@25388
   252
end
wenzelm@25388
   253
haftmann@25062
   254
class sgn = type +
haftmann@25062
   255
  fixes sgn :: "'a \<Rightarrow> 'a"
haftmann@25062
   256
haftmann@23878
   257
class ord = type +
haftmann@24748
   258
  fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@24748
   259
    and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@23878
   260
begin
haftmann@23878
   261
haftmann@23878
   262
notation
haftmann@23878
   263
  less_eq  ("op <=") and
haftmann@23878
   264
  less_eq  ("(_/ <= _)" [51, 51] 50) and
haftmann@23878
   265
  less  ("op <") and
haftmann@23878
   266
  less  ("(_/ < _)"  [51, 51] 50)
haftmann@23878
   267
  
haftmann@23878
   268
notation (xsymbols)
haftmann@23878
   269
  less_eq  ("op \<le>") and
haftmann@23878
   270
  less_eq  ("(_/ \<le> _)"  [51, 51] 50)
haftmann@23878
   271
haftmann@23878
   272
notation (HTML output)
haftmann@23878
   273
  less_eq  ("op \<le>") and
haftmann@23878
   274
  less_eq  ("(_/ \<le> _)"  [51, 51] 50)
haftmann@23878
   275
wenzelm@25388
   276
abbreviation (input)
wenzelm@25388
   277
  greater_eq  (infix ">=" 50) where
wenzelm@25388
   278
  "x >= y \<equiv> y <= x"
wenzelm@25388
   279
haftmann@24842
   280
notation (input)
haftmann@23878
   281
  greater_eq  (infix "\<ge>" 50)
haftmann@23878
   282
wenzelm@25388
   283
abbreviation (input)
wenzelm@25388
   284
  greater  (infix ">" 50) where
wenzelm@25388
   285
  "x > y \<equiv> y < x"
wenzelm@25388
   286
wenzelm@25388
   287
end
wenzelm@25388
   288
wenzelm@13456
   289
syntax
wenzelm@13456
   290
  "_index1"  :: index    ("\<^sub>1")
wenzelm@13456
   291
translations
wenzelm@14690
   292
  (index) "\<^sub>1" => (index) "\<^bsub>\<struct>\<^esub>"
wenzelm@13456
   293
wenzelm@11750
   294
typed_print_translation {*
haftmann@20713
   295
let
haftmann@20713
   296
  fun tr' c = (c, fn show_sorts => fn T => fn ts =>
haftmann@20713
   297
    if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match
haftmann@20713
   298
    else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T);
haftmann@22993
   299
in map tr' [@{const_syntax HOL.one}, @{const_syntax HOL.zero}] end;
wenzelm@11750
   300
*} -- {* show types that are presumably too general *}
wenzelm@11750
   301
wenzelm@11750
   302
haftmann@20944
   303
subsection {* Fundamental rules *}
haftmann@20944
   304
haftmann@20973
   305
subsubsection {* Equality *}
haftmann@20944
   306
haftmann@20944
   307
text {* Thanks to Stephan Merz *}
haftmann@20944
   308
lemma subst:
haftmann@20944
   309
  assumes eq: "s = t" and p: "P s"
haftmann@20944
   310
  shows "P t"
haftmann@20944
   311
proof -
haftmann@20944
   312
  from eq have meta: "s \<equiv> t"
haftmann@20944
   313
    by (rule eq_reflection)
haftmann@20944
   314
  from p show ?thesis
haftmann@20944
   315
    by (unfold meta)
haftmann@20944
   316
qed
paulson@15411
   317
wenzelm@18457
   318
lemma sym: "s = t ==> t = s"
wenzelm@18457
   319
  by (erule subst) (rule refl)
paulson@15411
   320
wenzelm@18457
   321
lemma ssubst: "t = s ==> P s ==> P t"
wenzelm@18457
   322
  by (drule sym) (erule subst)
paulson@15411
   323
paulson@15411
   324
lemma trans: "[| r=s; s=t |] ==> r=t"
wenzelm@18457
   325
  by (erule subst)
paulson@15411
   326
haftmann@20944
   327
lemma meta_eq_to_obj_eq: 
haftmann@20944
   328
  assumes meq: "A == B"
haftmann@20944
   329
  shows "A = B"
haftmann@20944
   330
  by (unfold meq) (rule refl)
paulson@15411
   331
wenzelm@21502
   332
text {* Useful with @{text erule} for proving equalities from known equalities. *}
haftmann@20944
   333
     (* a = b
paulson@15411
   334
        |   |
paulson@15411
   335
        c = d   *)
paulson@15411
   336
lemma box_equals: "[| a=b;  a=c;  b=d |] ==> c=d"
paulson@15411
   337
apply (rule trans)
paulson@15411
   338
apply (rule trans)
paulson@15411
   339
apply (rule sym)
paulson@15411
   340
apply assumption+
paulson@15411
   341
done
paulson@15411
   342
nipkow@15524
   343
text {* For calculational reasoning: *}
nipkow@15524
   344
nipkow@15524
   345
lemma forw_subst: "a = b ==> P b ==> P a"
nipkow@15524
   346
  by (rule ssubst)
nipkow@15524
   347
nipkow@15524
   348
lemma back_subst: "P a ==> a = b ==> P b"
nipkow@15524
   349
  by (rule subst)
nipkow@15524
   350
paulson@15411
   351
haftmann@20944
   352
subsubsection {*Congruence rules for application*}
paulson@15411
   353
paulson@15411
   354
(*similar to AP_THM in Gordon's HOL*)
paulson@15411
   355
lemma fun_cong: "(f::'a=>'b) = g ==> f(x)=g(x)"
paulson@15411
   356
apply (erule subst)
paulson@15411
   357
apply (rule refl)
paulson@15411
   358
done
paulson@15411
   359
paulson@15411
   360
(*similar to AP_TERM in Gordon's HOL and FOL's subst_context*)
paulson@15411
   361
lemma arg_cong: "x=y ==> f(x)=f(y)"
paulson@15411
   362
apply (erule subst)
paulson@15411
   363
apply (rule refl)
paulson@15411
   364
done
paulson@15411
   365
paulson@15655
   366
lemma arg_cong2: "\<lbrakk> a = b; c = d \<rbrakk> \<Longrightarrow> f a c = f b d"
paulson@15655
   367
apply (erule ssubst)+
paulson@15655
   368
apply (rule refl)
paulson@15655
   369
done
paulson@15655
   370
paulson@15411
   371
lemma cong: "[| f = g; (x::'a) = y |] ==> f(x) = g(y)"
paulson@15411
   372
apply (erule subst)+
paulson@15411
   373
apply (rule refl)
paulson@15411
   374
done
paulson@15411
   375
paulson@15411
   376
haftmann@20944
   377
subsubsection {*Equality of booleans -- iff*}
paulson@15411
   378
wenzelm@21504
   379
lemma iffI: assumes "P ==> Q" and "Q ==> P" shows "P=Q"
wenzelm@21504
   380
  by (iprover intro: iff [THEN mp, THEN mp] impI assms)
paulson@15411
   381
paulson@15411
   382
lemma iffD2: "[| P=Q; Q |] ==> P"
wenzelm@18457
   383
  by (erule ssubst)
paulson@15411
   384
paulson@15411
   385
lemma rev_iffD2: "[| Q; P=Q |] ==> P"
wenzelm@18457
   386
  by (erule iffD2)
paulson@15411
   387
wenzelm@21504
   388
lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P"
wenzelm@21504
   389
  by (drule sym) (rule iffD2)
wenzelm@21504
   390
wenzelm@21504
   391
lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P"
wenzelm@21504
   392
  by (drule sym) (rule rev_iffD2)
paulson@15411
   393
paulson@15411
   394
lemma iffE:
paulson@15411
   395
  assumes major: "P=Q"
wenzelm@21504
   396
    and minor: "[| P --> Q; Q --> P |] ==> R"
wenzelm@18457
   397
  shows R
wenzelm@18457
   398
  by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
paulson@15411
   399
paulson@15411
   400
haftmann@20944
   401
subsubsection {*True*}
paulson@15411
   402
paulson@15411
   403
lemma TrueI: "True"
wenzelm@21504
   404
  unfolding True_def by (rule refl)
paulson@15411
   405
wenzelm@21504
   406
lemma eqTrueI: "P ==> P = True"
wenzelm@18457
   407
  by (iprover intro: iffI TrueI)
paulson@15411
   408
wenzelm@21504
   409
lemma eqTrueE: "P = True ==> P"
wenzelm@21504
   410
  by (erule iffD2) (rule TrueI)
paulson@15411
   411
paulson@15411
   412
haftmann@20944
   413
subsubsection {*Universal quantifier*}
paulson@15411
   414
wenzelm@21504
   415
lemma allI: assumes "!!x::'a. P(x)" shows "ALL x. P(x)"
wenzelm@21504
   416
  unfolding All_def by (iprover intro: ext eqTrueI assms)
paulson@15411
   417
paulson@15411
   418
lemma spec: "ALL x::'a. P(x) ==> P(x)"
paulson@15411
   419
apply (unfold All_def)
paulson@15411
   420
apply (rule eqTrueE)
paulson@15411
   421
apply (erule fun_cong)
paulson@15411
   422
done
paulson@15411
   423
paulson@15411
   424
lemma allE:
paulson@15411
   425
  assumes major: "ALL x. P(x)"
wenzelm@21504
   426
    and minor: "P(x) ==> R"
wenzelm@21504
   427
  shows R
wenzelm@21504
   428
  by (iprover intro: minor major [THEN spec])
paulson@15411
   429
paulson@15411
   430
lemma all_dupE:
paulson@15411
   431
  assumes major: "ALL x. P(x)"
wenzelm@21504
   432
    and minor: "[| P(x); ALL x. P(x) |] ==> R"
wenzelm@21504
   433
  shows R
wenzelm@21504
   434
  by (iprover intro: minor major major [THEN spec])
paulson@15411
   435
paulson@15411
   436
wenzelm@21504
   437
subsubsection {* False *}
wenzelm@21504
   438
wenzelm@21504
   439
text {*
wenzelm@21504
   440
  Depends upon @{text spec}; it is impossible to do propositional
wenzelm@21504
   441
  logic before quantifiers!
wenzelm@21504
   442
*}
paulson@15411
   443
paulson@15411
   444
lemma FalseE: "False ==> P"
wenzelm@21504
   445
  apply (unfold False_def)
wenzelm@21504
   446
  apply (erule spec)
wenzelm@21504
   447
  done
paulson@15411
   448
wenzelm@21504
   449
lemma False_neq_True: "False = True ==> P"
wenzelm@21504
   450
  by (erule eqTrueE [THEN FalseE])
paulson@15411
   451
paulson@15411
   452
wenzelm@21504
   453
subsubsection {* Negation *}
paulson@15411
   454
paulson@15411
   455
lemma notI:
wenzelm@21504
   456
  assumes "P ==> False"
paulson@15411
   457
  shows "~P"
wenzelm@21504
   458
  apply (unfold not_def)
wenzelm@21504
   459
  apply (iprover intro: impI assms)
wenzelm@21504
   460
  done
paulson@15411
   461
paulson@15411
   462
lemma False_not_True: "False ~= True"
wenzelm@21504
   463
  apply (rule notI)
wenzelm@21504
   464
  apply (erule False_neq_True)
wenzelm@21504
   465
  done
paulson@15411
   466
paulson@15411
   467
lemma True_not_False: "True ~= False"
wenzelm@21504
   468
  apply (rule notI)
wenzelm@21504
   469
  apply (drule sym)
wenzelm@21504
   470
  apply (erule False_neq_True)
wenzelm@21504
   471
  done
paulson@15411
   472
paulson@15411
   473
lemma notE: "[| ~P;  P |] ==> R"
wenzelm@21504
   474
  apply (unfold not_def)
wenzelm@21504
   475
  apply (erule mp [THEN FalseE])
wenzelm@21504
   476
  apply assumption
wenzelm@21504
   477
  done
paulson@15411
   478
wenzelm@21504
   479
lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P"
wenzelm@21504
   480
  by (erule notE [THEN notI]) (erule meta_mp)
paulson@15411
   481
paulson@15411
   482
haftmann@20944
   483
subsubsection {*Implication*}
paulson@15411
   484
paulson@15411
   485
lemma impE:
paulson@15411
   486
  assumes "P-->Q" "P" "Q ==> R"
paulson@15411
   487
  shows "R"
wenzelm@23553
   488
by (iprover intro: assms mp)
paulson@15411
   489
paulson@15411
   490
(* Reduces Q to P-->Q, allowing substitution in P. *)
paulson@15411
   491
lemma rev_mp: "[| P;  P --> Q |] ==> Q"
nipkow@17589
   492
by (iprover intro: mp)
paulson@15411
   493
paulson@15411
   494
lemma contrapos_nn:
paulson@15411
   495
  assumes major: "~Q"
paulson@15411
   496
      and minor: "P==>Q"
paulson@15411
   497
  shows "~P"
nipkow@17589
   498
by (iprover intro: notI minor major [THEN notE])
paulson@15411
   499
paulson@15411
   500
(*not used at all, but we already have the other 3 combinations *)
paulson@15411
   501
lemma contrapos_pn:
paulson@15411
   502
  assumes major: "Q"
paulson@15411
   503
      and minor: "P ==> ~Q"
paulson@15411
   504
  shows "~P"
nipkow@17589
   505
by (iprover intro: notI minor major notE)
paulson@15411
   506
paulson@15411
   507
lemma not_sym: "t ~= s ==> s ~= t"
haftmann@21250
   508
  by (erule contrapos_nn) (erule sym)
haftmann@21250
   509
haftmann@21250
   510
lemma eq_neq_eq_imp_neq: "[| x = a ; a ~= b; b = y |] ==> x ~= y"
haftmann@21250
   511
  by (erule subst, erule ssubst, assumption)
paulson@15411
   512
paulson@15411
   513
(*still used in HOLCF*)
paulson@15411
   514
lemma rev_contrapos:
paulson@15411
   515
  assumes pq: "P ==> Q"
paulson@15411
   516
      and nq: "~Q"
paulson@15411
   517
  shows "~P"
paulson@15411
   518
apply (rule nq [THEN contrapos_nn])
paulson@15411
   519
apply (erule pq)
paulson@15411
   520
done
paulson@15411
   521
haftmann@20944
   522
subsubsection {*Existential quantifier*}
paulson@15411
   523
paulson@15411
   524
lemma exI: "P x ==> EX x::'a. P x"
paulson@15411
   525
apply (unfold Ex_def)
nipkow@17589
   526
apply (iprover intro: allI allE impI mp)
paulson@15411
   527
done
paulson@15411
   528
paulson@15411
   529
lemma exE:
paulson@15411
   530
  assumes major: "EX x::'a. P(x)"
paulson@15411
   531
      and minor: "!!x. P(x) ==> Q"
paulson@15411
   532
  shows "Q"
paulson@15411
   533
apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
nipkow@17589
   534
apply (iprover intro: impI [THEN allI] minor)
paulson@15411
   535
done
paulson@15411
   536
paulson@15411
   537
haftmann@20944
   538
subsubsection {*Conjunction*}
paulson@15411
   539
paulson@15411
   540
lemma conjI: "[| P; Q |] ==> P&Q"
paulson@15411
   541
apply (unfold and_def)
nipkow@17589
   542
apply (iprover intro: impI [THEN allI] mp)
paulson@15411
   543
done
paulson@15411
   544
paulson@15411
   545
lemma conjunct1: "[| P & Q |] ==> P"
paulson@15411
   546
apply (unfold and_def)
nipkow@17589
   547
apply (iprover intro: impI dest: spec mp)
paulson@15411
   548
done
paulson@15411
   549
paulson@15411
   550
lemma conjunct2: "[| P & Q |] ==> Q"
paulson@15411
   551
apply (unfold and_def)
nipkow@17589
   552
apply (iprover intro: impI dest: spec mp)
paulson@15411
   553
done
paulson@15411
   554
paulson@15411
   555
lemma conjE:
paulson@15411
   556
  assumes major: "P&Q"
paulson@15411
   557
      and minor: "[| P; Q |] ==> R"
paulson@15411
   558
  shows "R"
paulson@15411
   559
apply (rule minor)
paulson@15411
   560
apply (rule major [THEN conjunct1])
paulson@15411
   561
apply (rule major [THEN conjunct2])
paulson@15411
   562
done
paulson@15411
   563
paulson@15411
   564
lemma context_conjI:
wenzelm@23553
   565
  assumes "P" "P ==> Q" shows "P & Q"
wenzelm@23553
   566
by (iprover intro: conjI assms)
paulson@15411
   567
paulson@15411
   568
haftmann@20944
   569
subsubsection {*Disjunction*}
paulson@15411
   570
paulson@15411
   571
lemma disjI1: "P ==> P|Q"
paulson@15411
   572
apply (unfold or_def)
nipkow@17589
   573
apply (iprover intro: allI impI mp)
paulson@15411
   574
done
paulson@15411
   575
paulson@15411
   576
lemma disjI2: "Q ==> P|Q"
paulson@15411
   577
apply (unfold or_def)
nipkow@17589
   578
apply (iprover intro: allI impI mp)
paulson@15411
   579
done
paulson@15411
   580
paulson@15411
   581
lemma disjE:
paulson@15411
   582
  assumes major: "P|Q"
paulson@15411
   583
      and minorP: "P ==> R"
paulson@15411
   584
      and minorQ: "Q ==> R"
paulson@15411
   585
  shows "R"
nipkow@17589
   586
by (iprover intro: minorP minorQ impI
paulson@15411
   587
                 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
paulson@15411
   588
paulson@15411
   589
haftmann@20944
   590
subsubsection {*Classical logic*}
paulson@15411
   591
paulson@15411
   592
lemma classical:
paulson@15411
   593
  assumes prem: "~P ==> P"
paulson@15411
   594
  shows "P"
paulson@15411
   595
apply (rule True_or_False [THEN disjE, THEN eqTrueE])
paulson@15411
   596
apply assumption
paulson@15411
   597
apply (rule notI [THEN prem, THEN eqTrueI])
paulson@15411
   598
apply (erule subst)
paulson@15411
   599
apply assumption
paulson@15411
   600
done
paulson@15411
   601
paulson@15411
   602
lemmas ccontr = FalseE [THEN classical, standard]
paulson@15411
   603
paulson@15411
   604
(*notE with premises exchanged; it discharges ~R so that it can be used to
paulson@15411
   605
  make elimination rules*)
paulson@15411
   606
lemma rev_notE:
paulson@15411
   607
  assumes premp: "P"
paulson@15411
   608
      and premnot: "~R ==> ~P"
paulson@15411
   609
  shows "R"
paulson@15411
   610
apply (rule ccontr)
paulson@15411
   611
apply (erule notE [OF premnot premp])
paulson@15411
   612
done
paulson@15411
   613
paulson@15411
   614
(*Double negation law*)
paulson@15411
   615
lemma notnotD: "~~P ==> P"
paulson@15411
   616
apply (rule classical)
paulson@15411
   617
apply (erule notE)
paulson@15411
   618
apply assumption
paulson@15411
   619
done
paulson@15411
   620
paulson@15411
   621
lemma contrapos_pp:
paulson@15411
   622
  assumes p1: "Q"
paulson@15411
   623
      and p2: "~P ==> ~Q"
paulson@15411
   624
  shows "P"
nipkow@17589
   625
by (iprover intro: classical p1 p2 notE)
paulson@15411
   626
paulson@15411
   627
haftmann@20944
   628
subsubsection {*Unique existence*}
paulson@15411
   629
paulson@15411
   630
lemma ex1I:
wenzelm@23553
   631
  assumes "P a" "!!x. P(x) ==> x=a"
paulson@15411
   632
  shows "EX! x. P(x)"
wenzelm@23553
   633
by (unfold Ex1_def, iprover intro: assms exI conjI allI impI)
paulson@15411
   634
paulson@15411
   635
text{*Sometimes easier to use: the premises have no shared variables.  Safe!*}
paulson@15411
   636
lemma ex_ex1I:
paulson@15411
   637
  assumes ex_prem: "EX x. P(x)"
paulson@15411
   638
      and eq: "!!x y. [| P(x); P(y) |] ==> x=y"
paulson@15411
   639
  shows "EX! x. P(x)"
nipkow@17589
   640
by (iprover intro: ex_prem [THEN exE] ex1I eq)
paulson@15411
   641
paulson@15411
   642
lemma ex1E:
paulson@15411
   643
  assumes major: "EX! x. P(x)"
paulson@15411
   644
      and minor: "!!x. [| P(x);  ALL y. P(y) --> y=x |] ==> R"
paulson@15411
   645
  shows "R"
paulson@15411
   646
apply (rule major [unfolded Ex1_def, THEN exE])
paulson@15411
   647
apply (erule conjE)
nipkow@17589
   648
apply (iprover intro: minor)
paulson@15411
   649
done
paulson@15411
   650
paulson@15411
   651
lemma ex1_implies_ex: "EX! x. P x ==> EX x. P x"
paulson@15411
   652
apply (erule ex1E)
paulson@15411
   653
apply (rule exI)
paulson@15411
   654
apply assumption
paulson@15411
   655
done
paulson@15411
   656
paulson@15411
   657
haftmann@20944
   658
subsubsection {*THE: definite description operator*}
paulson@15411
   659
paulson@15411
   660
lemma the_equality:
paulson@15411
   661
  assumes prema: "P a"
paulson@15411
   662
      and premx: "!!x. P x ==> x=a"
paulson@15411
   663
  shows "(THE x. P x) = a"
paulson@15411
   664
apply (rule trans [OF _ the_eq_trivial])
paulson@15411
   665
apply (rule_tac f = "The" in arg_cong)
paulson@15411
   666
apply (rule ext)
paulson@15411
   667
apply (rule iffI)
paulson@15411
   668
 apply (erule premx)
paulson@15411
   669
apply (erule ssubst, rule prema)
paulson@15411
   670
done
paulson@15411
   671
paulson@15411
   672
lemma theI:
paulson@15411
   673
  assumes "P a" and "!!x. P x ==> x=a"
paulson@15411
   674
  shows "P (THE x. P x)"
wenzelm@23553
   675
by (iprover intro: assms the_equality [THEN ssubst])
paulson@15411
   676
paulson@15411
   677
lemma theI': "EX! x. P x ==> P (THE x. P x)"
paulson@15411
   678
apply (erule ex1E)
paulson@15411
   679
apply (erule theI)
paulson@15411
   680
apply (erule allE)
paulson@15411
   681
apply (erule mp)
paulson@15411
   682
apply assumption
paulson@15411
   683
done
paulson@15411
   684
paulson@15411
   685
(*Easier to apply than theI: only one occurrence of P*)
paulson@15411
   686
lemma theI2:
paulson@15411
   687
  assumes "P a" "!!x. P x ==> x=a" "!!x. P x ==> Q x"
paulson@15411
   688
  shows "Q (THE x. P x)"
wenzelm@23553
   689
by (iprover intro: assms theI)
paulson@15411
   690
nipkow@24553
   691
lemma the1I2: assumes "EX! x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)"
nipkow@24553
   692
by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)]
nipkow@24553
   693
           elim:allE impE)
nipkow@24553
   694
wenzelm@18697
   695
lemma the1_equality [elim?]: "[| EX!x. P x; P a |] ==> (THE x. P x) = a"
paulson@15411
   696
apply (rule the_equality)
paulson@15411
   697
apply  assumption
paulson@15411
   698
apply (erule ex1E)
paulson@15411
   699
apply (erule all_dupE)
paulson@15411
   700
apply (drule mp)
paulson@15411
   701
apply  assumption
paulson@15411
   702
apply (erule ssubst)
paulson@15411
   703
apply (erule allE)
paulson@15411
   704
apply (erule mp)
paulson@15411
   705
apply assumption
paulson@15411
   706
done
paulson@15411
   707
paulson@15411
   708
lemma the_sym_eq_trivial: "(THE y. x=y) = x"
paulson@15411
   709
apply (rule the_equality)
paulson@15411
   710
apply (rule refl)
paulson@15411
   711
apply (erule sym)
paulson@15411
   712
done
paulson@15411
   713
paulson@15411
   714
haftmann@20944
   715
subsubsection {*Classical intro rules for disjunction and existential quantifiers*}
paulson@15411
   716
paulson@15411
   717
lemma disjCI:
paulson@15411
   718
  assumes "~Q ==> P" shows "P|Q"
paulson@15411
   719
apply (rule classical)
wenzelm@23553
   720
apply (iprover intro: assms disjI1 disjI2 notI elim: notE)
paulson@15411
   721
done
paulson@15411
   722
paulson@15411
   723
lemma excluded_middle: "~P | P"
nipkow@17589
   724
by (iprover intro: disjCI)
paulson@15411
   725
haftmann@20944
   726
text {*
haftmann@20944
   727
  case distinction as a natural deduction rule.
haftmann@20944
   728
  Note that @{term "~P"} is the second case, not the first
haftmann@20944
   729
*}
wenzelm@27126
   730
lemma case_split [case_names True False]:
paulson@15411
   731
  assumes prem1: "P ==> Q"
paulson@15411
   732
      and prem2: "~P ==> Q"
paulson@15411
   733
  shows "Q"
paulson@15411
   734
apply (rule excluded_middle [THEN disjE])
paulson@15411
   735
apply (erule prem2)
paulson@15411
   736
apply (erule prem1)
paulson@15411
   737
done
wenzelm@27126
   738
paulson@15411
   739
(*Classical implies (-->) elimination. *)
paulson@15411
   740
lemma impCE:
paulson@15411
   741
  assumes major: "P-->Q"
paulson@15411
   742
      and minor: "~P ==> R" "Q ==> R"
paulson@15411
   743
  shows "R"
paulson@15411
   744
apply (rule excluded_middle [of P, THEN disjE])
nipkow@17589
   745
apply (iprover intro: minor major [THEN mp])+
paulson@15411
   746
done
paulson@15411
   747
paulson@15411
   748
(*This version of --> elimination works on Q before P.  It works best for
paulson@15411
   749
  those cases in which P holds "almost everywhere".  Can't install as
paulson@15411
   750
  default: would break old proofs.*)
paulson@15411
   751
lemma impCE':
paulson@15411
   752
  assumes major: "P-->Q"
paulson@15411
   753
      and minor: "Q ==> R" "~P ==> R"
paulson@15411
   754
  shows "R"
paulson@15411
   755
apply (rule excluded_middle [of P, THEN disjE])
nipkow@17589
   756
apply (iprover intro: minor major [THEN mp])+
paulson@15411
   757
done
paulson@15411
   758
paulson@15411
   759
(*Classical <-> elimination. *)
paulson@15411
   760
lemma iffCE:
paulson@15411
   761
  assumes major: "P=Q"
paulson@15411
   762
      and minor: "[| P; Q |] ==> R"  "[| ~P; ~Q |] ==> R"
paulson@15411
   763
  shows "R"
paulson@15411
   764
apply (rule major [THEN iffE])
nipkow@17589
   765
apply (iprover intro: minor elim: impCE notE)
paulson@15411
   766
done
paulson@15411
   767
paulson@15411
   768
lemma exCI:
paulson@15411
   769
  assumes "ALL x. ~P(x) ==> P(a)"
paulson@15411
   770
  shows "EX x. P(x)"
paulson@15411
   771
apply (rule ccontr)
wenzelm@23553
   772
apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"])
paulson@15411
   773
done
paulson@15411
   774
paulson@15411
   775
wenzelm@12386
   776
subsubsection {* Intuitionistic Reasoning *}
wenzelm@12386
   777
wenzelm@12386
   778
lemma impE':
wenzelm@12937
   779
  assumes 1: "P --> Q"
wenzelm@12937
   780
    and 2: "Q ==> R"
wenzelm@12937
   781
    and 3: "P --> Q ==> P"
wenzelm@12937
   782
  shows R
wenzelm@12386
   783
proof -
wenzelm@12386
   784
  from 3 and 1 have P .
wenzelm@12386
   785
  with 1 have Q by (rule impE)
wenzelm@12386
   786
  with 2 show R .
wenzelm@12386
   787
qed
wenzelm@12386
   788
wenzelm@12386
   789
lemma allE':
wenzelm@12937
   790
  assumes 1: "ALL x. P x"
wenzelm@12937
   791
    and 2: "P x ==> ALL x. P x ==> Q"
wenzelm@12937
   792
  shows Q
wenzelm@12386
   793
proof -
wenzelm@12386
   794
  from 1 have "P x" by (rule spec)
wenzelm@12386
   795
  from this and 1 show Q by (rule 2)
wenzelm@12386
   796
qed
wenzelm@12386
   797
wenzelm@12937
   798
lemma notE':
wenzelm@12937
   799
  assumes 1: "~ P"
wenzelm@12937
   800
    and 2: "~ P ==> P"
wenzelm@12937
   801
  shows R
wenzelm@12386
   802
proof -
wenzelm@12386
   803
  from 2 and 1 have P .
wenzelm@12386
   804
  with 1 show R by (rule notE)
wenzelm@12386
   805
qed
wenzelm@12386
   806
dixon@22444
   807
lemma TrueE: "True ==> P ==> P" .
dixon@22444
   808
lemma notFalseE: "~ False ==> P ==> P" .
dixon@22444
   809
dixon@22467
   810
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE
wenzelm@15801
   811
  and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
wenzelm@15801
   812
  and [Pure.elim 2] = allE notE' impE'
wenzelm@15801
   813
  and [Pure.intro] = exI disjI2 disjI1
wenzelm@12386
   814
wenzelm@12386
   815
lemmas [trans] = trans
wenzelm@12386
   816
  and [sym] = sym not_sym
wenzelm@15801
   817
  and [Pure.elim?] = iffD1 iffD2 impE
wenzelm@11750
   818
wenzelm@23553
   819
use "hologic.ML"
wenzelm@23553
   820
wenzelm@11438
   821
wenzelm@11750
   822
subsubsection {* Atomizing meta-level connectives *}
wenzelm@11750
   823
wenzelm@11750
   824
lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)"
wenzelm@12003
   825
proof
wenzelm@9488
   826
  assume "!!x. P x"
wenzelm@23389
   827
  then show "ALL x. P x" ..
wenzelm@9488
   828
next
wenzelm@9488
   829
  assume "ALL x. P x"
wenzelm@23553
   830
  then show "!!x. P x" by (rule allE)
wenzelm@9488
   831
qed
wenzelm@9488
   832
wenzelm@11750
   833
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
wenzelm@12003
   834
proof
wenzelm@9488
   835
  assume r: "A ==> B"
wenzelm@10383
   836
  show "A --> B" by (rule impI) (rule r)
wenzelm@9488
   837
next
wenzelm@9488
   838
  assume "A --> B" and A
wenzelm@23553
   839
  then show B by (rule mp)
wenzelm@9488
   840
qed
wenzelm@9488
   841
paulson@14749
   842
lemma atomize_not: "(A ==> False) == Trueprop (~A)"
paulson@14749
   843
proof
paulson@14749
   844
  assume r: "A ==> False"
paulson@14749
   845
  show "~A" by (rule notI) (rule r)
paulson@14749
   846
next
paulson@14749
   847
  assume "~A" and A
wenzelm@23553
   848
  then show False by (rule notE)
paulson@14749
   849
qed
paulson@14749
   850
wenzelm@11750
   851
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
wenzelm@12003
   852
proof
wenzelm@10432
   853
  assume "x == y"
wenzelm@23553
   854
  show "x = y" by (unfold `x == y`) (rule refl)
wenzelm@10432
   855
next
wenzelm@10432
   856
  assume "x = y"
wenzelm@23553
   857
  then show "x == y" by (rule eq_reflection)
wenzelm@10432
   858
qed
wenzelm@10432
   859
wenzelm@12023
   860
lemma atomize_conj [atomize]:
wenzelm@19121
   861
  includes meta_conjunction_syntax
wenzelm@19121
   862
  shows "(A && B) == Trueprop (A & B)"
wenzelm@12003
   863
proof
wenzelm@19121
   864
  assume conj: "A && B"
wenzelm@19121
   865
  show "A & B"
wenzelm@19121
   866
  proof (rule conjI)
wenzelm@19121
   867
    from conj show A by (rule conjunctionD1)
wenzelm@19121
   868
    from conj show B by (rule conjunctionD2)
wenzelm@19121
   869
  qed
wenzelm@11953
   870
next
wenzelm@19121
   871
  assume conj: "A & B"
wenzelm@19121
   872
  show "A && B"
wenzelm@19121
   873
  proof -
wenzelm@19121
   874
    from conj show A ..
wenzelm@19121
   875
    from conj show B ..
wenzelm@11953
   876
  qed
wenzelm@11953
   877
qed
wenzelm@11953
   878
wenzelm@12386
   879
lemmas [symmetric, rulify] = atomize_all atomize_imp
wenzelm@18832
   880
  and [symmetric, defn] = atomize_all atomize_imp atomize_eq
wenzelm@12386
   881
wenzelm@11750
   882
krauss@26580
   883
subsubsection {* Atomizing elimination rules *}
krauss@26580
   884
krauss@26580
   885
setup AtomizeElim.setup
krauss@26580
   886
krauss@26580
   887
lemma atomize_exL[atomize_elim]: "(!!x. P x ==> Q) == ((EX x. P x) ==> Q)"
krauss@26580
   888
  by rule iprover+
krauss@26580
   889
krauss@26580
   890
lemma atomize_conjL[atomize_elim]: "(A ==> B ==> C) == (A & B ==> C)"
krauss@26580
   891
  by rule iprover+
krauss@26580
   892
krauss@26580
   893
lemma atomize_disjL[atomize_elim]: "((A ==> C) ==> (B ==> C) ==> C) == ((A | B ==> C) ==> C)"
krauss@26580
   894
  by rule iprover+
krauss@26580
   895
krauss@26580
   896
lemma atomize_elimL[atomize_elim]: "(!!B. (A ==> B) ==> B) == Trueprop A" ..
krauss@26580
   897
krauss@26580
   898
haftmann@20944
   899
subsection {* Package setup *}
haftmann@20944
   900
wenzelm@11750
   901
subsubsection {* Classical Reasoner setup *}
wenzelm@9529
   902
wenzelm@26411
   903
lemma imp_elim: "P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R"
wenzelm@26411
   904
  by (rule classical) iprover
wenzelm@26411
   905
wenzelm@26411
   906
lemma swap: "~ P ==> (~ R ==> P) ==> R"
wenzelm@26411
   907
  by (rule classical) iprover
wenzelm@26411
   908
haftmann@20944
   909
lemma thin_refl:
haftmann@20944
   910
  "\<And>X. \<lbrakk> x=x; PROP W \<rbrakk> \<Longrightarrow> PROP W" .
haftmann@20944
   911
haftmann@21151
   912
ML {*
haftmann@21151
   913
structure Hypsubst = HypsubstFun(
haftmann@21151
   914
struct
haftmann@21151
   915
  structure Simplifier = Simplifier
wenzelm@21218
   916
  val dest_eq = HOLogic.dest_eq
haftmann@21151
   917
  val dest_Trueprop = HOLogic.dest_Trueprop
haftmann@21151
   918
  val dest_imp = HOLogic.dest_imp
wenzelm@26411
   919
  val eq_reflection = @{thm eq_reflection}
wenzelm@26411
   920
  val rev_eq_reflection = @{thm meta_eq_to_obj_eq}
wenzelm@26411
   921
  val imp_intr = @{thm impI}
wenzelm@26411
   922
  val rev_mp = @{thm rev_mp}
wenzelm@26411
   923
  val subst = @{thm subst}
wenzelm@26411
   924
  val sym = @{thm sym}
wenzelm@22129
   925
  val thin_refl = @{thm thin_refl};
krauss@27572
   926
  val prop_subst = @{lemma "PROP P t ==> PROP prop (x = t ==> PROP P x)"
krauss@27572
   927
                     by (unfold prop_def) (drule eq_reflection, unfold)}
haftmann@21151
   928
end);
wenzelm@21671
   929
open Hypsubst;
haftmann@21151
   930
haftmann@21151
   931
structure Classical = ClassicalFun(
haftmann@21151
   932
struct
wenzelm@26411
   933
  val imp_elim = @{thm imp_elim}
wenzelm@26411
   934
  val not_elim = @{thm notE}
wenzelm@26411
   935
  val swap = @{thm swap}
wenzelm@26411
   936
  val classical = @{thm classical}
haftmann@21151
   937
  val sizef = Drule.size_of_thm
haftmann@21151
   938
  val hyp_subst_tacs = [Hypsubst.hyp_subst_tac]
haftmann@21151
   939
end);
haftmann@21151
   940
haftmann@21151
   941
structure BasicClassical: BASIC_CLASSICAL = Classical; 
wenzelm@21671
   942
open BasicClassical;
wenzelm@22129
   943
wenzelm@27338
   944
ML_Antiquote.value "claset"
wenzelm@27338
   945
  (Scan.succeed "Classical.local_claset_of (ML_Context.the_local_context ())");
wenzelm@24035
   946
wenzelm@24035
   947
structure ResAtpset = NamedThmsFun(val name = "atp" val description = "ATP rules");
paulson@24286
   948
paulson@24286
   949
structure ResBlacklist = NamedThmsFun(val name = "noatp" val description = "Theorems blacklisted for ATP");
haftmann@21151
   950
*}
haftmann@21151
   951
wenzelm@25388
   952
text {*ResBlacklist holds theorems blacklisted to sledgehammer. 
paulson@24286
   953
  These theorems typically produce clauses that are prolific (match too many equality or
wenzelm@25388
   954
  membership literals) and relate to seldom-used facts. Some duplicate other rules.*}
paulson@24286
   955
haftmann@21009
   956
setup {*
haftmann@21009
   957
let
haftmann@21009
   958
  (*prevent substitution on bool*)
haftmann@21009
   959
  fun hyp_subst_tac' i thm = if i <= Thm.nprems_of thm andalso
haftmann@21009
   960
    Term.exists_Const (fn ("op =", Type (_, [T, _])) => T <> Type ("bool", []) | _ => false)
haftmann@21009
   961
      (nth (Thm.prems_of thm) (i - 1)) then Hypsubst.hyp_subst_tac i thm else no_tac thm;
haftmann@21009
   962
in
haftmann@21151
   963
  Hypsubst.hypsubst_setup
haftmann@21151
   964
  #> ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac)
haftmann@21151
   965
  #> Classical.setup
haftmann@21151
   966
  #> ResAtpset.setup
paulson@24286
   967
  #> ResBlacklist.setup
haftmann@21009
   968
end
haftmann@21009
   969
*}
haftmann@21009
   970
haftmann@21009
   971
declare iffI [intro!]
haftmann@21009
   972
  and notI [intro!]
haftmann@21009
   973
  and impI [intro!]
haftmann@21009
   974
  and disjCI [intro!]
haftmann@21009
   975
  and conjI [intro!]
haftmann@21009
   976
  and TrueI [intro!]
haftmann@21009
   977
  and refl [intro!]
haftmann@21009
   978
haftmann@21009
   979
declare iffCE [elim!]
haftmann@21009
   980
  and FalseE [elim!]
haftmann@21009
   981
  and impCE [elim!]
haftmann@21009
   982
  and disjE [elim!]
haftmann@21009
   983
  and conjE [elim!]
haftmann@21009
   984
  and conjE [elim!]
haftmann@21009
   985
haftmann@21009
   986
declare ex_ex1I [intro!]
haftmann@21009
   987
  and allI [intro!]
haftmann@21009
   988
  and the_equality [intro]
haftmann@21009
   989
  and exI [intro]
haftmann@21009
   990
haftmann@21009
   991
declare exE [elim!]
haftmann@21009
   992
  allE [elim]
haftmann@21009
   993
wenzelm@22377
   994
ML {* val HOL_cs = @{claset} *}
mengj@19162
   995
wenzelm@20223
   996
lemma contrapos_np: "~ Q ==> (~ P ==> Q) ==> P"
wenzelm@20223
   997
  apply (erule swap)
wenzelm@20223
   998
  apply (erule (1) meta_mp)
wenzelm@20223
   999
  done
wenzelm@10383
  1000
wenzelm@18689
  1001
declare ex_ex1I [rule del, intro! 2]
wenzelm@18689
  1002
  and ex1I [intro]
wenzelm@18689
  1003
wenzelm@12386
  1004
lemmas [intro?] = ext
wenzelm@12386
  1005
  and [elim?] = ex1_implies_ex
wenzelm@11977
  1006
haftmann@20944
  1007
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
haftmann@20973
  1008
lemma alt_ex1E [elim!]:
haftmann@20944
  1009
  assumes major: "\<exists>!x. P x"
haftmann@20944
  1010
      and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R"
haftmann@20944
  1011
  shows R
haftmann@20944
  1012
apply (rule ex1E [OF major])
haftmann@20944
  1013
apply (rule prem)
wenzelm@22129
  1014
apply (tactic {* ares_tac @{thms allI} 1 *})+
wenzelm@22129
  1015
apply (tactic {* etac (Classical.dup_elim @{thm allE}) 1 *})
wenzelm@22129
  1016
apply iprover
wenzelm@22129
  1017
done
haftmann@20944
  1018
haftmann@21151
  1019
ML {*
wenzelm@25388
  1020
structure Blast = BlastFun
wenzelm@25388
  1021
(
haftmann@21151
  1022
  type claset = Classical.claset
haftmann@22744
  1023
  val equality_name = @{const_name "op ="}
haftmann@22993
  1024
  val not_name = @{const_name Not}
wenzelm@26411
  1025
  val notE = @{thm notE}
wenzelm@26411
  1026
  val ccontr = @{thm ccontr}
haftmann@21151
  1027
  val contr_tac = Classical.contr_tac
haftmann@21151
  1028
  val dup_intr = Classical.dup_intr
haftmann@21151
  1029
  val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac
wenzelm@21671
  1030
  val claset = Classical.claset
haftmann@21151
  1031
  val rep_cs = Classical.rep_cs
haftmann@21151
  1032
  val cla_modifiers = Classical.cla_modifiers
haftmann@21151
  1033
  val cla_meth' = Classical.cla_meth'
wenzelm@25388
  1034
);
wenzelm@21671
  1035
val Blast_tac = Blast.Blast_tac;
wenzelm@21671
  1036
val blast_tac = Blast.blast_tac;
haftmann@20944
  1037
*}
haftmann@20944
  1038
haftmann@21151
  1039
setup Blast.setup
haftmann@21151
  1040
haftmann@20944
  1041
haftmann@20944
  1042
subsubsection {* Simplifier *}
wenzelm@12281
  1043
wenzelm@12281
  1044
lemma eta_contract_eq: "(%s. f s) = f" ..
wenzelm@12281
  1045
wenzelm@12281
  1046
lemma simp_thms:
wenzelm@12937
  1047
  shows not_not: "(~ ~ P) = P"
nipkow@15354
  1048
  and Not_eq_iff: "((~P) = (~Q)) = (P = Q)"
wenzelm@12937
  1049
  and
berghofe@12436
  1050
    "(P ~= Q) = (P = (~Q))"
berghofe@12436
  1051
    "(P | ~P) = True"    "(~P | P) = True"
wenzelm@12281
  1052
    "(x = x) = True"
haftmann@20944
  1053
  and not_True_eq_False: "(\<not> True) = False"
haftmann@20944
  1054
  and not_False_eq_True: "(\<not> False) = True"
haftmann@20944
  1055
  and
berghofe@12436
  1056
    "(~P) ~= P"  "P ~= (~P)"
haftmann@20944
  1057
    "(True=P) = P"
haftmann@20944
  1058
  and eq_True: "(P = True) = P"
haftmann@20944
  1059
  and "(False=P) = (~P)"
haftmann@20944
  1060
  and eq_False: "(P = False) = (\<not> P)"
haftmann@20944
  1061
  and
wenzelm@12281
  1062
    "(True --> P) = P"  "(False --> P) = True"
wenzelm@12281
  1063
    "(P --> True) = True"  "(P --> P) = True"
wenzelm@12281
  1064
    "(P --> False) = (~P)"  "(P --> ~P) = (~P)"
wenzelm@12281
  1065
    "(P & True) = P"  "(True & P) = P"
wenzelm@12281
  1066
    "(P & False) = False"  "(False & P) = False"
wenzelm@12281
  1067
    "(P & P) = P"  "(P & (P & Q)) = (P & Q)"
wenzelm@12281
  1068
    "(P & ~P) = False"    "(~P & P) = False"
wenzelm@12281
  1069
    "(P | True) = True"  "(True | P) = True"
wenzelm@12281
  1070
    "(P | False) = P"  "(False | P) = P"
berghofe@12436
  1071
    "(P | P) = P"  "(P | (P | Q)) = (P | Q)" and
wenzelm@12281
  1072
    "(ALL x. P) = P"  "(EX x. P) = P"  "EX x. x=t"  "EX x. t=x"
wenzelm@12281
  1073
    -- {* needed for the one-point-rule quantifier simplification procs *}
wenzelm@12281
  1074
    -- {* essential for termination!! *} and
wenzelm@12281
  1075
    "!!P. (EX x. x=t & P(x)) = P(t)"
wenzelm@12281
  1076
    "!!P. (EX x. t=x & P(x)) = P(t)"
wenzelm@12281
  1077
    "!!P. (ALL x. x=t --> P(x)) = P(t)"
wenzelm@12937
  1078
    "!!P. (ALL x. t=x --> P(x)) = P(t)"
nipkow@17589
  1079
  by (blast, blast, blast, blast, blast, iprover+)
wenzelm@13421
  1080
paulson@14201
  1081
lemma disj_absorb: "(A | A) = A"
paulson@14201
  1082
  by blast
paulson@14201
  1083
paulson@14201
  1084
lemma disj_left_absorb: "(A | (A | B)) = (A | B)"
paulson@14201
  1085
  by blast
paulson@14201
  1086
paulson@14201
  1087
lemma conj_absorb: "(A & A) = A"
paulson@14201
  1088
  by blast
paulson@14201
  1089
paulson@14201
  1090
lemma conj_left_absorb: "(A & (A & B)) = (A & B)"
paulson@14201
  1091
  by blast
paulson@14201
  1092
wenzelm@12281
  1093
lemma eq_ac:
wenzelm@12937
  1094
  shows eq_commute: "(a=b) = (b=a)"
wenzelm@12937
  1095
    and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
nipkow@17589
  1096
    and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (iprover, blast+)
nipkow@17589
  1097
lemma neq_commute: "(a~=b) = (b~=a)" by iprover
wenzelm@12281
  1098
wenzelm@12281
  1099
lemma conj_comms:
wenzelm@12937
  1100
  shows conj_commute: "(P&Q) = (Q&P)"
nipkow@17589
  1101
    and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by iprover+
nipkow@17589
  1102
lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by iprover
wenzelm@12281
  1103
paulson@19174
  1104
lemmas conj_ac = conj_commute conj_left_commute conj_assoc
paulson@19174
  1105
wenzelm@12281
  1106
lemma disj_comms:
wenzelm@12937
  1107
  shows disj_commute: "(P|Q) = (Q|P)"
nipkow@17589
  1108
    and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by iprover+
nipkow@17589
  1109
lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by iprover
wenzelm@12281
  1110
paulson@19174
  1111
lemmas disj_ac = disj_commute disj_left_commute disj_assoc
paulson@19174
  1112
nipkow@17589
  1113
lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by iprover
nipkow@17589
  1114
lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by iprover
wenzelm@12281
  1115
nipkow@17589
  1116
lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by iprover
nipkow@17589
  1117
lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by iprover
wenzelm@12281
  1118
nipkow@17589
  1119
lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by iprover
nipkow@17589
  1120
lemma imp_conjL: "((P&Q) -->R)  = (P --> (Q --> R))" by iprover
nipkow@17589
  1121
lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by iprover
wenzelm@12281
  1122
wenzelm@12281
  1123
text {* These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}. *}
wenzelm@12281
  1124
lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
wenzelm@12281
  1125
lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
wenzelm@12281
  1126
wenzelm@12281
  1127
lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
wenzelm@12281
  1128
lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" by blast
wenzelm@12281
  1129
haftmann@21151
  1130
lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
haftmann@21151
  1131
  by iprover
haftmann@21151
  1132
nipkow@17589
  1133
lemma de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by iprover
wenzelm@12281
  1134
lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
wenzelm@12281
  1135
lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
wenzelm@12281
  1136
lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
wenzelm@12281
  1137
lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
wenzelm@12281
  1138
lemma disj_not2: "(P | ~Q) = (Q --> P)"  -- {* changes orientation :-( *}
wenzelm@12281
  1139
  by blast
wenzelm@12281
  1140
lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
wenzelm@12281
  1141
nipkow@17589
  1142
lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by iprover
wenzelm@12281
  1143
wenzelm@12281
  1144
wenzelm@12281
  1145
lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
wenzelm@12281
  1146
  -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
wenzelm@12281
  1147
  -- {* cases boil down to the same thing. *}
wenzelm@12281
  1148
  by blast
wenzelm@12281
  1149
wenzelm@12281
  1150
lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
wenzelm@12281
  1151
lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
nipkow@17589
  1152
lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by iprover
nipkow@17589
  1153
lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by iprover
chaieb@23403
  1154
lemma all_not_ex: "(ALL x. P x) = (~ (EX x. ~ P x ))" by blast
wenzelm@12281
  1155
paulson@24286
  1156
declare All_def [noatp]
paulson@24286
  1157
nipkow@17589
  1158
lemma ex_disj_distrib: "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))" by iprover
nipkow@17589
  1159
lemma all_conj_distrib: "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))" by iprover
wenzelm@12281
  1160
wenzelm@12281
  1161
text {*
wenzelm@12281
  1162
  \medskip The @{text "&"} congruence rule: not included by default!
wenzelm@12281
  1163
  May slow rewrite proofs down by as much as 50\% *}
wenzelm@12281
  1164
wenzelm@12281
  1165
lemma conj_cong:
wenzelm@12281
  1166
    "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
nipkow@17589
  1167
  by iprover
wenzelm@12281
  1168
wenzelm@12281
  1169
lemma rev_conj_cong:
wenzelm@12281
  1170
    "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
nipkow@17589
  1171
  by iprover
wenzelm@12281
  1172
wenzelm@12281
  1173
text {* The @{text "|"} congruence rule: not included by default! *}
wenzelm@12281
  1174
wenzelm@12281
  1175
lemma disj_cong:
wenzelm@12281
  1176
    "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
wenzelm@12281
  1177
  by blast
wenzelm@12281
  1178
wenzelm@12281
  1179
wenzelm@12281
  1180
text {* \medskip if-then-else rules *}
wenzelm@12281
  1181
wenzelm@12281
  1182
lemma if_True: "(if True then x else y) = x"
wenzelm@12281
  1183
  by (unfold if_def) blast
wenzelm@12281
  1184
wenzelm@12281
  1185
lemma if_False: "(if False then x else y) = y"
wenzelm@12281
  1186
  by (unfold if_def) blast
wenzelm@12281
  1187
wenzelm@12281
  1188
lemma if_P: "P ==> (if P then x else y) = x"
wenzelm@12281
  1189
  by (unfold if_def) blast
wenzelm@12281
  1190
wenzelm@12281
  1191
lemma if_not_P: "~P ==> (if P then x else y) = y"
wenzelm@12281
  1192
  by (unfold if_def) blast
wenzelm@12281
  1193
wenzelm@12281
  1194
lemma split_if: "P (if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
wenzelm@12281
  1195
  apply (rule case_split [of Q])
paulson@15481
  1196
   apply (simplesubst if_P)
paulson@15481
  1197
    prefer 3 apply (simplesubst if_not_P, blast+)
wenzelm@12281
  1198
  done
wenzelm@12281
  1199
wenzelm@12281
  1200
lemma split_if_asm: "P (if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
paulson@15481
  1201
by (simplesubst split_if, blast)
wenzelm@12281
  1202
paulson@24286
  1203
lemmas if_splits [noatp] = split_if split_if_asm
wenzelm@12281
  1204
wenzelm@12281
  1205
lemma if_cancel: "(if c then x else x) = x"
paulson@15481
  1206
by (simplesubst split_if, blast)
wenzelm@12281
  1207
wenzelm@12281
  1208
lemma if_eq_cancel: "(if x = y then y else x) = x"
paulson@15481
  1209
by (simplesubst split_if, blast)
wenzelm@12281
  1210
wenzelm@12281
  1211
lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
wenzelm@19796
  1212
  -- {* This form is useful for expanding @{text "if"}s on the RIGHT of the @{text "==>"} symbol. *}
wenzelm@12281
  1213
  by (rule split_if)
wenzelm@12281
  1214
wenzelm@12281
  1215
lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
wenzelm@19796
  1216
  -- {* And this form is useful for expanding @{text "if"}s on the LEFT. *}
paulson@15481
  1217
  apply (simplesubst split_if, blast)
wenzelm@12281
  1218
  done
wenzelm@12281
  1219
nipkow@17589
  1220
lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) iprover
nipkow@17589
  1221
lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) iprover
wenzelm@12281
  1222
schirmer@15423
  1223
text {* \medskip let rules for simproc *}
schirmer@15423
  1224
schirmer@15423
  1225
lemma Let_folded: "f x \<equiv> g x \<Longrightarrow>  Let x f \<equiv> Let x g"
schirmer@15423
  1226
  by (unfold Let_def)
schirmer@15423
  1227
schirmer@15423
  1228
lemma Let_unfold: "f x \<equiv> g \<Longrightarrow>  Let x f \<equiv> g"
schirmer@15423
  1229
  by (unfold Let_def)
schirmer@15423
  1230
berghofe@16633
  1231
text {*
ballarin@16999
  1232
  The following copy of the implication operator is useful for
ballarin@16999
  1233
  fine-tuning congruence rules.  It instructs the simplifier to simplify
ballarin@16999
  1234
  its premise.
berghofe@16633
  1235
*}
berghofe@16633
  1236
wenzelm@17197
  1237
constdefs
wenzelm@17197
  1238
  simp_implies :: "[prop, prop] => prop"  (infixr "=simp=>" 1)
haftmann@25966
  1239
  [code func del]: "simp_implies \<equiv> op ==>"
berghofe@16633
  1240
wenzelm@18457
  1241
lemma simp_impliesI:
berghofe@16633
  1242
  assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
berghofe@16633
  1243
  shows "PROP P =simp=> PROP Q"
berghofe@16633
  1244
  apply (unfold simp_implies_def)
berghofe@16633
  1245
  apply (rule PQ)
berghofe@16633
  1246
  apply assumption
berghofe@16633
  1247
  done
berghofe@16633
  1248
berghofe@16633
  1249
lemma simp_impliesE:
wenzelm@25388
  1250
  assumes PQ: "PROP P =simp=> PROP Q"
berghofe@16633
  1251
  and P: "PROP P"
berghofe@16633
  1252
  and QR: "PROP Q \<Longrightarrow> PROP R"
berghofe@16633
  1253
  shows "PROP R"
berghofe@16633
  1254
  apply (rule QR)
berghofe@16633
  1255
  apply (rule PQ [unfolded simp_implies_def])
berghofe@16633
  1256
  apply (rule P)
berghofe@16633
  1257
  done
berghofe@16633
  1258
berghofe@16633
  1259
lemma simp_implies_cong:
berghofe@16633
  1260
  assumes PP' :"PROP P == PROP P'"
berghofe@16633
  1261
  and P'QQ': "PROP P' ==> (PROP Q == PROP Q')"
berghofe@16633
  1262
  shows "(PROP P =simp=> PROP Q) == (PROP P' =simp=> PROP Q')"
berghofe@16633
  1263
proof (unfold simp_implies_def, rule equal_intr_rule)
berghofe@16633
  1264
  assume PQ: "PROP P \<Longrightarrow> PROP Q"
berghofe@16633
  1265
  and P': "PROP P'"
berghofe@16633
  1266
  from PP' [symmetric] and P' have "PROP P"
berghofe@16633
  1267
    by (rule equal_elim_rule1)
wenzelm@23553
  1268
  then have "PROP Q" by (rule PQ)
berghofe@16633
  1269
  with P'QQ' [OF P'] show "PROP Q'" by (rule equal_elim_rule1)
berghofe@16633
  1270
next
berghofe@16633
  1271
  assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
berghofe@16633
  1272
  and P: "PROP P"
berghofe@16633
  1273
  from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
wenzelm@23553
  1274
  then have "PROP Q'" by (rule P'Q')
berghofe@16633
  1275
  with P'QQ' [OF P', symmetric] show "PROP Q"
berghofe@16633
  1276
    by (rule equal_elim_rule1)
berghofe@16633
  1277
qed
berghofe@16633
  1278
haftmann@20944
  1279
lemma uncurry:
haftmann@20944
  1280
  assumes "P \<longrightarrow> Q \<longrightarrow> R"
haftmann@20944
  1281
  shows "P \<and> Q \<longrightarrow> R"
wenzelm@23553
  1282
  using assms by blast
haftmann@20944
  1283
haftmann@20944
  1284
lemma iff_allI:
haftmann@20944
  1285
  assumes "\<And>x. P x = Q x"
haftmann@20944
  1286
  shows "(\<forall>x. P x) = (\<forall>x. Q x)"
wenzelm@23553
  1287
  using assms by blast
haftmann@20944
  1288
haftmann@20944
  1289
lemma iff_exI:
haftmann@20944
  1290
  assumes "\<And>x. P x = Q x"
haftmann@20944
  1291
  shows "(\<exists>x. P x) = (\<exists>x. Q x)"
wenzelm@23553
  1292
  using assms by blast
haftmann@20944
  1293
haftmann@20944
  1294
lemma all_comm:
haftmann@20944
  1295
  "(\<forall>x y. P x y) = (\<forall>y x. P x y)"
haftmann@20944
  1296
  by blast
haftmann@20944
  1297
haftmann@20944
  1298
lemma ex_comm:
haftmann@20944
  1299
  "(\<exists>x y. P x y) = (\<exists>y x. P x y)"
haftmann@20944
  1300
  by blast
haftmann@20944
  1301
wenzelm@9869
  1302
use "simpdata.ML"
wenzelm@21671
  1303
ML {* open Simpdata *}
wenzelm@21671
  1304
haftmann@21151
  1305
setup {*
haftmann@21151
  1306
  Simplifier.method_setup Splitter.split_modifiers
wenzelm@26496
  1307
  #> Simplifier.map_simpset (K Simpdata.simpset_simprocs)
haftmann@21151
  1308
  #> Splitter.setup
wenzelm@26496
  1309
  #> clasimp_setup
haftmann@21151
  1310
  #> EqSubst.setup
haftmann@21151
  1311
*}
haftmann@21151
  1312
wenzelm@24035
  1313
text {* Simproc for proving @{text "(y = x) == False"} from premise @{text "~(x = y)"}: *}
wenzelm@24035
  1314
wenzelm@24035
  1315
simproc_setup neq ("x = y") = {* fn _ =>
wenzelm@24035
  1316
let
wenzelm@24035
  1317
  val neq_to_EQ_False = @{thm not_sym} RS @{thm Eq_FalseI};
wenzelm@24035
  1318
  fun is_neq eq lhs rhs thm =
wenzelm@24035
  1319
    (case Thm.prop_of thm of
wenzelm@24035
  1320
      _ $ (Not $ (eq' $ l' $ r')) =>
wenzelm@24035
  1321
        Not = HOLogic.Not andalso eq' = eq andalso
wenzelm@24035
  1322
        r' aconv lhs andalso l' aconv rhs
wenzelm@24035
  1323
    | _ => false);
wenzelm@24035
  1324
  fun proc ss ct =
wenzelm@24035
  1325
    (case Thm.term_of ct of
wenzelm@24035
  1326
      eq $ lhs $ rhs =>
wenzelm@24035
  1327
        (case find_first (is_neq eq lhs rhs) (Simplifier.prems_of_ss ss) of
wenzelm@24035
  1328
          SOME thm => SOME (thm RS neq_to_EQ_False)
wenzelm@24035
  1329
        | NONE => NONE)
wenzelm@24035
  1330
     | _ => NONE);
wenzelm@24035
  1331
in proc end;
wenzelm@24035
  1332
*}
wenzelm@24035
  1333
wenzelm@24035
  1334
simproc_setup let_simp ("Let x f") = {*
wenzelm@24035
  1335
let
wenzelm@24035
  1336
  val (f_Let_unfold, x_Let_unfold) =
wenzelm@24035
  1337
    let val [(_$(f$x)$_)] = prems_of @{thm Let_unfold}
wenzelm@24035
  1338
    in (cterm_of @{theory} f, cterm_of @{theory} x) end
wenzelm@24035
  1339
  val (f_Let_folded, x_Let_folded) =
wenzelm@24035
  1340
    let val [(_$(f$x)$_)] = prems_of @{thm Let_folded}
wenzelm@24035
  1341
    in (cterm_of @{theory} f, cterm_of @{theory} x) end;
wenzelm@24035
  1342
  val g_Let_folded =
wenzelm@24035
  1343
    let val [(_$_$(g$_))] = prems_of @{thm Let_folded} in cterm_of @{theory} g end;
wenzelm@24035
  1344
wenzelm@24035
  1345
  fun proc _ ss ct =
wenzelm@24035
  1346
    let
wenzelm@24035
  1347
      val ctxt = Simplifier.the_context ss;
wenzelm@24035
  1348
      val thy = ProofContext.theory_of ctxt;
wenzelm@24035
  1349
      val t = Thm.term_of ct;
wenzelm@24035
  1350
      val ([t'], ctxt') = Variable.import_terms false [t] ctxt;
wenzelm@24035
  1351
    in Option.map (hd o Variable.export ctxt' ctxt o single)
wenzelm@24035
  1352
      (case t' of Const ("Let",_) $ x $ f => (* x and f are already in normal form *)
wenzelm@24035
  1353
        if is_Free x orelse is_Bound x orelse is_Const x
wenzelm@24035
  1354
        then SOME @{thm Let_def}
wenzelm@24035
  1355
        else
wenzelm@24035
  1356
          let
wenzelm@24035
  1357
            val n = case f of (Abs (x,_,_)) => x | _ => "x";
wenzelm@24035
  1358
            val cx = cterm_of thy x;
wenzelm@24035
  1359
            val {T=xT,...} = rep_cterm cx;
wenzelm@24035
  1360
            val cf = cterm_of thy f;
wenzelm@24035
  1361
            val fx_g = Simplifier.rewrite ss (Thm.capply cf cx);
wenzelm@24035
  1362
            val (_$_$g) = prop_of fx_g;
wenzelm@24035
  1363
            val g' = abstract_over (x,g);
wenzelm@24035
  1364
          in (if (g aconv g')
wenzelm@24035
  1365
               then
wenzelm@24035
  1366
                  let
wenzelm@24035
  1367
                    val rl =
wenzelm@24035
  1368
                      cterm_instantiate [(f_Let_unfold,cf),(x_Let_unfold,cx)] @{thm Let_unfold};
wenzelm@24035
  1369
                  in SOME (rl OF [fx_g]) end
wenzelm@24035
  1370
               else if Term.betapply (f,x) aconv g then NONE (*avoid identity conversion*)
wenzelm@24035
  1371
               else let
wenzelm@24035
  1372
                     val abs_g'= Abs (n,xT,g');
wenzelm@24035
  1373
                     val g'x = abs_g'$x;
wenzelm@24035
  1374
                     val g_g'x = symmetric (beta_conversion false (cterm_of thy g'x));
wenzelm@24035
  1375
                     val rl = cterm_instantiate
wenzelm@24035
  1376
                               [(f_Let_folded,cterm_of thy f),(x_Let_folded,cx),
wenzelm@24035
  1377
                                (g_Let_folded,cterm_of thy abs_g')]
wenzelm@24035
  1378
                               @{thm Let_folded};
wenzelm@24035
  1379
                   in SOME (rl OF [transitive fx_g g_g'x])
wenzelm@24035
  1380
                   end)
wenzelm@24035
  1381
          end
wenzelm@24035
  1382
      | _ => NONE)
wenzelm@24035
  1383
    end
wenzelm@24035
  1384
in proc end *}
wenzelm@24035
  1385
wenzelm@24035
  1386
haftmann@21151
  1387
lemma True_implies_equals: "(True \<Longrightarrow> PROP P) \<equiv> PROP P"
haftmann@21151
  1388
proof
wenzelm@23389
  1389
  assume "True \<Longrightarrow> PROP P"
wenzelm@23389
  1390
  from this [OF TrueI] show "PROP P" .
haftmann@21151
  1391
next
haftmann@21151
  1392
  assume "PROP P"
wenzelm@23389
  1393
  then show "PROP P" .
haftmann@21151
  1394
qed
haftmann@21151
  1395
haftmann@21151
  1396
lemma ex_simps:
haftmann@21151
  1397
  "!!P Q. (EX x. P x & Q)   = ((EX x. P x) & Q)"
haftmann@21151
  1398
  "!!P Q. (EX x. P & Q x)   = (P & (EX x. Q x))"
haftmann@21151
  1399
  "!!P Q. (EX x. P x | Q)   = ((EX x. P x) | Q)"
haftmann@21151
  1400
  "!!P Q. (EX x. P | Q x)   = (P | (EX x. Q x))"
haftmann@21151
  1401
  "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
haftmann@21151
  1402
  "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
haftmann@21151
  1403
  -- {* Miniscoping: pushing in existential quantifiers. *}
haftmann@21151
  1404
  by (iprover | blast)+
haftmann@21151
  1405
haftmann@21151
  1406
lemma all_simps:
haftmann@21151
  1407
  "!!P Q. (ALL x. P x & Q)   = ((ALL x. P x) & Q)"
haftmann@21151
  1408
  "!!P Q. (ALL x. P & Q x)   = (P & (ALL x. Q x))"
haftmann@21151
  1409
  "!!P Q. (ALL x. P x | Q)   = ((ALL x. P x) | Q)"
haftmann@21151
  1410
  "!!P Q. (ALL x. P | Q x)   = (P | (ALL x. Q x))"
haftmann@21151
  1411
  "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
haftmann@21151
  1412
  "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
haftmann@21151
  1413
  -- {* Miniscoping: pushing in universal quantifiers. *}
haftmann@21151
  1414
  by (iprover | blast)+
paulson@15481
  1415
wenzelm@21671
  1416
lemmas [simp] =
wenzelm@21671
  1417
  triv_forall_equality (*prunes params*)
wenzelm@21671
  1418
  True_implies_equals  (*prune asms `True'*)
wenzelm@21671
  1419
  if_True
wenzelm@21671
  1420
  if_False
wenzelm@21671
  1421
  if_cancel
wenzelm@21671
  1422
  if_eq_cancel
wenzelm@21671
  1423
  imp_disjL
haftmann@20973
  1424
  (*In general it seems wrong to add distributive laws by default: they
haftmann@20973
  1425
    might cause exponential blow-up.  But imp_disjL has been in for a while
haftmann@20973
  1426
    and cannot be removed without affecting existing proofs.  Moreover,
haftmann@20973
  1427
    rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
haftmann@20973
  1428
    grounds that it allows simplification of R in the two cases.*)
wenzelm@21671
  1429
  conj_assoc
wenzelm@21671
  1430
  disj_assoc
wenzelm@21671
  1431
  de_Morgan_conj
wenzelm@21671
  1432
  de_Morgan_disj
wenzelm@21671
  1433
  imp_disj1
wenzelm@21671
  1434
  imp_disj2
wenzelm@21671
  1435
  not_imp
wenzelm@21671
  1436
  disj_not1
wenzelm@21671
  1437
  not_all
wenzelm@21671
  1438
  not_ex
wenzelm@21671
  1439
  cases_simp
wenzelm@21671
  1440
  the_eq_trivial
wenzelm@21671
  1441
  the_sym_eq_trivial
wenzelm@21671
  1442
  ex_simps
wenzelm@21671
  1443
  all_simps
wenzelm@21671
  1444
  simp_thms
wenzelm@21671
  1445
wenzelm@21671
  1446
lemmas [cong] = imp_cong simp_implies_cong
wenzelm@21671
  1447
lemmas [split] = split_if
haftmann@20973
  1448
wenzelm@22377
  1449
ML {* val HOL_ss = @{simpset} *}
haftmann@20973
  1450
haftmann@20944
  1451
text {* Simplifies x assuming c and y assuming ~c *}
haftmann@20944
  1452
lemma if_cong:
haftmann@20944
  1453
  assumes "b = c"
haftmann@20944
  1454
      and "c \<Longrightarrow> x = u"
haftmann@20944
  1455
      and "\<not> c \<Longrightarrow> y = v"
haftmann@20944
  1456
  shows "(if b then x else y) = (if c then u else v)"
wenzelm@23553
  1457
  unfolding if_def using assms by simp
haftmann@20944
  1458
haftmann@20944
  1459
text {* Prevents simplification of x and y:
haftmann@20944
  1460
  faster and allows the execution of functional programs. *}
haftmann@20944
  1461
lemma if_weak_cong [cong]:
haftmann@20944
  1462
  assumes "b = c"
haftmann@20944
  1463
  shows "(if b then x else y) = (if c then x else y)"
wenzelm@23553
  1464
  using assms by (rule arg_cong)
haftmann@20944
  1465
haftmann@20944
  1466
text {* Prevents simplification of t: much faster *}
haftmann@20944
  1467
lemma let_weak_cong:
haftmann@20944
  1468
  assumes "a = b"
haftmann@20944
  1469
  shows "(let x = a in t x) = (let x = b in t x)"
wenzelm@23553
  1470
  using assms by (rule arg_cong)
haftmann@20944
  1471
haftmann@20944
  1472
text {* To tidy up the result of a simproc.  Only the RHS will be simplified. *}
haftmann@20944
  1473
lemma eq_cong2:
haftmann@20944
  1474
  assumes "u = u'"
haftmann@20944
  1475
  shows "(t \<equiv> u) \<equiv> (t \<equiv> u')"
wenzelm@23553
  1476
  using assms by simp
haftmann@20944
  1477
haftmann@20944
  1478
lemma if_distrib:
haftmann@20944
  1479
  "f (if c then x else y) = (if c then f x else f y)"
haftmann@20944
  1480
  by simp
haftmann@20944
  1481
haftmann@20944
  1482
text {* This lemma restricts the effect of the rewrite rule u=v to the left-hand
wenzelm@21502
  1483
  side of an equality.  Used in @{text "{Integ,Real}/simproc.ML"} *}
haftmann@20944
  1484
lemma restrict_to_left:
haftmann@20944
  1485
  assumes "x = y"
haftmann@20944
  1486
  shows "(x = z) = (y = z)"
wenzelm@23553
  1487
  using assms by simp
haftmann@20944
  1488
wenzelm@17459
  1489
haftmann@20944
  1490
subsubsection {* Generic cases and induction *}
wenzelm@17459
  1491
haftmann@20944
  1492
text {* Rule projections: *}
berghofe@18887
  1493
haftmann@20944
  1494
ML {*
haftmann@20944
  1495
structure ProjectRule = ProjectRuleFun
wenzelm@25388
  1496
(
wenzelm@27126
  1497
  val conjunct1 = @{thm conjunct1}
wenzelm@27126
  1498
  val conjunct2 = @{thm conjunct2}
wenzelm@27126
  1499
  val mp = @{thm mp}
wenzelm@25388
  1500
)
wenzelm@17459
  1501
*}
wenzelm@17459
  1502
wenzelm@11824
  1503
constdefs
wenzelm@18457
  1504
  induct_forall where "induct_forall P == \<forall>x. P x"
wenzelm@18457
  1505
  induct_implies where "induct_implies A B == A \<longrightarrow> B"
wenzelm@18457
  1506
  induct_equal where "induct_equal x y == x = y"
wenzelm@18457
  1507
  induct_conj where "induct_conj A B == A \<and> B"
wenzelm@11824
  1508
wenzelm@11989
  1509
lemma induct_forall_eq: "(!!x. P x) == Trueprop (induct_forall (\<lambda>x. P x))"
wenzelm@18457
  1510
  by (unfold atomize_all induct_forall_def)
wenzelm@11824
  1511
wenzelm@11989
  1512
lemma induct_implies_eq: "(A ==> B) == Trueprop (induct_implies A B)"
wenzelm@18457
  1513
  by (unfold atomize_imp induct_implies_def)
wenzelm@11824
  1514
wenzelm@11989
  1515
lemma induct_equal_eq: "(x == y) == Trueprop (induct_equal x y)"
wenzelm@18457
  1516
  by (unfold atomize_eq induct_equal_def)
wenzelm@18457
  1517
wenzelm@18457
  1518
lemma induct_conj_eq:
wenzelm@18457
  1519
  includes meta_conjunction_syntax
wenzelm@18457
  1520
  shows "(A && B) == Trueprop (induct_conj A B)"
wenzelm@18457
  1521
  by (unfold atomize_conj induct_conj_def)
wenzelm@18457
  1522
wenzelm@18457
  1523
lemmas induct_atomize = induct_forall_eq induct_implies_eq induct_equal_eq induct_conj_eq
wenzelm@18457
  1524
lemmas induct_rulify [symmetric, standard] = induct_atomize
wenzelm@18457
  1525
lemmas induct_rulify_fallback =
wenzelm@18457
  1526
  induct_forall_def induct_implies_def induct_equal_def induct_conj_def
wenzelm@18457
  1527
wenzelm@11824
  1528
wenzelm@11989
  1529
lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
wenzelm@11989
  1530
    induct_conj (induct_forall A) (induct_forall B)"
nipkow@17589
  1531
  by (unfold induct_forall_def induct_conj_def) iprover
wenzelm@11824
  1532
wenzelm@11989
  1533
lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
wenzelm@11989
  1534
    induct_conj (induct_implies C A) (induct_implies C B)"
nipkow@17589
  1535
  by (unfold induct_implies_def induct_conj_def) iprover
wenzelm@11989
  1536
berghofe@13598
  1537
lemma induct_conj_curry: "(induct_conj A B ==> PROP C) == (A ==> B ==> PROP C)"
berghofe@13598
  1538
proof
berghofe@13598
  1539
  assume r: "induct_conj A B ==> PROP C" and A B
wenzelm@18457
  1540
  show "PROP C" by (rule r) (simp add: induct_conj_def `A` `B`)
berghofe@13598
  1541
next
berghofe@13598
  1542
  assume r: "A ==> B ==> PROP C" and "induct_conj A B"
wenzelm@18457
  1543
  show "PROP C" by (rule r) (simp_all add: `induct_conj A B` [unfolded induct_conj_def])
berghofe@13598
  1544
qed
wenzelm@11824
  1545
wenzelm@11989
  1546
lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
wenzelm@11824
  1547
wenzelm@11989
  1548
hide const induct_forall induct_implies induct_equal induct_conj
wenzelm@11824
  1549
wenzelm@11824
  1550
text {* Method setup. *}
wenzelm@11824
  1551
wenzelm@11824
  1552
ML {*
wenzelm@27126
  1553
structure Induct = InductFun
wenzelm@27126
  1554
(
wenzelm@27126
  1555
  val cases_default = @{thm case_split}
wenzelm@27126
  1556
  val atomize = @{thms induct_atomize}
wenzelm@27126
  1557
  val rulify = @{thms induct_rulify}
wenzelm@27126
  1558
  val rulify_fallback = @{thms induct_rulify_fallback}
wenzelm@27126
  1559
)
wenzelm@11824
  1560
*}
wenzelm@11824
  1561
wenzelm@24830
  1562
setup Induct.setup
wenzelm@18457
  1563
wenzelm@27326
  1564
use "~~/src/Tools/induct_tacs.ML"
wenzelm@27126
  1565
setup InductTacs.setup
wenzelm@27126
  1566
haftmann@20944
  1567
berghofe@28325
  1568
subsubsection {* Coherent logic *}
berghofe@28325
  1569
berghofe@28325
  1570
ML {*
berghofe@28325
  1571
structure Coherent = CoherentFun
berghofe@28325
  1572
(
berghofe@28325
  1573
  val atomize_elimL = @{thm atomize_elimL}
berghofe@28325
  1574
  val atomize_exL = @{thm atomize_exL}
berghofe@28325
  1575
  val atomize_conjL = @{thm atomize_conjL}
berghofe@28325
  1576
  val atomize_disjL = @{thm atomize_disjL}
berghofe@28325
  1577
  val operator_names =
berghofe@28325
  1578
    [@{const_name "op |"}, @{const_name "op &"}, @{const_name "Ex"}]
berghofe@28325
  1579
);
berghofe@28325
  1580
*}
berghofe@28325
  1581
berghofe@28325
  1582
setup Coherent.setup
berghofe@28325
  1583
berghofe@28325
  1584
haftmann@20944
  1585
subsection {* Other simple lemmas and lemma duplicates *}
haftmann@20944
  1586
haftmann@24166
  1587
lemma Let_0 [simp]: "Let 0 f = f 0"
haftmann@24166
  1588
  unfolding Let_def ..
haftmann@24166
  1589
haftmann@24166
  1590
lemma Let_1 [simp]: "Let 1 f = f 1"
haftmann@24166
  1591
  unfolding Let_def ..
haftmann@24166
  1592
haftmann@20944
  1593
lemma ex1_eq [iff]: "EX! x. x = t" "EX! x. t = x"
haftmann@20944
  1594
  by blast+
haftmann@20944
  1595
haftmann@20944
  1596
lemma choice_eq: "(ALL x. EX! y. P x y) = (EX! f. ALL x. P x (f x))"
haftmann@20944
  1597
  apply (rule iffI)
haftmann@20944
  1598
  apply (rule_tac a = "%x. THE y. P x y" in ex1I)
haftmann@20944
  1599
  apply (fast dest!: theI')
haftmann@20944
  1600
  apply (fast intro: ext the1_equality [symmetric])
haftmann@20944
  1601
  apply (erule ex1E)
haftmann@20944
  1602
  apply (rule allI)
haftmann@20944
  1603
  apply (rule ex1I)
haftmann@20944
  1604
  apply (erule spec)
haftmann@20944
  1605
  apply (erule_tac x = "%z. if z = x then y else f z" in allE)
haftmann@20944
  1606
  apply (erule impE)
haftmann@20944
  1607
  apply (rule allI)
wenzelm@27126
  1608
  apply (case_tac "xa = x")
haftmann@20944
  1609
  apply (drule_tac [3] x = x in fun_cong, simp_all)
haftmann@20944
  1610
  done
haftmann@20944
  1611
haftmann@20944
  1612
lemma mk_left_commute:
haftmann@21547
  1613
  fixes f (infix "\<otimes>" 60)
haftmann@21547
  1614
  assumes a: "\<And>x y z. (x \<otimes> y) \<otimes> z = x \<otimes> (y \<otimes> z)" and
haftmann@21547
  1615
          c: "\<And>x y. x \<otimes> y = y \<otimes> x"
haftmann@21547
  1616
  shows "x \<otimes> (y \<otimes> z) = y \<otimes> (x \<otimes> z)"
haftmann@20944
  1617
  by (rule trans [OF trans [OF c a] arg_cong [OF c, of "f y"]])
haftmann@20944
  1618
haftmann@22218
  1619
lemmas eq_sym_conv = eq_commute
haftmann@22218
  1620
chaieb@23037
  1621
lemma nnf_simps:
chaieb@23037
  1622
  "(\<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)" 
chaieb@23037
  1623
  "(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
  1624
  "(\<not> \<not>(P)) = P"
chaieb@23037
  1625
by blast+
chaieb@23037
  1626
wenzelm@21671
  1627
wenzelm@21671
  1628
subsection {* Basic ML bindings *}
wenzelm@21671
  1629
wenzelm@21671
  1630
ML {*
wenzelm@22129
  1631
val FalseE = @{thm FalseE}
wenzelm@22129
  1632
val Let_def = @{thm Let_def}
wenzelm@22129
  1633
val TrueI = @{thm TrueI}
wenzelm@22129
  1634
val allE = @{thm allE}
wenzelm@22129
  1635
val allI = @{thm allI}
wenzelm@22129
  1636
val all_dupE = @{thm all_dupE}
wenzelm@22129
  1637
val arg_cong = @{thm arg_cong}
wenzelm@22129
  1638
val box_equals = @{thm box_equals}
wenzelm@22129
  1639
val ccontr = @{thm ccontr}
wenzelm@22129
  1640
val classical = @{thm classical}
wenzelm@22129
  1641
val conjE = @{thm conjE}
wenzelm@22129
  1642
val conjI = @{thm conjI}
wenzelm@22129
  1643
val conjunct1 = @{thm conjunct1}
wenzelm@22129
  1644
val conjunct2 = @{thm conjunct2}
wenzelm@22129
  1645
val disjCI = @{thm disjCI}
wenzelm@22129
  1646
val disjE = @{thm disjE}
wenzelm@22129
  1647
val disjI1 = @{thm disjI1}
wenzelm@22129
  1648
val disjI2 = @{thm disjI2}
wenzelm@22129
  1649
val eq_reflection = @{thm eq_reflection}
wenzelm@22129
  1650
val ex1E = @{thm ex1E}
wenzelm@22129
  1651
val ex1I = @{thm ex1I}
wenzelm@22129
  1652
val ex1_implies_ex = @{thm ex1_implies_ex}
wenzelm@22129
  1653
val exE = @{thm exE}
wenzelm@22129
  1654
val exI = @{thm exI}
wenzelm@22129
  1655
val excluded_middle = @{thm excluded_middle}
wenzelm@22129
  1656
val ext = @{thm ext}
wenzelm@22129
  1657
val fun_cong = @{thm fun_cong}
wenzelm@22129
  1658
val iffD1 = @{thm iffD1}
wenzelm@22129
  1659
val iffD2 = @{thm iffD2}
wenzelm@22129
  1660
val iffI = @{thm iffI}
wenzelm@22129
  1661
val impE = @{thm impE}
wenzelm@22129
  1662
val impI = @{thm impI}
wenzelm@22129
  1663
val meta_eq_to_obj_eq = @{thm meta_eq_to_obj_eq}
wenzelm@22129
  1664
val mp = @{thm mp}
wenzelm@22129
  1665
val notE = @{thm notE}
wenzelm@22129
  1666
val notI = @{thm notI}
wenzelm@22129
  1667
val not_all = @{thm not_all}
wenzelm@22129
  1668
val not_ex = @{thm not_ex}
wenzelm@22129
  1669
val not_iff = @{thm not_iff}
wenzelm@22129
  1670
val not_not = @{thm not_not}
wenzelm@22129
  1671
val not_sym = @{thm not_sym}
wenzelm@22129
  1672
val refl = @{thm refl}
wenzelm@22129
  1673
val rev_mp = @{thm rev_mp}
wenzelm@22129
  1674
val spec = @{thm spec}
wenzelm@22129
  1675
val ssubst = @{thm ssubst}
wenzelm@22129
  1676
val subst = @{thm subst}
wenzelm@22129
  1677
val sym = @{thm sym}
wenzelm@22129
  1678
val trans = @{thm trans}
wenzelm@21671
  1679
*}
wenzelm@21671
  1680
wenzelm@21671
  1681
haftmann@28400
  1682
subsection {* Code generator basics -- see further theory @{text "Code_Setup"} *}
haftmann@28400
  1683
haftmann@28400
  1684
text {* Module setup *}
haftmann@28400
  1685
haftmann@28400
  1686
use "~~/src/HOL/Tools/recfun_codegen.ML"
haftmann@23247
  1687
haftmann@28012
  1688
setup {*
haftmann@28400
  1689
  Code_Name.setup
haftmann@28400
  1690
  #> Code_ML.setup
haftmann@28400
  1691
  #> Code_Haskell.setup
haftmann@28400
  1692
  #> Nbe.setup
haftmann@28400
  1693
  #> Codegen.setup
haftmann@28400
  1694
  #> RecfunCodegen.setup
haftmann@28012
  1695
*}
haftmann@28012
  1696
haftmann@23247
  1697
haftmann@28400
  1698
text {* Equality *}
haftmann@24844
  1699
haftmann@26513
  1700
class eq = type +
haftmann@26513
  1701
  fixes eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
haftmann@28400
  1702
  assumes eq_equals: "eq x y \<longleftrightarrow> x = y"
haftmann@26513
  1703
begin
haftmann@26513
  1704
haftmann@28346
  1705
lemma eq: "eq = (op =)"
haftmann@28346
  1706
  by (rule ext eq_equals)+
haftmann@28346
  1707
haftmann@28346
  1708
lemma eq_refl: "eq x x \<longleftrightarrow> True"
haftmann@28346
  1709
  unfolding eq by rule+
haftmann@28346
  1710
haftmann@26513
  1711
end
haftmann@26513
  1712
haftmann@23247
  1713
haftmann@22839
  1714
subsection {* Legacy tactics and ML bindings *}
wenzelm@21671
  1715
wenzelm@21671
  1716
ML {*
wenzelm@21671
  1717
fun strip_tac i = REPEAT (resolve_tac [impI, allI] i);
wenzelm@21671
  1718
wenzelm@21671
  1719
(* combination of (spec RS spec RS ...(j times) ... spec RS mp) *)
wenzelm@21671
  1720
local
wenzelm@21671
  1721
  fun wrong_prem (Const ("All", _) $ (Abs (_, _, t))) = wrong_prem t
wenzelm@21671
  1722
    | wrong_prem (Bound _) = true
wenzelm@21671
  1723
    | wrong_prem _ = false;
wenzelm@21671
  1724
  val filter_right = filter (not o wrong_prem o HOLogic.dest_Trueprop o hd o Thm.prems_of);
wenzelm@21671
  1725
in
wenzelm@21671
  1726
  fun smp i = funpow i (fn m => filter_right ([spec] RL m)) ([mp]);
wenzelm@21671
  1727
  fun smp_tac j = EVERY'[dresolve_tac (smp j), atac];
wenzelm@21671
  1728
end;
haftmann@22839
  1729
haftmann@22839
  1730
val all_conj_distrib = thm "all_conj_distrib";
haftmann@22839
  1731
val all_simps = thms "all_simps";
haftmann@22839
  1732
val atomize_not = thm "atomize_not";
wenzelm@24830
  1733
val case_split = thm "case_split";
haftmann@22839
  1734
val cases_simp = thm "cases_simp";
haftmann@22839
  1735
val choice_eq = thm "choice_eq"
haftmann@22839
  1736
val cong = thm "cong"
haftmann@22839
  1737
val conj_comms = thms "conj_comms";
haftmann@22839
  1738
val conj_cong = thm "conj_cong";
haftmann@22839
  1739
val de_Morgan_conj = thm "de_Morgan_conj";
haftmann@22839
  1740
val de_Morgan_disj = thm "de_Morgan_disj";
haftmann@22839
  1741
val disj_assoc = thm "disj_assoc";
haftmann@22839
  1742
val disj_comms = thms "disj_comms";
haftmann@22839
  1743
val disj_cong = thm "disj_cong";
haftmann@22839
  1744
val eq_ac = thms "eq_ac";
haftmann@22839
  1745
val eq_cong2 = thm "eq_cong2"
haftmann@22839
  1746
val Eq_FalseI = thm "Eq_FalseI";
haftmann@22839
  1747
val Eq_TrueI = thm "Eq_TrueI";
haftmann@22839
  1748
val Ex1_def = thm "Ex1_def"
haftmann@22839
  1749
val ex_disj_distrib = thm "ex_disj_distrib";
haftmann@22839
  1750
val ex_simps = thms "ex_simps";
haftmann@22839
  1751
val if_cancel = thm "if_cancel";
haftmann@22839
  1752
val if_eq_cancel = thm "if_eq_cancel";
haftmann@22839
  1753
val if_False = thm "if_False";
haftmann@22839
  1754
val iff_conv_conj_imp = thm "iff_conv_conj_imp";
haftmann@22839
  1755
val iff = thm "iff"
haftmann@22839
  1756
val if_splits = thms "if_splits";
haftmann@22839
  1757
val if_True = thm "if_True";
haftmann@22839
  1758
val if_weak_cong = thm "if_weak_cong"
haftmann@22839
  1759
val imp_all = thm "imp_all";
haftmann@22839
  1760
val imp_cong = thm "imp_cong";
haftmann@22839
  1761
val imp_conjL = thm "imp_conjL";
haftmann@22839
  1762
val imp_conjR = thm "imp_conjR";
haftmann@22839
  1763
val imp_conv_disj = thm "imp_conv_disj";
haftmann@22839
  1764
val simp_implies_def = thm "simp_implies_def";
haftmann@22839
  1765
val simp_thms = thms "simp_thms";
haftmann@22839
  1766
val split_if = thm "split_if";
haftmann@22839
  1767
val the1_equality = thm "the1_equality"
haftmann@22839
  1768
val theI = thm "theI"
haftmann@22839
  1769
val theI' = thm "theI'"
haftmann@22839
  1770
val True_implies_equals = thm "True_implies_equals";
chaieb@23037
  1771
val nnf_conv = Simplifier.rewrite (HOL_basic_ss addsimps simp_thms @ @{thms "nnf_simps"})
chaieb@23037
  1772
wenzelm@21671
  1773
*}
wenzelm@21671
  1774
kleing@14357
  1775
end