author | nipkow |
Thu, 11 Nov 1999 11:43:14 +0100 | |
changeset 8009 | 29a7a79ee7f4 |
parent 8005 | b64d86018785 |
child 8025 | 61dde9078e24 |
permissions | -rw-r--r-- |
1465 | 1 |
(* Title: HOL/set |
923 | 2 |
ID: $Id$ |
1465 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
923 | 4 |
Copyright 1991 University of Cambridge |
5 |
||
1985
84cf16192e03
Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
1937
diff
changeset
|
6 |
Set theory for higher-order logic. A set is simply a predicate. |
923 | 7 |
*) |
8 |
||
1548 | 9 |
section "Relating predicates and sets"; |
10 |
||
3469
61d927bd57ec
Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson
parents:
3420
diff
changeset
|
11 |
Addsimps [Collect_mem_eq]; |
61d927bd57ec
Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson
parents:
3420
diff
changeset
|
12 |
AddIffs [mem_Collect_eq]; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
13 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
14 |
Goal "P(a) ==> a : {x. P(x)}"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
15 |
by (Asm_simp_tac 1); |
923 | 16 |
qed "CollectI"; |
17 |
||
5316 | 18 |
Goal "a : {x. P(x)} ==> P(a)"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
19 |
by (Asm_full_simp_tac 1); |
923 | 20 |
qed "CollectD"; |
21 |
||
7658 | 22 |
bind_thm ("CollectE", make_elim CollectD); |
23 |
||
5316 | 24 |
val [prem] = Goal "[| !!x. (x:A) = (x:B) |] ==> A = B"; |
923 | 25 |
by (rtac (prem RS ext RS arg_cong RS box_equals) 1); |
26 |
by (rtac Collect_mem_eq 1); |
|
27 |
by (rtac Collect_mem_eq 1); |
|
28 |
qed "set_ext"; |
|
29 |
||
5316 | 30 |
val [prem] = Goal "[| !!x. P(x)=Q(x) |] ==> {x. P(x)} = {x. Q(x)}"; |
923 | 31 |
by (rtac (prem RS ext RS arg_cong) 1); |
32 |
qed "Collect_cong"; |
|
33 |
||
34 |
val CollectE = make_elim CollectD; |
|
35 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
36 |
AddSIs [CollectI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
37 |
AddSEs [CollectE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
38 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
39 |
|
1548 | 40 |
section "Bounded quantifiers"; |
923 | 41 |
|
5316 | 42 |
val prems = Goalw [Ball_def] |
923 | 43 |
"[| !!x. x:A ==> P(x) |] ==> ! x:A. P(x)"; |
44 |
by (REPEAT (ares_tac (prems @ [allI,impI]) 1)); |
|
45 |
qed "ballI"; |
|
46 |
||
5316 | 47 |
Goalw [Ball_def] "[| ! x:A. P(x); x:A |] ==> P(x)"; |
48 |
by (Blast_tac 1); |
|
923 | 49 |
qed "bspec"; |
50 |
||
5316 | 51 |
val major::prems = Goalw [Ball_def] |
923 | 52 |
"[| ! x:A. P(x); P(x) ==> Q; x~:A ==> Q |] ==> Q"; |
53 |
by (rtac (major RS spec RS impCE) 1); |
|
54 |
by (REPEAT (eresolve_tac prems 1)); |
|
55 |
qed "ballE"; |
|
56 |
||
57 |
(*Takes assumptions ! x:A.P(x) and a:A; creates assumption P(a)*) |
|
58 |
fun ball_tac i = etac ballE i THEN contr_tac (i+1); |
|
59 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
60 |
AddSIs [ballI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
61 |
AddEs [ballE]; |
7441 | 62 |
AddXDs [bspec]; |
5521 | 63 |
(* gives better instantiation for bound: *) |
64 |
claset_ref() := claset() addWrapper ("bspec", fn tac2 => |
|
65 |
(dtac bspec THEN' atac) APPEND' tac2); |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
66 |
|
6006 | 67 |
(*Normally the best argument order: P(x) constrains the choice of x:A*) |
5316 | 68 |
Goalw [Bex_def] "[| P(x); x:A |] ==> ? x:A. P(x)"; |
69 |
by (Blast_tac 1); |
|
923 | 70 |
qed "bexI"; |
71 |
||
6006 | 72 |
(*The best argument order when there is only one x:A*) |
73 |
Goalw [Bex_def] "[| x:A; P(x) |] ==> ? x:A. P(x)"; |
|
74 |
by (Blast_tac 1); |
|
75 |
qed "rev_bexI"; |
|
76 |
||
7031 | 77 |
val prems = Goal |
7007 | 78 |
"[| ! x:A. ~P(x) ==> P(a); a:A |] ==> ? x:A. P(x)"; |
79 |
by (rtac classical 1); |
|
80 |
by (REPEAT (ares_tac (prems@[bexI,ballI,notI,notE]) 1)) ; |
|
81 |
qed "bexCI"; |
|
923 | 82 |
|
5316 | 83 |
val major::prems = Goalw [Bex_def] |
923 | 84 |
"[| ? x:A. P(x); !!x. [| x:A; P(x) |] ==> Q |] ==> Q"; |
85 |
by (rtac (major RS exE) 1); |
|
86 |
by (REPEAT (eresolve_tac (prems @ [asm_rl,conjE]) 1)); |
|
87 |
qed "bexE"; |
|
88 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
89 |
AddIs [bexI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
90 |
AddSEs [bexE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
91 |
|
3420 | 92 |
(*Trival rewrite rule*) |
5069 | 93 |
Goal "(! x:A. P) = ((? x. x:A) --> P)"; |
4089 | 94 |
by (simp_tac (simpset() addsimps [Ball_def]) 1); |
3420 | 95 |
qed "ball_triv"; |
1816 | 96 |
|
1882 | 97 |
(*Dual form for existentials*) |
5069 | 98 |
Goal "(? x:A. P) = ((? x. x:A) & P)"; |
4089 | 99 |
by (simp_tac (simpset() addsimps [Bex_def]) 1); |
3420 | 100 |
qed "bex_triv"; |
1882 | 101 |
|
3420 | 102 |
Addsimps [ball_triv, bex_triv]; |
923 | 103 |
|
104 |
(** Congruence rules **) |
|
105 |
||
6291 | 106 |
val prems = Goalw [Ball_def] |
923 | 107 |
"[| A=B; !!x. x:B ==> P(x) = Q(x) |] ==> \ |
108 |
\ (! x:A. P(x)) = (! x:B. Q(x))"; |
|
6291 | 109 |
by (asm_simp_tac (simpset() addsimps prems) 1); |
923 | 110 |
qed "ball_cong"; |
111 |
||
6291 | 112 |
val prems = Goalw [Bex_def] |
923 | 113 |
"[| A=B; !!x. x:B ==> P(x) = Q(x) |] ==> \ |
114 |
\ (? x:A. P(x)) = (? x:B. Q(x))"; |
|
6291 | 115 |
by (asm_simp_tac (simpset() addcongs [conj_cong] addsimps prems) 1); |
923 | 116 |
qed "bex_cong"; |
117 |
||
6291 | 118 |
Addcongs [ball_cong,bex_cong]; |
119 |
||
1548 | 120 |
section "Subsets"; |
923 | 121 |
|
5316 | 122 |
val prems = Goalw [subset_def] "(!!x. x:A ==> x:B) ==> A <= B"; |
923 | 123 |
by (REPEAT (ares_tac (prems @ [ballI]) 1)); |
124 |
qed "subsetI"; |
|
125 |
||
5649 | 126 |
(*Map the type ('a set => anything) to just 'a. |
127 |
For overloading constants whose first argument has type "'a set" *) |
|
128 |
fun overload_1st_set s = Blast.overloaded (s, HOLogic.dest_setT o domain_type); |
|
129 |
||
4059 | 130 |
(*While (:) is not, its type must be kept |
131 |
for overloading of = to work.*) |
|
4240
8ba60a4cd380
Renamed "overload" to "overloaded" for sml/nj compatibility
paulson
parents:
4231
diff
changeset
|
132 |
Blast.overloaded ("op :", domain_type); |
5649 | 133 |
|
134 |
overload_1st_set "Ball"; (*need UNION, INTER also?*) |
|
135 |
overload_1st_set "Bex"; |
|
4059 | 136 |
|
4469 | 137 |
(*Image: retain the type of the set being expressed*) |
8005 | 138 |
Blast.overloaded ("image", domain_type); |
2881 | 139 |
|
923 | 140 |
(*Rule in Modus Ponens style*) |
5316 | 141 |
Goalw [subset_def] "[| A <= B; c:A |] ==> c:B"; |
142 |
by (Blast_tac 1); |
|
923 | 143 |
qed "subsetD"; |
7658 | 144 |
AddXIs [subsetD]; |
923 | 145 |
|
146 |
(*The same, with reversed premises for use with etac -- cf rev_mp*) |
|
7007 | 147 |
Goal "[| c:A; A <= B |] ==> c:B"; |
148 |
by (REPEAT (ares_tac [subsetD] 1)) ; |
|
149 |
qed "rev_subsetD"; |
|
7658 | 150 |
AddXIs [rev_subsetD]; |
923 | 151 |
|
1920 | 152 |
(*Converts A<=B to x:A ==> x:B*) |
153 |
fun impOfSubs th = th RSN (2, rev_subsetD); |
|
154 |
||
7007 | 155 |
Goal "[| A <= B; c ~: B |] ==> c ~: A"; |
156 |
by (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ; |
|
157 |
qed "contra_subsetD"; |
|
1841 | 158 |
|
7007 | 159 |
Goal "[| c ~: B; A <= B |] ==> c ~: A"; |
160 |
by (REPEAT (eresolve_tac [asm_rl, contrapos, subsetD] 1)) ; |
|
161 |
qed "rev_contra_subsetD"; |
|
1841 | 162 |
|
923 | 163 |
(*Classical elimination rule*) |
5316 | 164 |
val major::prems = Goalw [subset_def] |
923 | 165 |
"[| A <= B; c~:A ==> P; c:B ==> P |] ==> P"; |
166 |
by (rtac (major RS ballE) 1); |
|
167 |
by (REPEAT (eresolve_tac prems 1)); |
|
168 |
qed "subsetCE"; |
|
169 |
||
170 |
(*Takes assumptions A<=B; c:A and creates the assumption c:B *) |
|
171 |
fun set_mp_tac i = etac subsetCE i THEN mp_tac i; |
|
172 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
173 |
AddSIs [subsetI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
174 |
AddEs [subsetD, subsetCE]; |
923 | 175 |
|
7007 | 176 |
Goal "A <= (A::'a set)"; |
177 |
by (Fast_tac 1); |
|
178 |
qed "subset_refl"; (*Blast_tac would try order_refl and fail*) |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
179 |
|
5316 | 180 |
Goal "[| A<=B; B<=C |] ==> A<=(C::'a set)"; |
2891 | 181 |
by (Blast_tac 1); |
923 | 182 |
qed "subset_trans"; |
183 |
||
184 |
||
1548 | 185 |
section "Equality"; |
923 | 186 |
|
187 |
(*Anti-symmetry of the subset relation*) |
|
5316 | 188 |
Goal "[| A <= B; B <= A |] ==> A = (B::'a set)"; |
5318 | 189 |
by (rtac set_ext 1); |
5316 | 190 |
by (blast_tac (claset() addIs [subsetD]) 1); |
923 | 191 |
qed "subset_antisym"; |
192 |
val equalityI = subset_antisym; |
|
193 |
||
1762 | 194 |
AddSIs [equalityI]; |
195 |
||
923 | 196 |
(* Equality rules from ZF set theory -- are they appropriate here? *) |
5316 | 197 |
Goal "A = B ==> A<=(B::'a set)"; |
198 |
by (etac ssubst 1); |
|
923 | 199 |
by (rtac subset_refl 1); |
200 |
qed "equalityD1"; |
|
201 |
||
5316 | 202 |
Goal "A = B ==> B<=(A::'a set)"; |
203 |
by (etac ssubst 1); |
|
923 | 204 |
by (rtac subset_refl 1); |
205 |
qed "equalityD2"; |
|
206 |
||
5316 | 207 |
val prems = Goal |
923 | 208 |
"[| A = B; [| A<=B; B<=(A::'a set) |] ==> P |] ==> P"; |
209 |
by (resolve_tac prems 1); |
|
210 |
by (REPEAT (resolve_tac (prems RL [equalityD1,equalityD2]) 1)); |
|
211 |
qed "equalityE"; |
|
212 |
||
5316 | 213 |
val major::prems = Goal |
923 | 214 |
"[| A = B; [| c:A; c:B |] ==> P; [| c~:A; c~:B |] ==> P |] ==> P"; |
215 |
by (rtac (major RS equalityE) 1); |
|
216 |
by (REPEAT (contr_tac 1 ORELSE eresolve_tac ([asm_rl,subsetCE]@prems) 1)); |
|
217 |
qed "equalityCE"; |
|
218 |
||
219 |
(*Lemma for creating induction formulae -- for "pattern matching" on p |
|
220 |
To make the induction hypotheses usable, apply "spec" or "bspec" to |
|
221 |
put universal quantifiers over the free variables in p. *) |
|
5316 | 222 |
val prems = Goal |
923 | 223 |
"[| p:A; !!z. z:A ==> p=z --> R |] ==> R"; |
224 |
by (rtac mp 1); |
|
225 |
by (REPEAT (resolve_tac (refl::prems) 1)); |
|
226 |
qed "setup_induction"; |
|
227 |
||
228 |
||
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
229 |
section "The universal set -- UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
230 |
|
7031 | 231 |
Goalw [UNIV_def] "x : UNIV"; |
232 |
by (rtac CollectI 1); |
|
233 |
by (rtac TrueI 1); |
|
234 |
qed "UNIV_I"; |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
235 |
|
4434 | 236 |
Addsimps [UNIV_I]; |
237 |
AddIs [UNIV_I]; (*unsafe makes it less likely to cause problems*) |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
238 |
|
7031 | 239 |
Goal "A <= UNIV"; |
240 |
by (rtac subsetI 1); |
|
241 |
by (rtac UNIV_I 1); |
|
242 |
qed "subset_UNIV"; |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
243 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
244 |
(** Eta-contracting these two rules (to remove P) causes them to be ignored |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
245 |
because of their interaction with congruence rules. **) |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
246 |
|
5069 | 247 |
Goalw [Ball_def] "Ball UNIV P = All P"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
248 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
249 |
qed "ball_UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
250 |
|
5069 | 251 |
Goalw [Bex_def] "Bex UNIV P = Ex P"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
252 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
253 |
qed "bex_UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
254 |
Addsimps [ball_UNIV, bex_UNIV]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
255 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
256 |
|
2858 | 257 |
section "The empty set -- {}"; |
258 |
||
7007 | 259 |
Goalw [empty_def] "(c : {}) = False"; |
260 |
by (Blast_tac 1) ; |
|
261 |
qed "empty_iff"; |
|
2858 | 262 |
|
263 |
Addsimps [empty_iff]; |
|
264 |
||
7007 | 265 |
Goal "a:{} ==> P"; |
266 |
by (Full_simp_tac 1); |
|
267 |
qed "emptyE"; |
|
2858 | 268 |
|
269 |
AddSEs [emptyE]; |
|
270 |
||
7007 | 271 |
Goal "{} <= A"; |
272 |
by (Blast_tac 1) ; |
|
273 |
qed "empty_subsetI"; |
|
2858 | 274 |
|
5256 | 275 |
(*One effect is to delete the ASSUMPTION {} <= A*) |
276 |
AddIffs [empty_subsetI]; |
|
277 |
||
7031 | 278 |
val [prem]= Goal "[| !!y. y:A ==> False |] ==> A={}"; |
7007 | 279 |
by (blast_tac (claset() addIs [prem RS FalseE]) 1) ; |
280 |
qed "equals0I"; |
|
2858 | 281 |
|
5256 | 282 |
(*Use for reasoning about disjointness: A Int B = {} *) |
7007 | 283 |
Goal "A={} ==> a ~: A"; |
284 |
by (Blast_tac 1) ; |
|
285 |
qed "equals0D"; |
|
2858 | 286 |
|
5450
fe9d103464a4
Changed equals0E back to equals0D and gave it the correct destruct form
paulson
parents:
5336
diff
changeset
|
287 |
AddDs [equals0D, sym RS equals0D]; |
5256 | 288 |
|
5069 | 289 |
Goalw [Ball_def] "Ball {} P = True"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
290 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
291 |
qed "ball_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
292 |
|
5069 | 293 |
Goalw [Bex_def] "Bex {} P = False"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
294 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
295 |
qed "bex_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
296 |
Addsimps [ball_empty, bex_empty]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
297 |
|
5069 | 298 |
Goal "UNIV ~= {}"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
299 |
by (blast_tac (claset() addEs [equalityE]) 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
300 |
qed "UNIV_not_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
301 |
AddIffs [UNIV_not_empty]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
302 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
303 |
|
2858 | 304 |
|
305 |
section "The Powerset operator -- Pow"; |
|
306 |
||
7007 | 307 |
Goalw [Pow_def] "(A : Pow(B)) = (A <= B)"; |
308 |
by (Asm_simp_tac 1); |
|
309 |
qed "Pow_iff"; |
|
2858 | 310 |
|
311 |
AddIffs [Pow_iff]; |
|
312 |
||
7031 | 313 |
Goalw [Pow_def] "A <= B ==> A : Pow(B)"; |
7007 | 314 |
by (etac CollectI 1); |
315 |
qed "PowI"; |
|
2858 | 316 |
|
7031 | 317 |
Goalw [Pow_def] "A : Pow(B) ==> A<=B"; |
7007 | 318 |
by (etac CollectD 1); |
319 |
qed "PowD"; |
|
320 |
||
2858 | 321 |
|
322 |
val Pow_bottom = empty_subsetI RS PowI; (* {}: Pow(B) *) |
|
323 |
val Pow_top = subset_refl RS PowI; (* A : Pow(A) *) |
|
324 |
||
325 |
||
5931 | 326 |
section "Set complement"; |
923 | 327 |
|
7031 | 328 |
Goalw [Compl_def] "(c : -A) = (c~:A)"; |
329 |
by (Blast_tac 1); |
|
330 |
qed "Compl_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
331 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
332 |
Addsimps [Compl_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
333 |
|
5490 | 334 |
val prems = Goalw [Compl_def] "[| c:A ==> False |] ==> c : -A"; |
923 | 335 |
by (REPEAT (ares_tac (prems @ [CollectI,notI]) 1)); |
336 |
qed "ComplI"; |
|
337 |
||
338 |
(*This form, with negated conclusion, works well with the Classical prover. |
|
339 |
Negated assumptions behave like formulae on the right side of the notional |
|
340 |
turnstile...*) |
|
5490 | 341 |
Goalw [Compl_def] "c : -A ==> c~:A"; |
5316 | 342 |
by (etac CollectD 1); |
923 | 343 |
qed "ComplD"; |
344 |
||
345 |
val ComplE = make_elim ComplD; |
|
346 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
347 |
AddSIs [ComplI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
348 |
AddSEs [ComplE]; |
1640 | 349 |
|
923 | 350 |
|
1548 | 351 |
section "Binary union -- Un"; |
923 | 352 |
|
7031 | 353 |
Goalw [Un_def] "(c : A Un B) = (c:A | c:B)"; |
354 |
by (Blast_tac 1); |
|
355 |
qed "Un_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
356 |
Addsimps [Un_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
357 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
358 |
Goal "c:A ==> c : A Un B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
359 |
by (Asm_simp_tac 1); |
923 | 360 |
qed "UnI1"; |
361 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
362 |
Goal "c:B ==> c : A Un B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
363 |
by (Asm_simp_tac 1); |
923 | 364 |
qed "UnI2"; |
365 |
||
366 |
(*Classical introduction rule: no commitment to A vs B*) |
|
7007 | 367 |
|
7031 | 368 |
val prems = Goal "(c~:B ==> c:A) ==> c : A Un B"; |
7007 | 369 |
by (Simp_tac 1); |
370 |
by (REPEAT (ares_tac (prems@[disjCI]) 1)) ; |
|
371 |
qed "UnCI"; |
|
923 | 372 |
|
5316 | 373 |
val major::prems = Goalw [Un_def] |
923 | 374 |
"[| c : A Un B; c:A ==> P; c:B ==> P |] ==> P"; |
375 |
by (rtac (major RS CollectD RS disjE) 1); |
|
376 |
by (REPEAT (eresolve_tac prems 1)); |
|
377 |
qed "UnE"; |
|
378 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
379 |
AddSIs [UnCI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
380 |
AddSEs [UnE]; |
1640 | 381 |
|
923 | 382 |
|
1548 | 383 |
section "Binary intersection -- Int"; |
923 | 384 |
|
7031 | 385 |
Goalw [Int_def] "(c : A Int B) = (c:A & c:B)"; |
386 |
by (Blast_tac 1); |
|
387 |
qed "Int_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
388 |
Addsimps [Int_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
389 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
390 |
Goal "[| c:A; c:B |] ==> c : A Int B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
391 |
by (Asm_simp_tac 1); |
923 | 392 |
qed "IntI"; |
393 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
394 |
Goal "c : A Int B ==> c:A"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
395 |
by (Asm_full_simp_tac 1); |
923 | 396 |
qed "IntD1"; |
397 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
398 |
Goal "c : A Int B ==> c:B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
399 |
by (Asm_full_simp_tac 1); |
923 | 400 |
qed "IntD2"; |
401 |
||
5316 | 402 |
val [major,minor] = Goal |
923 | 403 |
"[| c : A Int B; [| c:A; c:B |] ==> P |] ==> P"; |
404 |
by (rtac minor 1); |
|
405 |
by (rtac (major RS IntD1) 1); |
|
406 |
by (rtac (major RS IntD2) 1); |
|
407 |
qed "IntE"; |
|
408 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
409 |
AddSIs [IntI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
410 |
AddSEs [IntE]; |
923 | 411 |
|
1548 | 412 |
section "Set difference"; |
923 | 413 |
|
7031 | 414 |
Goalw [set_diff_def] "(c : A-B) = (c:A & c~:B)"; |
415 |
by (Blast_tac 1); |
|
416 |
qed "Diff_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
417 |
Addsimps [Diff_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
418 |
|
7007 | 419 |
Goal "[| c : A; c ~: B |] ==> c : A - B"; |
420 |
by (Asm_simp_tac 1) ; |
|
421 |
qed "DiffI"; |
|
923 | 422 |
|
7007 | 423 |
Goal "c : A - B ==> c : A"; |
424 |
by (Asm_full_simp_tac 1) ; |
|
425 |
qed "DiffD1"; |
|
923 | 426 |
|
7007 | 427 |
Goal "[| c : A - B; c : B |] ==> P"; |
428 |
by (Asm_full_simp_tac 1) ; |
|
429 |
qed "DiffD2"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
430 |
|
7031 | 431 |
val prems = Goal "[| c : A - B; [| c:A; c~:B |] ==> P |] ==> P"; |
7007 | 432 |
by (resolve_tac prems 1); |
433 |
by (REPEAT (ares_tac (prems RL [DiffD1, DiffD2 RS notI]) 1)) ; |
|
434 |
qed "DiffE"; |
|
923 | 435 |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
436 |
AddSIs [DiffI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
437 |
AddSEs [DiffE]; |
923 | 438 |
|
439 |
||
1548 | 440 |
section "Augmenting a set -- insert"; |
923 | 441 |
|
7031 | 442 |
Goalw [insert_def] "a : insert b A = (a=b | a:A)"; |
443 |
by (Blast_tac 1); |
|
444 |
qed "insert_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
445 |
Addsimps [insert_iff]; |
923 | 446 |
|
7031 | 447 |
Goal "a : insert a B"; |
7007 | 448 |
by (Simp_tac 1); |
449 |
qed "insertI1"; |
|
923 | 450 |
|
7007 | 451 |
Goal "!!a. a : B ==> a : insert b B"; |
452 |
by (Asm_simp_tac 1); |
|
453 |
qed "insertI2"; |
|
454 |
||
455 |
val major::prems = Goalw [insert_def] |
|
456 |
"[| a : insert b A; a=b ==> P; a:A ==> P |] ==> P"; |
|
457 |
by (rtac (major RS UnE) 1); |
|
458 |
by (REPEAT (eresolve_tac (prems @ [CollectE]) 1)); |
|
459 |
qed "insertE"; |
|
923 | 460 |
|
461 |
(*Classical introduction rule*) |
|
7031 | 462 |
val prems = Goal "(a~:B ==> a=b) ==> a: insert b B"; |
7007 | 463 |
by (Simp_tac 1); |
464 |
by (REPEAT (ares_tac (prems@[disjCI]) 1)) ; |
|
465 |
qed "insertCI"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
466 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
467 |
AddSIs [insertCI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
468 |
AddSEs [insertE]; |
923 | 469 |
|
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
470 |
Goal "A <= insert x B ==> A <= B & x ~: A | (? B'. A = insert x B' & B' <= B)"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
471 |
by (case_tac "x:A" 1); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
472 |
by (Fast_tac 2); |
7499 | 473 |
by (rtac disjI2 1); |
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
474 |
by (res_inst_tac [("x","A-{x}")] exI 1); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
475 |
by (Fast_tac 1); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
476 |
qed "subset_insertD"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
477 |
|
1548 | 478 |
section "Singletons, using insert"; |
923 | 479 |
|
7007 | 480 |
Goal "a : {a}"; |
481 |
by (rtac insertI1 1) ; |
|
482 |
qed "singletonI"; |
|
923 | 483 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
484 |
Goal "b : {a} ==> b=a"; |
2891 | 485 |
by (Blast_tac 1); |
923 | 486 |
qed "singletonD"; |
487 |
||
1776
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
488 |
bind_thm ("singletonE", make_elim singletonD); |
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
489 |
|
7007 | 490 |
Goal "(b : {a}) = (b=a)"; |
491 |
by (Blast_tac 1); |
|
492 |
qed "singleton_iff"; |
|
923 | 493 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
494 |
Goal "{a}={b} ==> a=b"; |
4089 | 495 |
by (blast_tac (claset() addEs [equalityE]) 1); |
923 | 496 |
qed "singleton_inject"; |
497 |
||
2858 | 498 |
(*Redundant? But unlike insertCI, it proves the subgoal immediately!*) |
499 |
AddSIs [singletonI]; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
500 |
AddSDs [singleton_inject]; |
3718 | 501 |
AddSEs [singletonE]; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
502 |
|
7969 | 503 |
Goal "{b} = insert a A = (a = b & A <= {b})"; |
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
504 |
by (safe_tac (claset() addSEs [equalityE])); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
505 |
by (ALLGOALS Blast_tac); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
506 |
qed "singleton_insert_inj_eq"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
507 |
|
7969 | 508 |
Goal "(insert a A = {b} ) = (a = b & A <= {b})"; |
509 |
by (rtac (singleton_insert_inj_eq RS (eq_sym_conv RS trans)) 1); |
|
510 |
qed "singleton_insert_inj_eq'"; |
|
511 |
||
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
512 |
Goal "A <= {x} ==> A={} | A = {x}"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
513 |
by (Fast_tac 1); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
514 |
qed "subset_singletonD"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
515 |
|
5069 | 516 |
Goal "{x. x=a} = {a}"; |
4423 | 517 |
by (Blast_tac 1); |
3582 | 518 |
qed "singleton_conv"; |
519 |
Addsimps [singleton_conv]; |
|
1531 | 520 |
|
5600 | 521 |
Goal "{x. a=x} = {a}"; |
6301 | 522 |
by (Blast_tac 1); |
5600 | 523 |
qed "singleton_conv2"; |
524 |
Addsimps [singleton_conv2]; |
|
525 |
||
1531 | 526 |
|
1548 | 527 |
section "Unions of families -- UNION x:A. B(x) is Union(B``A)"; |
923 | 528 |
|
5069 | 529 |
Goalw [UNION_def] "(b: (UN x:A. B(x))) = (EX x:A. b: B(x))"; |
2891 | 530 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
531 |
qed "UN_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
532 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
533 |
Addsimps [UN_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
534 |
|
923 | 535 |
(*The order of the premises presupposes that A is rigid; b may be flexible*) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
536 |
Goal "[| a:A; b: B(a) |] ==> b: (UN x:A. B(x))"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
537 |
by Auto_tac; |
923 | 538 |
qed "UN_I"; |
539 |
||
5316 | 540 |
val major::prems = Goalw [UNION_def] |
923 | 541 |
"[| b : (UN x:A. B(x)); !!x.[| x:A; b: B(x) |] ==> R |] ==> R"; |
542 |
by (rtac (major RS CollectD RS bexE) 1); |
|
543 |
by (REPEAT (ares_tac prems 1)); |
|
544 |
qed "UN_E"; |
|
545 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
546 |
AddIs [UN_I]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
547 |
AddSEs [UN_E]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
548 |
|
6291 | 549 |
val prems = Goalw [UNION_def] |
923 | 550 |
"[| A=B; !!x. x:B ==> C(x) = D(x) |] ==> \ |
551 |
\ (UN x:A. C(x)) = (UN x:B. D(x))"; |
|
6291 | 552 |
by (asm_simp_tac (simpset() addsimps prems) 1); |
923 | 553 |
qed "UN_cong"; |
554 |
||
555 |
||
1548 | 556 |
section "Intersections of families -- INTER x:A. B(x) is Inter(B``A)"; |
923 | 557 |
|
5069 | 558 |
Goalw [INTER_def] "(b: (INT x:A. B(x))) = (ALL x:A. b: B(x))"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
559 |
by Auto_tac; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
560 |
qed "INT_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
561 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
562 |
Addsimps [INT_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
563 |
|
5316 | 564 |
val prems = Goalw [INTER_def] |
923 | 565 |
"(!!x. x:A ==> b: B(x)) ==> b : (INT x:A. B(x))"; |
566 |
by (REPEAT (ares_tac ([CollectI,ballI] @ prems) 1)); |
|
567 |
qed "INT_I"; |
|
568 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
569 |
Goal "[| b : (INT x:A. B(x)); a:A |] ==> b: B(a)"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
570 |
by Auto_tac; |
923 | 571 |
qed "INT_D"; |
572 |
||
573 |
(*"Classical" elimination -- by the Excluded Middle on a:A *) |
|
5316 | 574 |
val major::prems = Goalw [INTER_def] |
923 | 575 |
"[| b : (INT x:A. B(x)); b: B(a) ==> R; a~:A ==> R |] ==> R"; |
576 |
by (rtac (major RS CollectD RS ballE) 1); |
|
577 |
by (REPEAT (eresolve_tac prems 1)); |
|
578 |
qed "INT_E"; |
|
579 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
580 |
AddSIs [INT_I]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
581 |
AddEs [INT_D, INT_E]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
582 |
|
6291 | 583 |
val prems = Goalw [INTER_def] |
923 | 584 |
"[| A=B; !!x. x:B ==> C(x) = D(x) |] ==> \ |
585 |
\ (INT x:A. C(x)) = (INT x:B. D(x))"; |
|
6291 | 586 |
by (asm_simp_tac (simpset() addsimps prems) 1); |
923 | 587 |
qed "INT_cong"; |
588 |
||
589 |
||
1548 | 590 |
section "Union"; |
923 | 591 |
|
5069 | 592 |
Goalw [Union_def] "(A : Union(C)) = (EX X:C. A:X)"; |
2891 | 593 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
594 |
qed "Union_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
595 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
596 |
Addsimps [Union_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
597 |
|
923 | 598 |
(*The order of the premises presupposes that C is rigid; A may be flexible*) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
599 |
Goal "[| X:C; A:X |] ==> A : Union(C)"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
600 |
by Auto_tac; |
923 | 601 |
qed "UnionI"; |
602 |
||
5316 | 603 |
val major::prems = Goalw [Union_def] |
923 | 604 |
"[| A : Union(C); !!X.[| A:X; X:C |] ==> R |] ==> R"; |
605 |
by (rtac (major RS UN_E) 1); |
|
606 |
by (REPEAT (ares_tac prems 1)); |
|
607 |
qed "UnionE"; |
|
608 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
609 |
AddIs [UnionI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
610 |
AddSEs [UnionE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
611 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
612 |
|
1548 | 613 |
section "Inter"; |
923 | 614 |
|
5069 | 615 |
Goalw [Inter_def] "(A : Inter(C)) = (ALL X:C. A:X)"; |
2891 | 616 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
617 |
qed "Inter_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
618 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
619 |
Addsimps [Inter_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
620 |
|
5316 | 621 |
val prems = Goalw [Inter_def] |
923 | 622 |
"[| !!X. X:C ==> A:X |] ==> A : Inter(C)"; |
623 |
by (REPEAT (ares_tac ([INT_I] @ prems) 1)); |
|
624 |
qed "InterI"; |
|
625 |
||
626 |
(*A "destruct" rule -- every X in C contains A as an element, but |
|
627 |
A:X can hold when X:C does not! This rule is analogous to "spec". *) |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
628 |
Goal "[| A : Inter(C); X:C |] ==> A:X"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
629 |
by Auto_tac; |
923 | 630 |
qed "InterD"; |
631 |
||
632 |
(*"Classical" elimination rule -- does not require proving X:C *) |
|
5316 | 633 |
val major::prems = Goalw [Inter_def] |
2721 | 634 |
"[| A : Inter(C); X~:C ==> R; A:X ==> R |] ==> R"; |
923 | 635 |
by (rtac (major RS INT_E) 1); |
636 |
by (REPEAT (eresolve_tac prems 1)); |
|
637 |
qed "InterE"; |
|
638 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
639 |
AddSIs [InterI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
640 |
AddEs [InterD, InterE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
641 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
642 |
|
2912 | 643 |
(*** Image of a set under a function ***) |
644 |
||
645 |
(*Frequently b does not have the syntactic form of f(x).*) |
|
5316 | 646 |
Goalw [image_def] "[| b=f(x); x:A |] ==> b : f``A"; |
647 |
by (Blast_tac 1); |
|
2912 | 648 |
qed "image_eqI"; |
3909 | 649 |
Addsimps [image_eqI]; |
2912 | 650 |
|
651 |
bind_thm ("imageI", refl RS image_eqI); |
|
652 |
||
653 |
(*The eta-expansion gives variable-name preservation.*) |
|
5316 | 654 |
val major::prems = Goalw [image_def] |
3842 | 655 |
"[| b : (%x. f(x))``A; !!x.[| b=f(x); x:A |] ==> P |] ==> P"; |
2912 | 656 |
by (rtac (major RS CollectD RS bexE) 1); |
657 |
by (REPEAT (ares_tac prems 1)); |
|
658 |
qed "imageE"; |
|
659 |
||
660 |
AddIs [image_eqI]; |
|
661 |
AddSEs [imageE]; |
|
662 |
||
5069 | 663 |
Goal "f``(A Un B) = f``A Un f``B"; |
2935 | 664 |
by (Blast_tac 1); |
2912 | 665 |
qed "image_Un"; |
666 |
||
5069 | 667 |
Goal "(z : f``A) = (EX x:A. z = f x)"; |
3960 | 668 |
by (Blast_tac 1); |
669 |
qed "image_iff"; |
|
670 |
||
4523 | 671 |
(*This rewrite rule would confuse users if made default.*) |
5069 | 672 |
Goal "(f``A <= B) = (ALL x:A. f(x): B)"; |
4523 | 673 |
by (Blast_tac 1); |
674 |
qed "image_subset_iff"; |
|
675 |
||
676 |
(*Replaces the three steps subsetI, imageE, hyp_subst_tac, but breaks too |
|
677 |
many existing proofs.*) |
|
5316 | 678 |
val prems = Goal "(!!x. x:A ==> f(x) : B) ==> f``A <= B"; |
4510 | 679 |
by (blast_tac (claset() addIs prems) 1); |
680 |
qed "image_subsetI"; |
|
681 |
||
2912 | 682 |
|
683 |
(*** Range of a function -- just a translation for image! ***) |
|
684 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
685 |
Goal "b=f(x) ==> b : range(f)"; |
2912 | 686 |
by (EVERY1 [etac image_eqI, rtac UNIV_I]); |
687 |
bind_thm ("range_eqI", UNIV_I RSN (2,image_eqI)); |
|
688 |
||
689 |
bind_thm ("rangeI", UNIV_I RS imageI); |
|
690 |
||
5316 | 691 |
val [major,minor] = Goal |
3842 | 692 |
"[| b : range(%x. f(x)); !!x. b=f(x) ==> P |] ==> P"; |
2912 | 693 |
by (rtac (major RS imageE) 1); |
694 |
by (etac minor 1); |
|
695 |
qed "rangeE"; |
|
696 |
||
1776
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
697 |
|
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
698 |
(*** Set reasoning tools ***) |
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
699 |
|
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
700 |
|
3912 | 701 |
(** Rewrite rules for boolean case-splitting: faster than |
4830 | 702 |
addsplits[split_if] |
3912 | 703 |
**) |
704 |
||
4830 | 705 |
bind_thm ("split_if_eq1", read_instantiate [("P", "%x. x = ?b")] split_if); |
706 |
bind_thm ("split_if_eq2", read_instantiate [("P", "%x. ?a = x")] split_if); |
|
3912 | 707 |
|
5237 | 708 |
(*Split ifs on either side of the membership relation. |
709 |
Not for Addsimps -- can cause goals to blow up!*) |
|
4830 | 710 |
bind_thm ("split_if_mem1", |
6394 | 711 |
read_instantiate_sg (Theory.sign_of Set.thy) [("P", "%x. x : ?b")] split_if); |
4830 | 712 |
bind_thm ("split_if_mem2", |
6394 | 713 |
read_instantiate_sg (Theory.sign_of Set.thy) [("P", "%x. ?a : x")] split_if); |
3912 | 714 |
|
4830 | 715 |
val split_ifs = [if_bool_eq_conj, split_if_eq1, split_if_eq2, |
716 |
split_if_mem1, split_if_mem2]; |
|
3912 | 717 |
|
718 |
||
4089 | 719 |
(*Each of these has ALREADY been added to simpset() above.*) |
2024
909153d8318f
Rationalized the rewriting of membership for {} and insert
paulson
parents:
1985
diff
changeset
|
720 |
val mem_simps = [insert_iff, empty_iff, Un_iff, Int_iff, Compl_iff, Diff_iff, |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
721 |
mem_Collect_eq, UN_iff, Union_iff, INT_iff, Inter_iff]; |
1776
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
722 |
|
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
723 |
val mksimps_pairs = ("Ball",[bspec]) :: mksimps_pairs; |
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
724 |
|
6291 | 725 |
simpset_ref() := simpset() setmksimps (mksimps mksimps_pairs); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
726 |
|
5256 | 727 |
Addsimps[subset_UNIV, subset_refl]; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
728 |
|
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
729 |
|
8001 | 730 |
(*** The 'proper subset' relation (<) ***) |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
731 |
|
5069 | 732 |
Goalw [psubset_def] "!!A::'a set. [| A <= B; A ~= B |] ==> A<B"; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
733 |
by (Blast_tac 1); |
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
734 |
qed "psubsetI"; |
7658 | 735 |
AddXIs [psubsetI]; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
736 |
|
5148
74919e8f221c
More tidying and removal of "\!\!... from Goal commands
paulson
parents:
5143
diff
changeset
|
737 |
Goalw [psubset_def] "A < insert x B ==> (x ~: A) & A<=B | x:A & A-{x}<B"; |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4469
diff
changeset
|
738 |
by Auto_tac; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
739 |
qed "psubset_insertD"; |
4059 | 740 |
|
741 |
bind_thm ("psubset_eq", psubset_def RS meta_eq_to_obj_eq); |
|
6443 | 742 |
|
743 |
bind_thm ("psubset_imp_subset", psubset_eq RS iffD1 RS conjunct1); |
|
744 |
||
745 |
Goal"[| (A::'a set) < B; B <= C |] ==> A < C"; |
|
746 |
by (auto_tac (claset(), simpset() addsimps [psubset_eq])); |
|
747 |
qed "psubset_subset_trans"; |
|
748 |
||
749 |
Goal"[| (A::'a set) <= B; B < C|] ==> A < C"; |
|
750 |
by (auto_tac (claset(), simpset() addsimps [psubset_eq])); |
|
751 |
qed "subset_psubset_trans"; |
|
7717
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
752 |
|
8001 | 753 |
Goalw [psubset_def] "A < B ==> EX b. b : (B - A)"; |
754 |
by (Blast_tac 1); |
|
755 |
qed "psubset_imp_ex_mem"; |
|
756 |
||
7717
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
757 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
758 |
(* attributes *) |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
759 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
760 |
local |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
761 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
762 |
fun gen_rulify_prems x = |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
763 |
Attrib.no_args (Drule.rule_attribute (fn _ => (standard o |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
764 |
rule_by_tactic (REPEAT (ALLGOALS (resolve_tac [allI, ballI, impI])))))) x; |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
765 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
766 |
in |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
767 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
768 |
val rulify_prems_attrib_setup = |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
769 |
[Attrib.add_attributes |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
770 |
[("rulify_prems", (gen_rulify_prems, gen_rulify_prems), "put theorem into standard rule form")]]; |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
771 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
772 |
end; |