src/HOL/HOL.thy
author haftmann
Mon, 12 Jul 2010 10:48:37 +0200
changeset 37767 a2b7a20d6ea3
parent 37442 037ee7b712b2
child 37781 2fbbf0a48cef
permissions -rw-r--r--
dropped superfluous [code del]s
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     1
(*  Title:      HOL/HOL.thy
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     2
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     3
*)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     5
header {* The basis of Higher-Order Logic *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
     7
theory HOL
30929
d9343c0aac11 code generator bootstrap theory src/Tools/Code_Generator.thy
haftmann
parents: 30927
diff changeset
     8
imports Pure "~~/src/Tools/Code_Generator"
23163
eef345eff987 proper loading of ML files;
wenzelm
parents: 23037
diff changeset
     9
uses
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28856
diff changeset
    10
  ("Tools/hologic.ML")
23171
861f63a35d31 moved IsaPlanner from Provers to Tools;
wenzelm
parents: 23163
diff changeset
    11
  "~~/src/Tools/IsaPlanner/zipper.ML"
861f63a35d31 moved IsaPlanner from Provers to Tools;
wenzelm
parents: 23163
diff changeset
    12
  "~~/src/Tools/IsaPlanner/isand.ML"
861f63a35d31 moved IsaPlanner from Provers to Tools;
wenzelm
parents: 23163
diff changeset
    13
  "~~/src/Tools/IsaPlanner/rw_tools.ML"
861f63a35d31 moved IsaPlanner from Provers to Tools;
wenzelm
parents: 23163
diff changeset
    14
  "~~/src/Tools/IsaPlanner/rw_inst.ML"
30165
6ee87f67d9cd moved generic intuitionistic prover to src/Tools/intuitionistic.ML;
wenzelm
parents: 30160
diff changeset
    15
  "~~/src/Tools/intuitionistic.ML"
30160
5f7b17941730 moved some generic tools to src/Tools/ -- src/Provers is essentially obsolete;
wenzelm
parents: 30063
diff changeset
    16
  "~~/src/Tools/project_rule.ML"
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
    17
  "~~/src/Tools/cong_tac.ML"
23263
0c227412b285 tuned boostrap
haftmann
parents: 23247
diff changeset
    18
  "~~/src/Provers/hypsubst.ML"
0c227412b285 tuned boostrap
haftmann
parents: 23247
diff changeset
    19
  "~~/src/Provers/splitter.ML"
23163
eef345eff987 proper loading of ML files;
wenzelm
parents: 23037
diff changeset
    20
  "~~/src/Provers/classical.ML"
eef345eff987 proper loading of ML files;
wenzelm
parents: 23037
diff changeset
    21
  "~~/src/Provers/blast.ML"
eef345eff987 proper loading of ML files;
wenzelm
parents: 23037
diff changeset
    22
  "~~/src/Provers/clasimp.ML"
30160
5f7b17941730 moved some generic tools to src/Tools/ -- src/Provers is essentially obsolete;
wenzelm
parents: 30063
diff changeset
    23
  "~~/src/Tools/coherent.ML"
5f7b17941730 moved some generic tools to src/Tools/ -- src/Provers is essentially obsolete;
wenzelm
parents: 30063
diff changeset
    24
  "~~/src/Tools/eqsubst.ML"
23163
eef345eff987 proper loading of ML files;
wenzelm
parents: 23037
diff changeset
    25
  "~~/src/Provers/quantifier1.ML"
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28856
diff changeset
    26
  ("Tools/simpdata.ML")
25741
2d102ddaca8b use random_word.ML earlier;
wenzelm
parents: 25534
diff changeset
    27
  "~~/src/Tools/random_word.ML"
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
    28
  "~~/src/Tools/atomize_elim.ML"
24901
d3cbf79769b9 added first version of user-space type system for class target
haftmann
parents: 24844
diff changeset
    29
  "~~/src/Tools/induct.ML"
27326
d3beec370964 moved src/HOL/Tools/induct_tacs.ML to src/Tools/induct_tacs.ML;
wenzelm
parents: 27212
diff changeset
    30
  ("~~/src/Tools/induct_tacs.ML")
29505
c6d2d23909d1 added HOL-Base image
haftmann
parents: 29105
diff changeset
    31
  ("Tools/recfun_codegen.ML")
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
    32
begin
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    33
31299
0c5baf034d0e modernized method setup;
wenzelm
parents: 31173
diff changeset
    34
setup {* Intuitionistic.method_setup @{binding iprover} *}
33316
6a72af4e84b8 modernized some structure names;
wenzelm
parents: 33308
diff changeset
    35
30165
6ee87f67d9cd moved generic intuitionistic prover to src/Tools/intuitionistic.ML;
wenzelm
parents: 30160
diff changeset
    36
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    37
subsection {* Primitive logic *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    38
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    39
subsubsection {* Core syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    40
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14749
diff changeset
    41
classes type
36452
d37c6eed8117 renamed command 'defaultsort' to 'default_sort';
wenzelm
parents: 36365
diff changeset
    42
default_sort type
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35417
diff changeset
    43
setup {* Object_Logic.add_base_sort @{sort type} *}
25460
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    44
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    45
arities
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    46
  "fun" :: (type, type) type
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    47
  itself :: (type) type
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    48
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    49
global
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    50
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    51
typedecl bool
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    52
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    53
judgment
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    54
  Trueprop      :: "bool => prop"                   ("(_)" 5)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    55
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    56
consts
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    57
  Not           :: "bool => bool"                   ("~ _" [40] 40)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    58
  True          :: bool
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    59
  False         :: bool
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    60
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    61
  The           :: "('a => bool) => 'a"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    62
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    63
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    64
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    65
  Let           :: "['a, 'a => 'b] => 'b"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    66
22839
ede26eb5e549 dropped HOL.ML
haftmann
parents: 22744
diff changeset
    67
  "op ="        :: "['a, 'a] => bool"               (infixl "=" 50)
ede26eb5e549 dropped HOL.ML
haftmann
parents: 22744
diff changeset
    68
  "op &"        :: "[bool, bool] => bool"           (infixr "&" 35)
ede26eb5e549 dropped HOL.ML
haftmann
parents: 22744
diff changeset
    69
  "op |"        :: "[bool, bool] => bool"           (infixr "|" 30)
ede26eb5e549 dropped HOL.ML
haftmann
parents: 22744
diff changeset
    70
  "op -->"      :: "[bool, bool] => bool"           (infixr "-->" 25)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    71
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    72
local
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    73
16587
b34c8aa657a5 Constant "If" is now local
paulson
parents: 16417
diff changeset
    74
consts
36363
ebaa558fc698 syntax precedence for If and Let
huffman
parents: 36297
diff changeset
    75
  If            :: "[bool, 'a, 'a] => 'a"           ("(if (_)/ then (_)/ else (_))" [0, 0, 10] 10)
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    76
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    77
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    78
subsubsection {* Additional concrete syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    79
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
    80
notation (output)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    81
  "op ="  (infix "=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    82
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    83
abbreviation
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    84
  not_equal :: "['a, 'a] => bool"  (infixl "~=" 50) where
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    85
  "x ~= y == ~ (x = y)"
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    86
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
    87
notation (output)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    88
  not_equal  (infix "~=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    89
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
    90
notation (xsymbols)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    91
  Not  ("\<not> _" [40] 40) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    92
  "op &"  (infixr "\<and>" 35) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    93
  "op |"  (infixr "\<or>" 30) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    94
  "op -->"  (infixr "\<longrightarrow>" 25) and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    95
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    96
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
    97
notation (HTML output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    98
  Not  ("\<not> _" [40] 40) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
    99
  "op &"  (infixr "\<and>" 35) and
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
   100
  "op |"  (infixr "\<or>" 30) and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   101
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   102
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   103
abbreviation (iff)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
   104
  iff :: "[bool, bool] => bool"  (infixr "<->" 25) where
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   105
  "A <-> B == A = B"
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   106
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
   107
notation (xsymbols)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   108
  iff  (infixr "\<longleftrightarrow>" 25)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   109
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   110
nonterminals
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   111
  letbinds  letbind
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   112
  case_syn  cases_syn
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   113
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   114
syntax
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
   115
  "_The"        :: "[pttrn, bool] => 'a"                 ("(3THE _./ _)" [0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   116
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   117
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   118
  ""            :: "letbind => letbinds"                 ("_")
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   119
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
36363
ebaa558fc698 syntax precedence for If and Let
huffman
parents: 36297
diff changeset
   120
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" [0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   121
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
   122
  "_case_syntax":: "['a, cases_syn] => 'b"               ("(case _ of/ _)" 10)
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
   123
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   124
  ""            :: "case_syn => cases_syn"               ("_")
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
   125
  "_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   126
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   127
translations
35115
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   128
  "THE x. P"              == "CONST The (%x. P)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   129
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
35115
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   130
  "let x = a in e"        == "CONST Let a (%x. e)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   131
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   132
print_translation {*
35115
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   133
  [(@{const_syntax The}, fn [Abs abs] =>
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   134
      let val (x, t) = atomic_abs_tr' abs
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   135
      in Syntax.const @{syntax_const "_The"} $ x $ t end)]
446c5063e4fd modernized translations;
wenzelm
parents: 34991
diff changeset
   136
*}  -- {* To avoid eta-contraction of body *}
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   137
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
   138
syntax (xsymbols)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   139
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ \<Rightarrow>/ _)" 10)
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   140
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   141
notation (xsymbols)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   142
  All  (binder "\<forall>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   143
  Ex  (binder "\<exists>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   144
  Ex1  (binder "\<exists>!" 10)
2372
a2999e19703b fixed alternative quantifier symbol syntax;
wenzelm
parents: 2368
diff changeset
   145
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   146
notation (HTML output)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   147
  All  (binder "\<forall>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   148
  Ex  (binder "\<exists>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   149
  Ex1  (binder "\<exists>!" 10)
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
   150
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   151
notation (HOL)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   152
  All  (binder "! " 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   153
  Ex  (binder "? " 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   154
  Ex1  (binder "?! " 10)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   155
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   156
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   157
subsubsection {* Axioms and basic definitions *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
   158
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   159
axioms
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   160
  refl:           "t = (t::'a)"
28513
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   161
  subst:          "s = t \<Longrightarrow> P s \<Longrightarrow> P t"
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   162
  ext:            "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   163
    -- {*Extensionality is built into the meta-logic, and this rule expresses
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   164
         a related property.  It is an eta-expanded version of the traditional
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   165
         rule, and similar to the ABS rule of HOL*}
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   166
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
   167
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   168
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   169
  impI:           "(P ==> Q) ==> P-->Q"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   170
  mp:             "[| P-->Q;  P |] ==> Q"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   171
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   172
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   173
defs
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   174
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   175
  All_def:      "All(P)    == (P = (%x. True))"
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   176
  Ex_def:       "Ex(P)     == !Q. (!x. P x --> Q) --> Q"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   177
  False_def:    "False     == (!P. P)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   178
  not_def:      "~ P       == P-->False"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   179
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   180
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   181
  Ex1_def:      "Ex1(P)    == ? x. P(x) & (! y. P(y) --> y=x)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   182
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   183
axioms
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   184
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   185
  True_or_False:  "(P=True) | (P=False)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   186
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   187
defs
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   188
  Let_def [code]: "Let s f == f(s)"
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   189
  if_def:         "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)"
5069
3ea049f7979d isatool fixgoal;
wenzelm
parents: 4868
diff changeset
   190
14223
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   191
finalconsts
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   192
  "op ="
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   193
  "op -->"
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   194
  The
22481
79c2724c36b5 added class "default" and expansion axioms for undefined
haftmann
parents: 22473
diff changeset
   195
79c2724c36b5 added class "default" and expansion axioms for undefined
haftmann
parents: 22473
diff changeset
   196
axiomatization
79c2724c36b5 added class "default" and expansion axioms for undefined
haftmann
parents: 22473
diff changeset
   197
  undefined :: 'a
79c2724c36b5 added class "default" and expansion axioms for undefined
haftmann
parents: 22473
diff changeset
   198
29608
564ea783ace8 no base sort in class import
haftmann
parents: 29505
diff changeset
   199
class default =
24901
d3cbf79769b9 added first version of user-space type system for class target
haftmann
parents: 24844
diff changeset
   200
  fixes default :: 'a
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   201
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   202
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   203
subsection {* Fundamental rules *}
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   204
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
   205
subsubsection {* Equality *}
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   206
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   207
lemma sym: "s = t ==> t = s"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   208
  by (erule subst) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   209
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   210
lemma ssubst: "t = s ==> P s ==> P t"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   211
  by (drule sym) (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   212
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   213
lemma trans: "[| r=s; s=t |] ==> r=t"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   214
  by (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   215
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   216
lemma meta_eq_to_obj_eq: 
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   217
  assumes meq: "A == B"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   218
  shows "A = B"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   219
  by (unfold meq) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   220
21502
7f3ea2b3bab6 prefer antiquotations over LaTeX macros;
wenzelm
parents: 21486
diff changeset
   221
text {* Useful with @{text erule} for proving equalities from known equalities. *}
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   222
     (* a = b
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   223
        |   |
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   224
        c = d   *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   225
lemma box_equals: "[| a=b;  a=c;  b=d |] ==> c=d"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   226
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   227
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   228
apply (rule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   229
apply assumption+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   230
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   231
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   232
text {* For calculational reasoning: *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   233
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   234
lemma forw_subst: "a = b ==> P b ==> P a"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   235
  by (rule ssubst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   236
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   237
lemma back_subst: "P a ==> a = b ==> P b"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   238
  by (rule subst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   239
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   240
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   241
subsubsection {* Congruence rules for application *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   242
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   243
text {* Similar to @{text AP_THM} in Gordon's HOL. *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   244
lemma fun_cong: "(f::'a=>'b) = g ==> f(x)=g(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   245
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   246
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   247
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   248
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   249
text {* Similar to @{text AP_TERM} in Gordon's HOL and FOL's @{text subst_context}. *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   250
lemma arg_cong: "x=y ==> f(x)=f(y)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   251
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   252
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   253
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   254
15655
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   255
lemma arg_cong2: "\<lbrakk> a = b; c = d \<rbrakk> \<Longrightarrow> f a c = f b d"
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   256
apply (erule ssubst)+
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   257
apply (rule refl)
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   258
done
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   259
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   260
lemma cong: "[| f = g; (x::'a) = y |] ==> f x = g y"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   261
apply (erule subst)+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   262
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   263
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   264
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   265
ML {* val cong_tac = Cong_Tac.cong_tac @{thm cong} *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   266
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   267
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   268
subsubsection {* Equality of booleans -- iff *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   269
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   270
lemma iffI: assumes "P ==> Q" and "Q ==> P" shows "P=Q"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   271
  by (iprover intro: iff [THEN mp, THEN mp] impI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   272
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   273
lemma iffD2: "[| P=Q; Q |] ==> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   274
  by (erule ssubst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   275
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   276
lemma rev_iffD2: "[| Q; P=Q |] ==> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   277
  by (erule iffD2)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   278
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   279
lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   280
  by (drule sym) (rule iffD2)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   281
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   282
lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   283
  by (drule sym) (rule rev_iffD2)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   284
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   285
lemma iffE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   286
  assumes major: "P=Q"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   287
    and minor: "[| P --> Q; Q --> P |] ==> R"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   288
  shows R
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   289
  by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   290
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   291
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   292
subsubsection {*True*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   293
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   294
lemma TrueI: "True"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   295
  unfolding True_def by (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   296
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   297
lemma eqTrueI: "P ==> P = True"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   298
  by (iprover intro: iffI TrueI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   299
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   300
lemma eqTrueE: "P = True ==> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   301
  by (erule iffD2) (rule TrueI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   302
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   303
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   304
subsubsection {*Universal quantifier*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   305
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   306
lemma allI: assumes "!!x::'a. P(x)" shows "ALL x. P(x)"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   307
  unfolding All_def by (iprover intro: ext eqTrueI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   308
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   309
lemma spec: "ALL x::'a. P(x) ==> P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   310
apply (unfold All_def)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   311
apply (rule eqTrueE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   312
apply (erule fun_cong)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   313
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   314
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   315
lemma allE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   316
  assumes major: "ALL x. P(x)"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   317
    and minor: "P(x) ==> R"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   318
  shows R
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   319
  by (iprover intro: minor major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   320
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   321
lemma all_dupE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   322
  assumes major: "ALL x. P(x)"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   323
    and minor: "[| P(x); ALL x. P(x) |] ==> R"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   324
  shows R
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   325
  by (iprover intro: minor major major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   326
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   327
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   328
subsubsection {* False *}
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   329
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   330
text {*
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   331
  Depends upon @{text spec}; it is impossible to do propositional
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   332
  logic before quantifiers!
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   333
*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   334
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   335
lemma FalseE: "False ==> P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   336
  apply (unfold False_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   337
  apply (erule spec)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   338
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   339
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   340
lemma False_neq_True: "False = True ==> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   341
  by (erule eqTrueE [THEN FalseE])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   342
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   343
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   344
subsubsection {* Negation *}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   345
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   346
lemma notI:
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   347
  assumes "P ==> False"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   348
  shows "~P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   349
  apply (unfold not_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   350
  apply (iprover intro: impI assms)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   351
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   352
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   353
lemma False_not_True: "False ~= True"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   354
  apply (rule notI)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   355
  apply (erule False_neq_True)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   356
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   357
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   358
lemma True_not_False: "True ~= False"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   359
  apply (rule notI)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   360
  apply (drule sym)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   361
  apply (erule False_neq_True)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   362
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   363
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   364
lemma notE: "[| ~P;  P |] ==> R"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   365
  apply (unfold not_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   366
  apply (erule mp [THEN FalseE])
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   367
  apply assumption
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   368
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   369
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   370
lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   371
  by (erule notE [THEN notI]) (erule meta_mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   372
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   373
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   374
subsubsection {*Implication*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   375
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   376
lemma impE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   377
  assumes "P-->Q" "P" "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   378
  shows "R"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   379
by (iprover intro: assms mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   380
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   381
(* Reduces Q to P-->Q, allowing substitution in P. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   382
lemma rev_mp: "[| P;  P --> Q |] ==> Q"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   383
by (iprover intro: mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   384
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   385
lemma contrapos_nn:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   386
  assumes major: "~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   387
      and minor: "P==>Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   388
  shows "~P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   389
by (iprover intro: notI minor major [THEN notE])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   390
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   391
(*not used at all, but we already have the other 3 combinations *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   392
lemma contrapos_pn:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   393
  assumes major: "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   394
      and minor: "P ==> ~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   395
  shows "~P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   396
by (iprover intro: notI minor major notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   397
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   398
lemma not_sym: "t ~= s ==> s ~= t"
21250
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   399
  by (erule contrapos_nn) (erule sym)
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   400
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   401
lemma eq_neq_eq_imp_neq: "[| x = a ; a ~= b; b = y |] ==> x ~= y"
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   402
  by (erule subst, erule ssubst, assumption)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   403
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   404
(*still used in HOLCF*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   405
lemma rev_contrapos:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   406
  assumes pq: "P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   407
      and nq: "~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   408
  shows "~P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   409
apply (rule nq [THEN contrapos_nn])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   410
apply (erule pq)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   411
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   412
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   413
subsubsection {*Existential quantifier*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   414
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   415
lemma exI: "P x ==> EX x::'a. P x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   416
apply (unfold Ex_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   417
apply (iprover intro: allI allE impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   418
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   419
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   420
lemma exE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   421
  assumes major: "EX x::'a. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   422
      and minor: "!!x. P(x) ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   423
  shows "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   424
apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   425
apply (iprover intro: impI [THEN allI] minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   426
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   427
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   428
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   429
subsubsection {*Conjunction*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   430
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   431
lemma conjI: "[| P; Q |] ==> P&Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   432
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   433
apply (iprover intro: impI [THEN allI] mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   434
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   435
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   436
lemma conjunct1: "[| P & Q |] ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   437
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   438
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   439
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   440
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   441
lemma conjunct2: "[| P & Q |] ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   442
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   443
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   444
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   445
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   446
lemma conjE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   447
  assumes major: "P&Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   448
      and minor: "[| P; Q |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   449
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   450
apply (rule minor)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   451
apply (rule major [THEN conjunct1])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   452
apply (rule major [THEN conjunct2])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   453
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   454
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   455
lemma context_conjI:
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   456
  assumes "P" "P ==> Q" shows "P & Q"
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   457
by (iprover intro: conjI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   458
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   459
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   460
subsubsection {*Disjunction*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   461
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   462
lemma disjI1: "P ==> P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   463
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   464
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   465
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   466
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   467
lemma disjI2: "Q ==> P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   468
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   469
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   470
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   471
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   472
lemma disjE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   473
  assumes major: "P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   474
      and minorP: "P ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   475
      and minorQ: "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   476
  shows "R"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   477
by (iprover intro: minorP minorQ impI
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   478
                 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   479
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   480
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   481
subsubsection {*Classical logic*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   482
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   483
lemma classical:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   484
  assumes prem: "~P ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   485
  shows "P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   486
apply (rule True_or_False [THEN disjE, THEN eqTrueE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   487
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   488
apply (rule notI [THEN prem, THEN eqTrueI])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   489
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   490
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   491
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   492
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   493
lemmas ccontr = FalseE [THEN classical, standard]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   494
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   495
(*notE with premises exchanged; it discharges ~R so that it can be used to
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   496
  make elimination rules*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   497
lemma rev_notE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   498
  assumes premp: "P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   499
      and premnot: "~R ==> ~P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   500
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   501
apply (rule ccontr)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   502
apply (erule notE [OF premnot premp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   503
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   504
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   505
(*Double negation law*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   506
lemma notnotD: "~~P ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   507
apply (rule classical)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   508
apply (erule notE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   509
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   510
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   511
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   512
lemma contrapos_pp:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   513
  assumes p1: "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   514
      and p2: "~P ==> ~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   515
  shows "P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   516
by (iprover intro: classical p1 p2 notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   517
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   518
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   519
subsubsection {*Unique existence*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   520
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   521
lemma ex1I:
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   522
  assumes "P a" "!!x. P(x) ==> x=a"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   523
  shows "EX! x. P(x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   524
by (unfold Ex1_def, iprover intro: assms exI conjI allI impI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   525
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   526
text{*Sometimes easier to use: the premises have no shared variables.  Safe!*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   527
lemma ex_ex1I:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   528
  assumes ex_prem: "EX x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   529
      and eq: "!!x y. [| P(x); P(y) |] ==> x=y"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   530
  shows "EX! x. P(x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   531
by (iprover intro: ex_prem [THEN exE] ex1I eq)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   532
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   533
lemma ex1E:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   534
  assumes major: "EX! x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   535
      and minor: "!!x. [| P(x);  ALL y. P(y) --> y=x |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   536
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   537
apply (rule major [unfolded Ex1_def, THEN exE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   538
apply (erule conjE)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   539
apply (iprover intro: minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   540
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   541
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   542
lemma ex1_implies_ex: "EX! x. P x ==> EX x. P x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   543
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   544
apply (rule exI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   545
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   546
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   547
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   548
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   549
subsubsection {*THE: definite description operator*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   550
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   551
lemma the_equality:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   552
  assumes prema: "P a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   553
      and premx: "!!x. P x ==> x=a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   554
  shows "(THE x. P x) = a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   555
apply (rule trans [OF _ the_eq_trivial])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   556
apply (rule_tac f = "The" in arg_cong)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   557
apply (rule ext)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   558
apply (rule iffI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   559
 apply (erule premx)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   560
apply (erule ssubst, rule prema)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   561
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   562
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   563
lemma theI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   564
  assumes "P a" and "!!x. P x ==> x=a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   565
  shows "P (THE x. P x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   566
by (iprover intro: assms the_equality [THEN ssubst])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   567
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   568
lemma theI': "EX! x. P x ==> P (THE x. P x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   569
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   570
apply (erule theI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   571
apply (erule allE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   572
apply (erule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   573
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   574
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   575
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   576
(*Easier to apply than theI: only one occurrence of P*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   577
lemma theI2:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   578
  assumes "P a" "!!x. P x ==> x=a" "!!x. P x ==> Q x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   579
  shows "Q (THE x. P x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   580
by (iprover intro: assms theI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   581
24553
9b19da7b2b08 added lemma
nipkow
parents: 24506
diff changeset
   582
lemma the1I2: assumes "EX! x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)"
9b19da7b2b08 added lemma
nipkow
parents: 24506
diff changeset
   583
by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)]
9b19da7b2b08 added lemma
nipkow
parents: 24506
diff changeset
   584
           elim:allE impE)
9b19da7b2b08 added lemma
nipkow
parents: 24506
diff changeset
   585
18697
86b3f73e3fd5 declare the1_equality [elim?];
wenzelm
parents: 18689
diff changeset
   586
lemma the1_equality [elim?]: "[| EX!x. P x; P a |] ==> (THE x. P x) = a"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   587
apply (rule the_equality)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   588
apply  assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   589
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   590
apply (erule all_dupE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   591
apply (drule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   592
apply  assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   593
apply (erule ssubst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   594
apply (erule allE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   595
apply (erule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   596
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   597
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   598
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   599
lemma the_sym_eq_trivial: "(THE y. x=y) = x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   600
apply (rule the_equality)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   601
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   602
apply (erule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   603
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   604
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   605
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   606
subsubsection {*Classical intro rules for disjunction and existential quantifiers*}
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   607
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   608
lemma disjCI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   609
  assumes "~Q ==> P" shows "P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   610
apply (rule classical)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   611
apply (iprover intro: assms disjI1 disjI2 notI elim: notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   612
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   613
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   614
lemma excluded_middle: "~P | P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   615
by (iprover intro: disjCI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   616
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   617
text {*
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   618
  case distinction as a natural deduction rule.
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   619
  Note that @{term "~P"} is the second case, not the first
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   620
*}
27126
3ede9103de8e eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents: 27107
diff changeset
   621
lemma case_split [case_names True False]:
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   622
  assumes prem1: "P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   623
      and prem2: "~P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   624
  shows "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   625
apply (rule excluded_middle [THEN disjE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   626
apply (erule prem2)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   627
apply (erule prem1)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   628
done
27126
3ede9103de8e eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents: 27107
diff changeset
   629
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   630
(*Classical implies (-->) elimination. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   631
lemma impCE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   632
  assumes major: "P-->Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   633
      and minor: "~P ==> R" "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   634
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   635
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   636
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   637
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   638
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   639
(*This version of --> elimination works on Q before P.  It works best for
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   640
  those cases in which P holds "almost everywhere".  Can't install as
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   641
  default: would break old proofs.*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   642
lemma impCE':
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   643
  assumes major: "P-->Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   644
      and minor: "Q ==> R" "~P ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   645
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   646
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   647
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   648
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   649
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   650
(*Classical <-> elimination. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   651
lemma iffCE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   652
  assumes major: "P=Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   653
      and minor: "[| P; Q |] ==> R"  "[| ~P; ~Q |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   654
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   655
apply (rule major [THEN iffE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   656
apply (iprover intro: minor elim: impCE notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   657
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   658
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   659
lemma exCI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   660
  assumes "ALL x. ~P(x) ==> P(a)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   661
  shows "EX x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   662
apply (rule ccontr)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   663
apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   664
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   665
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   666
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   667
subsubsection {* Intuitionistic Reasoning *}
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   668
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   669
lemma impE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   670
  assumes 1: "P --> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   671
    and 2: "Q ==> R"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   672
    and 3: "P --> Q ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   673
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   674
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   675
  from 3 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   676
  with 1 have Q by (rule impE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   677
  with 2 show R .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   678
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   679
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   680
lemma allE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   681
  assumes 1: "ALL x. P x"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   682
    and 2: "P x ==> ALL x. P x ==> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   683
  shows Q
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   684
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   685
  from 1 have "P x" by (rule spec)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   686
  from this and 1 show Q by (rule 2)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   687
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   688
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   689
lemma notE':
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   690
  assumes 1: "~ P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   691
    and 2: "~ P ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   692
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   693
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   694
  from 2 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   695
  with 1 show R by (rule notE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   696
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   697
22444
fb80fedd192d added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents: 22377
diff changeset
   698
lemma TrueE: "True ==> P ==> P" .
fb80fedd192d added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents: 22377
diff changeset
   699
lemma notFalseE: "~ False ==> P ==> P" .
fb80fedd192d added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents: 22377
diff changeset
   700
22467
c9357ef01168 TrueElim and notTrueElim tested and added as safe elim rules.
dixon
parents: 22445
diff changeset
   701
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   702
  and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   703
  and [Pure.elim 2] = allE notE' impE'
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   704
  and [Pure.intro] = exI disjI2 disjI1
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   705
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   706
lemmas [trans] = trans
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   707
  and [sym] = sym not_sym
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   708
  and [Pure.elim?] = iffD1 iffD2 impE
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   709
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28856
diff changeset
   710
use "Tools/hologic.ML"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   711
11438
3d9222b80989 declare trans [trans] (*overridden in theory Calculation*);
wenzelm
parents: 11432
diff changeset
   712
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   713
subsubsection {* Atomizing meta-level connectives *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   714
28513
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   715
axiomatization where
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   716
  eq_reflection: "x = y \<Longrightarrow> x \<equiv> y" (*admissible axiom*)
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   717
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   718
lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   719
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   720
  assume "!!x. P x"
23389
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
   721
  then show "ALL x. P x" ..
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   722
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   723
  assume "ALL x. P x"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   724
  then show "!!x. P x" by (rule allE)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   725
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   726
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   727
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   728
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   729
  assume r: "A ==> B"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   730
  show "A --> B" by (rule impI) (rule r)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   731
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   732
  assume "A --> B" and A
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   733
  then show B by (rule mp)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   734
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   735
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   736
lemma atomize_not: "(A ==> False) == Trueprop (~A)"
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   737
proof
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   738
  assume r: "A ==> False"
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   739
  show "~A" by (rule notI) (rule r)
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   740
next
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   741
  assume "~A" and A
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   742
  then show False by (rule notE)
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   743
qed
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   744
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   745
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   746
proof
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   747
  assume "x == y"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   748
  show "x = y" by (unfold `x == y`) (rule refl)
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   749
next
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   750
  assume "x = y"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   751
  then show "x == y" by (rule eq_reflection)
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   752
qed
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   753
28856
5e009a80fe6d Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents: 28741
diff changeset
   754
lemma atomize_conj [atomize]: "(A &&& B) == Trueprop (A & B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   755
proof
28856
5e009a80fe6d Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents: 28741
diff changeset
   756
  assume conj: "A &&& B"
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   757
  show "A & B"
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   758
  proof (rule conjI)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   759
    from conj show A by (rule conjunctionD1)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   760
    from conj show B by (rule conjunctionD2)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   761
  qed
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   762
next
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   763
  assume conj: "A & B"
28856
5e009a80fe6d Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents: 28741
diff changeset
   764
  show "A &&& B"
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   765
  proof -
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   766
    from conj show A ..
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   767
    from conj show B ..
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   768
  qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   769
qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   770
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   771
lemmas [symmetric, rulify] = atomize_all atomize_imp
18832
6ab4de872a70 declare 'defn' rules;
wenzelm
parents: 18757
diff changeset
   772
  and [symmetric, defn] = atomize_all atomize_imp atomize_eq
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   773
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   774
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   775
subsubsection {* Atomizing elimination rules *}
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   776
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   777
setup AtomizeElim.setup
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   778
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   779
lemma atomize_exL[atomize_elim]: "(!!x. P x ==> Q) == ((EX x. P x) ==> Q)"
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   780
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   781
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   782
lemma atomize_conjL[atomize_elim]: "(A ==> B ==> C) == (A & B ==> C)"
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   783
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   784
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   785
lemma atomize_disjL[atomize_elim]: "((A ==> C) ==> (B ==> C) ==> C) == ((A | B ==> C) ==> C)"
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   786
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   787
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   788
lemma atomize_elimL[atomize_elim]: "(!!B. (A ==> B) ==> B) == Trueprop A" ..
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   789
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   790
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   791
subsection {* Package setup *}
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   792
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   793
subsubsection {* Sledgehammer setup *}
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   794
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   795
text {*
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   796
Theorems blacklisted to Sledgehammer. These theorems typically produce clauses
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   797
that are prolific (match too many equality or membership literals) and relate to
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   798
seldom-used facts. Some duplicate other rules.
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   799
*}
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   800
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   801
ML {*
36297
6b2b9516a3cd removed obsolete Named_Thm_Set -- Named_Thms provides efficient member operation;
wenzelm
parents: 36246
diff changeset
   802
structure No_ATPs = Named_Thms
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   803
(
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   804
  val name = "no_atp"
36060
4d27652ffb40 reintroduce efficient set structure to collect "no_atp" theorems
blanchet
parents: 35828
diff changeset
   805
  val description = "theorems that should be filtered out by Sledgehammer"
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   806
)
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   807
*}
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   808
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   809
setup {* No_ATPs.setup *}
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   810
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   811
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   812
subsubsection {* Classical Reasoner setup *}
9529
d9434a9277a4 lemmas atomize = all_eq imp_eq;
wenzelm
parents: 9488
diff changeset
   813
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   814
lemma imp_elim: "P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R"
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   815
  by (rule classical) iprover
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   816
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   817
lemma swap: "~ P ==> (~ R ==> P) ==> R"
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   818
  by (rule classical) iprover
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   819
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   820
lemma thin_refl:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   821
  "\<And>X. \<lbrakk> x=x; PROP W \<rbrakk> \<Longrightarrow> PROP W" .
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   822
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   823
ML {*
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   824
structure Hypsubst = HypsubstFun(
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   825
struct
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   826
  structure Simplifier = Simplifier
21218
38013c3a77a2 tuned hypsubst setup;
wenzelm
parents: 21210
diff changeset
   827
  val dest_eq = HOLogic.dest_eq
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   828
  val dest_Trueprop = HOLogic.dest_Trueprop
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   829
  val dest_imp = HOLogic.dest_imp
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   830
  val eq_reflection = @{thm eq_reflection}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   831
  val rev_eq_reflection = @{thm meta_eq_to_obj_eq}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   832
  val imp_intr = @{thm impI}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   833
  val rev_mp = @{thm rev_mp}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   834
  val subst = @{thm subst}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   835
  val sym = @{thm sym}
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   836
  val thin_refl = @{thm thin_refl};
27572
67cd6ed76446 single_hyp(_meta)_subst_tac: Controlled substitution of a single hyp
krauss
parents: 27338
diff changeset
   837
  val prop_subst = @{lemma "PROP P t ==> PROP prop (x = t ==> PROP P x)"
67cd6ed76446 single_hyp(_meta)_subst_tac: Controlled substitution of a single hyp
krauss
parents: 27338
diff changeset
   838
                     by (unfold prop_def) (drule eq_reflection, unfold)}
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   839
end);
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
   840
open Hypsubst;
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   841
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   842
structure Classical = ClassicalFun(
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   843
struct
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   844
  val imp_elim = @{thm imp_elim}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   845
  val not_elim = @{thm notE}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   846
  val swap = @{thm swap}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   847
  val classical = @{thm classical}
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   848
  val sizef = Drule.size_of_thm
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   849
  val hyp_subst_tacs = [Hypsubst.hyp_subst_tac]
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   850
end);
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   851
33308
cf62d1690d04 separate ResBlacklist, based on scalable persistent data -- avoids inefficient hashing later on;
wenzelm
parents: 33185
diff changeset
   852
structure Basic_Classical: BASIC_CLASSICAL = Classical; 
cf62d1690d04 separate ResBlacklist, based on scalable persistent data -- avoids inefficient hashing later on;
wenzelm
parents: 33185
diff changeset
   853
open Basic_Classical;
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   854
27338
2cd6c60cc10b ML_Antiquote.value;
wenzelm
parents: 27326
diff changeset
   855
ML_Antiquote.value "claset"
32149
ef59550a55d3 renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32119
diff changeset
   856
  (Scan.succeed "Classical.claset_of (ML_Context.the_local_context ())");
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   857
*}
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   858
33308
cf62d1690d04 separate ResBlacklist, based on scalable persistent data -- avoids inefficient hashing later on;
wenzelm
parents: 33185
diff changeset
   859
setup Classical.setup
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
   860
21009
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   861
setup {*
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   862
let
35389
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   863
  fun non_bool_eq (@{const_name "op ="}, Type (_, [T, _])) = T <> @{typ bool}
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   864
    | non_bool_eq _ = false;
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   865
  val hyp_subst_tac' =
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   866
    SUBGOAL (fn (goal, i) =>
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   867
      if Term.exists_Const non_bool_eq goal
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   868
      then Hypsubst.hyp_subst_tac i
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   869
      else no_tac);
21009
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   870
in
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   871
  Hypsubst.hypsubst_setup
35389
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   872
  (*prevent substitution on bool*)
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33364
diff changeset
   873
  #> Context_Rules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac)
21009
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   874
end
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   875
*}
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   876
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   877
declare iffI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   878
  and notI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   879
  and impI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   880
  and disjCI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   881
  and conjI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   882
  and TrueI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   883
  and refl [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   884
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   885
declare iffCE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   886
  and FalseE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   887
  and impCE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   888
  and disjE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   889
  and conjE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   890
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   891
declare ex_ex1I [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   892
  and allI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   893
  and the_equality [intro]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   894
  and exI [intro]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   895
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   896
declare exE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   897
  allE [elim]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   898
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22218
diff changeset
   899
ML {* val HOL_cs = @{claset} *}
19162
67436e2a16df Added setup for "atpset" (a rule set for ATPs).
mengj
parents: 19138
diff changeset
   900
20223
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   901
lemma contrapos_np: "~ Q ==> (~ P ==> Q) ==> P"
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   902
  apply (erule swap)
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   903
  apply (erule (1) meta_mp)
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   904
  done
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   905
18689
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   906
declare ex_ex1I [rule del, intro! 2]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   907
  and ex1I [intro]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   908
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   909
lemmas [intro?] = ext
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   910
  and [elim?] = ex1_implies_ex
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   911
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   912
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
   913
lemma alt_ex1E [elim!]:
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   914
  assumes major: "\<exists>!x. P x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   915
      and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   916
  shows R
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   917
apply (rule ex1E [OF major])
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   918
apply (rule prem)
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   919
apply (tactic {* ares_tac @{thms allI} 1 *})+
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   920
apply (tactic {* etac (Classical.dup_elim @{thm allE}) 1 *})
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   921
apply iprover
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   922
done
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   923
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   924
ML {*
32176
893614e2c35c renamed functor BlastFun to Blast, require explicit theory;
wenzelm
parents: 32172
diff changeset
   925
structure Blast = Blast
25388
5cd130251825 tuned specifications of 'notation';
wenzelm
parents: 25297
diff changeset
   926
(
32176
893614e2c35c renamed functor BlastFun to Blast, require explicit theory;
wenzelm
parents: 32172
diff changeset
   927
  val thy = @{theory}
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   928
  type claset = Classical.claset
22744
5cbe966d67a2 Isar definitions are now added explicitly to code theorem table
haftmann
parents: 22481
diff changeset
   929
  val equality_name = @{const_name "op ="}
22993
haftmann
parents: 22839
diff changeset
   930
  val not_name = @{const_name Not}
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   931
  val notE = @{thm notE}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   932
  val ccontr = @{thm ccontr}
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   933
  val contr_tac = Classical.contr_tac
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   934
  val dup_intr = Classical.dup_intr
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   935
  val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   936
  val rep_cs = Classical.rep_cs
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   937
  val cla_modifiers = Classical.cla_modifiers
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   938
  val cla_meth' = Classical.cla_meth'
25388
5cd130251825 tuned specifications of 'notation';
wenzelm
parents: 25297
diff changeset
   939
);
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
   940
val blast_tac = Blast.blast_tac;
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   941
*}
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   942
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   943
setup Blast.setup
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   944
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   945
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   946
subsubsection {* Simplifier *}
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   947
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   948
lemma eta_contract_eq: "(%s. f s) = f" ..
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   949
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   950
lemma simp_thms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   951
  shows not_not: "(~ ~ P) = P"
15354
9234f5765d9c Added > and >= sugar
nipkow
parents: 15288
diff changeset
   952
  and Not_eq_iff: "((~P) = (~Q)) = (P = Q)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   953
  and
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   954
    "(P ~= Q) = (P = (~Q))"
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   955
    "(P | ~P) = True"    "(~P | P) = True"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   956
    "(x = x) = True"
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   957
  and not_True_eq_False [code]: "(\<not> True) = False"
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   958
  and not_False_eq_True [code]: "(\<not> False) = True"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   959
  and
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   960
    "(~P) ~= P"  "P ~= (~P)"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   961
    "(True=P) = P"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   962
  and eq_True: "(P = True) = P"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   963
  and "(False=P) = (~P)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   964
  and eq_False: "(P = False) = (\<not> P)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   965
  and
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   966
    "(True --> P) = P"  "(False --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   967
    "(P --> True) = True"  "(P --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   968
    "(P --> False) = (~P)"  "(P --> ~P) = (~P)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   969
    "(P & True) = P"  "(True & P) = P"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   970
    "(P & False) = False"  "(False & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   971
    "(P & P) = P"  "(P & (P & Q)) = (P & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   972
    "(P & ~P) = False"    "(~P & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   973
    "(P | True) = True"  "(True | P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   974
    "(P | False) = P"  "(False | P) = P"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   975
    "(P | P) = P"  "(P | (P | Q)) = (P | Q)" and
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   976
    "(ALL x. P) = P"  "(EX x. P) = P"  "EX x. x=t"  "EX x. t=x"
31166
a90fe83f58ea "{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents: 31156
diff changeset
   977
  and
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   978
    "!!P. (EX x. x=t & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   979
    "!!P. (EX x. t=x & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   980
    "!!P. (ALL x. x=t --> P(x)) = P(t)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   981
    "!!P. (ALL x. t=x --> P(x)) = P(t)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   982
  by (blast, blast, blast, blast, blast, iprover+)
13421
8fcdf4a26468 simplified locale predicates;
wenzelm
parents: 13412
diff changeset
   983
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   984
lemma disj_absorb: "(A | A) = A"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   985
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   986
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   987
lemma disj_left_absorb: "(A | (A | B)) = (A | B)"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   988
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   989
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   990
lemma conj_absorb: "(A & A) = A"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   991
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   992
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   993
lemma conj_left_absorb: "(A & (A & B)) = (A & B)"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   994
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   995
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   996
lemma eq_ac:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   997
  shows eq_commute: "(a=b) = (b=a)"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   998
    and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   999
    and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (iprover, blast+)
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1000
lemma neq_commute: "(a~=b) = (b~=a)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1001
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1002
lemma conj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1003
  shows conj_commute: "(P&Q) = (Q&P)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1004
    and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by iprover+
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1005
lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1006
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1007
lemmas conj_ac = conj_commute conj_left_commute conj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1008
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1009
lemma disj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1010
  shows disj_commute: "(P|Q) = (Q|P)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1011
    and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by iprover+
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1012
lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1013
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1014
lemmas disj_ac = disj_commute disj_left_commute disj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1015
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1016
lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1017
lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1018
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1019
lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1020
lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1021
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1022
lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1023
lemma imp_conjL: "((P&Q) -->R)  = (P --> (Q --> R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1024
lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1025
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1026
text {* These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1027
lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1028
lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1029
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1030
lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1031
lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1032
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1033
lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1034
  by iprover
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1035
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1036
lemma de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1037
lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1038
lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1039
lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1040
lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1041
lemma disj_not2: "(P | ~Q) = (Q --> P)"  -- {* changes orientation :-( *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1042
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1043
lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1044
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1045
lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1046
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1047
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1048
lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1049
  -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1050
  -- {* cases boil down to the same thing. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1051
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1052
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1053
lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1054
lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1055
lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1056
lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by iprover
23403
9e1edc15ef52 added Theorem all_not_ex
chaieb
parents: 23389
diff changeset
  1057
lemma all_not_ex: "(ALL x. P x) = (~ (EX x. ~ P x ))" by blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1058
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
  1059
declare All_def [no_atp]
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1060
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1061
lemma ex_disj_distrib: "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1062
lemma all_conj_distrib: "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1063
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1064
text {*
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1065
  \medskip The @{text "&"} congruence rule: not included by default!
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1066
  May slow rewrite proofs down by as much as 50\% *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1067
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1068
lemma conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1069
    "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1070
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1071
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1072
lemma rev_conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1073
    "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1074
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1075
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1076
text {* The @{text "|"} congruence rule: not included by default! *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1077
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1078
lemma disj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1079
    "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1080
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1081
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1082
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1083
text {* \medskip if-then-else rules *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1084
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
  1085
lemma if_True [code]: "(if True then x else y) = x"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1086
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1087
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
  1088
lemma if_False [code]: "(if False then x else y) = y"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1089
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1090
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1091
lemma if_P: "P ==> (if P then x else y) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1092
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1093
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1094
lemma if_not_P: "~P ==> (if P then x else y) = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1095
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1096
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1097
lemma split_if: "P (if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1098
  apply (rule case_split [of Q])
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1099
   apply (simplesubst if_P)
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1100
    prefer 3 apply (simplesubst if_not_P, blast+)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1101
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1102
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1103
lemma split_if_asm: "P (if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1104
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1105
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
  1106
lemmas if_splits [no_atp] = split_if split_if_asm
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1107
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1108
lemma if_cancel: "(if c then x else x) = x"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1109
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1110
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1111
lemma if_eq_cancel: "(if x = y then y else x) = x"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1112
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1113
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1114
lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
19796
d86e7b1fc472 quoted "if";
wenzelm
parents: 19656
diff changeset
  1115
  -- {* This form is useful for expanding @{text "if"}s on the RIGHT of the @{text "==>"} symbol. *}
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1116
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1117
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1118
lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
19796
d86e7b1fc472 quoted "if";
wenzelm
parents: 19656
diff changeset
  1119
  -- {* And this form is useful for expanding @{text "if"}s on the LEFT. *}
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1120
  apply (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1121
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1122
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1123
lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1124
lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1125
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1126
text {* \medskip let rules for simproc *}
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1127
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1128
lemma Let_folded: "f x \<equiv> g x \<Longrightarrow>  Let x f \<equiv> Let x g"
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1129
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1130
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1131
lemma Let_unfold: "f x \<equiv> g \<Longrightarrow>  Let x f \<equiv> g"
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1132
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1133
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1134
text {*
16999
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1135
  The following copy of the implication operator is useful for
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1136
  fine-tuning congruence rules.  It instructs the simplifier to simplify
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1137
  its premise.
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1138
*}
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1139
35416
d8d7d1b785af replaced a couple of constsdefs by definitions (also some old primrecs by modern ones)
haftmann
parents: 35115
diff changeset
  1140
definition simp_implies :: "[prop, prop] => prop"  (infixr "=simp=>" 1) where
37767
a2b7a20d6ea3 dropped superfluous [code del]s
haftmann
parents: 37442
diff changeset
  1141
  "simp_implies \<equiv> op ==>"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1142
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1143
lemma simp_impliesI:
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1144
  assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1145
  shows "PROP P =simp=> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1146
  apply (unfold simp_implies_def)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1147
  apply (rule PQ)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1148
  apply assumption
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1149
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1150
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1151
lemma simp_impliesE:
25388
5cd130251825 tuned specifications of 'notation';
wenzelm
parents: 25297
diff changeset
  1152
  assumes PQ: "PROP P =simp=> PROP Q"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1153
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1154
  and QR: "PROP Q \<Longrightarrow> PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1155
  shows "PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1156
  apply (rule QR)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1157
  apply (rule PQ [unfolded simp_implies_def])
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1158
  apply (rule P)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1159
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1160
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1161
lemma simp_implies_cong:
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1162
  assumes PP' :"PROP P == PROP P'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1163
  and P'QQ': "PROP P' ==> (PROP Q == PROP Q')"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1164
  shows "(PROP P =simp=> PROP Q) == (PROP P' =simp=> PROP Q')"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1165
proof (unfold simp_implies_def, rule equal_intr_rule)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1166
  assume PQ: "PROP P \<Longrightarrow> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1167
  and P': "PROP P'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1168
  from PP' [symmetric] and P' have "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1169
    by (rule equal_elim_rule1)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1170
  then have "PROP Q" by (rule PQ)
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1171
  with P'QQ' [OF P'] show "PROP Q'" by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1172
next
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1173
  assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1174
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1175
  from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1176
  then have "PROP Q'" by (rule P'Q')
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1177
  with P'QQ' [OF P', symmetric] show "PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1178
    by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1179
qed
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1180
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1181
lemma uncurry:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1182
  assumes "P \<longrightarrow> Q \<longrightarrow> R"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1183
  shows "P \<and> Q \<longrightarrow> R"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1184
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1185
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1186
lemma iff_allI:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1187
  assumes "\<And>x. P x = Q x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1188
  shows "(\<forall>x. P x) = (\<forall>x. Q x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1189
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1190
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1191
lemma iff_exI:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1192
  assumes "\<And>x. P x = Q x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1193
  shows "(\<exists>x. P x) = (\<exists>x. Q x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1194
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1195
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1196
lemma all_comm:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1197
  "(\<forall>x y. P x y) = (\<forall>y x. P x y)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1198
  by blast
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1199
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1200
lemma ex_comm:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1201
  "(\<exists>x y. P x y) = (\<exists>y x. P x y)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1202
  by blast
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1203
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28856
diff changeset
  1204
use "Tools/simpdata.ML"
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1205
ML {* open Simpdata *}
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1206
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1207
setup {*
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1208
  Simplifier.method_setup Splitter.split_modifiers
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26411
diff changeset
  1209
  #> Simplifier.map_simpset (K Simpdata.simpset_simprocs)
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1210
  #> Splitter.setup
26496
49ae9456eba9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26411
diff changeset
  1211
  #> clasimp_setup
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1212
  #> EqSubst.setup
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1213
*}
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1214
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1215
text {* Simproc for proving @{text "(y = x) == False"} from premise @{text "~(x = y)"}: *}
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1216
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1217
simproc_setup neq ("x = y") = {* fn _ =>
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1218
let
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1219
  val neq_to_EQ_False = @{thm not_sym} RS @{thm Eq_FalseI};
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1220
  fun is_neq eq lhs rhs thm =
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1221
    (case Thm.prop_of thm of
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1222
      _ $ (Not $ (eq' $ l' $ r')) =>
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1223
        Not = HOLogic.Not andalso eq' = eq andalso
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1224
        r' aconv lhs andalso l' aconv rhs
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1225
    | _ => false);
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1226
  fun proc ss ct =
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1227
    (case Thm.term_of ct of
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1228
      eq $ lhs $ rhs =>
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1229
        (case find_first (is_neq eq lhs rhs) (Simplifier.prems_of_ss ss) of
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1230
          SOME thm => SOME (thm RS neq_to_EQ_False)
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1231
        | NONE => NONE)
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1232
     | _ => NONE);
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1233
in proc end;
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1234
*}
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1235
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1236
simproc_setup let_simp ("Let x f") = {*
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1237
let
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1238
  val (f_Let_unfold, x_Let_unfold) =
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1239
    let val [(_ $ (f $ x) $ _)] = prems_of @{thm Let_unfold}
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1240
    in (cterm_of @{theory} f, cterm_of @{theory} x) end
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1241
  val (f_Let_folded, x_Let_folded) =
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1242
    let val [(_ $ (f $ x) $ _)] = prems_of @{thm Let_folded}
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1243
    in (cterm_of @{theory} f, cterm_of @{theory} x) end;
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1244
  val g_Let_folded =
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1245
    let val [(_ $ _ $ (g $ _))] = prems_of @{thm Let_folded}
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1246
    in cterm_of @{theory} g end;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1247
  fun count_loose (Bound i) k = if i >= k then 1 else 0
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1248
    | count_loose (s $ t) k = count_loose s k + count_loose t k
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1249
    | count_loose (Abs (_, _, t)) k = count_loose  t (k + 1)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1250
    | count_loose _ _ = 0;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1251
  fun is_trivial_let (Const (@{const_name Let}, _) $ x $ t) =
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1252
   case t
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1253
    of Abs (_, _, t') => count_loose t' 0 <= 1
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1254
     | _ => true;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1255
in fn _ => fn ss => fn ct => if is_trivial_let (Thm.term_of ct)
31151
1c64b0827ee8 rewrite op = == eq handled by simproc
haftmann
parents: 31132
diff changeset
  1256
  then SOME @{thm Let_def} (*no or one ocurrence of bound variable*)
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1257
  else let (*Norbert Schirmer's case*)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1258
    val ctxt = Simplifier.the_context ss;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1259
    val thy = ProofContext.theory_of ctxt;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1260
    val t = Thm.term_of ct;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1261
    val ([t'], ctxt') = Variable.import_terms false [t] ctxt;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1262
  in Option.map (hd o Variable.export ctxt' ctxt o single)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1263
    (case t' of Const (@{const_name Let},_) $ x $ f => (* x and f are already in normal form *)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1264
      if is_Free x orelse is_Bound x orelse is_Const x
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1265
      then SOME @{thm Let_def}
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1266
      else
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1267
        let
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1268
          val n = case f of (Abs (x, _, _)) => x | _ => "x";
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1269
          val cx = cterm_of thy x;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1270
          val {T = xT, ...} = rep_cterm cx;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1271
          val cf = cterm_of thy f;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1272
          val fx_g = Simplifier.rewrite ss (Thm.capply cf cx);
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1273
          val (_ $ _ $ g) = prop_of fx_g;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1274
          val g' = abstract_over (x,g);
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1275
        in (if (g aconv g')
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1276
             then
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1277
                let
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1278
                  val rl =
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1279
                    cterm_instantiate [(f_Let_unfold, cf), (x_Let_unfold, cx)] @{thm Let_unfold};
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1280
                in SOME (rl OF [fx_g]) end
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1281
             else if Term.betapply (f, x) aconv g then NONE (*avoid identity conversion*)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1282
             else let
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1283
                   val abs_g'= Abs (n,xT,g');
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1284
                   val g'x = abs_g'$x;
36945
9bec62c10714 less pervasive names from structure Thm;
wenzelm
parents: 36936
diff changeset
  1285
                   val g_g'x = Thm.symmetric (Thm.beta_conversion false (cterm_of thy g'x));
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1286
                   val rl = cterm_instantiate
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1287
                             [(f_Let_folded, cterm_of thy f), (x_Let_folded, cx),
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1288
                              (g_Let_folded, cterm_of thy abs_g')]
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1289
                             @{thm Let_folded};
36945
9bec62c10714 less pervasive names from structure Thm;
wenzelm
parents: 36936
diff changeset
  1290
                 in SOME (rl OF [Thm.transitive fx_g g_g'x])
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1291
                 end)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1292
        end
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1293
    | _ => NONE)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1294
  end
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1295
end *}
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1296
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1297
lemma True_implies_equals: "(True \<Longrightarrow> PROP P) \<equiv> PROP P"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1298
proof
23389
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1299
  assume "True \<Longrightarrow> PROP P"
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1300
  from this [OF TrueI] show "PROP P" .
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1301
next
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1302
  assume "PROP P"
23389
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1303
  then show "PROP P" .
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1304
qed
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1305
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1306
lemma ex_simps:
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1307
  "!!P Q. (EX x. P x & Q)   = ((EX x. P x) & Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1308
  "!!P Q. (EX x. P & Q x)   = (P & (EX x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1309
  "!!P Q. (EX x. P x | Q)   = ((EX x. P x) | Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1310
  "!!P Q. (EX x. P | Q x)   = (P | (EX x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1311
  "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1312
  "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1313
  -- {* Miniscoping: pushing in existential quantifiers. *}
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1314
  by (iprover | blast)+
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1315
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1316
lemma all_simps:
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1317
  "!!P Q. (ALL x. P x & Q)   = ((ALL x. P x) & Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1318
  "!!P Q. (ALL x. P & Q x)   = (P & (ALL x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1319
  "!!P Q. (ALL x. P x | Q)   = ((ALL x. P x) | Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1320
  "!!P Q. (ALL x. P | Q x)   = (P | (ALL x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1321
  "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1322
  "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1323
  -- {* Miniscoping: pushing in universal quantifiers. *}
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1324
  by (iprover | blast)+
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1325
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1326
lemmas [simp] =
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1327
  triv_forall_equality (*prunes params*)
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1328
  True_implies_equals  (*prune asms `True'*)
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1329
  if_True
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1330
  if_False
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1331
  if_cancel
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1332
  if_eq_cancel
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1333
  imp_disjL
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1334
  (*In general it seems wrong to add distributive laws by default: they
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1335
    might cause exponential blow-up.  But imp_disjL has been in for a while
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1336
    and cannot be removed without affecting existing proofs.  Moreover,
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1337
    rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1338
    grounds that it allows simplification of R in the two cases.*)
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1339
  conj_assoc
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1340
  disj_assoc
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1341
  de_Morgan_conj
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1342
  de_Morgan_disj
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1343
  imp_disj1
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1344
  imp_disj2
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1345
  not_imp
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1346
  disj_not1
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1347
  not_all
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1348
  not_ex
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1349
  cases_simp
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1350
  the_eq_trivial
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1351
  the_sym_eq_trivial
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1352
  ex_simps
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1353
  all_simps
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1354
  simp_thms
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1355
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1356
lemmas [cong] = imp_cong simp_implies_cong
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1357
lemmas [split] = split_if
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1358
22377
61610b1beedf tuned ML setup;
wenzelm
parents: 22218
diff changeset
  1359
ML {* val HOL_ss = @{simpset} *}
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1360
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1361
text {* Simplifies x assuming c and y assuming ~c *}
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset