author | wenzelm |
Sat, 01 Jul 2000 19:55:22 +0200 | |
changeset 9230 | 17ae63f82ad8 |
parent 9186 | 7b2f4e6538b4 |
child 9338 | fcf7f29a3447 |
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 |
||
5316 | 22 |
val [prem] = Goal "[| !!x. (x:A) = (x:B) |] ==> A = B"; |
923 | 23 |
by (rtac (prem RS ext RS arg_cong RS box_equals) 1); |
24 |
by (rtac Collect_mem_eq 1); |
|
25 |
by (rtac Collect_mem_eq 1); |
|
26 |
qed "set_ext"; |
|
27 |
||
5316 | 28 |
val [prem] = Goal "[| !!x. P(x)=Q(x) |] ==> {x. P(x)} = {x. Q(x)}"; |
923 | 29 |
by (rtac (prem RS ext RS arg_cong) 1); |
30 |
qed "Collect_cong"; |
|
31 |
||
9108 | 32 |
bind_thm ("CollectE", make_elim CollectD); |
923 | 33 |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
34 |
AddSIs [CollectI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
35 |
AddSEs [CollectE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
36 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
37 |
|
1548 | 38 |
section "Bounded quantifiers"; |
923 | 39 |
|
5316 | 40 |
val prems = Goalw [Ball_def] |
9041 | 41 |
"[| !!x. x:A ==> P(x) |] ==> ALL x:A. P(x)"; |
923 | 42 |
by (REPEAT (ares_tac (prems @ [allI,impI]) 1)); |
43 |
qed "ballI"; |
|
44 |
||
8839 | 45 |
bind_thms ("strip", [impI, allI, ballI]); |
46 |
||
9041 | 47 |
Goalw [Ball_def] "[| ALL x:A. P(x); x:A |] ==> P(x)"; |
5316 | 48 |
by (Blast_tac 1); |
923 | 49 |
qed "bspec"; |
50 |
||
5316 | 51 |
val major::prems = Goalw [Ball_def] |
9041 | 52 |
"[| ALL x:A. P(x); P(x) ==> Q; x~:A ==> Q |] ==> Q"; |
923 | 53 |
by (rtac (major RS spec RS impCE) 1); |
54 |
by (REPEAT (eresolve_tac prems 1)); |
|
55 |
qed "ballE"; |
|
56 |
||
9041 | 57 |
(*Takes assumptions ALL x:A.P(x) and a:A; creates assumption P(a)*) |
923 | 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*) |
9041 | 68 |
Goalw [Bex_def] "[| P(x); x:A |] ==> EX x:A. P(x)"; |
5316 | 69 |
by (Blast_tac 1); |
923 | 70 |
qed "bexI"; |
71 |
||
6006 | 72 |
(*The best argument order when there is only one x:A*) |
9041 | 73 |
Goalw [Bex_def] "[| x:A; P(x) |] ==> EX x:A. P(x)"; |
6006 | 74 |
by (Blast_tac 1); |
75 |
qed "rev_bexI"; |
|
76 |
||
7031 | 77 |
val prems = Goal |
9041 | 78 |
"[| ALL x:A. ~P(x) ==> P(a); a:A |] ==> EX x:A. P(x)"; |
7007 | 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] |
9041 | 84 |
"[| EX x:A. P(x); !!x. [| x:A; P(x) |] ==> Q |] ==> Q"; |
923 | 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*) |
9041 | 93 |
Goal "(ALL x:A. P) = ((EX 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*) |
9041 | 98 |
Goal "(EX x:A. P) = ((EX 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) |] ==> \ |
9041 | 108 |
\ (ALL x:A. P(x)) = (ALL 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) |] ==> \ |
9041 | 114 |
\ (EX x:A. P(x)) = (EX 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"; |
9108 | 192 |
bind_thm ("equalityI", subset_antisym); |
923 | 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 |
||
9186
7b2f4e6538b4
now uses equalityCE, which usually is more efficent than equalityE
paulson
parents:
9161
diff
changeset
|
219 |
AddEs [equalityCE]; |
7b2f4e6538b4
now uses equalityCE, which usually is more efficent than equalityE
paulson
parents:
9161
diff
changeset
|
220 |
|
923 | 221 |
(*Lemma for creating induction formulae -- for "pattern matching" on p |
222 |
To make the induction hypotheses usable, apply "spec" or "bspec" to |
|
223 |
put universal quantifiers over the free variables in p. *) |
|
5316 | 224 |
val prems = Goal |
923 | 225 |
"[| p:A; !!z. z:A ==> p=z --> R |] ==> R"; |
226 |
by (rtac mp 1); |
|
227 |
by (REPEAT (resolve_tac (refl::prems) 1)); |
|
228 |
qed "setup_induction"; |
|
229 |
||
8053 | 230 |
Goal "A = B ==> (x : A) = (x : B)"; |
231 |
by (Asm_simp_tac 1); |
|
232 |
qed "eqset_imp_iff"; |
|
233 |
||
923 | 234 |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
235 |
section "The universal set -- UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
236 |
|
7031 | 237 |
Goalw [UNIV_def] "x : UNIV"; |
238 |
by (rtac CollectI 1); |
|
239 |
by (rtac TrueI 1); |
|
240 |
qed "UNIV_I"; |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
241 |
|
4434 | 242 |
Addsimps [UNIV_I]; |
243 |
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
|
244 |
|
7031 | 245 |
Goal "A <= UNIV"; |
246 |
by (rtac subsetI 1); |
|
247 |
by (rtac UNIV_I 1); |
|
248 |
qed "subset_UNIV"; |
|
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
249 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
250 |
(** 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
|
251 |
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
|
252 |
|
5069 | 253 |
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
|
254 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
255 |
qed "ball_UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
256 |
|
5069 | 257 |
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
|
258 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
259 |
qed "bex_UNIV"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
260 |
Addsimps [ball_UNIV, bex_UNIV]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
261 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
262 |
|
2858 | 263 |
section "The empty set -- {}"; |
264 |
||
7007 | 265 |
Goalw [empty_def] "(c : {}) = False"; |
266 |
by (Blast_tac 1) ; |
|
267 |
qed "empty_iff"; |
|
2858 | 268 |
|
269 |
Addsimps [empty_iff]; |
|
270 |
||
7007 | 271 |
Goal "a:{} ==> P"; |
272 |
by (Full_simp_tac 1); |
|
273 |
qed "emptyE"; |
|
2858 | 274 |
|
275 |
AddSEs [emptyE]; |
|
276 |
||
7007 | 277 |
Goal "{} <= A"; |
278 |
by (Blast_tac 1) ; |
|
279 |
qed "empty_subsetI"; |
|
2858 | 280 |
|
5256 | 281 |
(*One effect is to delete the ASSUMPTION {} <= A*) |
282 |
AddIffs [empty_subsetI]; |
|
283 |
||
7031 | 284 |
val [prem]= Goal "[| !!y. y:A ==> False |] ==> A={}"; |
7007 | 285 |
by (blast_tac (claset() addIs [prem RS FalseE]) 1) ; |
286 |
qed "equals0I"; |
|
2858 | 287 |
|
5256 | 288 |
(*Use for reasoning about disjointness: A Int B = {} *) |
7007 | 289 |
Goal "A={} ==> a ~: A"; |
290 |
by (Blast_tac 1) ; |
|
291 |
qed "equals0D"; |
|
2858 | 292 |
|
5069 | 293 |
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
|
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 "ball_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
296 |
|
5069 | 297 |
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
|
298 |
by (Simp_tac 1); |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
299 |
qed "bex_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
300 |
Addsimps [ball_empty, bex_empty]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
301 |
|
5069 | 302 |
Goal "UNIV ~= {}"; |
4159
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
303 |
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
|
304 |
qed "UNIV_not_empty"; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
305 |
AddIffs [UNIV_not_empty]; |
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
306 |
|
4aff9b7e5597
UNIV now a constant; UNION1, INTER1 now translations and no longer have
paulson
parents:
4135
diff
changeset
|
307 |
|
2858 | 308 |
|
309 |
section "The Powerset operator -- Pow"; |
|
310 |
||
7007 | 311 |
Goalw [Pow_def] "(A : Pow(B)) = (A <= B)"; |
312 |
by (Asm_simp_tac 1); |
|
313 |
qed "Pow_iff"; |
|
2858 | 314 |
|
315 |
AddIffs [Pow_iff]; |
|
316 |
||
7031 | 317 |
Goalw [Pow_def] "A <= B ==> A : Pow(B)"; |
7007 | 318 |
by (etac CollectI 1); |
319 |
qed "PowI"; |
|
2858 | 320 |
|
7031 | 321 |
Goalw [Pow_def] "A : Pow(B) ==> A<=B"; |
7007 | 322 |
by (etac CollectD 1); |
323 |
qed "PowD"; |
|
324 |
||
2858 | 325 |
|
9108 | 326 |
bind_thm ("Pow_bottom", empty_subsetI RS PowI); (* {}: Pow(B) *) |
327 |
bind_thm ("Pow_top", subset_refl RS PowI); (* A : Pow(A) *) |
|
2858 | 328 |
|
329 |
||
5931 | 330 |
section "Set complement"; |
923 | 331 |
|
7031 | 332 |
Goalw [Compl_def] "(c : -A) = (c~:A)"; |
333 |
by (Blast_tac 1); |
|
334 |
qed "Compl_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
335 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
336 |
Addsimps [Compl_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
337 |
|
5490 | 338 |
val prems = Goalw [Compl_def] "[| c:A ==> False |] ==> c : -A"; |
923 | 339 |
by (REPEAT (ares_tac (prems @ [CollectI,notI]) 1)); |
340 |
qed "ComplI"; |
|
341 |
||
342 |
(*This form, with negated conclusion, works well with the Classical prover. |
|
343 |
Negated assumptions behave like formulae on the right side of the notional |
|
344 |
turnstile...*) |
|
5490 | 345 |
Goalw [Compl_def] "c : -A ==> c~:A"; |
5316 | 346 |
by (etac CollectD 1); |
923 | 347 |
qed "ComplD"; |
348 |
||
9108 | 349 |
bind_thm ("ComplE", make_elim ComplD); |
923 | 350 |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
351 |
AddSIs [ComplI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
352 |
AddSEs [ComplE]; |
1640 | 353 |
|
923 | 354 |
|
1548 | 355 |
section "Binary union -- Un"; |
923 | 356 |
|
7031 | 357 |
Goalw [Un_def] "(c : A Un B) = (c:A | c:B)"; |
358 |
by (Blast_tac 1); |
|
359 |
qed "Un_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
360 |
Addsimps [Un_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
361 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
362 |
Goal "c:A ==> 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 "UnI1"; |
365 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
366 |
Goal "c:B ==> c : A Un B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
367 |
by (Asm_simp_tac 1); |
923 | 368 |
qed "UnI2"; |
369 |
||
370 |
(*Classical introduction rule: no commitment to A vs B*) |
|
7007 | 371 |
|
7031 | 372 |
val prems = Goal "(c~:B ==> c:A) ==> c : A Un B"; |
7007 | 373 |
by (Simp_tac 1); |
374 |
by (REPEAT (ares_tac (prems@[disjCI]) 1)) ; |
|
375 |
qed "UnCI"; |
|
923 | 376 |
|
5316 | 377 |
val major::prems = Goalw [Un_def] |
923 | 378 |
"[| c : A Un B; c:A ==> P; c:B ==> P |] ==> P"; |
379 |
by (rtac (major RS CollectD RS disjE) 1); |
|
380 |
by (REPEAT (eresolve_tac prems 1)); |
|
381 |
qed "UnE"; |
|
382 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
383 |
AddSIs [UnCI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
384 |
AddSEs [UnE]; |
1640 | 385 |
|
923 | 386 |
|
1548 | 387 |
section "Binary intersection -- Int"; |
923 | 388 |
|
7031 | 389 |
Goalw [Int_def] "(c : A Int B) = (c:A & c:B)"; |
390 |
by (Blast_tac 1); |
|
391 |
qed "Int_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
392 |
Addsimps [Int_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
393 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
394 |
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
|
395 |
by (Asm_simp_tac 1); |
923 | 396 |
qed "IntI"; |
397 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
398 |
Goal "c : A Int B ==> c:A"; |
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 "IntD1"; |
401 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
402 |
Goal "c : A Int B ==> c:B"; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
403 |
by (Asm_full_simp_tac 1); |
923 | 404 |
qed "IntD2"; |
405 |
||
5316 | 406 |
val [major,minor] = Goal |
923 | 407 |
"[| c : A Int B; [| c:A; c:B |] ==> P |] ==> P"; |
408 |
by (rtac minor 1); |
|
409 |
by (rtac (major RS IntD1) 1); |
|
410 |
by (rtac (major RS IntD2) 1); |
|
411 |
qed "IntE"; |
|
412 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
413 |
AddSIs [IntI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
414 |
AddSEs [IntE]; |
923 | 415 |
|
1548 | 416 |
section "Set difference"; |
923 | 417 |
|
7031 | 418 |
Goalw [set_diff_def] "(c : A-B) = (c:A & c~:B)"; |
419 |
by (Blast_tac 1); |
|
420 |
qed "Diff_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
421 |
Addsimps [Diff_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
422 |
|
7007 | 423 |
Goal "[| c : A; c ~: B |] ==> c : A - B"; |
424 |
by (Asm_simp_tac 1) ; |
|
425 |
qed "DiffI"; |
|
923 | 426 |
|
7007 | 427 |
Goal "c : A - B ==> c : A"; |
428 |
by (Asm_full_simp_tac 1) ; |
|
429 |
qed "DiffD1"; |
|
923 | 430 |
|
7007 | 431 |
Goal "[| c : A - B; c : B |] ==> P"; |
432 |
by (Asm_full_simp_tac 1) ; |
|
433 |
qed "DiffD2"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
434 |
|
7031 | 435 |
val prems = Goal "[| c : A - B; [| c:A; c~:B |] ==> P |] ==> P"; |
7007 | 436 |
by (resolve_tac prems 1); |
437 |
by (REPEAT (ares_tac (prems RL [DiffD1, DiffD2 RS notI]) 1)) ; |
|
438 |
qed "DiffE"; |
|
923 | 439 |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
440 |
AddSIs [DiffI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
441 |
AddSEs [DiffE]; |
923 | 442 |
|
443 |
||
1548 | 444 |
section "Augmenting a set -- insert"; |
923 | 445 |
|
7031 | 446 |
Goalw [insert_def] "a : insert b A = (a=b | a:A)"; |
447 |
by (Blast_tac 1); |
|
448 |
qed "insert_iff"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
449 |
Addsimps [insert_iff]; |
923 | 450 |
|
7031 | 451 |
Goal "a : insert a B"; |
7007 | 452 |
by (Simp_tac 1); |
453 |
qed "insertI1"; |
|
923 | 454 |
|
7007 | 455 |
Goal "!!a. a : B ==> a : insert b B"; |
456 |
by (Asm_simp_tac 1); |
|
457 |
qed "insertI2"; |
|
458 |
||
459 |
val major::prems = Goalw [insert_def] |
|
460 |
"[| a : insert b A; a=b ==> P; a:A ==> P |] ==> P"; |
|
461 |
by (rtac (major RS UnE) 1); |
|
462 |
by (REPEAT (eresolve_tac (prems @ [CollectE]) 1)); |
|
463 |
qed "insertE"; |
|
923 | 464 |
|
465 |
(*Classical introduction rule*) |
|
7031 | 466 |
val prems = Goal "(a~:B ==> a=b) ==> a: insert b B"; |
7007 | 467 |
by (Simp_tac 1); |
468 |
by (REPEAT (ares_tac (prems@[disjCI]) 1)) ; |
|
469 |
qed "insertCI"; |
|
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
470 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
471 |
AddSIs [insertCI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
472 |
AddSEs [insertE]; |
923 | 473 |
|
9088
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
474 |
Goal "(A <= insert x B) = (if x:A then A-{x} <= B else A<=B)"; |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
475 |
by Auto_tac; |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
476 |
qed "subset_insert_iff"; |
7496
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})"; |
8326
0e329578b0ef
tidied the proofs of singleton_insert_inj_eq, singleton_insert_inj_eq' and
paulson
parents:
8053
diff
changeset
|
504 |
by (blast_tac (claset() addSEs [equalityE]) 1); |
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
505 |
qed "singleton_insert_inj_eq"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
506 |
|
8326
0e329578b0ef
tidied the proofs of singleton_insert_inj_eq, singleton_insert_inj_eq' and
paulson
parents:
8053
diff
changeset
|
507 |
Goal "(insert a A = {b}) = (a = b & A <= {b})"; |
0e329578b0ef
tidied the proofs of singleton_insert_inj_eq, singleton_insert_inj_eq' and
paulson
parents:
8053
diff
changeset
|
508 |
by (blast_tac (claset() addSEs [equalityE]) 1); |
7969 | 509 |
qed "singleton_insert_inj_eq'"; |
510 |
||
8326
0e329578b0ef
tidied the proofs of singleton_insert_inj_eq, singleton_insert_inj_eq' and
paulson
parents:
8053
diff
changeset
|
511 |
AddIffs [singleton_insert_inj_eq, singleton_insert_inj_eq']; |
0e329578b0ef
tidied the proofs of singleton_insert_inj_eq, singleton_insert_inj_eq' and
paulson
parents:
8053
diff
changeset
|
512 |
|
7496
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
513 |
Goal "A <= {x} ==> A={} | A = {x}"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
514 |
by (Fast_tac 1); |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
515 |
qed "subset_singletonD"; |
93ae11d887ff
added theorems subset_insertD, singleton_insert_inj_eq, subset_singletonD
oheimb
parents:
7441
diff
changeset
|
516 |
|
5069 | 517 |
Goal "{x. x=a} = {a}"; |
4423 | 518 |
by (Blast_tac 1); |
3582 | 519 |
qed "singleton_conv"; |
520 |
Addsimps [singleton_conv]; |
|
1531 | 521 |
|
5600 | 522 |
Goal "{x. a=x} = {a}"; |
6301 | 523 |
by (Blast_tac 1); |
5600 | 524 |
qed "singleton_conv2"; |
525 |
Addsimps [singleton_conv2]; |
|
526 |
||
1531 | 527 |
|
1548 | 528 |
section "Unions of families -- UNION x:A. B(x) is Union(B``A)"; |
923 | 529 |
|
5069 | 530 |
Goalw [UNION_def] "(b: (UN x:A. B(x))) = (EX x:A. b: B(x))"; |
2891 | 531 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
532 |
qed "UN_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
533 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
534 |
Addsimps [UN_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
535 |
|
923 | 536 |
(*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
|
537 |
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
|
538 |
by Auto_tac; |
923 | 539 |
qed "UN_I"; |
540 |
||
5316 | 541 |
val major::prems = Goalw [UNION_def] |
923 | 542 |
"[| b : (UN x:A. B(x)); !!x.[| x:A; b: B(x) |] ==> R |] ==> R"; |
543 |
by (rtac (major RS CollectD RS bexE) 1); |
|
544 |
by (REPEAT (ares_tac prems 1)); |
|
545 |
qed "UN_E"; |
|
546 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
547 |
AddIs [UN_I]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
548 |
AddSEs [UN_E]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
549 |
|
6291 | 550 |
val prems = Goalw [UNION_def] |
923 | 551 |
"[| A=B; !!x. x:B ==> C(x) = D(x) |] ==> \ |
552 |
\ (UN x:A. C(x)) = (UN x:B. D(x))"; |
|
6291 | 553 |
by (asm_simp_tac (simpset() addsimps prems) 1); |
923 | 554 |
qed "UN_cong"; |
555 |
||
556 |
||
1548 | 557 |
section "Intersections of families -- INTER x:A. B(x) is Inter(B``A)"; |
923 | 558 |
|
5069 | 559 |
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
|
560 |
by Auto_tac; |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
561 |
qed "INT_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
562 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
563 |
Addsimps [INT_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
564 |
|
5316 | 565 |
val prems = Goalw [INTER_def] |
923 | 566 |
"(!!x. x:A ==> b: B(x)) ==> b : (INT x:A. B(x))"; |
567 |
by (REPEAT (ares_tac ([CollectI,ballI] @ prems) 1)); |
|
568 |
qed "INT_I"; |
|
569 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
570 |
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
|
571 |
by Auto_tac; |
923 | 572 |
qed "INT_D"; |
573 |
||
574 |
(*"Classical" elimination -- by the Excluded Middle on a:A *) |
|
5316 | 575 |
val major::prems = Goalw [INTER_def] |
923 | 576 |
"[| b : (INT x:A. B(x)); b: B(a) ==> R; a~:A ==> R |] ==> R"; |
577 |
by (rtac (major RS CollectD RS ballE) 1); |
|
578 |
by (REPEAT (eresolve_tac prems 1)); |
|
579 |
qed "INT_E"; |
|
580 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
581 |
AddSIs [INT_I]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
582 |
AddEs [INT_D, INT_E]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
583 |
|
6291 | 584 |
val prems = Goalw [INTER_def] |
923 | 585 |
"[| A=B; !!x. x:B ==> C(x) = D(x) |] ==> \ |
586 |
\ (INT x:A. C(x)) = (INT x:B. D(x))"; |
|
6291 | 587 |
by (asm_simp_tac (simpset() addsimps prems) 1); |
923 | 588 |
qed "INT_cong"; |
589 |
||
590 |
||
1548 | 591 |
section "Union"; |
923 | 592 |
|
5069 | 593 |
Goalw [Union_def] "(A : Union(C)) = (EX X:C. A:X)"; |
2891 | 594 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
595 |
qed "Union_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
596 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
597 |
Addsimps [Union_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
598 |
|
923 | 599 |
(*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
|
600 |
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
|
601 |
by Auto_tac; |
923 | 602 |
qed "UnionI"; |
603 |
||
5316 | 604 |
val major::prems = Goalw [Union_def] |
923 | 605 |
"[| A : Union(C); !!X.[| A:X; X:C |] ==> R |] ==> R"; |
606 |
by (rtac (major RS UN_E) 1); |
|
607 |
by (REPEAT (ares_tac prems 1)); |
|
608 |
qed "UnionE"; |
|
609 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
610 |
AddIs [UnionI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
611 |
AddSEs [UnionE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
612 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
613 |
|
1548 | 614 |
section "Inter"; |
923 | 615 |
|
5069 | 616 |
Goalw [Inter_def] "(A : Inter(C)) = (ALL X:C. A:X)"; |
2891 | 617 |
by (Blast_tac 1); |
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
618 |
qed "Inter_iff"; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
619 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
620 |
Addsimps [Inter_iff]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
621 |
|
5316 | 622 |
val prems = Goalw [Inter_def] |
923 | 623 |
"[| !!X. X:C ==> A:X |] ==> A : Inter(C)"; |
624 |
by (REPEAT (ares_tac ([INT_I] @ prems) 1)); |
|
625 |
qed "InterI"; |
|
626 |
||
627 |
(*A "destruct" rule -- every X in C contains A as an element, but |
|
628 |
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
|
629 |
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
|
630 |
by Auto_tac; |
923 | 631 |
qed "InterD"; |
632 |
||
633 |
(*"Classical" elimination rule -- does not require proving X:C *) |
|
5316 | 634 |
val major::prems = Goalw [Inter_def] |
2721 | 635 |
"[| A : Inter(C); X~:C ==> R; A:X ==> R |] ==> R"; |
923 | 636 |
by (rtac (major RS INT_E) 1); |
637 |
by (REPEAT (eresolve_tac prems 1)); |
|
638 |
qed "InterE"; |
|
639 |
||
2499
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
640 |
AddSIs [InterI]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
641 |
AddEs [InterD, InterE]; |
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
642 |
|
0bc87b063447
Tidying of proofs. New theorems are enterred immediately into the
paulson
parents:
2031
diff
changeset
|
643 |
|
2912 | 644 |
(*** Image of a set under a function ***) |
645 |
||
646 |
(*Frequently b does not have the syntactic form of f(x).*) |
|
5316 | 647 |
Goalw [image_def] "[| b=f(x); x:A |] ==> b : f``A"; |
648 |
by (Blast_tac 1); |
|
2912 | 649 |
qed "image_eqI"; |
3909 | 650 |
Addsimps [image_eqI]; |
2912 | 651 |
|
652 |
bind_thm ("imageI", refl RS image_eqI); |
|
653 |
||
8025 | 654 |
(*This version's more effective when we already have the required x*) |
655 |
Goalw [image_def] "[| x:A; b=f(x) |] ==> b : f``A"; |
|
656 |
by (Blast_tac 1); |
|
657 |
qed "rev_image_eqI"; |
|
658 |
||
2912 | 659 |
(*The eta-expansion gives variable-name preservation.*) |
5316 | 660 |
val major::prems = Goalw [image_def] |
3842 | 661 |
"[| b : (%x. f(x))``A; !!x.[| b=f(x); x:A |] ==> P |] ==> P"; |
2912 | 662 |
by (rtac (major RS CollectD RS bexE) 1); |
663 |
by (REPEAT (ares_tac prems 1)); |
|
664 |
qed "imageE"; |
|
665 |
||
666 |
AddIs [image_eqI]; |
|
667 |
AddSEs [imageE]; |
|
668 |
||
5069 | 669 |
Goal "f``(A Un B) = f``A Un f``B"; |
2935 | 670 |
by (Blast_tac 1); |
2912 | 671 |
qed "image_Un"; |
672 |
||
5069 | 673 |
Goal "(z : f``A) = (EX x:A. z = f x)"; |
3960 | 674 |
by (Blast_tac 1); |
675 |
qed "image_iff"; |
|
676 |
||
4523 | 677 |
(*This rewrite rule would confuse users if made default.*) |
5069 | 678 |
Goal "(f``A <= B) = (ALL x:A. f(x): B)"; |
4523 | 679 |
by (Blast_tac 1); |
680 |
qed "image_subset_iff"; |
|
681 |
||
682 |
(*Replaces the three steps subsetI, imageE, hyp_subst_tac, but breaks too |
|
683 |
many existing proofs.*) |
|
5316 | 684 |
val prems = Goal "(!!x. x:A ==> f(x) : B) ==> f``A <= B"; |
4510 | 685 |
by (blast_tac (claset() addIs prems) 1); |
686 |
qed "image_subsetI"; |
|
687 |
||
2912 | 688 |
|
689 |
(*** Range of a function -- just a translation for image! ***) |
|
690 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
691 |
Goal "b=f(x) ==> b : range(f)"; |
2912 | 692 |
by (EVERY1 [etac image_eqI, rtac UNIV_I]); |
693 |
bind_thm ("range_eqI", UNIV_I RSN (2,image_eqI)); |
|
694 |
||
695 |
bind_thm ("rangeI", UNIV_I RS imageI); |
|
696 |
||
5316 | 697 |
val [major,minor] = Goal |
3842 | 698 |
"[| b : range(%x. f(x)); !!x. b=f(x) ==> P |] ==> P"; |
2912 | 699 |
by (rtac (major RS imageE) 1); |
700 |
by (etac minor 1); |
|
701 |
qed "rangeE"; |
|
702 |
||
1776
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
703 |
|
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
704 |
(*** Set reasoning tools ***) |
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
705 |
|
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
706 |
|
3912 | 707 |
(** Rewrite rules for boolean case-splitting: faster than |
4830 | 708 |
addsplits[split_if] |
3912 | 709 |
**) |
710 |
||
4830 | 711 |
bind_thm ("split_if_eq1", read_instantiate [("P", "%x. x = ?b")] split_if); |
712 |
bind_thm ("split_if_eq2", read_instantiate [("P", "%x. ?a = x")] split_if); |
|
3912 | 713 |
|
5237 | 714 |
(*Split ifs on either side of the membership relation. |
715 |
Not for Addsimps -- can cause goals to blow up!*) |
|
4830 | 716 |
bind_thm ("split_if_mem1", |
6394 | 717 |
read_instantiate_sg (Theory.sign_of Set.thy) [("P", "%x. x : ?b")] split_if); |
4830 | 718 |
bind_thm ("split_if_mem2", |
6394 | 719 |
read_instantiate_sg (Theory.sign_of Set.thy) [("P", "%x. ?a : x")] split_if); |
3912 | 720 |
|
9108 | 721 |
bind_thms ("split_ifs", [if_bool_eq_conj, split_if_eq1, split_if_eq2, |
722 |
split_if_mem1, split_if_mem2]); |
|
3912 | 723 |
|
724 |
||
4089 | 725 |
(*Each of these has ALREADY been added to simpset() above.*) |
9108 | 726 |
bind_thms ("mem_simps", [insert_iff, empty_iff, Un_iff, Int_iff, Compl_iff, Diff_iff, |
727 |
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
|
728 |
|
9041 | 729 |
(*Would like to add these, but the existing code only searches for the |
730 |
outer-level constant, which in this case is just "op :"; we instead need |
|
731 |
to use term-nets to associate patterns with rules. Also, if a rule fails to |
|
732 |
apply, then the formula should be kept. |
|
733 |
[("uminus", Compl_iff RS iffD1), ("op -", [Diff_iff RS iffD1]), |
|
734 |
("op Int", [IntD1,IntD2]), |
|
735 |
("Collect", [CollectD]), ("Inter", [InterD]), ("INTER", [INT_D])] |
|
736 |
*) |
|
737 |
val mksimps_pairs = |
|
738 |
[("Ball",[bspec])] @ mksimps_pairs; |
|
1776
d7e77cb8ce5c
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
oheimb
parents:
1762
diff
changeset
|
739 |
|
6291 | 740 |
simpset_ref() := simpset() setmksimps (mksimps mksimps_pairs); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
741 |
|
5256 | 742 |
Addsimps[subset_UNIV, subset_refl]; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
743 |
|
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
744 |
|
8001 | 745 |
(*** The 'proper subset' relation (<) ***) |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
746 |
|
5069 | 747 |
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
|
748 |
by (Blast_tac 1); |
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
749 |
qed "psubsetI"; |
8913 | 750 |
AddSIs [psubsetI]; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2935
diff
changeset
|
751 |
|
9088
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
752 |
Goalw [psubset_def] |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
753 |
"(A < insert x B) = (if x:B then A<B else if x:A then A-{x} < B else A<=B)"; |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
754 |
by (asm_simp_tac (simpset() addsimps [subset_insert_iff]) 1); |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
755 |
by (Blast_tac 1); |
453996655ac2
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson
parents:
9075
diff
changeset
|
756 |
qed "psubset_insert_iff"; |
4059 | 757 |
|
758 |
bind_thm ("psubset_eq", psubset_def RS meta_eq_to_obj_eq); |
|
6443 | 759 |
|
760 |
bind_thm ("psubset_imp_subset", psubset_eq RS iffD1 RS conjunct1); |
|
761 |
||
762 |
Goal"[| (A::'a set) < B; B <= C |] ==> A < C"; |
|
763 |
by (auto_tac (claset(), simpset() addsimps [psubset_eq])); |
|
764 |
qed "psubset_subset_trans"; |
|
765 |
||
766 |
Goal"[| (A::'a set) <= B; B < C|] ==> A < C"; |
|
767 |
by (auto_tac (claset(), simpset() addsimps [psubset_eq])); |
|
768 |
qed "subset_psubset_trans"; |
|
7717
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
769 |
|
8001 | 770 |
Goalw [psubset_def] "A < B ==> EX b. b : (B - A)"; |
771 |
by (Blast_tac 1); |
|
772 |
qed "psubset_imp_ex_mem"; |
|
773 |
||
7717
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
774 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
775 |
(* attributes *) |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
776 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
777 |
local |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
778 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
779 |
fun gen_rulify_prems x = |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
780 |
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
|
781 |
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
|
782 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
783 |
in |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
784 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
785 |
val rulify_prems_attrib_setup = |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
786 |
[Attrib.add_attributes |
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
787 |
[("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
|
788 |
|
e7ecfa617443
Added attribute rulify_prems (useful for modifying premises of introduction
berghofe
parents:
7658
diff
changeset
|
789 |
end; |