src/HOL/HOL.thy
author wenzelm
Tue, 16 May 2006 21:33:01 +0200
changeset 19656 09be06943252
parent 19607 07eeb832f28d
child 19796 d86e7b1fc472
permissions -rw-r--r--
tuned concrete syntax -- abbreviation/const_syntax;
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
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     3
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     4
*)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     6
header {* The basis of Higher-Order Logic *}
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
     8
theory HOL
15140
322485b816ac import -> imports
nipkow
parents: 15131
diff changeset
     9
imports CPure
18595
a52907967bae simplified EqSubst setup;
wenzelm
parents: 18591
diff changeset
    10
uses ("cladata.ML") ("blastdata.ML") ("simpdata.ML")
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
    11
    "Tools/res_atpset.ML"
16775
c1b87ef4a1c3 added lemmas to OrderedGroup.thy (reasoning about signs, absolute value, triangle inequalities)
avigad
parents: 16633
diff changeset
    12
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
    13
begin
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    14
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    15
subsection {* Primitive logic *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    16
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    17
subsubsection {* Core syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    18
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14749
diff changeset
    19
classes type
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    20
defaultsort type
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    21
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    22
global
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    23
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    24
typedecl bool
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    25
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    26
arities
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    27
  bool :: type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
    28
  fun :: (type, type) type
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    29
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    30
judgment
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    31
  Trueprop      :: "bool => prop"                   ("(_)" 5)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    32
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    33
consts
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    34
  Not           :: "bool => bool"                   ("~ _" [40] 40)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    35
  True          :: bool
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    36
  False         :: bool
3947
eb707467f8c5 adapted to qualified names;
wenzelm
parents: 3842
diff changeset
    37
  arbitrary     :: 'a
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    38
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    39
  The           :: "('a => bool) => 'a"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    40
  All           :: "('a => bool) => bool"           (binder "ALL " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    41
  Ex            :: "('a => bool) => bool"           (binder "EX " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    42
  Ex1           :: "('a => bool) => bool"           (binder "EX! " 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    43
  Let           :: "['a, 'a => 'b] => 'b"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    44
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    45
  "="           :: "['a, 'a] => bool"               (infixl 50)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    46
  &             :: "[bool, bool] => bool"           (infixr 35)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    47
  "|"           :: "[bool, bool] => bool"           (infixr 30)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    48
  -->           :: "[bool, bool] => bool"           (infixr 25)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    49
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    50
local
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
    51
16587
b34c8aa657a5 Constant "If" is now local
paulson
parents: 16417
diff changeset
    52
consts
b34c8aa657a5 Constant "If" is now local
paulson
parents: 16417
diff changeset
    53
  If            :: "[bool, 'a, 'a] => 'a"           ("(if (_)/ then (_)/ else (_))" 10)
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    54
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    55
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    56
subsubsection {* Additional concrete syntax *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    57
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    58
const_syntax (output)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    59
  "op ="  (infix "=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    60
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    61
abbreviation
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    62
  not_equal     :: "['a, 'a] => bool"               (infixl "~=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    63
  "x ~= y == ~ (x = y)"
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    64
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    65
const_syntax (output)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    66
  not_equal  (infix "~=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    67
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    68
const_syntax (xsymbols)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    69
  Not  ("\<not> _" [40] 40)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    70
  "op &"  (infixr "\<and>" 35)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    71
  "op |"  (infixr "\<or>" 30)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    72
  "op -->"  (infixr "\<longrightarrow>" 25)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    73
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    74
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    75
const_syntax (HTML output)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    76
  Not  ("\<not> _" [40] 40)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    77
  "op &"  (infixr "\<and>" 35)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    78
  "op |"  (infixr "\<or>" 30)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    79
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    80
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    81
abbreviation (iff)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    82
  iff :: "[bool, bool] => bool"  (infixr "<->" 25)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    83
  "A <-> B == A = B"
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    84
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    85
const_syntax (xsymbols)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    86
  iff  (infixr "\<longleftrightarrow>" 25)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    87
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    88
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
    89
nonterminals
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    90
  letbinds  letbind
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    91
  case_syn  cases_syn
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    92
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    93
syntax
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
    94
  "_The"        :: "[pttrn, bool] => 'a"                 ("(3THE _./ _)" [0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    95
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    96
  "_bind"       :: "[pttrn, 'a] => letbind"              ("(2_ =/ _)" 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    97
  ""            :: "letbind => letbinds"                 ("_")
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    98
  "_binds"      :: "[letbind, letbinds] => letbinds"     ("_;/ _")
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    99
  "_Let"        :: "[letbinds, 'a] => 'a"                ("(let (_)/ in (_))" 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   100
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
   101
  "_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
   102
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ =>/ _)" 10)
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   103
  ""            :: "case_syn => cases_syn"               ("_")
9060
b0dd884b1848 rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents: 8959
diff changeset
   104
  "_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ | _")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   105
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   106
translations
13764
3e180bf68496 removed some problems with print translations
nipkow
parents: 13763
diff changeset
   107
  "THE x. P"              == "The (%x. P)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   108
  "_Let (_binds b bs) e"  == "_Let b (_Let bs e)"
1114
c8dfb56a7e95 Prod is now a parent of Lfp.
nipkow
parents: 1068
diff changeset
   109
  "let x = a in e"        == "Let a (%x. e)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   111
print_translation {*
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   112
(* To avoid eta-contraction of body: *)
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   113
[("The", fn [Abs abs] =>
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   114
     let val (x,t) = atomic_abs_tr' abs
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   115
     in Syntax.const "_The" $ x $ t end)]
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   116
*}
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   117
12114
a8e860c86252 eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents: 12023
diff changeset
   118
syntax (xsymbols)
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   119
  "ALL "        :: "[idts, bool] => bool"                ("(3\<forall>_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   120
  "EX "         :: "[idts, bool] => bool"                ("(3\<exists>_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   121
  "EX! "        :: "[idts, bool] => bool"                ("(3\<exists>!_./ _)" [0, 10] 10)
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   122
  "_case1"      :: "['a, 'b] => case_syn"                ("(2_ \<Rightarrow>/ _)" 10)
14361
ad2f5da643b4 * Support for raw latex output in control symbols: \<^raw...>
schirmer
parents: 14357
diff changeset
   123
(*"_case2"      :: "[case_syn, cases_syn] => cases_syn"  ("_/ \<orelse> _")*)
2372
a2999e19703b fixed alternative quantifier symbol syntax;
wenzelm
parents: 2368
diff changeset
   124
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
   125
syntax (HTML output)
14565
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14444
diff changeset
   126
  "ALL "        :: "[idts, bool] => bool"                ("(3\<forall>_./ _)" [0, 10] 10)
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14444
diff changeset
   127
  "EX "         :: "[idts, bool] => bool"                ("(3\<exists>_./ _)" [0, 10] 10)
c6dc17aab88a use more symbols in HTML output
kleing
parents: 14444
diff changeset
   128
  "EX! "        :: "[idts, bool] => bool"                ("(3\<exists>!_./ _)" [0, 10] 10)
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
   129
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   130
syntax (HOL)
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   131
  "ALL "        :: "[idts, bool] => bool"                ("(3! _./ _)" [0, 10] 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   132
  "EX "         :: "[idts, bool] => bool"                ("(3? _./ _)" [0, 10] 10)
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   133
  "EX! "        :: "[idts, bool] => bool"                ("(3?! _./ _)" [0, 10] 10)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   134
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   135
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   136
subsubsection {* Axioms and basic definitions *}
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
   137
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   138
axioms
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   139
  eq_reflection:  "(x=y) ==> (x==y)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   140
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   141
  refl:           "t = (t::'a)"
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   142
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   143
  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
   144
    -- {*Extensionality is built into the meta-logic, and this rule expresses
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   145
         a related property.  It is an eta-expanded version of the traditional
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   146
         rule, and similar to the ABS rule of HOL*}
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   147
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
   148
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   149
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   150
  impI:           "(P ==> Q) ==> P-->Q"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   151
  mp:             "[| P-->Q;  P |] ==> Q"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   152
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   153
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   154
text{*Thanks to Stephan Merz*}
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   155
theorem subst:
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   156
  assumes eq: "s = t" and p: "P(s)"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   157
  shows "P(t::'a)"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   158
proof -
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   159
  from eq have meta: "s \<equiv> t"
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   160
    by (rule eq_reflection)
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   161
  from p show ?thesis
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   162
    by (unfold meta)
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   163
qed
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   164
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   165
defs
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   166
  True_def:     "True      == ((%x::bool. x) = (%x. x))"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   167
  All_def:      "All(P)    == (P = (%x. True))"
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   168
  Ex_def:       "Ex(P)     == !Q. (!x. P x --> Q) --> Q"
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   169
  False_def:    "False     == (!P. P)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   170
  not_def:      "~ P       == P-->False"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   171
  and_def:      "P & Q     == !R. (P-->Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   172
  or_def:       "P | Q     == !R. (P-->R) --> (Q-->R) --> R"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   173
  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
   174
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   175
axioms
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   176
  iff:          "(P-->Q) --> (Q-->P) --> (P=Q)"
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   177
  True_or_False:  "(P=True) | (P=False)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   178
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   179
defs
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
   180
  Let_def:      "Let s f == f(s)"
11451
8abfb4f7bd02 partial restructuring to reduce dependence on Axiom of Choice
paulson
parents: 11438
diff changeset
   181
  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
   182
14223
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   183
finalconsts
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   184
  "op ="
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   185
  "op -->"
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   186
  The
0ee05eef881b Added support for making constants final, that is, ensuring that no
skalberg
parents: 14208
diff changeset
   187
  arbitrary
3320
3a5e4930fb77 Added `arbitrary'
nipkow
parents: 3248
diff changeset
   188
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   189
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   190
subsubsection {* Generic algebraic operations *}
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   191
12338
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   192
axclass zero < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   193
axclass one < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   194
axclass plus < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   195
axclass minus < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   196
axclass times < type
de0f4a63baa5 renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents: 12281
diff changeset
   197
axclass inverse < type
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   198
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   199
consts
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   200
  plus             :: "['a::plus, 'a]  => 'a"       (infixl "+" 65)
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   201
  uminus           :: "'a::minus => 'a"             ("- _" [81] 80)
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   202
  minus            :: "['a::minus, 'a] => 'a"       (infixl "-" 65)
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   203
  abs              :: "'a::minus => 'a"
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   204
  times            :: "['a::times, 'a] => 'a"       (infixl "*" 70)
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   205
  inverse          :: "'a::inverse => 'a"
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   206
  divide           :: "['a::inverse, 'a] => 'a"     (infixl "'/" 70)
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19174
diff changeset
   207
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   208
global
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   209
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   210
consts
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   211
  "0"           :: "'a::zero"                       ("0")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   212
  "1"           :: "'a::one"                        ("1")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   213
13456
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   214
syntax
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   215
  "_index1"  :: index    ("\<^sub>1")
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   216
translations
14690
f61ea8bfa81e _index1: accomodate improved indexed syntax;
wenzelm
parents: 14590
diff changeset
   217
  (index) "\<^sub>1" => (index) "\<^bsub>\<struct>\<^esub>"
13456
42601eb7553f special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents: 13438
diff changeset
   218
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   219
local
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   220
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   221
typed_print_translation {*
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   222
  let
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   223
    fun tr' c = (c, fn show_sorts => fn T => fn ts =>
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   224
      if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   225
      else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T);
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   226
  in [tr' "0", tr' "1"] end;
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   227
*} -- {* show types that are presumably too general *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   228
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   229
syntax (xsymbols)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   230
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   231
syntax (HTML output)
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   232
  abs :: "'a::minus => 'a"    ("\<bar>_\<bar>")
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   233
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   234
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   235
subsection {*Equality*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   236
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   237
lemma sym: "s = t ==> t = s"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   238
  by (erule subst) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   239
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   240
lemma ssubst: "t = s ==> P s ==> P t"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   241
  by (drule sym) (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   242
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   243
lemma trans: "[| r=s; s=t |] ==> r=t"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   244
  by (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   245
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   246
lemma def_imp_eq: assumes meq: "A == B" shows "A = B"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   247
  by (unfold meq) (rule refl)
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   248
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   249
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   250
(*Useful with eresolve_tac for proving equalties from known equalities.
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   251
        a = b
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   252
        |   |
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   253
        c = d   *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   254
lemma box_equals: "[| a=b;  a=c;  b=d |] ==> c=d"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   255
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   256
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   257
apply (rule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   258
apply assumption+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   259
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   260
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   261
text {* For calculational reasoning: *}
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   262
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   263
lemma forw_subst: "a = b ==> P b ==> P a"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   264
  by (rule ssubst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   265
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   266
lemma back_subst: "P a ==> a = b ==> P b"
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   267
  by (rule subst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   268
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   269
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   270
subsection {*Congruence rules for application*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   271
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   272
(*similar to AP_THM in Gordon's HOL*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   273
lemma fun_cong: "(f::'a=>'b) = g ==> f(x)=g(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   274
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   275
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   276
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   277
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   278
(*similar to AP_TERM in Gordon's HOL and FOL's subst_context*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   279
lemma arg_cong: "x=y ==> f(x)=f(y)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   280
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   281
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   282
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   283
15655
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   284
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
   285
apply (erule ssubst)+
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   286
apply (rule refl)
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   287
done
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   288
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   289
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   290
lemma cong: "[| f = g; (x::'a) = y |] ==> f(x) = g(y)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   291
apply (erule subst)+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   292
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   293
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   294
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   295
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   296
subsection {*Equality of booleans -- iff*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   297
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   298
lemma iffI: assumes prems: "P ==> Q" "Q ==> P" shows "P=Q"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   299
  by (iprover intro: iff [THEN mp, THEN mp] impI prems)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   300
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   301
lemma iffD2: "[| P=Q; Q |] ==> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   302
  by (erule ssubst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   303
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   304
lemma rev_iffD2: "[| Q; P=Q |] ==> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   305
  by (erule iffD2)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   306
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   307
lemmas iffD1 = sym [THEN iffD2, standard]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   308
lemmas rev_iffD1 = sym [THEN [2] rev_iffD2, standard]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   309
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   310
lemma iffE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   311
  assumes major: "P=Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   312
      and minor: "[| P --> Q; Q --> P |] ==> R"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   313
  shows R
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   314
  by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   315
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   316
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   317
subsection {*True*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   318
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   319
lemma TrueI: "True"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   320
  by (unfold True_def) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   321
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   322
lemma eqTrueI: "P ==> P=True"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   323
  by (iprover intro: iffI TrueI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   324
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   325
lemma eqTrueE: "P=True ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   326
apply (erule iffD2)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   327
apply (rule TrueI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   328
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   329
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   330
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   331
subsection {*Universal quantifier*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   332
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   333
lemma allI: assumes p: "!!x::'a. P(x)" shows "ALL x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   334
apply (unfold All_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   335
apply (iprover intro: ext eqTrueI p)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   336
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   337
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   338
lemma spec: "ALL x::'a. P(x) ==> P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   339
apply (unfold All_def)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   340
apply (rule eqTrueE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   341
apply (erule fun_cong)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   342
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   343
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   344
lemma allE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   345
  assumes major: "ALL x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   346
      and minor: "P(x) ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   347
  shows "R"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   348
by (iprover intro: minor major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   349
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   350
lemma all_dupE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   351
  assumes major: "ALL x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   352
      and minor: "[| P(x); ALL x. P(x) |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   353
  shows "R"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   354
by (iprover intro: minor major major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   355
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   356
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   357
subsection {*False*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   358
(*Depends upon spec; it is impossible to do propositional logic before quantifiers!*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   359
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   360
lemma FalseE: "False ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   361
apply (unfold False_def)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   362
apply (erule spec)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   363
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   364
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   365
lemma False_neq_True: "False=True ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   366
by (erule eqTrueE [THEN FalseE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   367
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   368
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   369
subsection {*Negation*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   370
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   371
lemma notI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   372
  assumes p: "P ==> False"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   373
  shows "~P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   374
apply (unfold not_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   375
apply (iprover intro: impI p)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   376
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   377
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   378
lemma False_not_True: "False ~= True"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   379
apply (rule notI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   380
apply (erule False_neq_True)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   381
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   382
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   383
lemma True_not_False: "True ~= False"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   384
apply (rule notI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   385
apply (drule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   386
apply (erule False_neq_True)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   387
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   388
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   389
lemma notE: "[| ~P;  P |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   390
apply (unfold not_def)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   391
apply (erule mp [THEN FalseE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   392
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   393
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   394
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   395
(* Alternative ~ introduction rule: [| P ==> ~ Pa; P ==> Pa |] ==> ~ P *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   396
lemmas notI2 = notE [THEN notI, standard]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   397
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   398
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   399
subsection {*Implication*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   400
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   401
lemma impE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   402
  assumes "P-->Q" "P" "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   403
  shows "R"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   404
by (iprover intro: prems mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   405
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   406
(* Reduces Q to P-->Q, allowing substitution in P. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   407
lemma rev_mp: "[| P;  P --> Q |] ==> Q"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   408
by (iprover intro: mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   409
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   410
lemma contrapos_nn:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   411
  assumes major: "~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   412
      and minor: "P==>Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   413
  shows "~P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   414
by (iprover intro: notI minor major [THEN notE])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   415
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   416
(*not used at all, but we already have the other 3 combinations *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   417
lemma contrapos_pn:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   418
  assumes major: "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   419
      and minor: "P ==> ~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   420
  shows "~P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   421
by (iprover intro: notI minor major notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   422
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   423
lemma not_sym: "t ~= s ==> s ~= t"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   424
apply (erule contrapos_nn)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   425
apply (erule sym)
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
(*still used in HOLCF*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   429
lemma rev_contrapos:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   430
  assumes pq: "P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   431
      and nq: "~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   432
  shows "~P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   433
apply (rule nq [THEN contrapos_nn])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   434
apply (erule pq)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   435
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   436
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   437
subsection {*Existential quantifier*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   438
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   439
lemma exI: "P x ==> EX x::'a. P x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   440
apply (unfold Ex_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   441
apply (iprover intro: allI allE impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   442
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   443
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   444
lemma exE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   445
  assumes major: "EX x::'a. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   446
      and minor: "!!x. P(x) ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   447
  shows "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   448
apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   449
apply (iprover intro: impI [THEN allI] minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   450
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   451
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   452
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   453
subsection {*Conjunction*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   454
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   455
lemma conjI: "[| P; Q |] ==> P&Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   456
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   457
apply (iprover intro: impI [THEN allI] mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   458
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   459
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   460
lemma conjunct1: "[| P & Q |] ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   461
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   462
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   463
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   464
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   465
lemma conjunct2: "[| P & Q |] ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   466
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   467
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   468
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   469
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   470
lemma conjE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   471
  assumes major: "P&Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   472
      and minor: "[| P; Q |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   473
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   474
apply (rule minor)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   475
apply (rule major [THEN conjunct1])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   476
apply (rule major [THEN conjunct2])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   477
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   478
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   479
lemma context_conjI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   480
  assumes prems: "P" "P ==> Q" shows "P & Q"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   481
by (iprover intro: conjI prems)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   482
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   483
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   484
subsection {*Disjunction*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   485
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   486
lemma disjI1: "P ==> P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   487
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   488
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   489
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   490
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   491
lemma disjI2: "Q ==> P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   492
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   493
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   494
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   495
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   496
lemma disjE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   497
  assumes major: "P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   498
      and minorP: "P ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   499
      and minorQ: "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   500
  shows "R"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   501
by (iprover intro: minorP minorQ impI
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   502
                 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   503
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   504
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   505
subsection {*Classical logic*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   506
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   507
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   508
lemma classical:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   509
  assumes prem: "~P ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   510
  shows "P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   511
apply (rule True_or_False [THEN disjE, THEN eqTrueE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   512
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   513
apply (rule notI [THEN prem, THEN eqTrueI])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   514
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   515
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   516
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   517
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   518
lemmas ccontr = FalseE [THEN classical, standard]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   519
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   520
(*notE with premises exchanged; it discharges ~R so that it can be used to
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   521
  make elimination rules*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   522
lemma rev_notE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   523
  assumes premp: "P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   524
      and premnot: "~R ==> ~P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   525
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   526
apply (rule ccontr)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   527
apply (erule notE [OF premnot premp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   528
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   529
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   530
(*Double negation law*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   531
lemma notnotD: "~~P ==> P"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   532
apply (rule classical)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   533
apply (erule notE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   534
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   535
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   536
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   537
lemma contrapos_pp:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   538
  assumes p1: "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   539
      and p2: "~P ==> ~Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   540
  shows "P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   541
by (iprover intro: classical p1 p2 notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   542
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   543
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   544
subsection {*Unique existence*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   545
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   546
lemma ex1I:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   547
  assumes prems: "P a" "!!x. P(x) ==> x=a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   548
  shows "EX! x. P(x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   549
by (unfold Ex1_def, iprover intro: prems exI conjI allI impI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   550
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   551
text{*Sometimes easier to use: the premises have no shared variables.  Safe!*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   552
lemma ex_ex1I:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   553
  assumes ex_prem: "EX x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   554
      and eq: "!!x y. [| P(x); P(y) |] ==> x=y"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   555
  shows "EX! x. P(x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   556
by (iprover intro: ex_prem [THEN exE] ex1I eq)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   557
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   558
lemma ex1E:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   559
  assumes major: "EX! x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   560
      and minor: "!!x. [| P(x);  ALL y. P(y) --> y=x |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   561
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   562
apply (rule major [unfolded Ex1_def, THEN exE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   563
apply (erule conjE)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   564
apply (iprover intro: minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   565
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   566
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   567
lemma ex1_implies_ex: "EX! x. P x ==> EX x. P x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   568
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   569
apply (rule exI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   570
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   571
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   572
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   573
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   574
subsection {*THE: definite description operator*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   575
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   576
lemma the_equality:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   577
  assumes prema: "P a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   578
      and premx: "!!x. P x ==> x=a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   579
  shows "(THE x. P x) = a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   580
apply (rule trans [OF _ the_eq_trivial])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   581
apply (rule_tac f = "The" in arg_cong)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   582
apply (rule ext)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   583
apply (rule iffI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   584
 apply (erule premx)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   585
apply (erule ssubst, rule prema)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   586
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   587
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   588
lemma theI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   589
  assumes "P a" and "!!x. P x ==> x=a"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   590
  shows "P (THE x. P x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   591
by (iprover intro: prems the_equality [THEN ssubst])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   592
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   593
lemma theI': "EX! x. P x ==> P (THE x. P x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   594
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   595
apply (erule theI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   596
apply (erule allE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   597
apply (erule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   598
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   599
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   600
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   601
(*Easier to apply than theI: only one occurrence of P*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   602
lemma theI2:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   603
  assumes "P a" "!!x. P x ==> x=a" "!!x. P x ==> Q x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   604
  shows "Q (THE x. P x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   605
by (iprover intro: prems theI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   606
18697
86b3f73e3fd5 declare the1_equality [elim?];
wenzelm
parents: 18689
diff changeset
   607
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
   608
apply (rule the_equality)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   609
apply  assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   610
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   611
apply (erule all_dupE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   612
apply (drule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   613
apply  assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   614
apply (erule ssubst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   615
apply (erule allE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   616
apply (erule mp)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   617
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   618
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   619
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   620
lemma the_sym_eq_trivial: "(THE y. x=y) = x"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   621
apply (rule the_equality)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   622
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   623
apply (erule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   624
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   625
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   626
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   627
subsection {*Classical intro rules for disjunction and existential quantifiers*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   628
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   629
lemma disjCI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   630
  assumes "~Q ==> P" shows "P|Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   631
apply (rule classical)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   632
apply (iprover intro: prems disjI1 disjI2 notI elim: notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   633
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   634
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   635
lemma excluded_middle: "~P | P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   636
by (iprover intro: disjCI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   637
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   638
text{*case distinction as a natural deduction rule. Note that @{term "~P"}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   639
   is the second case, not the first.*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   640
lemma case_split_thm:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   641
  assumes prem1: "P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   642
      and prem2: "~P ==> Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   643
  shows "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   644
apply (rule excluded_middle [THEN disjE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   645
apply (erule prem2)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   646
apply (erule prem1)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   647
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   648
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   649
(*Classical implies (-->) elimination. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   650
lemma impCE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   651
  assumes major: "P-->Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   652
      and minor: "~P ==> R" "Q ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   653
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   654
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   655
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   656
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   657
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   658
(*This version of --> elimination works on Q before P.  It works best for
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   659
  those cases in which P holds "almost everywhere".  Can't install as
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   660
  default: would break old proofs.*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   661
lemma impCE':
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   662
  assumes major: "P-->Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   663
      and minor: "Q ==> R" "~P ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   664
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   665
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   666
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   667
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   668
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   669
(*Classical <-> elimination. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   670
lemma iffCE:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   671
  assumes major: "P=Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   672
      and minor: "[| P; Q |] ==> R"  "[| ~P; ~Q |] ==> R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   673
  shows "R"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   674
apply (rule major [THEN iffE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   675
apply (iprover intro: minor elim: impCE notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   676
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   677
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   678
lemma exCI:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   679
  assumes "ALL x. ~P(x) ==> P(a)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   680
  shows "EX x. P(x)"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   681
apply (rule ccontr)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   682
apply (iprover intro: prems exI allI notI notE [of "\<exists>x. P x"])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   683
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   684
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   685
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   686
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   687
subsection {* Theory and package setup *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   688
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   689
ML
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   690
{*
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   691
val eq_reflection = thm "eq_reflection"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   692
val refl = thm "refl"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   693
val subst = thm "subst"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   694
val ext = thm "ext"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   695
val impI = thm "impI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   696
val mp = thm "mp"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   697
val True_def = thm "True_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   698
val All_def = thm "All_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   699
val Ex_def = thm "Ex_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   700
val False_def = thm "False_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   701
val not_def = thm "not_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   702
val and_def = thm "and_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   703
val or_def = thm "or_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   704
val Ex1_def = thm "Ex1_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   705
val iff = thm "iff"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   706
val True_or_False = thm "True_or_False"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   707
val Let_def = thm "Let_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   708
val if_def = thm "if_def"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   709
val sym = thm "sym"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   710
val ssubst = thm "ssubst"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   711
val trans = thm "trans"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   712
val def_imp_eq = thm "def_imp_eq"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   713
val box_equals = thm "box_equals"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   714
val fun_cong = thm "fun_cong"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   715
val arg_cong = thm "arg_cong"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   716
val cong = thm "cong"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   717
val iffI = thm "iffI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   718
val iffD2 = thm "iffD2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   719
val rev_iffD2 = thm "rev_iffD2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   720
val iffD1 = thm "iffD1"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   721
val rev_iffD1 = thm "rev_iffD1"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   722
val iffE = thm "iffE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   723
val TrueI = thm "TrueI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   724
val eqTrueI = thm "eqTrueI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   725
val eqTrueE = thm "eqTrueE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   726
val allI = thm "allI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   727
val spec = thm "spec"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   728
val allE = thm "allE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   729
val all_dupE = thm "all_dupE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   730
val FalseE = thm "FalseE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   731
val False_neq_True = thm "False_neq_True"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   732
val notI = thm "notI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   733
val False_not_True = thm "False_not_True"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   734
val True_not_False = thm "True_not_False"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   735
val notE = thm "notE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   736
val notI2 = thm "notI2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   737
val impE = thm "impE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   738
val rev_mp = thm "rev_mp"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   739
val contrapos_nn = thm "contrapos_nn"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   740
val contrapos_pn = thm "contrapos_pn"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   741
val not_sym = thm "not_sym"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   742
val rev_contrapos = thm "rev_contrapos"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   743
val exI = thm "exI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   744
val exE = thm "exE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   745
val conjI = thm "conjI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   746
val conjunct1 = thm "conjunct1"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   747
val conjunct2 = thm "conjunct2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   748
val conjE = thm "conjE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   749
val context_conjI = thm "context_conjI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   750
val disjI1 = thm "disjI1"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   751
val disjI2 = thm "disjI2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   752
val disjE = thm "disjE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   753
val classical = thm "classical"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   754
val ccontr = thm "ccontr"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   755
val rev_notE = thm "rev_notE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   756
val notnotD = thm "notnotD"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   757
val contrapos_pp = thm "contrapos_pp"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   758
val ex1I = thm "ex1I"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   759
val ex_ex1I = thm "ex_ex1I"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   760
val ex1E = thm "ex1E"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   761
val ex1_implies_ex = thm "ex1_implies_ex"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   762
val the_equality = thm "the_equality"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   763
val theI = thm "theI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   764
val theI' = thm "theI'"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   765
val theI2 = thm "theI2"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   766
val the1_equality = thm "the1_equality"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   767
val the_sym_eq_trivial = thm "the_sym_eq_trivial"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   768
val disjCI = thm "disjCI"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   769
val excluded_middle = thm "excluded_middle"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   770
val case_split_thm = thm "case_split_thm"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   771
val impCE = thm "impCE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   772
val impCE = thm "impCE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   773
val iffCE = thm "iffCE"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   774
val exCI = thm "exCI"
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   775
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   776
(* combination of (spec RS spec RS ...(j times) ... spec RS mp) *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   777
local
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   778
  fun wrong_prem (Const ("All", _) $ (Abs (_, _, t))) = wrong_prem t
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   779
  |   wrong_prem (Bound _) = true
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   780
  |   wrong_prem _ = false
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15524
diff changeset
   781
  val filter_right = List.filter (fn t => not (wrong_prem (HOLogic.dest_Trueprop (hd (Thm.prems_of t)))))
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   782
in
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   783
  fun smp i = funpow i (fn m => filter_right ([spec] RL m)) ([mp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   784
  fun smp_tac j = EVERY'[dresolve_tac (smp j), atac]
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   785
end
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   786
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   787
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   788
fun strip_tac i = REPEAT(resolve_tac [impI,allI] i)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   789
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   790
(*Obsolete form of disjunctive case analysis*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   791
fun excluded_middle_tac sP =
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   792
    res_inst_tac [("Q",sP)] (excluded_middle RS disjE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   793
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   794
fun case_tac a = res_inst_tac [("P",a)] case_split_thm
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   795
*}
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   796
11687
b0fe6e522559 non-oriented infix = and ~= (output only);
wenzelm
parents: 11451
diff changeset
   797
theorems case_split = case_split_thm [case_names True False]
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   798
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   799
ML {*
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   800
structure ProjectRule = ProjectRuleFun
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   801
(struct
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   802
  val conjunct1 = thm "conjunct1";
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   803
  val conjunct2 = thm "conjunct2";
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   804
  val mp = thm "mp";
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   805
end)
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   806
*}
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   807
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   808
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   809
subsubsection {* Intuitionistic Reasoning *}
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   810
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   811
lemma impE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   812
  assumes 1: "P --> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   813
    and 2: "Q ==> R"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   814
    and 3: "P --> Q ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   815
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   816
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   817
  from 3 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   818
  with 1 have Q by (rule impE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   819
  with 2 show R .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   820
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   821
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   822
lemma allE':
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   823
  assumes 1: "ALL x. P x"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   824
    and 2: "P x ==> ALL x. P x ==> Q"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   825
  shows Q
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   826
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   827
  from 1 have "P x" by (rule spec)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   828
  from this and 1 show Q by (rule 2)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   829
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   830
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   831
lemma notE':
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   832
  assumes 1: "~ P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   833
    and 2: "~ P ==> P"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   834
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   835
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   836
  from 2 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   837
  with 1 show R by (rule notE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   838
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   839
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   840
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   841
  and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   842
  and [Pure.elim 2] = allE notE' impE'
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   843
  and [Pure.intro] = exI disjI2 disjI1
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   844
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   845
lemmas [trans] = trans
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   846
  and [sym] = sym not_sym
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   847
  and [Pure.elim?] = iffD1 iffD2 impE
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   848
11438
3d9222b80989 declare trans [trans] (*overridden in theory Calculation*);
wenzelm
parents: 11432
diff changeset
   849
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   850
subsubsection {* Atomizing meta-level connectives *}
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   851
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   852
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
   853
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   854
  assume "!!x. P x"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   855
  show "ALL x. P x" by (rule allI)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   856
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   857
  assume "ALL x. P x"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   858
  thus "!!x. P x" by (rule allE)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   859
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   860
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   861
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   862
proof
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   863
  assume r: "A ==> B"
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   864
  show "A --> B" by (rule impI) (rule r)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   865
next
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   866
  assume "A --> B" and A
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   867
  thus B by (rule mp)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   868
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   869
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   870
lemma atomize_not: "(A ==> False) == Trueprop (~A)"
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   871
proof
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   872
  assume r: "A ==> False"
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   873
  show "~A" by (rule notI) (rule r)
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   874
next
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   875
  assume "~A" and A
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   876
  thus False by (rule notE)
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   877
qed
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   878
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   879
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   880
proof
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   881
  assume "x == y"
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   882
  show "x = y" by (unfold prems) (rule refl)
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   883
next
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   884
  assume "x = y"
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   885
  thus "x == y" by (rule eq_reflection)
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   886
qed
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   887
12023
wenzelm
parents: 12003
diff changeset
   888
lemma atomize_conj [atomize]:
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   889
  includes meta_conjunction_syntax
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   890
  shows "(A && B) == Trueprop (A & B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   891
proof
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   892
  assume conj: "A && B"
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   893
  show "A & B"
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   894
  proof (rule conjI)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   895
    from conj show A by (rule conjunctionD1)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   896
    from conj show B by (rule conjunctionD2)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   897
  qed
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   898
next
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   899
  assume conj: "A & B"
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   900
  show "A && B"
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   901
  proof -
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   902
    from conj show A ..
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   903
    from conj show B ..
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   904
  qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   905
qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   906
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   907
lemmas [symmetric, rulify] = atomize_all atomize_imp
18832
6ab4de872a70 declare 'defn' rules;
wenzelm
parents: 18757
diff changeset
   908
  and [symmetric, defn] = atomize_all atomize_imp atomize_eq
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   909
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   910
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   911
subsubsection {* Classical Reasoner setup *}
9529
d9434a9277a4 lemmas atomize = all_eq imp_eq;
wenzelm
parents: 9488
diff changeset
   912
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   913
use "cladata.ML"
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   914
setup hypsubst_setup
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   915
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   916
setup {* ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac) *}
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   917
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   918
setup Classical.setup
19162
67436e2a16df Added setup for "atpset" (a rule set for ATPs).
mengj
parents: 19138
diff changeset
   919
67436e2a16df Added setup for "atpset" (a rule set for ATPs).
mengj
parents: 19138
diff changeset
   920
setup ResAtpSet.setup
67436e2a16df Added setup for "atpset" (a rule set for ATPs).
mengj
parents: 19138
diff changeset
   921
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   922
setup clasetup
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   923
18689
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   924
declare ex_ex1I [rule del, intro! 2]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   925
  and ex1I [intro]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   926
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   927
lemmas [intro?] = ext
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   928
  and [elim?] = ex1_implies_ex
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   929
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   930
use "blastdata.ML"
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
   931
setup Blast.setup
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   932
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   933
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
   934
subsubsection {* Simplifier setup *}
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   935
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   936
lemma meta_eq_to_obj_eq: "x == y ==> x = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   937
proof -
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   938
  assume r: "x == y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   939
  show "x = y" by (unfold r) (rule refl)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   940
qed
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   941
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   942
lemma eta_contract_eq: "(%s. f s) = f" ..
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   943
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   944
lemma simp_thms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   945
  shows not_not: "(~ ~ P) = P"
15354
9234f5765d9c Added > and >= sugar
nipkow
parents: 15288
diff changeset
   946
  and Not_eq_iff: "((~P) = (~Q)) = (P = Q)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   947
  and
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   948
    "(P ~= Q) = (P = (~Q))"
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   949
    "(P | ~P) = True"    "(~P | P) = True"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   950
    "(x = x) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   951
    "(~True) = False"  "(~False) = True"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   952
    "(~P) ~= P"  "P ~= (~P)"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   953
    "(True=P) = P"  "(P=True) = P"  "(False=P) = (~P)"  "(P=False) = (~P)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   954
    "(True --> P) = P"  "(False --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   955
    "(P --> True) = True"  "(P --> P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   956
    "(P --> False) = (~P)"  "(P --> ~P) = (~P)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   957
    "(P & True) = P"  "(True & P) = P"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   958
    "(P & False) = False"  "(False & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   959
    "(P & P) = P"  "(P & (P & Q)) = (P & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   960
    "(P & ~P) = False"    "(~P & P) = False"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   961
    "(P | True) = True"  "(True | P) = True"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   962
    "(P | False) = P"  "(False | P) = P"
12436
a2df07fefed7 Replaced several occurrences of "blast" by "rules".
berghofe
parents: 12386
diff changeset
   963
    "(P | P) = P"  "(P | (P | Q)) = (P | Q)" and
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   964
    "(ALL x. P) = P"  "(EX x. P) = P"  "EX x. x=t"  "EX x. t=x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   965
    -- {* needed for the one-point-rule quantifier simplification procs *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   966
    -- {* essential for termination!! *} and
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   967
    "!!P. (EX x. x=t & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   968
    "!!P. (EX x. t=x & P(x)) = P(t)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   969
    "!!P. (ALL x. x=t --> P(x)) = P(t)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   970
    "!!P. (ALL x. t=x --> P(x)) = P(t)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   971
  by (blast, blast, blast, blast, blast, iprover+)
13421
8fcdf4a26468 simplified locale predicates;
wenzelm
parents: 13412
diff changeset
   972
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   973
lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   974
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   975
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   976
lemma ex_simps:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   977
  "!!P Q. (EX x. P x & Q)   = ((EX x. P x) & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   978
  "!!P Q. (EX x. P & Q x)   = (P & (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   979
  "!!P Q. (EX x. P x | Q)   = ((EX x. P x) | Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   980
  "!!P Q. (EX x. P | Q x)   = (P | (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   981
  "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   982
  "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   983
  -- {* Miniscoping: pushing in existential quantifiers. *}
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   984
  by (iprover | blast)+
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   985
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   986
lemma all_simps:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   987
  "!!P Q. (ALL x. P x & Q)   = ((ALL x. P x) & Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   988
  "!!P Q. (ALL x. P & Q x)   = (P & (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   989
  "!!P Q. (ALL x. P x | Q)   = ((ALL x. P x) | Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   990
  "!!P Q. (ALL x. P | Q x)   = (P | (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   991
  "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   992
  "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   993
  -- {* Miniscoping: pushing in universal quantifiers. *}
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   994
  by (iprover | blast)+
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   995
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   996
lemma disj_absorb: "(A | A) = A"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   997
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   998
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   999
lemma disj_left_absorb: "(A | (A | B)) = (A | B)"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1000
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1001
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1002
lemma conj_absorb: "(A & A) = A"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1003
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1004
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1005
lemma conj_left_absorb: "(A & (A & B)) = (A & B)"
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1006
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1007
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1008
lemma eq_ac:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1009
  shows eq_commute: "(a=b) = (b=a)"
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1010
    and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1011
    and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (iprover, blast+)
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1012
lemma neq_commute: "(a~=b) = (b~=a)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1013
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1014
lemma conj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1015
  shows conj_commute: "(P&Q) = (Q&P)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1016
    and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by iprover+
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1017
lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1018
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1019
lemmas conj_ac = conj_commute conj_left_commute conj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1020
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1021
lemma disj_comms:
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
  1022
  shows disj_commute: "(P|Q) = (Q|P)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1023
    and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by iprover+
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1024
lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1025
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1026
lemmas disj_ac = disj_commute disj_left_commute disj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
  1027
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1028
lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1029
lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1030
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1031
lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1032
lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1033
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1034
lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1035
lemma imp_conjL: "((P&Q) -->R)  = (P --> (Q --> R))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1036
lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1037
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1038
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
  1039
lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1040
lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1041
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1042
lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1043
lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" 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 de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1046
lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1047
lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1048
lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1049
lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1050
lemma disj_not2: "(P | ~Q) = (Q --> P)"  -- {* changes orientation :-( *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1051
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1052
lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1053
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1054
lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1055
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1056
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1057
lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1058
  -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1059
  -- {* cases boil down to the same thing. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1060
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1061
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1062
lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1063
lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1064
lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1065
lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1066
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1067
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
  1068
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
  1069
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1070
text {*
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1071
  \medskip The @{text "&"} congruence rule: not included by default!
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1072
  May slow rewrite proofs down by as much as 50\% *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1073
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1074
lemma conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1075
    "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1076
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1077
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1078
lemma rev_conj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1079
    "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1080
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1081
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1082
text {* The @{text "|"} congruence rule: not included by default! *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1083
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1084
lemma disj_cong:
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1085
    "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1086
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1087
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1088
lemma eq_sym_conv: "(x = y) = (y = x)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1089
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1090
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1091
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1092
text {* \medskip if-then-else rules *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1093
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1094
lemma if_True: "(if True then x else y) = x"
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 if_False: "(if False then x else y) = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1098
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1099
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1100
lemma if_P: "P ==> (if P then x else y) = x"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1101
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1102
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1103
lemma if_not_P: "~P ==> (if P then x else y) = y"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1104
  by (unfold if_def) blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1105
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1106
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
  1107
  apply (rule case_split [of Q])
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1108
   apply (simplesubst if_P)
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1109
    prefer 3 apply (simplesubst if_not_P, blast+)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1110
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1111
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1112
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
  1113
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1114
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1115
lemmas if_splits = split_if split_if_asm
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1116
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1117
lemma if_def2: "(if Q then x else y) = ((Q --> x) & (~ Q --> y))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1118
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1119
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1120
lemma if_cancel: "(if c then x else x) = x"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1121
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1122
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1123
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
  1124
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1125
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1126
lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1127
  -- {* This form is useful for expanding @{text if}s on the RIGHT of the @{text "==>"} symbol. *}
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1128
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1129
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1130
lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1131
  -- {* 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
  1132
  apply (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1133
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1134
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1135
lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) iprover
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1136
lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1137
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1138
text {* \medskip let rules for simproc *}
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1139
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1140
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
  1141
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1142
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1143
lemma Let_unfold: "f x \<equiv> g \<Longrightarrow>  Let x f \<equiv> g"
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1144
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1145
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1146
text {*
16999
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1147
  The following copy of the implication operator is useful for
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1148
  fine-tuning congruence rules.  It instructs the simplifier to simplify
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1149
  its premise.
16633
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
17197
917c6e7ca28d simp_implies: proper named infix;
wenzelm
parents: 16999
diff changeset
  1152
constdefs
917c6e7ca28d simp_implies: proper named infix;
wenzelm
parents: 16999
diff changeset
  1153
  simp_implies :: "[prop, prop] => prop"  (infixr "=simp=>" 1)
917c6e7ca28d simp_implies: proper named infix;
wenzelm
parents: 16999
diff changeset
  1154
  "simp_implies \<equiv> op ==>"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1155
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1156
lemma simp_impliesI:
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1157
  assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1158
  shows "PROP P =simp=> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1159
  apply (unfold simp_implies_def)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1160
  apply (rule PQ)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1161
  apply assumption
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1162
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1163
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1164
lemma simp_impliesE:
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1165
  assumes PQ:"PROP P =simp=> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1166
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1167
  and QR: "PROP Q \<Longrightarrow> PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1168
  shows "PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1169
  apply (rule QR)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1170
  apply (rule PQ [unfolded simp_implies_def])
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1171
  apply (rule P)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1172
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1173
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1174
lemma simp_implies_cong:
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1175
  assumes PP' :"PROP P == PROP P'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1176
  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
  1177
  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
  1178
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
  1179
  assume PQ: "PROP P \<Longrightarrow> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1180
  and P': "PROP P'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1181
  from PP' [symmetric] and P' have "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1182
    by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1183
  hence "PROP Q" by (rule PQ)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1184
  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
  1185
next
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1186
  assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1187
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1188
  from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1189
  hence "PROP Q'" by (rule P'Q')
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1190
  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
  1191
    by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1192
qed
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1193
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1194
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1195
text {* \medskip Actual Installation of the Simplifier. *}
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1196
9869
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
  1197
use "simpdata.ML"
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
  1198
setup "Simplifier.method_setup Splitter.split_modifiers" setup simpsetup
95dca9f991f2 improved meson setup;
wenzelm
parents: 9852
diff changeset
  1199
setup Splitter.setup setup Clasimp.setup
18591
04b9f2bf5a48 tuned EqSubst setup;
wenzelm
parents: 18531
diff changeset
  1200
setup EqSubst.setup
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1201
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1202
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1203
subsubsection {* Code generator setup *}
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1204
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1205
types_code
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1206
  "bool"  ("bool")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1207
attach (term_of) {*
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1208
fun term_of_bool b = if b then HOLogic.true_const else HOLogic.false_const;
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1209
*}
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1210
attach (test) {*
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1211
fun gen_bool i = one_of [false, true];
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1212
*}
18887
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1213
  "prop"  ("bool")
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1214
attach (term_of) {*
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1215
fun term_of_prop b =
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1216
  HOLogic.mk_Trueprop (if b then HOLogic.true_const else HOLogic.false_const);
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1217
*}
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1218
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1219
consts_code
18887
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1220
  "Trueprop" ("(_)")
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1221
  "True"    ("true")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1222
  "False"   ("false")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1223
  "Not"     ("not")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1224
  "op |"    ("(_ orelse/ _)")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1225
  "op &"    ("(_ andalso/ _)")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1226
  "HOL.If"      ("(if _/ then _/ else _)")
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1227
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1228
ML {*
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1229
local
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1230
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1231
fun eq_codegen thy defs gr dep thyname b t =
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1232
    (case strip_comb t of
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1233
       (Const ("op =", Type (_, [Type ("fun", _), _])), _) => NONE
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1234
     | (Const ("op =", _), [t, u]) =>
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1235
          let
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1236
            val (gr', pt) = Codegen.invoke_codegen thy defs dep thyname false (gr, t);
17639
50878db27b94 eq_codegen now ensures that code for bool type is generated.
berghofe
parents: 17589
diff changeset
  1237
            val (gr'', pu) = Codegen.invoke_codegen thy defs dep thyname false (gr', u);
50878db27b94 eq_codegen now ensures that code for bool type is generated.
berghofe
parents: 17589
diff changeset
  1238
            val (gr''', _) = Codegen.invoke_tycodegen thy defs dep thyname false (gr'', HOLogic.boolT)
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1239
          in
17639
50878db27b94 eq_codegen now ensures that code for bool type is generated.
berghofe
parents: 17589
diff changeset
  1240
            SOME (gr''', Codegen.parens
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1241
              (Pretty.block [pt, Pretty.str " =", Pretty.brk 1, pu]))
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1242
          end
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1243
     | (t as Const ("op =", _), ts) => SOME (Codegen.invoke_codegen
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1244
         thy defs dep thyname b (gr, Codegen.eta_expand t ts 2))
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1245
     | _ => NONE);
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1246
18887
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1247
exception Evaluation of term;
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1248
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1249
fun evaluation_oracle (thy, Evaluation t) =
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1250
  Logic.mk_equals (t, Codegen.eval_term thy t);
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1251
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1252
fun evaluation_conv ct =
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1253
  let val {sign, t, ...} = rep_cterm ct
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1254
  in Thm.invoke_oracle_i sign "HOL.Evaluation" (sign, Evaluation t) end;
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1255
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1256
fun evaluation_tac i = Tactical.PRIMITIVE (Drule.fconv_rule
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1257
  (Drule.goals_conv (equal i) evaluation_conv));
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1258
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1259
val evaluation_meth =
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1260
  Method.no_args (Method.METHOD (fn _ => evaluation_tac 1 THEN rtac TrueI 1));
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1261
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1262
in
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1263
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
  1264
val eq_codegen_setup = Codegen.add_codegen "eq_codegen" eq_codegen;
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1265
18887
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1266
val evaluation_oracle_setup =
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1267
  Theory.add_oracle ("Evaluation", evaluation_oracle) #>
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1268
  Method.add_method ("evaluation", evaluation_meth, "solve goal by evaluation");
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1269
17459
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1270
end;
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1271
*}
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1272
9a3925c07392 added code generator setup (from Main.thy);
wenzelm
parents: 17404
diff changeset
  1273
setup eq_codegen_setup
18887
6ad81e3fa478 Added "evaluation" method and oracle.
berghofe
parents: 18867
diff changeset
  1274
setup evaluation_oracle_setup
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1275
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1276
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1277
subsection {* Other simple lemmas *}
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1278
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
  1279
declare disj_absorb [simp] conj_absorb [simp]
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
  1280
13723
c7d104550205 *** empty log message ***
nipkow
parents: 13638
diff changeset
  1281
lemma ex1_eq[iff]: "EX! x. x = t" "EX! x. t = x"
c7d104550205 *** empty log message ***
nipkow
parents: 13638
diff changeset
  1282
by blast+
c7d104550205 *** empty log message ***
nipkow
parents: 13638
diff changeset
  1283
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1284
13638
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1285
theorem choice_eq: "(ALL x. EX! y. P x y) = (EX! f. ALL x. P x (f x))"
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1286
  apply (rule iffI)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1287
  apply (rule_tac a = "%x. THE y. P x y" in ex1I)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1288
  apply (fast dest!: theI')
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1289
  apply (fast intro: ext the1_equality [symmetric])
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1290
  apply (erule ex1E)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1291
  apply (rule allI)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1292
  apply (rule ex1I)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1293
  apply (erule spec)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1294
  apply (erule_tac x = "%z. if z = x then y else f z" in allE)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1295
  apply (erule impE)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1296
  apply (rule allI)
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1297
  apply (rule_tac P = "xa = x" in case_split_thm)
14208
144f45277d5a misc tidying
paulson
parents: 14201
diff changeset
  1298
  apply (drule_tac [3] x = x in fun_cong, simp_all)
13638
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1299
  done
2b234b079245 Added choice_eq.
berghofe
parents: 13598
diff changeset
  1300
13438
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1301
text{*Needs only HOL-lemmas:*}
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1302
lemma mk_left_commute:
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1303
  assumes a: "\<And>x y z. f (f x y) z = f x (f y z)" and
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1304
          c: "\<And>x y. f x y = f y x"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1305
  shows "f x (f y z) = f y (f x z)"
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1306
by(rule trans[OF trans[OF c a] arg_cong[OF c, of "f y"]])
527811f00c56 added mk_left_commute to HOL.thy and used it "everywhere"
nipkow
parents: 13421
diff changeset
  1307
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
  1308
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1309
subsection {* Generic cases and induction *}
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1310
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1311
constdefs
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1312
  induct_forall where "induct_forall P == \<forall>x. P x"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1313
  induct_implies where "induct_implies A B == A \<longrightarrow> B"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1314
  induct_equal where "induct_equal x y == x = y"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1315
  induct_conj where "induct_conj A B == A \<and> B"
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1316
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1317
lemma induct_forall_eq: "(!!x. P x) == Trueprop (induct_forall (\<lambda>x. P x))"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1318
  by (unfold atomize_all induct_forall_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1319
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1320
lemma induct_implies_eq: "(A ==> B) == Trueprop (induct_implies A B)"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1321
  by (unfold atomize_imp induct_implies_def)
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1322
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1323
lemma induct_equal_eq: "(x == y) == Trueprop (induct_equal x y)"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1324
  by (unfold atomize_eq induct_equal_def)
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1325
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1326
lemma induct_conj_eq:
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1327
  includes meta_conjunction_syntax
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1328
  shows "(A && B) == Trueprop (induct_conj A B)"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1329
  by (unfold atomize_conj induct_conj_def)
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1330
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1331
lemmas induct_atomize = induct_forall_eq induct_implies_eq induct_equal_eq induct_conj_eq
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1332
lemmas induct_rulify [symmetric, standard] = induct_atomize
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1333
lemmas induct_rulify_fallback =
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1334
  induct_forall_def induct_implies_def induct_equal_def induct_conj_def
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1335
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1336
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1337
lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1338
    induct_conj (induct_forall A) (induct_forall B)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1339
  by (unfold induct_forall_def induct_conj_def) iprover
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1340
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1341
lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1342
    induct_conj (induct_implies C A) (induct_implies C B)"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1343
  by (unfold induct_implies_def induct_conj_def) iprover
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1344
13598
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1345
lemma induct_conj_curry: "(induct_conj A B ==> PROP C) == (A ==> B ==> PROP C)"
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1346
proof
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1347
  assume r: "induct_conj A B ==> PROP C" and A B
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1348
  show "PROP C" by (rule r) (simp add: induct_conj_def `A` `B`)
13598
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1349
next
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1350
  assume r: "A ==> B ==> PROP C" and "induct_conj A B"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1351
  show "PROP C" by (rule r) (simp_all add: `induct_conj A B` [unfolded induct_conj_def])
13598
8bc77b17f59f Fixed problem with induct_conj_curry: variable C should have type prop.
berghofe
parents: 13596
diff changeset
  1352
qed
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1353
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1354
lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1355
11989
d4bcba4e080e renamed inductive_XXX to induct_XXX;
wenzelm
parents: 11977
diff changeset
  1356
hide const induct_forall induct_implies induct_equal induct_conj
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1357
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1358
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1359
text {* Method setup. *}
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1360
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1361
ML {*
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1362
  structure InductMethod = InductMethodFun
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1363
  (struct
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
  1364
    val cases_default = thm "case_split"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
  1365
    val atomize = thms "induct_atomize"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1366
    val rulify = thms "induct_rulify"
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1367
    val rulify_fallback = thms "induct_rulify_fallback"
11824
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1368
  end);
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1369
*}
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1370
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1371
setup InductMethod.setup
f4c1882dde2c setup generic cases and induction (from Inductive.thy);
wenzelm
parents: 11770
diff changeset
  1372
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1373
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1374
subsubsection {*Tags, for the ATP Linkup *}
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17274
diff changeset
  1375
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17274
diff changeset
  1376
constdefs
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17274
diff changeset
  1377
  tag :: "bool => bool"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1378
  "tag P == P"
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17274
diff changeset
  1379
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17274
diff changeset