author | paulson |
Wed, 01 Mar 2000 15:00:21 +0100 | |
changeset 8320 | 073144bed7da |
parent 8262 | 08ad0a986db2 |
child 8423 | 3c19160b6432 |
permissions | -rw-r--r-- |
1465 | 1 |
(* Title: HOL/Finite.thy |
923 | 2 |
ID: $Id$ |
1531 | 3 |
Author: Lawrence C Paulson & Tobias Nipkow |
4 |
Copyright 1995 University of Cambridge & TU Muenchen |
|
923 | 5 |
|
1531 | 6 |
Finite sets and their cardinality |
923 | 7 |
*) |
8 |
||
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
9 |
section "finite"; |
1531 | 10 |
|
923 | 11 |
(*Discharging ~ x:y entails extra work*) |
5316 | 12 |
val major::prems = Goal |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
13 |
"[| finite F; P({}); \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
14 |
\ !!F x. [| finite F; x ~: F; P(F) |] ==> P(insert x F) \ |
923 | 15 |
\ |] ==> P(F)"; |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
16 |
by (rtac (major RS Finites.induct) 1); |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
17 |
by (excluded_middle_tac "a:A" 2); |
923 | 18 |
by (etac (insert_absorb RS ssubst) 3 THEN assume_tac 3); (*backtracking!*) |
19 |
by (REPEAT (ares_tac prems 1)); |
|
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
20 |
qed "finite_induct"; |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
21 |
|
5316 | 22 |
val major::subs::prems = Goal |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
23 |
"[| finite F; F <= A; \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
24 |
\ P({}); \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
25 |
\ !!F a. [| finite F; a:A; a ~: F; P(F) |] ==> P(insert a F) \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
26 |
\ |] ==> P(F)"; |
4386 | 27 |
by (rtac (subs RS rev_mp) 1); |
28 |
by (rtac (major RS finite_induct) 1); |
|
29 |
by (ALLGOALS (blast_tac (claset() addIs prems))); |
|
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
30 |
qed "finite_subset_induct"; |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
31 |
|
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
32 |
Addsimps Finites.intrs; |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
33 |
AddSIs Finites.intrs; |
923 | 34 |
|
35 |
(*The union of two finite sets is finite*) |
|
5316 | 36 |
Goal "[| finite F; finite G |] ==> finite(F Un G)"; |
37 |
by (etac finite_induct 1); |
|
38 |
by (ALLGOALS Asm_simp_tac); |
|
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
39 |
qed "finite_UnI"; |
923 | 40 |
|
41 |
(*Every subset of a finite set is finite*) |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
42 |
Goal "finite B ==> ALL A. A<=B --> finite A"; |
4304 | 43 |
by (etac finite_induct 1); |
44 |
by (Simp_tac 1); |
|
4089 | 45 |
by (safe_tac (claset() addSDs [subset_insert_iff RS iffD1])); |
4304 | 46 |
by (eres_inst_tac [("t","A")] (insert_Diff RS subst) 2); |
1264 | 47 |
by (ALLGOALS Asm_simp_tac); |
4304 | 48 |
val lemma = result(); |
49 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
50 |
Goal "[| A<=B; finite B |] ==> finite A"; |
4423 | 51 |
by (dtac lemma 1); |
4304 | 52 |
by (Blast_tac 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
53 |
qed "finite_subset"; |
923 | 54 |
|
5069 | 55 |
Goal "finite(F Un G) = (finite F & finite G)"; |
4304 | 56 |
by (blast_tac (claset() |
5413 | 57 |
addIs [read_instantiate [("B", "?X Un ?Y")] finite_subset, |
4304 | 58 |
finite_UnI]) 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
59 |
qed "finite_Un"; |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
60 |
AddIffs[finite_Un]; |
1531 | 61 |
|
5413 | 62 |
Goal "finite F ==> finite(F Int G)"; |
63 |
by (blast_tac (claset() addIs [finite_subset]) 1); |
|
64 |
qed "finite_Int1"; |
|
65 |
||
66 |
Goal "finite G ==> finite(F Int G)"; |
|
67 |
by (blast_tac (claset() addIs [finite_subset]) 1); |
|
68 |
qed "finite_Int2"; |
|
69 |
||
70 |
Addsimps[finite_Int1, finite_Int2]; |
|
71 |
AddIs[finite_Int1, finite_Int2]; |
|
72 |
||
73 |
||
5069 | 74 |
Goal "finite(insert a A) = finite A"; |
1553 | 75 |
by (stac insert_is_Un 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
76 |
by (simp_tac (HOL_ss addsimps [finite_Un]) 1); |
3427
e7cef2081106
Removed a few redundant additions of simprules or classical rules
paulson
parents:
3416
diff
changeset
|
77 |
by (Blast_tac 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
78 |
qed "finite_insert"; |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
79 |
Addsimps[finite_insert]; |
1531 | 80 |
|
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
81 |
(*The image of a finite set is finite *) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
82 |
Goal "finite F ==> finite(h``F)"; |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
83 |
by (etac finite_induct 1); |
1264 | 84 |
by (Simp_tac 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
85 |
by (Asm_simp_tac 1); |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
86 |
qed "finite_imageI"; |
923 | 87 |
|
8155 | 88 |
Goal "finite (range g) ==> finite (range (%x. f (g x)))"; |
89 |
by (Simp_tac 1); |
|
90 |
by (etac finite_imageI 1); |
|
91 |
qed "finite_range_imageI"; |
|
92 |
||
5316 | 93 |
val major::prems = Goal |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
94 |
"[| finite c; finite b; \ |
1465 | 95 |
\ P(b); \ |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
96 |
\ !!x y. [| finite y; x:y; P(y) |] ==> P(y-{x}) \ |
923 | 97 |
\ |] ==> c<=b --> P(b-c)"; |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
98 |
by (rtac (major RS finite_induct) 1); |
2031 | 99 |
by (stac Diff_insert 2); |
923 | 100 |
by (ALLGOALS (asm_simp_tac |
5537 | 101 |
(simpset() addsimps prems@[Diff_subset RS finite_subset]))); |
1531 | 102 |
val lemma = result(); |
923 | 103 |
|
5316 | 104 |
val prems = Goal |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
105 |
"[| finite A; \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
106 |
\ P(A); \ |
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
107 |
\ !!a A. [| finite A; a:A; P(A) |] ==> P(A-{a}) \ |
923 | 108 |
\ |] ==> P({})"; |
109 |
by (rtac (Diff_cancel RS subst) 1); |
|
1531 | 110 |
by (rtac (lemma RS mp) 1); |
923 | 111 |
by (REPEAT (ares_tac (subset_refl::prems) 1)); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
112 |
qed "finite_empty_induct"; |
1531 | 113 |
|
114 |
||
1618 | 115 |
(* finite B ==> finite (B - Ba) *) |
116 |
bind_thm ("finite_Diff", Diff_subset RS finite_subset); |
|
1531 | 117 |
Addsimps [finite_Diff]; |
118 |
||
5626 | 119 |
Goal "finite(A - insert a B) = finite(A-B)"; |
6162 | 120 |
by (stac Diff_insert 1); |
5626 | 121 |
by (case_tac "a : A-B" 1); |
3457 | 122 |
by (rtac (finite_insert RS sym RS trans) 1); |
3368 | 123 |
by (stac insert_Diff 1); |
5626 | 124 |
by (ALLGOALS Asm_full_simp_tac); |
125 |
qed "finite_Diff_insert"; |
|
126 |
AddIffs [finite_Diff_insert]; |
|
127 |
||
128 |
(* lemma merely for classical reasoner *) |
|
129 |
Goal "finite(A-{}) = finite A"; |
|
130 |
by (Simp_tac 1); |
|
131 |
val lemma = result(); |
|
132 |
AddSIs [lemma RS iffD2]; |
|
133 |
AddSDs [lemma RS iffD1]; |
|
3368 | 134 |
|
4059 | 135 |
(*Lemma for proving finite_imageD*) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
136 |
Goal "finite B ==> !A. f``A = B --> inj_on f A --> finite A"; |
1553 | 137 |
by (etac finite_induct 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
138 |
by (ALLGOALS Asm_simp_tac); |
3708 | 139 |
by (Clarify_tac 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
140 |
by (subgoal_tac "EX y:A. f y = x & F = f``(A-{y})" 1); |
3708 | 141 |
by (Clarify_tac 1); |
8081 | 142 |
by (full_simp_tac (simpset() addsimps [inj_on_def]) 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
143 |
by (Blast_tac 1); |
3368 | 144 |
by (thin_tac "ALL A. ?PP(A)" 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
145 |
by (forward_tac [[equalityD2, insertI1] MRS subsetD] 1); |
3708 | 146 |
by (Clarify_tac 1); |
3368 | 147 |
by (res_inst_tac [("x","xa")] bexI 1); |
4059 | 148 |
by (ALLGOALS |
4830 | 149 |
(asm_full_simp_tac (simpset() addsimps [inj_on_image_set_diff]))); |
3368 | 150 |
val lemma = result(); |
151 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
152 |
Goal "[| finite(f``A); inj_on f A |] ==> finite A"; |
3457 | 153 |
by (dtac lemma 1); |
3368 | 154 |
by (Blast_tac 1); |
155 |
qed "finite_imageD"; |
|
156 |
||
4014 | 157 |
(** The finite UNION of finite sets **) |
158 |
||
5316 | 159 |
Goal "finite A ==> (!a:A. finite(B a)) --> finite(UN a:A. B a)"; |
160 |
by (etac finite_induct 1); |
|
4153 | 161 |
by (ALLGOALS Asm_simp_tac); |
4014 | 162 |
bind_thm("finite_UnionI", ballI RSN (2, result() RS mp)); |
163 |
Addsimps [finite_UnionI]; |
|
164 |
||
165 |
(** Sigma of finite sets **) |
|
166 |
||
5069 | 167 |
Goalw [Sigma_def] |
5148
74919e8f221c
More tidying and removal of "\!\!... from Goal commands
paulson
parents:
5143
diff
changeset
|
168 |
"[| finite A; !a:A. finite(B a) |] ==> finite(SIGMA a:A. B a)"; |
4153 | 169 |
by (blast_tac (claset() addSIs [finite_UnionI]) 1); |
4014 | 170 |
bind_thm("finite_SigmaI", ballI RSN (2,result())); |
171 |
Addsimps [finite_SigmaI]; |
|
3368 | 172 |
|
8262 | 173 |
Goal "[| finite (UNIV::'a set); finite (UNIV::'b set)|] ==> finite (UNIV::('a * 'b) set)"; |
174 |
by (subgoal_tac "(UNIV::('a * 'b) set) = Sigma UNIV (%x. UNIV)" 1); |
|
175 |
by (etac ssubst 1); |
|
176 |
by (etac finite_SigmaI 1); |
|
177 |
by Auto_tac; |
|
178 |
qed "finite_Prod_UNIV"; |
|
179 |
||
180 |
Goal "finite (UNIV :: ('a::finite * 'b::finite) set)"; |
|
8320 | 181 |
by (rtac (finite_Prod_UNIV) 1); |
182 |
by (rtac finite 1); |
|
183 |
by (rtac finite 1); |
|
8262 | 184 |
qed "finite_Prod"; |
185 |
||
3368 | 186 |
(** The powerset of a finite set **) |
187 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
188 |
Goal "finite(Pow A) ==> finite A"; |
3368 | 189 |
by (subgoal_tac "finite ((%x.{x})``A)" 1); |
3457 | 190 |
by (rtac finite_subset 2); |
191 |
by (assume_tac 3); |
|
3368 | 192 |
by (ALLGOALS |
4830 | 193 |
(fast_tac (claset() addSDs [rewrite_rule [inj_on_def] finite_imageD]))); |
3368 | 194 |
val lemma = result(); |
195 |
||
5069 | 196 |
Goal "finite(Pow A) = finite A"; |
3457 | 197 |
by (rtac iffI 1); |
198 |
by (etac lemma 1); |
|
3368 | 199 |
(*Opposite inclusion: finite A ==> finite (Pow A) *) |
3340 | 200 |
by (etac finite_induct 1); |
201 |
by (ALLGOALS |
|
202 |
(asm_simp_tac |
|
4089 | 203 |
(simpset() addsimps [finite_UnI, finite_imageI, Pow_insert]))); |
3368 | 204 |
qed "finite_Pow_iff"; |
205 |
AddIffs [finite_Pow_iff]; |
|
3340 | 206 |
|
5069 | 207 |
Goal "finite(r^-1) = finite r"; |
3457 | 208 |
by (subgoal_tac "r^-1 = (%(x,y).(y,x))``r" 1); |
209 |
by (Asm_simp_tac 1); |
|
210 |
by (rtac iffI 1); |
|
4830 | 211 |
by (etac (rewrite_rule [inj_on_def] finite_imageD) 1); |
212 |
by (simp_tac (simpset() addsplits [split_split]) 1); |
|
3457 | 213 |
by (etac finite_imageI 1); |
4746 | 214 |
by (simp_tac (simpset() addsimps [converse_def,image_def]) 1); |
4477
b3e5857d8d99
New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
paulson
parents:
4423
diff
changeset
|
215 |
by Auto_tac; |
5516 | 216 |
by (rtac bexI 1); |
217 |
by (assume_tac 2); |
|
4763 | 218 |
by (Simp_tac 1); |
4746 | 219 |
qed "finite_converse"; |
220 |
AddIffs [finite_converse]; |
|
1531 | 221 |
|
1548 | 222 |
section "Finite cardinality -- 'card'"; |
1531 | 223 |
|
5626 | 224 |
(* Ugly proofs for the traditional definition |
225 |
||
5316 | 226 |
Goal "{f i |i. (P i | i=n)} = insert (f n) {f i|i. P i}"; |
2922 | 227 |
by (Blast_tac 1); |
1531 | 228 |
val Collect_conv_insert = result(); |
229 |
||
5069 | 230 |
Goalw [card_def] "card {} = 0"; |
1553 | 231 |
by (rtac Least_equality 1); |
232 |
by (ALLGOALS Asm_full_simp_tac); |
|
1531 | 233 |
qed "card_empty"; |
234 |
Addsimps [card_empty]; |
|
235 |
||
5316 | 236 |
Goal "finite A ==> ? (n::nat) f. A = {f i |i. i<n}"; |
237 |
by (etac finite_induct 1); |
|
1553 | 238 |
by (res_inst_tac [("x","0")] exI 1); |
239 |
by (Simp_tac 1); |
|
240 |
by (etac exE 1); |
|
241 |
by (etac exE 1); |
|
242 |
by (hyp_subst_tac 1); |
|
243 |
by (res_inst_tac [("x","Suc n")] exI 1); |
|
244 |
by (res_inst_tac [("x","%i. if i<n then f i else x")] exI 1); |
|
4089 | 245 |
by (asm_simp_tac (simpset() addsimps [Collect_conv_insert, less_Suc_eq] |
1548 | 246 |
addcongs [rev_conj_cong]) 1); |
1531 | 247 |
qed "finite_has_card"; |
248 |
||
5278 | 249 |
Goal "[| x ~: A; insert x A = {f i|i. i<n} |] \ |
250 |
\ ==> ? m::nat. m<n & (? g. A = {g i|i. i<m})"; |
|
5183 | 251 |
by (exhaust_tac "n" 1); |
1553 | 252 |
by (hyp_subst_tac 1); |
253 |
by (Asm_full_simp_tac 1); |
|
254 |
by (rename_tac "m" 1); |
|
255 |
by (hyp_subst_tac 1); |
|
256 |
by (case_tac "? a. a:A" 1); |
|
257 |
by (res_inst_tac [("x","0")] exI 2); |
|
258 |
by (Simp_tac 2); |
|
2922 | 259 |
by (Blast_tac 2); |
1553 | 260 |
by (etac exE 1); |
4089 | 261 |
by (simp_tac (simpset() addsimps [less_Suc_eq]) 1); |
1553 | 262 |
by (rtac exI 1); |
1782 | 263 |
by (rtac (refl RS disjI2 RS conjI) 1); |
1553 | 264 |
by (etac equalityE 1); |
265 |
by (asm_full_simp_tac |
|
4089 | 266 |
(simpset() addsimps [subset_insert,Collect_conv_insert, less_Suc_eq]) 1); |
4153 | 267 |
by Safe_tac; |
1553 | 268 |
by (Asm_full_simp_tac 1); |
269 |
by (res_inst_tac [("x","%i. if f i = f m then a else f i")] exI 1); |
|
4153 | 270 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 271 |
by (subgoal_tac "x ~= f m" 1); |
2922 | 272 |
by (Blast_tac 2); |
1553 | 273 |
by (subgoal_tac "? k. f k = x & k<m" 1); |
2922 | 274 |
by (Blast_tac 2); |
4153 | 275 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 276 |
by (res_inst_tac [("x","k")] exI 1); |
277 |
by (Asm_simp_tac 1); |
|
4686 | 278 |
by (Simp_tac 1); |
2922 | 279 |
by (Blast_tac 1); |
3457 | 280 |
by (dtac sym 1); |
1553 | 281 |
by (rotate_tac ~1 1); |
282 |
by (Asm_full_simp_tac 1); |
|
283 |
by (res_inst_tac [("x","%i. if f i = f m then a else f i")] exI 1); |
|
4153 | 284 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 285 |
by (subgoal_tac "x ~= f m" 1); |
2922 | 286 |
by (Blast_tac 2); |
1553 | 287 |
by (subgoal_tac "? k. f k = x & k<m" 1); |
2922 | 288 |
by (Blast_tac 2); |
4153 | 289 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 290 |
by (res_inst_tac [("x","k")] exI 1); |
291 |
by (Asm_simp_tac 1); |
|
4686 | 292 |
by (Simp_tac 1); |
2922 | 293 |
by (Blast_tac 1); |
1553 | 294 |
by (res_inst_tac [("x","%j. if f j = f i then f m else f j")] exI 1); |
4153 | 295 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 296 |
by (subgoal_tac "x ~= f i" 1); |
2922 | 297 |
by (Blast_tac 2); |
1553 | 298 |
by (case_tac "x = f m" 1); |
299 |
by (res_inst_tac [("x","i")] exI 1); |
|
300 |
by (Asm_simp_tac 1); |
|
301 |
by (subgoal_tac "? k. f k = x & k<m" 1); |
|
2922 | 302 |
by (Blast_tac 2); |
4153 | 303 |
by (SELECT_GOAL Safe_tac 1); |
1553 | 304 |
by (res_inst_tac [("x","k")] exI 1); |
305 |
by (Asm_simp_tac 1); |
|
4686 | 306 |
by (Simp_tac 1); |
2922 | 307 |
by (Blast_tac 1); |
1531 | 308 |
val lemma = result(); |
309 |
||
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
310 |
Goal "[| finite A; x ~: A |] ==> \ |
3842 | 311 |
\ (LEAST n. ? f. insert x A = {f i|i. i<n}) = Suc(LEAST n. ? f. A={f i|i. i<n})"; |
1553 | 312 |
by (rtac Least_equality 1); |
3457 | 313 |
by (dtac finite_has_card 1); |
314 |
by (etac exE 1); |
|
3842 | 315 |
by (dres_inst_tac [("P","%n.? f. A={f i|i. i<n}")] LeastI 1); |
3457 | 316 |
by (etac exE 1); |
1553 | 317 |
by (res_inst_tac |
1531 | 318 |
[("x","%i. if i<(LEAST n. ? f. A={f i |i. i < n}) then f i else x")] exI 1); |
1553 | 319 |
by (simp_tac |
4089 | 320 |
(simpset() addsimps [Collect_conv_insert, less_Suc_eq] |
2031 | 321 |
addcongs [rev_conj_cong]) 1); |
3457 | 322 |
by (etac subst 1); |
323 |
by (rtac refl 1); |
|
1553 | 324 |
by (rtac notI 1); |
325 |
by (etac exE 1); |
|
326 |
by (dtac lemma 1); |
|
3457 | 327 |
by (assume_tac 1); |
1553 | 328 |
by (etac exE 1); |
329 |
by (etac conjE 1); |
|
330 |
by (dres_inst_tac [("P","%x. ? g. A = {g i |i. i < x}")] Least_le 1); |
|
331 |
by (dtac le_less_trans 1 THEN atac 1); |
|
4089 | 332 |
by (asm_full_simp_tac (simpset() addsimps [less_Suc_eq]) 1); |
1553 | 333 |
by (etac disjE 1); |
334 |
by (etac less_asym 1 THEN atac 1); |
|
335 |
by (hyp_subst_tac 1); |
|
336 |
by (Asm_full_simp_tac 1); |
|
1531 | 337 |
val lemma = result(); |
338 |
||
5416
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
339 |
Goalw [card_def] "[| finite A; x ~: A |] ==> card(insert x A) = Suc(card A)"; |
1553 | 340 |
by (etac lemma 1); |
341 |
by (assume_tac 1); |
|
1531 | 342 |
qed "card_insert_disjoint"; |
3352 | 343 |
Addsimps [card_insert_disjoint]; |
5626 | 344 |
*) |
345 |
||
6141 | 346 |
val cardR_emptyE = cardR.mk_cases "({},n) : cardR"; |
5626 | 347 |
AddSEs [cardR_emptyE]; |
6141 | 348 |
val cardR_insertE = cardR.mk_cases "(insert a A,n) : cardR"; |
5626 | 349 |
AddSIs cardR.intrs; |
350 |
||
351 |
Goal "[| (A,n) : cardR |] ==> a : A --> (? m. n = Suc m)"; |
|
6162 | 352 |
by (etac cardR.induct 1); |
353 |
by (Blast_tac 1); |
|
354 |
by (Blast_tac 1); |
|
5626 | 355 |
qed "cardR_SucD"; |
356 |
||
357 |
Goal "(A,m): cardR ==> (!n a. m = Suc n --> a:A --> (A-{a},n) : cardR)"; |
|
6162 | 358 |
by (etac cardR.induct 1); |
359 |
by (Auto_tac); |
|
360 |
by (asm_simp_tac (simpset() addsimps [insert_Diff_if]) 1); |
|
361 |
by (Auto_tac); |
|
7499 | 362 |
by (ftac cardR_SucD 1); |
6162 | 363 |
by (Blast_tac 1); |
5626 | 364 |
val lemma = result(); |
365 |
||
366 |
Goal "[| (insert a A, Suc m) : cardR; a ~: A |] ==> (A,m) : cardR"; |
|
6162 | 367 |
by (dtac lemma 1); |
368 |
by (Asm_full_simp_tac 1); |
|
5626 | 369 |
val lemma = result(); |
370 |
||
371 |
Goal "(A,m): cardR ==> (!n. (A,n) : cardR --> n=m)"; |
|
6162 | 372 |
by (etac cardR.induct 1); |
373 |
by (safe_tac (claset() addSEs [cardR_insertE])); |
|
374 |
by (rename_tac "B b m" 1); |
|
375 |
by (case_tac "a = b" 1); |
|
376 |
by (subgoal_tac "A = B" 1); |
|
377 |
by (blast_tac (claset() addEs [equalityE]) 2); |
|
378 |
by (Blast_tac 1); |
|
379 |
by (subgoal_tac "? C. A = insert b C & B = insert a C" 1); |
|
380 |
by (res_inst_tac [("x","A Int B")] exI 2); |
|
381 |
by (blast_tac (claset() addEs [equalityE]) 2); |
|
382 |
by (forw_inst_tac [("A","B")] cardR_SucD 1); |
|
383 |
by (blast_tac (claset() addDs [lemma]) 1); |
|
5626 | 384 |
qed_spec_mp "cardR_determ"; |
385 |
||
386 |
Goal "(A,n) : cardR ==> finite(A)"; |
|
387 |
by (etac cardR.induct 1); |
|
388 |
by Auto_tac; |
|
389 |
qed "cardR_imp_finite"; |
|
390 |
||
391 |
Goal "finite(A) ==> EX n. (A, n) : cardR"; |
|
392 |
by (etac finite_induct 1); |
|
393 |
by Auto_tac; |
|
394 |
qed "finite_imp_cardR"; |
|
395 |
||
396 |
Goalw [card_def] "(A,n) : cardR ==> card A = n"; |
|
397 |
by (blast_tac (claset() addIs [cardR_determ]) 1); |
|
398 |
qed "card_equality"; |
|
399 |
||
400 |
Goalw [card_def] "card {} = 0"; |
|
401 |
by (Blast_tac 1); |
|
402 |
qed "card_empty"; |
|
403 |
Addsimps [card_empty]; |
|
404 |
||
405 |
Goal "x ~: A ==> \ |
|
406 |
\ ((insert x A, n) : cardR) = \ |
|
407 |
\ (EX m. (A, m) : cardR & n = Suc m)"; |
|
408 |
by Auto_tac; |
|
409 |
by (res_inst_tac [("A1", "A")] (finite_imp_cardR RS exE) 1); |
|
410 |
by (force_tac (claset() addDs [cardR_imp_finite], simpset()) 1); |
|
411 |
by (blast_tac (claset() addIs [cardR_determ]) 1); |
|
412 |
val lemma = result(); |
|
413 |
||
414 |
Goalw [card_def] |
|
415 |
"[| finite A; x ~: A |] ==> card (insert x A) = Suc(card A)"; |
|
416 |
by (asm_simp_tac (simpset() addsimps [lemma]) 1); |
|
417 |
by (rtac select_equality 1); |
|
418 |
by (auto_tac (claset() addIs [finite_imp_cardR], |
|
419 |
simpset() addcongs [conj_cong] |
|
420 |
addsimps [symmetric card_def, |
|
421 |
card_equality])); |
|
422 |
qed "card_insert_disjoint"; |
|
423 |
Addsimps [card_insert_disjoint]; |
|
424 |
||
425 |
(* Delete rules to do with cardR relation: obsolete *) |
|
426 |
Delrules [cardR_emptyE]; |
|
427 |
Delrules cardR.intrs; |
|
428 |
||
7958 | 429 |
Goal "finite A ==> (card A = 0) = (A = {})"; |
430 |
by Auto_tac; |
|
431 |
by (dres_inst_tac [("a","x")] mk_disjoint_insert 1); |
|
432 |
by (Clarify_tac 1); |
|
433 |
by (rotate_tac ~1 1); |
|
434 |
by Auto_tac; |
|
435 |
qed "card_0_eq"; |
|
436 |
Addsimps[card_0_eq]; |
|
437 |
||
5626 | 438 |
Goal "finite A ==> card(insert x A) = (if x:A then card A else Suc(card(A)))"; |
439 |
by (asm_simp_tac (simpset() addsimps [insert_absorb]) 1); |
|
440 |
qed "card_insert_if"; |
|
441 |
||
7821 | 442 |
Goal "[| finite A; x: A |] ==> Suc (card (A-{x})) = card A"; |
5626 | 443 |
by (res_inst_tac [("t", "A")] (insert_Diff RS subst) 1); |
444 |
by (assume_tac 1); |
|
445 |
by (Asm_simp_tac 1); |
|
446 |
qed "card_Suc_Diff1"; |
|
447 |
||
7821 | 448 |
Goal "[| finite A; x: A |] ==> card (A-{x}) = card A - 1"; |
449 |
by (asm_simp_tac (simpset() addsimps [card_Suc_Diff1 RS sym]) 1); |
|
450 |
qed "card_Diff_singleton"; |
|
451 |
||
5626 | 452 |
Goal "finite A ==> card(insert x A) = Suc(card(A-{x}))"; |
453 |
by (asm_simp_tac (simpset() addsimps [card_insert_if,card_Suc_Diff1]) 1); |
|
454 |
qed "card_insert"; |
|
3352 | 455 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
456 |
Goal "finite A ==> card A <= card (insert x A)"; |
5626 | 457 |
by (asm_simp_tac (simpset() addsimps [card_insert_if]) 1); |
4768
c342d63173e9
New theorems card_Diff_le and card_insert_le; tidied
paulson
parents:
4763
diff
changeset
|
458 |
qed "card_insert_le"; |
c342d63173e9
New theorems card_Diff_le and card_insert_le; tidied
paulson
parents:
4763
diff
changeset
|
459 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
460 |
Goal "finite A ==> !B. B <= A --> card(B) <= card(A)"; |
3352 | 461 |
by (etac finite_induct 1); |
462 |
by (Simp_tac 1); |
|
3708 | 463 |
by (Clarify_tac 1); |
3352 | 464 |
by (case_tac "x:B" 1); |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
465 |
by (dres_inst_tac [("A","B")] mk_disjoint_insert 1); |
5476 | 466 |
by (asm_full_simp_tac (simpset() addsimps [subset_insert_iff]) 2); |
4775 | 467 |
by (fast_tac (claset() addss |
5477 | 468 |
(simpset() addsimps [subset_insert_iff, finite_subset] |
469 |
delsimps [insert_subset])) 1); |
|
3352 | 470 |
qed_spec_mp "card_mono"; |
471 |
||
5416
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
472 |
|
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
473 |
Goal "[| finite A; finite B |] \ |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
474 |
\ ==> card A + card B = card (A Un B) + card (A Int B)"; |
3352 | 475 |
by (etac finite_induct 1); |
5416
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
476 |
by (Simp_tac 1); |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
477 |
by (asm_simp_tac (simpset() addsimps [insert_absorb, Int_insert_left]) 1); |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
478 |
qed "card_Un_Int"; |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
479 |
|
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
480 |
Goal "[| finite A; finite B; A Int B = {} |] \ |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
481 |
\ ==> card (A Un B) = card A + card B"; |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
482 |
by (asm_simp_tac (simpset() addsimps [card_Un_Int]) 1); |
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
483 |
qed "card_Un_disjoint"; |
3352 | 484 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
485 |
Goal "[| finite A; B<=A |] ==> card A - card B = card (A - B)"; |
3352 | 486 |
by (subgoal_tac "(A-B) Un B = A" 1); |
487 |
by (Blast_tac 2); |
|
3457 | 488 |
by (rtac (add_right_cancel RS iffD1) 1); |
489 |
by (rtac (card_Un_disjoint RS subst) 1); |
|
490 |
by (etac ssubst 4); |
|
3352 | 491 |
by (Blast_tac 3); |
492 |
by (ALLGOALS |
|
493 |
(asm_simp_tac |
|
4089 | 494 |
(simpset() addsimps [add_commute, not_less_iff_le, |
5416
9f029e382b5d
New law card_Un_Int. Removed card_insert from simpset
paulson
parents:
5413
diff
changeset
|
495 |
add_diff_inverse, card_mono, finite_subset]))); |
3352 | 496 |
qed "card_Diff_subset"; |
1531 | 497 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
498 |
Goal "[| finite A; x: A |] ==> card(A-{x}) < card A"; |
2031 | 499 |
by (rtac Suc_less_SucD 1); |
5626 | 500 |
by (asm_simp_tac (simpset() addsimps [card_Suc_Diff1]) 1); |
501 |
qed "card_Diff1_less"; |
|
1618 | 502 |
|
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
503 |
Goal "finite A ==> card(A-{x}) <= card A"; |
4768
c342d63173e9
New theorems card_Diff_le and card_insert_le; tidied
paulson
parents:
4763
diff
changeset
|
504 |
by (case_tac "x: A" 1); |
5626 | 505 |
by (ALLGOALS (asm_simp_tac (simpset() addsimps [card_Diff1_less, less_imp_le]))); |
506 |
qed "card_Diff1_le"; |
|
1531 | 507 |
|
5148
74919e8f221c
More tidying and removal of "\!\!... from Goal commands
paulson
parents:
5143
diff
changeset
|
508 |
Goalw [psubset_def] "finite B ==> !A. A < B --> card(A) < card(B)"; |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
509 |
by (etac finite_induct 1); |
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
510 |
by (Simp_tac 1); |
3708 | 511 |
by (Clarify_tac 1); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
512 |
by (case_tac "x:A" 1); |
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
513 |
(*1*) |
3413
c1f63cc3a768
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
nipkow
parents:
3389
diff
changeset
|
514 |
by (dres_inst_tac [("A","A")]mk_disjoint_insert 1); |
4775 | 515 |
by (Clarify_tac 1); |
516 |
by (rotate_tac ~3 1); |
|
517 |
by (asm_full_simp_tac (simpset() addsimps [finite_subset]) 1); |
|
3708 | 518 |
by (Blast_tac 1); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
519 |
(*2*) |
3708 | 520 |
by (eres_inst_tac [("P","?a<?b")] notE 1); |
4775 | 521 |
by (asm_full_simp_tac (simpset() addsimps [subset_insert_iff]) 1); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
522 |
by (case_tac "A=F" 1); |
3708 | 523 |
by (ALLGOALS Asm_simp_tac); |
3222
726a9b069947
Distributed Psubset stuff to basic set theory files, incl Finite.
nipkow
parents:
2922
diff
changeset
|
524 |
qed_spec_mp "psubset_card" ; |
3368 | 525 |
|
7821 | 526 |
Goal "[| A <= B; card B <= card A; finite B |] ==> A = B"; |
5626 | 527 |
by (case_tac "A < B" 1); |
7497 | 528 |
by (datac psubset_card 1 1); |
5626 | 529 |
by (ALLGOALS (asm_full_simp_tac (simpset() addsimps [psubset_eq]))); |
530 |
qed "card_seteq"; |
|
531 |
||
532 |
Goal "[| finite B; A <= B; card A < card B |] ==> A < B"; |
|
533 |
by (etac psubsetI 1); |
|
534 |
by (Blast_tac 1); |
|
535 |
qed "card_psubset"; |
|
536 |
||
537 |
(*** Cardinality of image ***) |
|
538 |
||
539 |
Goal "finite A ==> card (f `` A) <= card A"; |
|
540 |
by (etac finite_induct 1); |
|
541 |
by (Simp_tac 1); |
|
542 |
by (asm_simp_tac (simpset() addsimps [finite_imageI,card_insert_if]) 1); |
|
543 |
qed "card_image_le"; |
|
544 |
||
545 |
Goal "finite(A) ==> inj_on f A --> card (f `` A) = card A"; |
|
546 |
by (etac finite_induct 1); |
|
547 |
by (ALLGOALS Asm_simp_tac); |
|
548 |
by Safe_tac; |
|
549 |
by (rewtac inj_on_def); |
|
550 |
by (Blast_tac 1); |
|
551 |
by (stac card_insert_disjoint 1); |
|
552 |
by (etac finite_imageI 1); |
|
553 |
by (Blast_tac 1); |
|
554 |
by (Blast_tac 1); |
|
555 |
qed_spec_mp "card_image"; |
|
556 |
||
557 |
Goal "[| finite A; f``A <= A; inj_on f A |] ==> f``A = A"; |
|
7497 | 558 |
by (etac card_seteq 1); |
559 |
by (dtac (card_image RS sym) 1); |
|
560 |
by Auto_tac; |
|
5626 | 561 |
qed "endo_inj_surj"; |
562 |
||
563 |
(*** Cardinality of the Powerset ***) |
|
564 |
||
565 |
Goal "finite A ==> card (Pow A) = 2 ^ card A"; |
|
566 |
by (etac finite_induct 1); |
|
567 |
by (ALLGOALS (asm_simp_tac (simpset() addsimps [Pow_insert]))); |
|
568 |
by (stac card_Un_disjoint 1); |
|
569 |
by (EVERY (map (blast_tac (claset() addIs [finite_imageI])) [3,2,1])); |
|
570 |
by (subgoal_tac "inj_on (insert x) (Pow F)" 1); |
|
571 |
by (asm_simp_tac (simpset() addsimps [card_image, Pow_insert]) 1); |
|
572 |
by (rewtac inj_on_def); |
|
573 |
by (blast_tac (claset() addSEs [equalityE]) 1); |
|
574 |
qed "card_Pow"; |
|
575 |
Addsimps [card_Pow]; |
|
576 |
||
3368 | 577 |
|
3430 | 578 |
(*Relates to equivalence classes. Based on a theorem of F. Kammueller's. |
3368 | 579 |
The "finite C" premise is redundant*) |
5143
b94cd208f073
Removal of leading "\!\!..." from most Goal commands
paulson
parents:
5069
diff
changeset
|
580 |
Goal "finite C ==> finite (Union C) --> \ |
3368 | 581 |
\ (! c : C. k dvd card c) --> \ |
582 |
\ (! c1: C. ! c2: C. c1 ~= c2 --> c1 Int c2 = {}) \ |
|
583 |
\ --> k dvd card(Union C)"; |
|
584 |
by (etac finite_induct 1); |
|
585 |
by (ALLGOALS Asm_simp_tac); |
|
3708 | 586 |
by (Clarify_tac 1); |
3368 | 587 |
by (stac card_Un_disjoint 1); |
588 |
by (ALLGOALS |
|
4089 | 589 |
(asm_full_simp_tac (simpset() |
3368 | 590 |
addsimps [dvd_add, disjoint_eq_subset_Compl]))); |
591 |
by (thin_tac "!c:F. ?PP(c)" 1); |
|
592 |
by (thin_tac "!c:F. ?PP(c) & ?QQ(c)" 1); |
|
3708 | 593 |
by (Clarify_tac 1); |
3368 | 594 |
by (ball_tac 1); |
595 |
by (Blast_tac 1); |
|
596 |
qed_spec_mp "dvd_partition"; |
|
597 |
||
5616 | 598 |
|
599 |
(*** foldSet ***) |
|
600 |
||
6141 | 601 |
val empty_foldSetE = foldSet.mk_cases "({}, x) : foldSet f e"; |
5616 | 602 |
|
603 |
AddSEs [empty_foldSetE]; |
|
604 |
AddIs foldSet.intrs; |
|
605 |
||
606 |
Goal "[| (A-{x},y) : foldSet f e; x: A |] ==> (A, f x y) : foldSet f e"; |
|
607 |
by (etac (insert_Diff RS subst) 1 THEN resolve_tac foldSet.intrs 1); |
|
608 |
by Auto_tac; |
|
5626 | 609 |
qed "Diff1_foldSet"; |
5616 | 610 |
|
611 |
Goal "(A, x) : foldSet f e ==> finite(A)"; |
|
612 |
by (eresolve_tac [foldSet.induct] 1); |
|
613 |
by Auto_tac; |
|
614 |
qed "foldSet_imp_finite"; |
|
615 |
||
616 |
Addsimps [foldSet_imp_finite]; |
|
617 |
||
618 |
||
619 |
Goal "finite(A) ==> EX x. (A, x) : foldSet f e"; |
|
620 |
by (etac finite_induct 1); |
|
621 |
by Auto_tac; |
|
622 |
qed "finite_imp_foldSet"; |
|
623 |
||
624 |
||
625 |
Open_locale "LC"; |
|
626 |
||
5782
7559f116cb10
locales now implicitly quantify over free variables
paulson
parents:
5626
diff
changeset
|
627 |
val f_lcomm = thm "lcomm"; |
5616 | 628 |
|
629 |
||
630 |
Goal "ALL A x. card(A) < n --> (A, x) : foldSet f e --> \ |
|
631 |
\ (ALL y. (A, y) : foldSet f e --> y=x)"; |
|
632 |
by (induct_tac "n" 1); |
|
633 |
by (auto_tac (claset(), simpset() addsimps [less_Suc_eq])); |
|
634 |
by (etac foldSet.elim 1); |
|
635 |
by (Blast_tac 1); |
|
636 |
by (etac foldSet.elim 1); |
|
637 |
by (Blast_tac 1); |
|
638 |
by (Clarify_tac 1); |
|
639 |
(*force simplification of "card A < card (insert ...)"*) |
|
640 |
by (etac rev_mp 1); |
|
641 |
by (asm_simp_tac (simpset() addsimps [less_Suc_eq_le]) 1); |
|
642 |
by (rtac impI 1); |
|
643 |
(** LEVEL 10 **) |
|
644 |
by (rename_tac "Aa xa ya Ab xb yb" 1); |
|
645 |
by (case_tac "xa=xb" 1); |
|
646 |
by (subgoal_tac "Aa = Ab" 1); |
|
647 |
by (blast_tac (claset() addEs [equalityE]) 2); |
|
648 |
by (Blast_tac 1); |
|
649 |
(*case xa ~= xb*) |
|
650 |
by (subgoal_tac "Aa-{xb} = Ab-{xa} & xb : Aa & xa : Ab" 1); |
|
651 |
by (blast_tac (claset() addEs [equalityE]) 2); |
|
652 |
by (Clarify_tac 1); |
|
653 |
by (subgoal_tac "Aa = insert xb Ab - {xa}" 1); |
|
654 |
by (blast_tac (claset() addEs [equalityE]) 2); |
|
655 |
(** LEVEL 20 **) |
|
656 |
by (subgoal_tac "card Aa <= card Ab" 1); |
|
657 |
by (rtac (Suc_le_mono RS subst) 2); |
|
5626 | 658 |
by (asm_simp_tac (simpset() addsimps [card_Suc_Diff1]) 2); |
5616 | 659 |
by (res_inst_tac [("A1", "Aa-{xb}"), ("f1","f")] |
660 |
(finite_imp_foldSet RS exE) 1); |
|
661 |
by (blast_tac (claset() addIs [foldSet_imp_finite, finite_Diff]) 1); |
|
7499 | 662 |
by (ftac Diff1_foldSet 1 THEN assume_tac 1); |
5616 | 663 |
by (subgoal_tac "ya = f xb x" 1); |
664 |
by (Blast_tac 2); |
|
665 |
by (subgoal_tac "(Ab - {xa}, x) : foldSet f e" 1); |
|
666 |
by (Asm_full_simp_tac 2); |
|
667 |
by (subgoal_tac "yb = f xa x" 1); |
|
5626 | 668 |
by (blast_tac (claset() addDs [Diff1_foldSet]) 2); |
5616 | 669 |
by (asm_simp_tac (simpset() addsimps [f_lcomm]) 1); |
670 |
val lemma = result(); |
|
671 |
||
672 |
||
673 |
Goal "[| (A, x) : foldSet f e; (A, y) : foldSet f e |] ==> y=x"; |
|
674 |
by (blast_tac (claset() addIs [normalize_thm [RSspec, RSmp] lemma]) 1); |
|
675 |
qed "foldSet_determ"; |
|
676 |
||
677 |
Goalw [fold_def] "(A,y) : foldSet f e ==> fold f e A = y"; |
|
678 |
by (blast_tac (claset() addIs [foldSet_determ]) 1); |
|
679 |
qed "fold_equality"; |
|
680 |
||
681 |
Goalw [fold_def] "fold f e {} = e"; |
|
682 |
by (Blast_tac 1); |
|
683 |
qed "fold_empty"; |
|
684 |
Addsimps [fold_empty]; |
|
685 |
||
5626 | 686 |
|
5616 | 687 |
Goal "x ~: A ==> \ |
688 |
\ ((insert x A, v) : foldSet f e) = \ |
|
689 |
\ (EX y. (A, y) : foldSet f e & v = f x y)"; |
|
690 |
by Auto_tac; |
|
691 |
by (res_inst_tac [("A1", "A"), ("f1","f")] (finite_imp_foldSet RS exE) 1); |
|
692 |
by (force_tac (claset() addDs [foldSet_imp_finite], simpset()) 1); |
|
693 |
by (blast_tac (claset() addIs [foldSet_determ]) 1); |
|
694 |
val lemma = result(); |
|
695 |
||
696 |
Goalw [fold_def] |
|
697 |
"[| finite A; x ~: A |] ==> fold f e (insert x A) = f x (fold f e A)"; |
|
698 |
by (asm_simp_tac (simpset() addsimps [lemma]) 1); |
|
699 |
by (rtac select_equality 1); |
|
700 |
by (auto_tac (claset() addIs [finite_imp_foldSet], |
|
701 |
simpset() addcongs [conj_cong] |
|
702 |
addsimps [symmetric fold_def, |
|
703 |
fold_equality])); |
|
704 |
qed "fold_insert"; |
|
705 |
||
5626 | 706 |
(* Delete rules to do with foldSet relation: obsolete *) |
707 |
Delsimps [foldSet_imp_finite]; |
|
708 |
Delrules [empty_foldSetE]; |
|
709 |
Delrules foldSet.intrs; |
|
710 |
||
6024 | 711 |
Close_locale "LC"; |
5616 | 712 |
|
713 |
Open_locale "ACe"; |
|
714 |
||
5782
7559f116cb10
locales now implicitly quantify over free variables
paulson
parents:
5626
diff
changeset
|
715 |
val f_ident = thm "ident"; |
7559f116cb10
locales now implicitly quantify over free variables
paulson
parents:
5626
diff
changeset
|
716 |
val f_commute = thm "commute"; |
7559f116cb10
locales now implicitly quantify over free variables
paulson
parents:
5626
diff
changeset
|
717 |
val f_assoc = thm "assoc"; |
5616 | 718 |
|
719 |
||
720 |
Goal "f x (f y z) = f y (f x z)"; |
|
721 |
by (rtac (f_commute RS trans) 1); |
|
722 |
by (rtac (f_assoc RS trans) 1); |
|
723 |
by (rtac (f_commute RS arg_cong) 1); |
|
724 |
qed "f_left_commute"; |
|
725 |
||
726 |
val f_ac = [f_assoc, f_commute, f_left_commute]; |
|
727 |
||
728 |
Goal "f e x = x"; |
|
729 |
by (stac f_commute 1); |
|
730 |
by (rtac f_ident 1); |
|
731 |
qed "f_left_ident"; |
|
732 |
||
733 |
val f_idents = [f_left_ident, f_ident]; |
|
734 |
||
735 |
Goal "[| finite A; finite B |] \ |
|
736 |
\ ==> f (fold f e A) (fold f e B) = \ |
|
737 |
\ f (fold f e (A Un B)) (fold f e (A Int B))"; |
|
738 |
by (etac finite_induct 1); |
|
739 |
by (simp_tac (simpset() addsimps f_idents) 1); |
|
740 |
by (asm_simp_tac (simpset() addsimps f_ac @ f_idents @ |
|
741 |
[export fold_insert,insert_absorb, Int_insert_left]) 1); |
|
742 |
qed "fold_Un_Int"; |
|
743 |
||
744 |
Goal "[| finite A; finite B; A Int B = {} |] \ |
|
745 |
\ ==> fold f e (A Un B) = f (fold f e A) (fold f e B)"; |
|
746 |
by (asm_simp_tac (simpset() addsimps fold_Un_Int::f_idents) 1); |
|
747 |
qed "fold_Un_disjoint"; |
|
748 |
||
749 |
Goal |
|
750 |
"[| finite A; finite B |] ==> A Int B = {} --> \ |
|
751 |
\ fold (f o g) e (A Un B) = f (fold (f o g) e A) (fold (f o g) e B)"; |
|
752 |
by (etac finite_induct 1); |
|
753 |
by (simp_tac (simpset() addsimps f_idents) 1); |
|
754 |
by (asm_full_simp_tac (simpset() addsimps f_ac @ f_idents @ |
|
755 |
[export fold_insert,insert_absorb, Int_insert_left]) 1); |
|
756 |
qed "fold_Un_disjoint2"; |
|
757 |
||
6024 | 758 |
Close_locale "ACe"; |
5616 | 759 |
|
760 |
Delrules ([empty_foldSetE] @ foldSet.intrs); |
|
761 |
Delsimps [foldSet_imp_finite]; |
|
762 |
||
763 |
(*** setsum ***) |
|
764 |
||
765 |
Goalw [setsum_def] "setsum f {} = 0"; |
|
6162 | 766 |
by (Simp_tac 1); |
5616 | 767 |
qed "setsum_empty"; |
768 |
Addsimps [setsum_empty]; |
|
769 |
||
770 |
Goalw [setsum_def] |
|
771 |
"[| finite F; a ~: F |] ==> setsum f (insert a F) = f(a) + setsum f F"; |
|
6162 | 772 |
by (asm_simp_tac (simpset() addsimps [export fold_insert]) 1); |
5616 | 773 |
qed "setsum_insert"; |
774 |
Addsimps [setsum_insert]; |
|
775 |
||
776 |
Goalw [setsum_def] |
|
777 |
"[| finite A; finite B; A Int B = {} |] ==> \ |
|
778 |
\ setsum f (A Un B) = setsum f A + setsum f B"; |
|
6162 | 779 |
by (asm_simp_tac (simpset() addsimps [export fold_Un_disjoint2]) 1); |
5616 | 780 |
qed_spec_mp "setsum_disj_Un"; |
781 |
||
782 |
Goal "[| finite F |] ==> \ |
|
783 |
\ setsum f (F-{a}) = (if a:F then setsum f F - f a else setsum f F)"; |
|
6162 | 784 |
by (etac finite_induct 1); |
785 |
by (auto_tac (claset(), simpset() addsimps [insert_Diff_if])); |
|
786 |
by (dres_inst_tac [("a","a")] mk_disjoint_insert 1); |
|
787 |
by (Auto_tac); |
|
5616 | 788 |
qed_spec_mp "setsum_diff1"; |
7834 | 789 |
|
790 |
||
791 |
(*** Basic theorem about "choose". By Florian Kammueller, tidied by LCP ***) |
|
792 |
||
793 |
Goal "finite S ==> (card S = 0) = (S = {})"; |
|
794 |
by (auto_tac (claset() addDs [card_Suc_Diff1], |
|
795 |
simpset())); |
|
796 |
qed "card_0_empty_iff"; |
|
797 |
||
798 |
Goal "finite A ==> card {B. B <= A & card B = 0} = 1"; |
|
799 |
by (asm_simp_tac (simpset() addcongs [conj_cong] |
|
800 |
addsimps [finite_subset RS card_0_empty_iff]) 1); |
|
801 |
by (simp_tac (simpset() addcongs [rev_conj_cong]) 1); |
|
802 |
qed "card_s_0_eq_empty"; |
|
803 |
||
804 |
Goal "[| finite M; x ~: M |] \ |
|
805 |
\ ==> {s. s <= insert x M & card(s) = Suc k} \ |
|
806 |
\ = {s. s <= M & card(s) = Suc k} Un \ |
|
807 |
\ {s. EX t. t <= M & card(t) = k & s = insert x t}"; |
|
808 |
by Safe_tac; |
|
809 |
by (auto_tac (claset() addIs [finite_subset RS card_insert_disjoint], |
|
810 |
simpset())); |
|
811 |
by (dres_inst_tac [("x","xa - {x}")] spec 1); |
|
812 |
by (subgoal_tac ("x ~: xa") 1); |
|
813 |
by Auto_tac; |
|
814 |
by (etac rev_mp 1 THEN stac card_Diff_singleton 1); |
|
7958 | 815 |
by (auto_tac (claset() addIs [finite_subset], simpset())); |
7834 | 816 |
qed "choose_deconstruct"; |
817 |
||
8140 | 818 |
Goal "[| finite(A); finite(B); f``A <= B; inj_on f A |] \ |
7834 | 819 |
\ ==> card A <= card B"; |
820 |
by (auto_tac (claset() addIs [card_mono], |
|
8140 | 821 |
simpset() addsimps [card_image RS sym])); |
7834 | 822 |
qed "card_inj_on_le"; |
823 |
||
824 |
Goal "[| finite A; finite B; \ |
|
8140 | 825 |
\ f``A <= B; inj_on f A; g``B <= A; inj_on g B |] \ |
7834 | 826 |
\ ==> card(A) = card(B)"; |
827 |
by (auto_tac (claset() addIs [le_anti_sym,card_inj_on_le], simpset())); |
|
828 |
qed "card_bij_eq"; |
|
829 |
||
830 |
Goal "[| finite M; x ~: M |] \ |
|
831 |
\ ==> card{s. EX t. t <= M & card(t) = k & s = insert x t} = \ |
|
832 |
\ card {s. s <= M & card(s) = k}"; |
|
8140 | 833 |
by (res_inst_tac [("f", "%s. s - {x}"), ("g","insert x")] card_bij_eq 1); |
7834 | 834 |
by (res_inst_tac [("B","Pow(insert x M)")] finite_subset 1); |
835 |
by (res_inst_tac [("B","Pow(M)")] finite_subset 3); |
|
8320 | 836 |
by (REPEAT(Fast_tac 1)); |
7834 | 837 |
(* arity *) |
8140 | 838 |
by (auto_tac (claset() addSEs [equalityE], simpset() addsimps [inj_on_def])); |
7834 | 839 |
by (stac Diff_insert0 1); |
840 |
by Auto_tac; |
|
841 |
qed "constr_bij"; |
|
842 |
||
843 |
(* Main theorem: combinatorial theorem about number of subsets of a set *) |
|
7842
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
844 |
Goal "(ALL A. finite A --> card {s. s <= A & card s = k} = (card A choose k))"; |
7834 | 845 |
by (induct_tac "k" 1); |
846 |
by (simp_tac (simpset() addsimps [card_s_0_eq_empty]) 1); |
|
847 |
(* first 0 case finished *) |
|
7842
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
848 |
(* prepare finite set induction *) |
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
849 |
by (rtac allI 1 THEN rtac impI 1); |
7834 | 850 |
(* second induction *) |
851 |
by (etac finite_induct 1); |
|
7842
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
852 |
by (ALLGOALS |
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
853 |
(simp_tac (simpset() addcongs [conj_cong] addsimps [card_s_0_eq_empty]))); |
7834 | 854 |
by (stac choose_deconstruct 1); |
855 |
by (assume_tac 1); |
|
856 |
by (assume_tac 1); |
|
857 |
by (stac card_Un_disjoint 1); |
|
858 |
by (Force_tac 3); |
|
7842
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
859 |
(** LEVEL 10 **) |
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
860 |
(* use bijection *) |
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
861 |
by (force_tac (claset(), simpset() addsimps [constr_bij]) 3); |
7834 | 862 |
(* finite goal *) |
863 |
by (res_inst_tac [("B","Pow F")] finite_subset 1); |
|
864 |
by (Blast_tac 1); |
|
865 |
by (etac (finite_Pow_iff RS iffD2) 1); |
|
866 |
(* finite goal *) |
|
867 |
by (res_inst_tac [("B","Pow (insert x F)")] finite_subset 1); |
|
868 |
by (Blast_tac 1); |
|
869 |
by (blast_tac (claset() addIs [finite_Pow_iff RS iffD2]) 1); |
|
870 |
qed "n_sub_lemma"; |
|
871 |
||
7842
6858c98385c3
simplified and generalized n_sub_lemma and n_subsets
paulson
parents:
7834
diff
changeset
|
872 |
Goal "finite M ==> card {s. s <= M & card(s) = k} = ((card M) choose k)"; |
7834 | 873 |
by (asm_simp_tac (simpset() addsimps [n_sub_lemma]) 1); |
874 |
qed "n_subsets"; |