author | haftmann |
Fri, 16 Jan 2009 08:29:11 +0100 | |
changeset 29505 | c6d2d23909d1 |
parent 29105 | 8f38bf68d42e |
child 29608 | 564ea783ace8 |
permissions | -rw-r--r-- |
923 | 1 |
(* Title: HOL/HOL.thy |
11750 | 2 |
Author: Tobias Nipkow, Markus Wenzel, and Larry Paulson |
3 |
*) |
|
923 | 4 |
|
11750 | 5 |
header {* The basis of Higher-Order Logic *} |
923 | 6 |
|
15131 | 7 |
theory HOL |
26957 | 8 |
imports Pure |
23163 | 9 |
uses |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28856
diff
changeset
|
10 |
("Tools/hologic.ML") |
23171 | 11 |
"~~/src/Tools/IsaPlanner/zipper.ML" |
12 |
"~~/src/Tools/IsaPlanner/isand.ML" |
|
13 |
"~~/src/Tools/IsaPlanner/rw_tools.ML" |
|
14 |
"~~/src/Tools/IsaPlanner/rw_inst.ML" |
|
23263 | 15 |
"~~/src/Provers/project_rule.ML" |
16 |
"~~/src/Provers/hypsubst.ML" |
|
17 |
"~~/src/Provers/splitter.ML" |
|
23163 | 18 |
"~~/src/Provers/classical.ML" |
19 |
"~~/src/Provers/blast.ML" |
|
20 |
"~~/src/Provers/clasimp.ML" |
|
28325 | 21 |
"~~/src/Provers/coherent.ML" |
23263 | 22 |
"~~/src/Provers/eqsubst.ML" |
23163 | 23 |
"~~/src/Provers/quantifier1.ML" |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28856
diff
changeset
|
24 |
("Tools/simpdata.ML") |
25741 | 25 |
"~~/src/Tools/random_word.ML" |
26580
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
26 |
"~~/src/Tools/atomize_elim.ML" |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24844
diff
changeset
|
27 |
"~~/src/Tools/induct.ML" |
27326
d3beec370964
moved src/HOL/Tools/induct_tacs.ML to src/Tools/induct_tacs.ML;
wenzelm
parents:
27212
diff
changeset
|
28 |
("~~/src/Tools/induct_tacs.ML") |
29105 | 29 |
"~~/src/Tools/value.ML" |
24280 | 30 |
"~~/src/Tools/code/code_name.ML" |
31 |
"~~/src/Tools/code/code_funcgr.ML" |
|
32 |
"~~/src/Tools/code/code_thingol.ML" |
|
28054 | 33 |
"~~/src/Tools/code/code_printer.ML" |
24280 | 34 |
"~~/src/Tools/code/code_target.ML" |
28054 | 35 |
"~~/src/Tools/code/code_ml.ML" |
36 |
"~~/src/Tools/code/code_haskell.ML" |
|
24166 | 37 |
"~~/src/Tools/nbe.ML" |
29505 | 38 |
("Tools/recfun_codegen.ML") |
15131 | 39 |
begin |
2260 | 40 |
|
11750 | 41 |
subsection {* Primitive logic *} |
42 |
||
43 |
subsubsection {* Core syntax *} |
|
2260 | 44 |
|
14854 | 45 |
classes type |
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12281
diff
changeset
|
46 |
defaultsort type |
25494
b2484a7912ac
replaced typedecl interpretation by ObjectLogic.typedecl (based on base_sort);
wenzelm
parents:
25460
diff
changeset
|
47 |
setup {* ObjectLogic.add_base_sort @{sort type} *} |
25460
b80087af2274
interpretation of typedecls: instantiation to class type
haftmann
parents:
25388
diff
changeset
|
48 |
|
b80087af2274
interpretation of typedecls: instantiation to class type
haftmann
parents:
25388
diff
changeset
|
49 |
arities |
b80087af2274
interpretation of typedecls: instantiation to class type
haftmann
parents:
25388
diff
changeset
|
50 |
"fun" :: (type, type) type |
b80087af2274
interpretation of typedecls: instantiation to class type
haftmann
parents:
25388
diff
changeset
|
51 |
itself :: (type) type |
b80087af2274
interpretation of typedecls: instantiation to class type
haftmann
parents:
25388
diff
changeset
|
52 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12281
diff
changeset
|
53 |
global |
923 | 54 |
|
7357 | 55 |
typedecl bool |
923 | 56 |
|
11750 | 57 |
judgment |
58 |
Trueprop :: "bool => prop" ("(_)" 5) |
|
923 | 59 |
|
11750 | 60 |
consts |
7357 | 61 |
Not :: "bool => bool" ("~ _" [40] 40) |
62 |
True :: bool |
|
63 |
False :: bool |
|
923 | 64 |
|
11432
8a203ae6efe3
added "The" (definite description operator) (by Larry);
wenzelm
parents:
10489
diff
changeset
|
65 |
The :: "('a => bool) => 'a" |
7357 | 66 |
All :: "('a => bool) => bool" (binder "ALL " 10) |
67 |
Ex :: "('a => bool) => bool" (binder "EX " 10) |
|
68 |
Ex1 :: "('a => bool) => bool" (binder "EX! " 10) |
|
69 |
Let :: "['a, 'a => 'b] => 'b" |
|
923 | 70 |
|
22839 | 71 |
"op =" :: "['a, 'a] => bool" (infixl "=" 50) |
72 |
"op &" :: "[bool, bool] => bool" (infixr "&" 35) |
|
73 |
"op |" :: "[bool, bool] => bool" (infixr "|" 30) |
|
74 |
"op -->" :: "[bool, bool] => bool" (infixr "-->" 25) |
|
923 | 75 |
|
10432
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
76 |
local |
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
77 |
|
16587 | 78 |
consts |
79 |
If :: "[bool, 'a, 'a] => 'a" ("(if (_)/ then (_)/ else (_))" 10) |
|
2260 | 80 |
|
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
81 |
|
11750 | 82 |
subsubsection {* Additional concrete syntax *} |
2260 | 83 |
|
21210 | 84 |
notation (output) |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
85 |
"op =" (infix "=" 50) |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
86 |
|
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
87 |
abbreviation |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
88 |
not_equal :: "['a, 'a] => bool" (infixl "~=" 50) where |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
89 |
"x ~= y == ~ (x = y)" |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
90 |
|
21210 | 91 |
notation (output) |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
92 |
not_equal (infix "~=" 50) |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
93 |
|
21210 | 94 |
notation (xsymbols) |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
95 |
Not ("\<not> _" [40] 40) and |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
96 |
"op &" (infixr "\<and>" 35) and |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
97 |
"op |" (infixr "\<or>" 30) and |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
98 |
"op -->" (infixr "\<longrightarrow>" 25) and |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
99 |
not_equal (infix "\<noteq>" 50) |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
100 |
|
21210 | 101 |
notation (HTML output) |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
102 |
Not ("\<not> _" [40] 40) and |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
103 |
"op &" (infixr "\<and>" 35) and |
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
104 |
"op |" (infixr "\<or>" 30) and |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
105 |
not_equal (infix "\<noteq>" 50) |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
106 |
|
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
107 |
abbreviation (iff) |
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21250
diff
changeset
|
108 |
iff :: "[bool, bool] => bool" (infixr "<->" 25) where |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
109 |
"A <-> B == A = B" |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
110 |
|
21210 | 111 |
notation (xsymbols) |
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
112 |
iff (infixr "\<longleftrightarrow>" 25) |
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
113 |
|
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
114 |
|
4868 | 115 |
nonterminals |
923 | 116 |
letbinds letbind |
117 |
case_syn cases_syn |
|
118 |
||
119 |
syntax |
|
11432
8a203ae6efe3
added "The" (definite description operator) (by Larry);
wenzelm
parents:
10489
diff
changeset
|
120 |
"_The" :: "[pttrn, bool] => 'a" ("(3THE _./ _)" [0, 10] 10) |
923 | 121 |
|
7357 | 122 |
"_bind" :: "[pttrn, 'a] => letbind" ("(2_ =/ _)" 10) |
123 |
"" :: "letbind => letbinds" ("_") |
|
124 |
"_binds" :: "[letbind, letbinds] => letbinds" ("_;/ _") |
|
125 |
"_Let" :: "[letbinds, 'a] => 'a" ("(let (_)/ in (_))" 10) |
|
923 | 126 |
|
9060
b0dd884b1848
rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents:
8959
diff
changeset
|
127 |
"_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
|
128 |
"_case1" :: "['a, 'b] => case_syn" ("(2_ =>/ _)" 10) |
7357 | 129 |
"" :: "case_syn => cases_syn" ("_") |
9060
b0dd884b1848
rename @case to _case_syntax (improves on low-level errors);
wenzelm
parents:
8959
diff
changeset
|
130 |
"_case2" :: "[case_syn, cases_syn] => cases_syn" ("_/ | _") |
923 | 131 |
|
132 |
translations |
|
13764 | 133 |
"THE x. P" == "The (%x. P)" |
923 | 134 |
"_Let (_binds b bs) e" == "_Let b (_Let bs e)" |
1114 | 135 |
"let x = a in e" == "Let a (%x. e)" |
923 | 136 |
|
13763
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
137 |
print_translation {* |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
138 |
(* To avoid eta-contraction of body: *) |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
139 |
[("The", fn [Abs abs] => |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
140 |
let val (x,t) = atomic_abs_tr' abs |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
141 |
in Syntax.const "_The" $ x $ t end)] |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
142 |
*} |
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13723
diff
changeset
|
143 |
|
12114
a8e860c86252
eliminated old "symbols" syntax, use "xsymbols" instead;
wenzelm
parents:
12023
diff
changeset
|
144 |
syntax (xsymbols) |
11687 | 145 |
"_case1" :: "['a, 'b] => case_syn" ("(2_ \<Rightarrow>/ _)" 10) |
21524 | 146 |
|
147 |
notation (xsymbols) |
|
148 |
All (binder "\<forall>" 10) and |
|
149 |
Ex (binder "\<exists>" 10) and |
|
150 |
Ex1 (binder "\<exists>!" 10) |
|
2372 | 151 |
|
21524 | 152 |
notation (HTML output) |
153 |
All (binder "\<forall>" 10) and |
|
154 |
Ex (binder "\<exists>" 10) and |
|
155 |
Ex1 (binder "\<exists>!" 10) |
|
6340 | 156 |
|
21524 | 157 |
notation (HOL) |
158 |
All (binder "! " 10) and |
|
159 |
Ex (binder "? " 10) and |
|
160 |
Ex1 (binder "?! " 10) |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7220
diff
changeset
|
161 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7220
diff
changeset
|
162 |
|
11750 | 163 |
subsubsection {* Axioms and basic definitions *} |
2260 | 164 |
|
7357 | 165 |
axioms |
15380 | 166 |
refl: "t = (t::'a)" |
28513 | 167 |
subst: "s = t \<Longrightarrow> P s \<Longrightarrow> P t" |
15380 | 168 |
ext: "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)" |
169 |
-- {*Extensionality is built into the meta-logic, and this rule expresses |
|
170 |
a related property. It is an eta-expanded version of the traditional |
|
171 |
rule, and similar to the ABS rule of HOL*} |
|
6289 | 172 |
|
11432
8a203ae6efe3
added "The" (definite description operator) (by Larry);
wenzelm
parents:
10489
diff
changeset
|
173 |
the_eq_trivial: "(THE x. x = a) = (a::'a)" |
923 | 174 |
|
15380 | 175 |
impI: "(P ==> Q) ==> P-->Q" |
176 |
mp: "[| P-->Q; P |] ==> Q" |
|
177 |
||
178 |
||
923 | 179 |
defs |
7357 | 180 |
True_def: "True == ((%x::bool. x) = (%x. x))" |
181 |
All_def: "All(P) == (P = (%x. True))" |
|
11451
8abfb4f7bd02
partial restructuring to reduce dependence on Axiom of Choice
paulson
parents:
11438
diff
changeset
|
182 |
Ex_def: "Ex(P) == !Q. (!x. P x --> Q) --> Q" |
7357 | 183 |
False_def: "False == (!P. P)" |
184 |
not_def: "~ P == P-->False" |
|
185 |
and_def: "P & Q == !R. (P-->Q-->R) --> R" |
|
186 |
or_def: "P | Q == !R. (P-->R) --> (Q-->R) --> R" |
|
187 |
Ex1_def: "Ex1(P) == ? x. P(x) & (! y. P(y) --> y=x)" |
|
923 | 188 |
|
7357 | 189 |
axioms |
190 |
iff: "(P-->Q) --> (Q-->P) --> (P=Q)" |
|
191 |
True_or_False: "(P=True) | (P=False)" |
|
923 | 192 |
|
193 |
defs |
|
24219 | 194 |
Let_def: "Let s f == f(s)" |
11451
8abfb4f7bd02
partial restructuring to reduce dependence on Axiom of Choice
paulson
parents:
11438
diff
changeset
|
195 |
if_def: "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)" |
5069 | 196 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14208
diff
changeset
|
197 |
finalconsts |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14208
diff
changeset
|
198 |
"op =" |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14208
diff
changeset
|
199 |
"op -->" |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14208
diff
changeset
|
200 |
The |
22481
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
201 |
|
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
202 |
axiomatization |
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
203 |
undefined :: 'a |
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
204 |
|
28682 | 205 |
abbreviation (input) |
206 |
"arbitrary \<equiv> undefined" |
|
3320 | 207 |
|
19656
09be06943252
tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents:
19607
diff
changeset
|
208 |
|
22481
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
209 |
subsubsection {* Generic classes and algebraic operations *} |
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
210 |
|
79c2724c36b5
added class "default" and expansion axioms for undefined
haftmann
parents:
22473
diff
changeset
|
211 |
class default = type + |
24901
d3cbf79769b9
added first version of user-space type system for class target
haftmann
parents:
24844
diff
changeset
|
212 |
fixes default :: 'a |
4868 | 213 |
|
22473 | 214 |
class zero = type + |
25062 | 215 |
fixes zero :: 'a ("0") |
20713
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
216 |
|
22473 | 217 |
class one = type + |
25062 | 218 |
fixes one :: 'a ("1") |
20713
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
219 |
|
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
220 |
hide (open) const zero one |
20590
bf92900995f8
introduced syntactic classes; moved some setup to Pure/codegen, Pure/nbe or OperationalEquality.thy
haftmann
parents:
20453
diff
changeset
|
221 |
|
22473 | 222 |
class plus = type + |
25062 | 223 |
fixes plus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "+" 65) |
11750 | 224 |
|
22473 | 225 |
class minus = type + |
25762 | 226 |
fixes minus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "-" 65) |
227 |
||
228 |
class uminus = type + |
|
25062 | 229 |
fixes uminus :: "'a \<Rightarrow> 'a" ("- _" [81] 80) |
20590
bf92900995f8
introduced syntactic classes; moved some setup to Pure/codegen, Pure/nbe or OperationalEquality.thy
haftmann
parents:
20453
diff
changeset
|
230 |
|
22473 | 231 |
class times = type + |
25062 | 232 |
fixes times :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "*" 70) |
20590
bf92900995f8
introduced syntactic classes; moved some setup to Pure/codegen, Pure/nbe or OperationalEquality.thy
haftmann
parents:
20453
diff
changeset
|
233 |
|
22473 | 234 |
class inverse = type + |
20590
bf92900995f8
introduced syntactic classes; moved some setup to Pure/codegen, Pure/nbe or OperationalEquality.thy
haftmann
parents:
20453
diff
changeset
|
235 |
fixes inverse :: "'a \<Rightarrow> 'a" |
25062 | 236 |
and divide :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "'/" 70) |
21524 | 237 |
|
23878 | 238 |
class abs = type + |
239 |
fixes abs :: "'a \<Rightarrow> 'a" |
|
25388 | 240 |
begin |
23878 | 241 |
|
21524 | 242 |
notation (xsymbols) |
243 |
abs ("\<bar>_\<bar>") |
|
25388 | 244 |
|
21524 | 245 |
notation (HTML output) |
246 |
abs ("\<bar>_\<bar>") |
|
11750 | 247 |
|
25388 | 248 |
end |
249 |
||
25062 | 250 |
class sgn = type + |
251 |
fixes sgn :: "'a \<Rightarrow> 'a" |
|
252 |
||
23878 | 253 |
class ord = type + |
24748 | 254 |
fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool" |
255 |
and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool" |
|
23878 | 256 |
begin |
257 |
||
258 |
notation |
|
259 |
less_eq ("op <=") and |
|
260 |
less_eq ("(_/ <= _)" [51, 51] 50) and |
|
261 |
less ("op <") and |
|
262 |
less ("(_/ < _)" [51, 51] 50) |
|
263 |
||
264 |
notation (xsymbols) |
|
265 |
less_eq ("op \<le>") and |
|
266 |
less_eq ("(_/ \<le> _)" [51, 51] 50) |
|
267 |
||
268 |
notation (HTML output) |
|
269 |
less_eq ("op \<le>") and |
|
270 |
less_eq ("(_/ \<le> _)" [51, 51] 50) |
|
271 |
||
25388 | 272 |
abbreviation (input) |
273 |
greater_eq (infix ">=" 50) where |
|
274 |
"x >= y \<equiv> y <= x" |
|
275 |
||
24842 | 276 |
notation (input) |
23878 | 277 |
greater_eq (infix "\<ge>" 50) |
278 |
||
25388 | 279 |
abbreviation (input) |
280 |
greater (infix ">" 50) where |
|
281 |
"x > y \<equiv> y < x" |
|
282 |
||
283 |
end |
|
284 |
||
13456
42601eb7553f
special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents:
13438
diff
changeset
|
285 |
syntax |
42601eb7553f
special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents:
13438
diff
changeset
|
286 |
"_index1" :: index ("\<^sub>1") |
42601eb7553f
special syntax for index "1" (plain numeral hidden by "1" symbol in HOL);
wenzelm
parents:
13438
diff
changeset
|
287 |
translations |
14690 | 288 |
(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
|
289 |
|
11750 | 290 |
typed_print_translation {* |
20713
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
291 |
let |
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
292 |
fun tr' c = (c, fn show_sorts => fn T => fn ts => |
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
293 |
if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match |
823967ef47f1
renamed 0 and 1 to HOL.zero and HOL.one respectivly; introduced corresponding syntactic classes
haftmann
parents:
20698
diff
changeset
|
294 |
else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T); |
22993 | 295 |
in map tr' [@{const_syntax HOL.one}, @{const_syntax HOL.zero}] end; |
11750 | 296 |
*} -- {* show types that are presumably too general *} |
297 |
||
298 |
||
20944 | 299 |
subsection {* Fundamental rules *} |
300 |
||
20973 | 301 |
subsubsection {* Equality *} |
20944 | 302 |
|
18457 | 303 |
lemma sym: "s = t ==> t = s" |
304 |
by (erule subst) (rule refl) |
|
15411 | 305 |
|
18457 | 306 |
lemma ssubst: "t = s ==> P s ==> P t" |
307 |
by (drule sym) (erule subst) |
|
15411 | 308 |
|
309 |
lemma trans: "[| r=s; s=t |] ==> r=t" |
|
18457 | 310 |
by (erule subst) |
15411 | 311 |
|
20944 | 312 |
lemma meta_eq_to_obj_eq: |
313 |
assumes meq: "A == B" |
|
314 |
shows "A = B" |
|
315 |
by (unfold meq) (rule refl) |
|
15411 | 316 |
|
21502 | 317 |
text {* Useful with @{text erule} for proving equalities from known equalities. *} |
20944 | 318 |
(* a = b |
15411 | 319 |
| | |
320 |
c = d *) |
|
321 |
lemma box_equals: "[| a=b; a=c; b=d |] ==> c=d" |
|
322 |
apply (rule trans) |
|
323 |
apply (rule trans) |
|
324 |
apply (rule sym) |
|
325 |
apply assumption+ |
|
326 |
done |
|
327 |
||
15524
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
328 |
text {* For calculational reasoning: *} |
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
329 |
|
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
330 |
lemma forw_subst: "a = b ==> P b ==> P a" |
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
331 |
by (rule ssubst) |
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
332 |
|
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
333 |
lemma back_subst: "P a ==> a = b ==> P b" |
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
334 |
by (rule subst) |
2ef571f80a55
Moved oderings from HOL into the new Orderings.thy
nipkow
parents:
15481
diff
changeset
|
335 |
|
15411 | 336 |
|
20944 | 337 |
subsubsection {*Congruence rules for application*} |
15411 | 338 |
|
339 |
(*similar to AP_THM in Gordon's HOL*) |
|
340 |
lemma fun_cong: "(f::'a=>'b) = g ==> f(x)=g(x)" |
|
341 |
apply (erule subst) |
|
342 |
apply (rule refl) |
|
343 |
done |
|
344 |
||
345 |
(*similar to AP_TERM in Gordon's HOL and FOL's subst_context*) |
|
346 |
lemma arg_cong: "x=y ==> f(x)=f(y)" |
|
347 |
apply (erule subst) |
|
348 |
apply (rule refl) |
|
349 |
done |
|
350 |
||
15655 | 351 |
lemma arg_cong2: "\<lbrakk> a = b; c = d \<rbrakk> \<Longrightarrow> f a c = f b d" |
352 |
apply (erule ssubst)+ |
|
353 |
apply (rule refl) |
|
354 |
done |
|
355 |
||
15411 | 356 |
lemma cong: "[| f = g; (x::'a) = y |] ==> f(x) = g(y)" |
357 |
apply (erule subst)+ |
|
358 |
apply (rule refl) |
|
359 |
done |
|
360 |
||
361 |
||
20944 | 362 |
subsubsection {*Equality of booleans -- iff*} |
15411 | 363 |
|
21504 | 364 |
lemma iffI: assumes "P ==> Q" and "Q ==> P" shows "P=Q" |
365 |
by (iprover intro: iff [THEN mp, THEN mp] impI assms) |
|
15411 | 366 |
|
367 |
lemma iffD2: "[| P=Q; Q |] ==> P" |
|
18457 | 368 |
by (erule ssubst) |
15411 | 369 |
|
370 |
lemma rev_iffD2: "[| Q; P=Q |] ==> P" |
|
18457 | 371 |
by (erule iffD2) |
15411 | 372 |
|
21504 | 373 |
lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P" |
374 |
by (drule sym) (rule iffD2) |
|
375 |
||
376 |
lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P" |
|
377 |
by (drule sym) (rule rev_iffD2) |
|
15411 | 378 |
|
379 |
lemma iffE: |
|
380 |
assumes major: "P=Q" |
|
21504 | 381 |
and minor: "[| P --> Q; Q --> P |] ==> R" |
18457 | 382 |
shows R |
383 |
by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1]) |
|
15411 | 384 |
|
385 |
||
20944 | 386 |
subsubsection {*True*} |
15411 | 387 |
|
388 |
lemma TrueI: "True" |
|
21504 | 389 |
unfolding True_def by (rule refl) |
15411 | 390 |
|
21504 | 391 |
lemma eqTrueI: "P ==> P = True" |
18457 | 392 |
by (iprover intro: iffI TrueI) |
15411 | 393 |
|
21504 | 394 |
lemma eqTrueE: "P = True ==> P" |
395 |
by (erule iffD2) (rule TrueI) |
|
15411 | 396 |
|
397 |
||
20944 | 398 |
subsubsection {*Universal quantifier*} |
15411 | 399 |
|
21504 | 400 |
lemma allI: assumes "!!x::'a. P(x)" shows "ALL x. P(x)" |
401 |
unfolding All_def by (iprover intro: ext eqTrueI assms) |
|
15411 | 402 |
|
403 |
lemma spec: "ALL x::'a. P(x) ==> P(x)" |
|
404 |
apply (unfold All_def) |
|
405 |
apply (rule eqTrueE) |
|
406 |
apply (erule fun_cong) |
|
407 |
done |
|
408 |
||
409 |
lemma allE: |
|
410 |
assumes major: "ALL x. P(x)" |
|
21504 | 411 |
and minor: "P(x) ==> R" |
412 |
shows R |
|
413 |
by (iprover intro: minor major [THEN spec]) |
|
15411 | 414 |
|
415 |
lemma all_dupE: |
|
416 |
assumes major: "ALL x. P(x)" |
|
21504 | 417 |
and minor: "[| P(x); ALL x. P(x) |] ==> R" |
418 |
shows R |
|
419 |
by (iprover intro: minor major major [THEN spec]) |
|
15411 | 420 |
|
421 |
||
21504 | 422 |
subsubsection {* False *} |
423 |
||
424 |
text {* |
|
425 |
Depends upon @{text spec}; it is impossible to do propositional |
|
426 |
logic before quantifiers! |
|
427 |
*} |
|
15411 | 428 |
|
429 |
lemma FalseE: "False ==> P" |
|
21504 | 430 |
apply (unfold False_def) |
431 |
apply (erule spec) |
|
432 |
done |
|
15411 | 433 |
|
21504 | 434 |
lemma False_neq_True: "False = True ==> P" |
435 |
by (erule eqTrueE [THEN FalseE]) |
|
15411 | 436 |
|
437 |
||
21504 | 438 |
subsubsection {* Negation *} |
15411 | 439 |
|
440 |
lemma notI: |
|
21504 | 441 |
assumes "P ==> False" |
15411 | 442 |
shows "~P" |
21504 | 443 |
apply (unfold not_def) |
444 |
apply (iprover intro: impI assms) |
|
445 |
done |
|
15411 | 446 |
|
447 |
lemma False_not_True: "False ~= True" |
|
21504 | 448 |
apply (rule notI) |
449 |
apply (erule False_neq_True) |
|
450 |
done |
|
15411 | 451 |
|
452 |
lemma True_not_False: "True ~= False" |
|
21504 | 453 |
apply (rule notI) |
454 |
apply (drule sym) |
|
455 |
apply (erule False_neq_True) |
|
456 |
done |
|
15411 | 457 |
|
458 |
lemma notE: "[| ~P; P |] ==> R" |
|
21504 | 459 |
apply (unfold not_def) |
460 |
apply (erule mp [THEN FalseE]) |
|
461 |
apply assumption |
|
462 |
done |
|
15411 | 463 |
|
21504 | 464 |
lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P" |
465 |
by (erule notE [THEN notI]) (erule meta_mp) |
|
15411 | 466 |
|
467 |
||
20944 | 468 |
subsubsection {*Implication*} |
15411 | 469 |
|
470 |
lemma impE: |
|
471 |
assumes "P-->Q" "P" "Q ==> R" |
|
472 |
shows "R" |
|
23553 | 473 |
by (iprover intro: assms mp) |
15411 | 474 |
|
475 |
(* Reduces Q to P-->Q, allowing substitution in P. *) |
|
476 |
lemma rev_mp: "[| P; P --> Q |] ==> Q" |
|
17589 | 477 |
by (iprover intro: mp) |
15411 | 478 |
|
479 |
lemma contrapos_nn: |
|
480 |
assumes major: "~Q" |
|
481 |
and minor: "P==>Q" |
|
482 |
shows "~P" |
|
17589 | 483 |
by (iprover intro: notI minor major [THEN notE]) |
15411 | 484 |
|
485 |
(*not used at all, but we already have the other 3 combinations *) |
|
486 |
lemma contrapos_pn: |
|
487 |
assumes major: "Q" |
|
488 |
and minor: "P ==> ~Q" |
|
489 |
shows "~P" |
|
17589 | 490 |
by (iprover intro: notI minor major notE) |
15411 | 491 |
|
492 |
lemma not_sym: "t ~= s ==> s ~= t" |
|
21250 | 493 |
by (erule contrapos_nn) (erule sym) |
494 |
||
495 |
lemma eq_neq_eq_imp_neq: "[| x = a ; a ~= b; b = y |] ==> x ~= y" |
|
496 |
by (erule subst, erule ssubst, assumption) |
|
15411 | 497 |
|
498 |
(*still used in HOLCF*) |
|
499 |
lemma rev_contrapos: |
|
500 |
assumes pq: "P ==> Q" |
|
501 |
and nq: "~Q" |
|
502 |
shows "~P" |
|
503 |
apply (rule nq [THEN contrapos_nn]) |
|
504 |
apply (erule pq) |
|
505 |
done |
|
506 |
||
20944 | 507 |
subsubsection {*Existential quantifier*} |
15411 | 508 |
|
509 |
lemma exI: "P x ==> EX x::'a. P x" |
|
510 |
apply (unfold Ex_def) |
|
17589 | 511 |
apply (iprover intro: allI allE impI mp) |
15411 | 512 |
done |
513 |
||
514 |
lemma exE: |
|
515 |
assumes major: "EX x::'a. P(x)" |
|
516 |
and minor: "!!x. P(x) ==> Q" |
|
517 |
shows "Q" |
|
518 |
apply (rule major [unfolded Ex_def, THEN spec, THEN mp]) |
|
17589 | 519 |
apply (iprover intro: impI [THEN allI] minor) |
15411 | 520 |
done |
521 |
||
522 |
||
20944 | 523 |
subsubsection {*Conjunction*} |
15411 | 524 |
|
525 |
lemma conjI: "[| P; Q |] ==> P&Q" |
|
526 |
apply (unfold and_def) |
|
17589 | 527 |
apply (iprover intro: impI [THEN allI] mp) |
15411 | 528 |
done |
529 |
||
530 |
lemma conjunct1: "[| P & Q |] ==> P" |
|
531 |
apply (unfold and_def) |
|
17589 | 532 |
apply (iprover intro: impI dest: spec mp) |
15411 | 533 |
done |
534 |
||
535 |
lemma conjunct2: "[| P & Q |] ==> Q" |
|
536 |
apply (unfold and_def) |
|
17589 | 537 |
apply (iprover intro: impI dest: spec mp) |
15411 | 538 |
done |
539 |
||
540 |
lemma conjE: |
|
541 |
assumes major: "P&Q" |
|
542 |
and minor: "[| P; Q |] ==> R" |
|
543 |
shows "R" |
|
544 |
apply (rule minor) |
|
545 |
apply (rule major [THEN conjunct1]) |
|
546 |
apply (rule major [THEN conjunct2]) |
|
547 |
done |
|
548 |
||
549 |
lemma context_conjI: |
|
23553 | 550 |
assumes "P" "P ==> Q" shows "P & Q" |
551 |
by (iprover intro: conjI assms) |
|
15411 | 552 |
|
553 |
||
20944 | 554 |
subsubsection {*Disjunction*} |
15411 | 555 |
|
556 |
lemma disjI1: "P ==> P|Q" |
|
557 |
apply (unfold or_def) |
|
17589 | 558 |
apply (iprover intro: allI impI mp) |
15411 | 559 |
done |
560 |
||
561 |
lemma disjI2: "Q ==> P|Q" |
|
562 |
apply (unfold or_def) |
|
17589 | 563 |
apply (iprover intro: allI impI mp) |
15411 | 564 |
done |
565 |
||
566 |
lemma disjE: |
|
567 |
assumes major: "P|Q" |
|
568 |
and minorP: "P ==> R" |
|
569 |
and minorQ: "Q ==> R" |
|
570 |
shows "R" |
|
17589 | 571 |
by (iprover intro: minorP minorQ impI |
15411 | 572 |
major [unfolded or_def, THEN spec, THEN mp, THEN mp]) |
573 |
||
574 |
||
20944 | 575 |
subsubsection {*Classical logic*} |
15411 | 576 |
|
577 |
lemma classical: |
|
578 |
assumes prem: "~P ==> P" |
|
579 |
shows "P" |
|
580 |
apply (rule True_or_False [THEN disjE, THEN eqTrueE]) |
|
581 |
apply assumption |
|
582 |
apply (rule notI [THEN prem, THEN eqTrueI]) |
|
583 |
apply (erule subst) |
|
584 |
apply assumption |
|
585 |
done |
|
586 |
||
587 |
lemmas ccontr = FalseE [THEN classical, standard] |
|
588 |
||
589 |
(*notE with premises exchanged; it discharges ~R so that it can be used to |
|
590 |
make elimination rules*) |
|
591 |
lemma rev_notE: |
|
592 |
assumes premp: "P" |
|
593 |
and premnot: "~R ==> ~P" |
|
594 |
shows "R" |
|
595 |
apply (rule ccontr) |
|
596 |
apply (erule notE [OF premnot premp]) |
|
597 |
done |
|
598 |
||
599 |
(*Double negation law*) |
|
600 |
lemma notnotD: "~~P ==> P" |
|
601 |
apply (rule classical) |
|
602 |
apply (erule notE) |
|
603 |
apply assumption |
|
604 |
done |
|
605 |
||
606 |
lemma contrapos_pp: |
|
607 |
assumes p1: "Q" |
|
608 |
and p2: "~P ==> ~Q" |
|
609 |
shows "P" |
|
17589 | 610 |
by (iprover intro: classical p1 p2 notE) |
15411 | 611 |
|
612 |
||
20944 | 613 |
subsubsection {*Unique existence*} |
15411 | 614 |
|
615 |
lemma ex1I: |
|
23553 | 616 |
assumes "P a" "!!x. P(x) ==> x=a" |
15411 | 617 |
shows "EX! x. P(x)" |
23553 | 618 |
by (unfold Ex1_def, iprover intro: assms exI conjI allI impI) |
15411 | 619 |
|
620 |
text{*Sometimes easier to use: the premises have no shared variables. Safe!*} |
|
621 |
lemma ex_ex1I: |
|
622 |
assumes ex_prem: "EX x. P(x)" |
|
623 |
and eq: "!!x y. [| P(x); P(y) |] ==> x=y" |
|
624 |
shows "EX! x. P(x)" |
|
17589 | 625 |
by (iprover intro: ex_prem [THEN exE] ex1I eq) |
15411 | 626 |
|
627 |
lemma ex1E: |
|
628 |
assumes major: "EX! x. P(x)" |
|
629 |
and minor: "!!x. [| P(x); ALL y. P(y) --> y=x |] ==> R" |
|
630 |
shows "R" |
|
631 |
apply (rule major [unfolded Ex1_def, THEN exE]) |
|
632 |
apply (erule conjE) |
|
17589 | 633 |
apply (iprover intro: minor) |
15411 | 634 |
done |
635 |
||
636 |
lemma ex1_implies_ex: "EX! x. P x ==> EX x. P x" |
|
637 |
apply (erule ex1E) |
|
638 |
apply (rule exI) |
|
639 |
apply assumption |
|
640 |
done |
|
641 |
||
642 |
||
20944 | 643 |
subsubsection {*THE: definite description operator*} |
15411 | 644 |
|
645 |
lemma the_equality: |
|
646 |
assumes prema: "P a" |
|
647 |
and premx: "!!x. P x ==> x=a" |
|
648 |
shows "(THE x. P x) = a" |
|
649 |
apply (rule trans [OF _ the_eq_trivial]) |
|
650 |
apply (rule_tac f = "The" in arg_cong) |
|
651 |
apply (rule ext) |
|
652 |
apply (rule iffI) |
|
653 |
apply (erule premx) |
|
654 |
apply (erule ssubst, rule prema) |
|
655 |
done |
|
656 |
||
657 |
lemma theI: |
|
658 |
assumes "P a" and "!!x. P x ==> x=a" |
|
659 |
shows "P (THE x. P x)" |
|
23553 | 660 |
by (iprover intro: assms the_equality [THEN ssubst]) |
15411 | 661 |
|
662 |
lemma theI': "EX! x. P x ==> P (THE x. P x)" |
|
663 |
apply (erule ex1E) |
|
664 |
apply (erule theI) |
|
665 |
apply (erule allE) |
|
666 |
apply (erule mp) |
|
667 |
apply assumption |
|
668 |
done |
|
669 |
||
670 |
(*Easier to apply than theI: only one occurrence of P*) |
|
671 |
lemma theI2: |
|
672 |
assumes "P a" "!!x. P x ==> x=a" "!!x. P x ==> Q x" |
|
673 |
shows "Q (THE x. P x)" |
|
23553 | 674 |
by (iprover intro: assms theI) |
15411 | 675 |
|
24553 | 676 |
lemma the1I2: assumes "EX! x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)" |
677 |
by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)] |
|
678 |
elim:allE impE) |
|
679 |
||
18697 | 680 |
lemma the1_equality [elim?]: "[| EX!x. P x; P a |] ==> (THE x. P x) = a" |
15411 | 681 |
apply (rule the_equality) |
682 |
apply assumption |
|
683 |
apply (erule ex1E) |
|
684 |
apply (erule all_dupE) |
|
685 |
apply (drule mp) |
|
686 |
apply assumption |
|
687 |
apply (erule ssubst) |
|
688 |
apply (erule allE) |
|
689 |
apply (erule mp) |
|
690 |
apply assumption |
|
691 |
done |
|
692 |
||
693 |
lemma the_sym_eq_trivial: "(THE y. x=y) = x" |
|
694 |
apply (rule the_equality) |
|
695 |
apply (rule refl) |
|
696 |
apply (erule sym) |
|
697 |
done |
|
698 |
||
699 |
||
20944 | 700 |
subsubsection {*Classical intro rules for disjunction and existential quantifiers*} |
15411 | 701 |
|
702 |
lemma disjCI: |
|
703 |
assumes "~Q ==> P" shows "P|Q" |
|
704 |
apply (rule classical) |
|
23553 | 705 |
apply (iprover intro: assms disjI1 disjI2 notI elim: notE) |
15411 | 706 |
done |
707 |
||
708 |
lemma excluded_middle: "~P | P" |
|
17589 | 709 |
by (iprover intro: disjCI) |
15411 | 710 |
|
20944 | 711 |
text {* |
712 |
case distinction as a natural deduction rule. |
|
713 |
Note that @{term "~P"} is the second case, not the first |
|
714 |
*} |
|
27126
3ede9103de8e
eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents:
27107
diff
changeset
|
715 |
lemma case_split [case_names True False]: |
15411 | 716 |
assumes prem1: "P ==> Q" |
717 |
and prem2: "~P ==> Q" |
|
718 |
shows "Q" |
|
719 |
apply (rule excluded_middle [THEN disjE]) |
|
720 |
apply (erule prem2) |
|
721 |
apply (erule prem1) |
|
722 |
done |
|
27126
3ede9103de8e
eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents:
27107
diff
changeset
|
723 |
|
15411 | 724 |
(*Classical implies (-->) elimination. *) |
725 |
lemma impCE: |
|
726 |
assumes major: "P-->Q" |
|
727 |
and minor: "~P ==> R" "Q ==> R" |
|
728 |
shows "R" |
|
729 |
apply (rule excluded_middle [of P, THEN disjE]) |
|
17589 | 730 |
apply (iprover intro: minor major [THEN mp])+ |
15411 | 731 |
done |
732 |
||
733 |
(*This version of --> elimination works on Q before P. It works best for |
|
734 |
those cases in which P holds "almost everywhere". Can't install as |
|
735 |
default: would break old proofs.*) |
|
736 |
lemma impCE': |
|
737 |
assumes major: "P-->Q" |
|
738 |
and minor: "Q ==> R" "~P ==> R" |
|
739 |
shows "R" |
|
740 |
apply (rule excluded_middle [of P, THEN disjE]) |
|
17589 | 741 |
apply (iprover intro: minor major [THEN mp])+ |
15411 | 742 |
done |
743 |
||
744 |
(*Classical <-> elimination. *) |
|
745 |
lemma iffCE: |
|
746 |
assumes major: "P=Q" |
|
747 |
and minor: "[| P; Q |] ==> R" "[| ~P; ~Q |] ==> R" |
|
748 |
shows "R" |
|
749 |
apply (rule major [THEN iffE]) |
|
17589 | 750 |
apply (iprover intro: minor elim: impCE notE) |
15411 | 751 |
done |
752 |
||
753 |
lemma exCI: |
|
754 |
assumes "ALL x. ~P(x) ==> P(a)" |
|
755 |
shows "EX x. P(x)" |
|
756 |
apply (rule ccontr) |
|
23553 | 757 |
apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"]) |
15411 | 758 |
done |
759 |
||
760 |
||
12386 | 761 |
subsubsection {* Intuitionistic Reasoning *} |
762 |
||
763 |
lemma impE': |
|
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
764 |
assumes 1: "P --> Q" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
765 |
and 2: "Q ==> R" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
766 |
and 3: "P --> Q ==> P" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
767 |
shows R |
12386 | 768 |
proof - |
769 |
from 3 and 1 have P . |
|
770 |
with 1 have Q by (rule impE) |
|
771 |
with 2 show R . |
|
772 |
qed |
|
773 |
||
774 |
lemma allE': |
|
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
775 |
assumes 1: "ALL x. P x" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
776 |
and 2: "P x ==> ALL x. P x ==> Q" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
777 |
shows Q |
12386 | 778 |
proof - |
779 |
from 1 have "P x" by (rule spec) |
|
780 |
from this and 1 show Q by (rule 2) |
|
781 |
qed |
|
782 |
||
12937
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
783 |
lemma notE': |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
784 |
assumes 1: "~ P" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
785 |
and 2: "~ P ==> P" |
0c4fd7529467
clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents:
12892
diff
changeset
|
786 |
shows R |
12386 | 787 |
proof - |
788 |
from 2 and 1 have P . |
|
789 |
with 1 show R by (rule notE) |
|
790 |
qed |
|
791 |
||
22444
fb80fedd192d
added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents:
22377
diff
changeset
|
792 |
lemma TrueE: "True ==> P ==> P" . |
fb80fedd192d
added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents:
22377
diff
changeset
|
793 |
lemma notFalseE: "~ False ==> P ==> P" . |
fb80fedd192d
added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents:
22377
diff
changeset
|
794 |
|
22467
c9357ef01168
TrueElim and notTrueElim tested and added as safe elim rules.
dixon
parents:
22445
diff
changeset
|
795 |
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE |
15801 | 796 |
and [Pure.intro!] = iffI conjI impI TrueI notI allI refl |
797 |
and [Pure.elim 2] = allE notE' impE' |
|
798 |
and [Pure.intro] = exI disjI2 disjI1 |
|
12386 | 799 |
|
800 |
lemmas [trans] = trans |
|
801 |
and [sym] = sym not_sym |
|
15801 | 802 |
and [Pure.elim?] = iffD1 iffD2 impE |
11750 | 803 |
|
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28856
diff
changeset
|
804 |
use "Tools/hologic.ML" |
23553 | 805 |
|
11438
3d9222b80989
declare trans [trans] (*overridden in theory Calculation*);
wenzelm
parents:
11432
diff
changeset
|
806 |
|
11750 | 807 |
subsubsection {* Atomizing meta-level connectives *} |
808 |
||
28513 | 809 |
axiomatization where |
810 |
eq_reflection: "x = y \<Longrightarrow> x \<equiv> y" (*admissible axiom*) |
|
811 |
||
11750 | 812 |
lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)" |
12003 | 813 |
proof |
9488 | 814 |
assume "!!x. P x" |
23389 | 815 |
then show "ALL x. P x" .. |
9488 | 816 |
next |
817 |
assume "ALL x. P x" |
|
23553 | 818 |
then show "!!x. P x" by (rule allE) |
9488 | 819 |
qed |
820 |
||
11750 | 821 |
lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)" |
12003 | 822 |
proof |
9488 | 823 |
assume r: "A ==> B" |
10383 | 824 |
show "A --> B" by (rule impI) (rule r) |
9488 | 825 |
next |
826 |
assume "A --> B" and A |
|
23553 | 827 |
then show B by (rule mp) |
9488 | 828 |
qed |
829 |
||
14749 | 830 |
lemma atomize_not: "(A ==> False) == Trueprop (~A)" |
831 |
proof |
|
832 |
assume r: "A ==> False" |
|
833 |
show "~A" by (rule notI) (rule r) |
|
834 |
next |
|
835 |
assume "~A" and A |
|
23553 | 836 |
then show False by (rule notE) |
14749 | 837 |
qed |
838 |
||
11750 | 839 |
lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)" |
12003 | 840 |
proof |
10432
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
841 |
assume "x == y" |
23553 | 842 |
show "x = y" by (unfold `x == y`) (rule refl) |
10432
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
843 |
next |
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
844 |
assume "x = y" |
23553 | 845 |
then show "x == y" by (rule eq_reflection) |
10432
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
846 |
qed |
3dfbc913d184
added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents:
10383
diff
changeset
|
847 |
|
28856
5e009a80fe6d
Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents:
28741
diff
changeset
|
848 |
lemma atomize_conj [atomize]: "(A &&& B) == Trueprop (A & B)" |
12003 | 849 |
proof |
28856
5e009a80fe6d
Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents:
28741
diff
changeset
|
850 |
assume conj: "A &&& B" |
19121 | 851 |
show "A & B" |
852 |
proof (rule conjI) |
|
853 |
from conj show A by (rule conjunctionD1) |
|
854 |
from conj show B by (rule conjunctionD2) |
|
855 |
qed |
|
11953 | 856 |
next |
19121 | 857 |
assume conj: "A & B" |
28856
5e009a80fe6d
Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents:
28741
diff
changeset
|
858 |
show "A &&& B" |
19121 | 859 |
proof - |
860 |
from conj show A .. |
|
861 |
from conj show B .. |
|
11953 | 862 |
qed |
863 |
qed |
|
864 |
||
12386 | 865 |
lemmas [symmetric, rulify] = atomize_all atomize_imp |
18832 | 866 |
and [symmetric, defn] = atomize_all atomize_imp atomize_eq |
12386 | 867 |
|
11750 | 868 |
|
26580
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
869 |
subsubsection {* Atomizing elimination rules *} |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
870 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
871 |
setup AtomizeElim.setup |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
872 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
873 |
lemma atomize_exL[atomize_elim]: "(!!x. P x ==> Q) == ((EX x. P x) ==> Q)" |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
874 |
by rule iprover+ |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
875 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
876 |
lemma atomize_conjL[atomize_elim]: "(A ==> B ==> C) == (A & B ==> C)" |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
877 |
by rule iprover+ |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
878 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
879 |
lemma atomize_disjL[atomize_elim]: "((A ==> C) ==> (B ==> C) ==> C) == ((A | B ==> C) ==> C)" |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
880 |
by rule iprover+ |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
881 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
882 |
lemma atomize_elimL[atomize_elim]: "(!!B. (A ==> B) ==> B) == Trueprop A" .. |
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
883 |
|
c3e597a476fd
Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents:
26555
diff
changeset
|
884 |
|
20944 | 885 |
subsection {* Package setup *} |
886 |
||
11750 | 887 |
subsubsection {* Classical Reasoner setup *} |
9529 | 888 |
|
26411 | 889 |
lemma imp_elim: "P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R" |
890 |
by (rule classical) iprover |
|
891 |
||
892 |
lemma swap: "~ P ==> (~ R ==> P) ==> R" |
|
893 |
by (rule classical) iprover |
|
894 |
||
20944 | 895 |
lemma thin_refl: |
896 |
"\<And>X. \<lbrakk> x=x; PROP W \<rbrakk> \<Longrightarrow> PROP W" . |
|
897 |
||
21151 | 898 |
ML {* |
899 |
structure Hypsubst = HypsubstFun( |
|
900 |
struct |
|
901 |
structure Simplifier = Simplifier |
|
21218 | 902 |
val dest_eq = HOLogic.dest_eq |
21151 | 903 |
val dest_Trueprop = HOLogic.dest_Trueprop |
904 |
val dest_imp = HOLogic.dest_imp |
|
26411 | 905 |
val eq_reflection = @{thm eq_reflection} |
906 |
val rev_eq_reflection = @{thm meta_eq_to_obj_eq} |
|
907 |
val imp_intr = @{thm impI} |
|
908 |
val rev_mp = @{thm rev_mp} |
|
909 |
val subst = @{thm subst} |
|
910 |
val sym = @{thm sym} |
|
22129 | 911 |
val thin_refl = @{thm thin_refl}; |
27572
67cd6ed76446
single_hyp(_meta)_subst_tac: Controlled substitution of a single hyp
krauss
parents:
27338
diff
changeset
|
912 |
val prop_subst = @{lemma "PROP P t ==> PROP prop (x = t ==> PROP P x)" |
67cd6ed76446
single_hyp(_meta)_subst_tac: Controlled substitution of a single hyp
krauss
parents:
27338
diff
changeset
|
913 |
by (unfold prop_def) (drule eq_reflection, unfold)} |
21151 | 914 |
end); |
21671 | 915 |
open Hypsubst; |
21151 | 916 |
|
917 |
structure Classical = ClassicalFun( |
|
918 |
struct |
|
26411 | 919 |
val imp_elim = @{thm imp_elim} |
920 |
val not_elim = @{thm notE} |
|
921 |
val swap = @{thm swap} |
|
922 |
val classical = @{thm classical} |
|
21151 | 923 |
val sizef = Drule.size_of_thm |
924 |
val hyp_subst_tacs = [Hypsubst.hyp_subst_tac] |
|
925 |
end); |
|
926 |
||
927 |
structure BasicClassical: BASIC_CLASSICAL = Classical; |
|
21671 | 928 |
open BasicClassical; |
22129 | 929 |
|
27338 | 930 |
ML_Antiquote.value "claset" |
931 |
(Scan.succeed "Classical.local_claset_of (ML_Context.the_local_context ())"); |
|
24035 | 932 |
|
933 |
structure ResAtpset = NamedThmsFun(val name = "atp" val description = "ATP rules"); |
|
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset
|
934 |
|
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset
|
935 |
structure ResBlacklist = NamedThmsFun(val name = "noatp" val description = "Theorems blacklisted for ATP"); |
21151 | 936 |
*} |
937 |
||
25388 | 938 |
text {*ResBlacklist holds theorems blacklisted to sledgehammer. |
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset
|
939 |
These theorems typically produce clauses that are prolific (match too many equality or |
25388 | 940 |
membership literals) and relate to seldom-used facts. Some duplicate other rules.*} |
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset
|
941 |
|
21009 | 942 |
setup {* |
943 |
let |
|
944 |
(*prevent substitution on bool*) |
|
945 |
fun hyp_subst_tac' i thm = if i <= Thm.nprems_of thm andalso |
|
946 |
Term.exists_Const (fn ("op =", Type (_, [T, _])) => T <> Type ("bool", []) | _ => false) |
|
947 |
(nth (Thm.prems_of thm) (i - 1)) then Hypsubst.hyp_subst_tac i thm else no_tac thm; |
|
948 |
in |
|
21151 | 949 |
Hypsubst.hypsubst_setup |
950 |
#> ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac) |
|
951 |
#> Classical.setup |
|
952 |
#> ResAtpset.setup |
|
24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset
|
953 |
#> ResBlacklist.setup |
21009 | 954 |
end |
955 |
*} |
|
956 |
||
957 |
declare iffI [intro!] |
|
958 |
and notI [intro!] |
|
959 |
and impI [intro!] |
|
960 |
and disjCI [intro!] |
|
961 |
and conjI [intro!] |
|
962 |
and TrueI [intro!] |
|
963 |
and refl [intro!] |
|
964 |
||
965 |
declare iffCE [elim!] |
|
966 |
and FalseE [elim!] |
|
967 |
and impCE [elim!] |
|
968 |
and disjE [elim!] |
|
969 |
and conjE [elim!] |
|
970 |
and conjE [elim!] |
|
971 |
||
972 |
declare ex_ex1I [intro!] |
|
973 |
and allI [intro!] |
|
974 |
and the_equality [intro] |
|
975 |
and exI [intro] |
|
976 |
||
977 |
declare exE [elim!] |
|
978 |
allE [elim] |
|
979 |
||
22377 | 980 |
ML {* val HOL_cs = @{claset} *} |
19162 | 981 |
|
20223 | 982 |
lemma contrapos_np: "~ Q ==> (~ P ==> Q) ==> P" |
983 |
apply (erule swap) |
|
984 |
apply (erule (1) meta_mp) |
|
985 |
done |
|
10383 | 986 |
|
18689
a50587cd8414
prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents:
18595
diff
changeset
|
987 |
declare ex_ex1I [rule del, intro! 2] |
a50587cd8414
prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents:
18595
diff
changeset
|
988 |
and ex1I [intro] |
a50587cd8414
prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents:
18595
diff
changeset
|
989 |
|
12386 | 990 |
lemmas [intro?] = ext |
991 |
and [elim?] = ex1_implies_ex |
|
11977 | 992 |
|
20944 | 993 |
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*) |
20973 | 994 |
lemma alt_ex1E [elim!]: |
20944 | 995 |
assumes major: "\<exists>!x. P x" |
996 |
and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R" |
|
997 |
shows R |
|
998 |
apply (rule ex1E [OF major]) |
|
999 |
apply (rule prem) |
|
22129 | 1000 |
apply (tactic {* ares_tac @{thms allI} 1 *})+ |
1001 |
apply (tactic {* etac (Classical.dup_elim @{thm allE}) 1 *}) |
|
1002 |
apply iprover |
|
1003 |
done |
|
20944 | 1004 |
|
21151 | 1005 |
ML {* |
25388 | 1006 |
structure Blast = BlastFun |
1007 |
( |
|
21151 | 1008 |
type claset = Classical.claset |
22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22481
diff
changeset
|
1009 |
val equality_name = @{const_name "op ="} |
22993 | 1010 |
val not_name = @{const_name Not} |
26411 | 1011 |
val notE = @{thm notE} |
1012 |
val ccontr = @{thm ccontr} |
|
21151 | 1013 |
val contr_tac = Classical.contr_tac |
1014 |
val dup_intr = Classical.dup_intr |
|
1015 |
val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac |
|
21671 | 1016 |
val claset = Classical.claset |
21151 | 1017 |
val rep_cs = Classical.rep_cs |
1018 |
val cla_modifiers = Classical.cla_modifiers |
|
1019 |
val cla_meth' = Classical.cla_meth' |
|
25388 | 1020 |
); |
21671 | 1021 |
val Blast_tac = Blast.Blast_tac; |
1022 |
val blast_tac = Blast.blast_tac; |
|