1 (* Title: HOL/Finite_Set.thy
2 Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel
3 with contributions by Jeremy Avigad
6 header {* Finite sets *}
12 subsection {* Predicate for finite sets *}
14 inductive finite :: "'a set \<Rightarrow> bool"
16 emptyI [simp, intro!]: "finite {}"
17 | insertI [simp, intro!]: "finite A \<Longrightarrow> finite (insert a A)"
19 lemma finite_induct [case_names empty insert, induct set: finite]:
20 -- {* Discharging @{text "x \<notin> F"} entails extra work. *}
23 and insert: "\<And>x F. finite F \<Longrightarrow> x \<notin> F \<Longrightarrow> P F \<Longrightarrow> P (insert x F)"
25 using `finite F` proof induct
27 fix x F assume F: "finite F" and P: "P F"
31 hence "insert x F = F" by (rule insert_absorb)
32 with P show ?thesis by (simp only:)
35 from F this P show ?thesis by (rule insert)
40 subsubsection {* Choice principles *}
42 lemma ex_new_if_finite: -- "does not depend on def of finite at all"
43 assumes "\<not> finite (UNIV :: 'a set)" and "finite A"
44 shows "\<exists>a::'a. a \<notin> A"
46 from assms have "A \<noteq> UNIV" by blast
47 then show ?thesis by blast
50 text {* A finite choice principle. Does not need the SOME choice operator. *}
52 lemma finite_set_choice:
53 "finite A \<Longrightarrow> \<forall>x\<in>A. \<exists>y. P x y \<Longrightarrow> \<exists>f. \<forall>x\<in>A. P x (f x)"
54 proof (induct rule: finite_induct)
55 case empty then show ?case by simp
58 then obtain f b where f: "ALL x:A. P x (f x)" and ab: "P a b" by auto
59 show ?case (is "EX f. ?P f")
61 show "?P(%x. if x = a then b else f x)" using f ab by auto
66 subsubsection {* Finite sets are the images of initial segments of natural numbers *}
68 lemma finite_imp_nat_seg_image_inj_on:
70 shows "\<exists>(n::nat) f. A = f ` {i. i < n} \<and> inj_on f {i. i < n}"
71 using assms proof induct
75 show "\<exists>f. {} = f ` {i::nat. i < 0} \<and> inj_on f {i. i < 0}" by simp
79 have notinA: "a \<notin> A" by fact
80 from insert.hyps obtain n f
81 where "A = f ` {i::nat. i < n}" "inj_on f {i. i < n}" by blast
82 hence "insert a A = f(n:=a) ` {i. i < Suc n}"
83 "inj_on (f(n:=a)) {i. i < Suc n}" using notinA
84 by (auto simp add: image_def Ball_def inj_on_def less_Suc_eq)
88 lemma nat_seg_image_imp_finite:
89 "A = f ` {i::nat. i < n} \<Longrightarrow> finite A"
90 proof (induct n arbitrary: A)
91 case 0 thus ?case by simp
94 let ?B = "f ` {i. i < n}"
95 have finB: "finite ?B" by(rule Suc.hyps[OF refl])
98 assume "\<exists>k<n. f n = f k"
99 hence "A = ?B" using Suc.prems by(auto simp:less_Suc_eq)
100 thus ?thesis using finB by simp
102 assume "\<not>(\<exists> k<n. f n = f k)"
103 hence "A = insert (f n) ?B" using Suc.prems by(auto simp:less_Suc_eq)
104 thus ?thesis using finB by simp
108 lemma finite_conv_nat_seg_image:
109 "finite A \<longleftrightarrow> (\<exists>(n::nat) f. A = f ` {i::nat. i < n})"
110 by (blast intro: nat_seg_image_imp_finite dest: finite_imp_nat_seg_image_inj_on)
112 lemma finite_imp_inj_to_nat_seg:
114 shows "\<exists>f n::nat. f ` A = {i. i < n} \<and> inj_on f A"
116 from finite_imp_nat_seg_image_inj_on[OF `finite A`]
117 obtain f and n::nat where bij: "bij_betw f {i. i<n} A"
118 by (auto simp:bij_betw_def)
119 let ?f = "the_inv_into {i. i<n} f"
120 have "inj_on ?f A & ?f ` A = {i. i<n}"
121 by (fold bij_betw_def) (rule bij_betw_the_inv_into[OF bij])
122 thus ?thesis by blast
125 lemma finite_Collect_less_nat [iff]:
126 "finite {n::nat. n < k}"
127 by (fastforce simp: finite_conv_nat_seg_image)
129 lemma finite_Collect_le_nat [iff]:
130 "finite {n::nat. n \<le> k}"
131 by (simp add: le_eq_less_or_eq Collect_disj_eq)
134 subsubsection {* Finiteness and common set operations *}
136 lemma rev_finite_subset:
137 "finite B \<Longrightarrow> A \<subseteq> B \<Longrightarrow> finite A"
138 proof (induct arbitrary: A rule: finite_induct)
140 then show ?case by simp
143 have A: "A \<subseteq> insert x F" and r: "A - {x} \<subseteq> F \<Longrightarrow> finite (A - {x})" by fact+
146 assume x: "x \<in> A"
147 with A have "A - {x} \<subseteq> F" by (simp add: subset_insert_iff)
148 with r have "finite (A - {x})" .
149 hence "finite (insert x (A - {x}))" ..
150 also have "insert x (A - {x}) = A" using x by (rule insert_Diff)
151 finally show ?thesis .
153 show "A \<subseteq> F ==> ?thesis" by fact
154 assume "x \<notin> A"
155 with A show "A \<subseteq> F" by (simp add: subset_insert_iff)
160 "A \<subseteq> B \<Longrightarrow> finite B \<Longrightarrow> finite A"
161 by (rule rev_finite_subset)
164 assumes "finite F" and "finite G"
165 shows "finite (F \<union> G)"
166 using assms by induct simp_all
168 lemma finite_Un [iff]:
169 "finite (F \<union> G) \<longleftrightarrow> finite F \<and> finite G"
170 by (blast intro: finite_UnI finite_subset [of _ "F \<union> G"])
172 lemma finite_insert [simp]: "finite (insert a A) \<longleftrightarrow> finite A"
174 have "finite {a} \<and> finite A \<longleftrightarrow> finite A" by simp
175 then have "finite ({a} \<union> A) \<longleftrightarrow> finite A" by (simp only: finite_Un)
176 then show ?thesis by simp
179 lemma finite_Int [simp, intro]:
180 "finite F \<or> finite G \<Longrightarrow> finite (F \<inter> G)"
181 by (blast intro: finite_subset)
183 lemma finite_Collect_conjI [simp, intro]:
184 "finite {x. P x} \<or> finite {x. Q x} \<Longrightarrow> finite {x. P x \<and> Q x}"
185 by (simp add: Collect_conj_eq)
187 lemma finite_Collect_disjI [simp]:
188 "finite {x. P x \<or> Q x} \<longleftrightarrow> finite {x. P x} \<and> finite {x. Q x}"
189 by (simp add: Collect_disj_eq)
191 lemma finite_Diff [simp, intro]:
192 "finite A \<Longrightarrow> finite (A - B)"
193 by (rule finite_subset, rule Diff_subset)
195 lemma finite_Diff2 [simp]:
197 shows "finite (A - B) \<longleftrightarrow> finite A"
199 have "finite A \<longleftrightarrow> finite((A - B) \<union> (A \<inter> B))" by (simp add: Un_Diff_Int)
200 also have "\<dots> \<longleftrightarrow> finite (A - B)" using `finite B` by simp
201 finally show ?thesis ..
204 lemma finite_Diff_insert [iff]:
205 "finite (A - insert a B) \<longleftrightarrow> finite (A - B)"
207 have "finite (A - B) \<longleftrightarrow> finite (A - B - {a})" by simp
208 moreover have "A - insert a B = A - B - {a}" by auto
209 ultimately show ?thesis by simp
212 lemma finite_compl[simp]:
213 "finite (A :: 'a set) \<Longrightarrow> finite (- A) \<longleftrightarrow> finite (UNIV :: 'a set)"
214 by (simp add: Compl_eq_Diff_UNIV)
216 lemma finite_Collect_not[simp]:
217 "finite {x :: 'a. P x} \<Longrightarrow> finite {x. \<not> P x} \<longleftrightarrow> finite (UNIV :: 'a set)"
218 by (simp add: Collect_neg_eq)
220 lemma finite_Union [simp, intro]:
221 "finite A \<Longrightarrow> (\<And>M. M \<in> A \<Longrightarrow> finite M) \<Longrightarrow> finite(\<Union>A)"
222 by (induct rule: finite_induct) simp_all
224 lemma finite_UN_I [intro]:
225 "finite A \<Longrightarrow> (\<And>a. a \<in> A \<Longrightarrow> finite (B a)) \<Longrightarrow> finite (\<Union>a\<in>A. B a)"
226 by (induct rule: finite_induct) simp_all
228 lemma finite_UN [simp]:
229 "finite A \<Longrightarrow> finite (UNION A B) \<longleftrightarrow> (\<forall>x\<in>A. finite (B x))"
230 by (blast intro: finite_subset)
232 lemma finite_Inter [intro]:
233 "\<exists>A\<in>M. finite A \<Longrightarrow> finite (\<Inter>M)"
234 by (blast intro: Inter_lower finite_subset)
236 lemma finite_INT [intro]:
237 "\<exists>x\<in>I. finite (A x) \<Longrightarrow> finite (\<Inter>x\<in>I. A x)"
238 by (blast intro: INT_lower finite_subset)
240 lemma finite_imageI [simp, intro]:
241 "finite F \<Longrightarrow> finite (h ` F)"
242 by (induct rule: finite_induct) simp_all
244 lemma finite_image_set [simp]:
245 "finite {x. P x} \<Longrightarrow> finite { f x | x. P x }"
246 by (simp add: image_Collect [symmetric])
249 assumes "finite (f ` A)" and "inj_on f A"
251 using assms proof (induct "f ` A" arbitrary: A)
252 case empty then show ?case by simp
255 then have B_A: "insert x B = f ` A" by simp
256 then obtain y where "x = f y" and "y \<in> A" by blast
257 from B_A `x \<notin> B` have "B = f ` A - {x}" by blast
258 with B_A `x \<notin> B` `x = f y` `inj_on f A` `y \<in> A` have "B = f ` (A - {y})" by (simp add: inj_on_image_set_diff)
259 moreover from `inj_on f A` have "inj_on f (A - {y})" by (rule inj_on_diff)
260 ultimately have "finite (A - {y})" by (rule insert.hyps)
261 then show "finite A" by simp
265 "finite A \<Longrightarrow> B \<subseteq> f ` A \<Longrightarrow> finite B"
266 by (erule finite_subset) (rule finite_imageI)
268 lemma finite_range_imageI:
269 "finite (range g) \<Longrightarrow> finite (range (\<lambda>x. f (g x)))"
270 by (drule finite_imageI) (simp add: range_composition)
272 lemma finite_subset_image:
274 shows "B \<subseteq> f ` A \<Longrightarrow> \<exists>C\<subseteq>A. finite C \<and> B = f ` C"
275 using assms proof induct
276 case empty then show ?case by simp
278 case insert then show ?case
279 by (clarsimp simp del: image_insert simp add: image_insert [symmetric])
283 lemma finite_vimage_IntI:
284 "finite F \<Longrightarrow> inj_on h A \<Longrightarrow> finite (h -` F \<inter> A)"
285 apply (induct rule: finite_induct)
287 apply (subst vimage_insert)
288 apply (simp add: finite_subset [OF inj_on_vimage_singleton] Int_Un_distrib2)
291 lemma finite_vimageI:
292 "finite F \<Longrightarrow> inj h \<Longrightarrow> finite (h -` F)"
293 using finite_vimage_IntI[of F h UNIV] by auto
295 lemma finite_vimageD:
296 assumes fin: "finite (h -` F)" and surj: "surj h"
299 have "finite (h ` (h -` F))" using fin by (rule finite_imageI)
300 also have "h ` (h -` F) = F" using surj by (rule surj_image_vimage_eq)
301 finally show "finite F" .
304 lemma finite_vimage_iff: "bij h \<Longrightarrow> finite (h -` F) \<longleftrightarrow> finite F"
305 unfolding bij_def by (auto elim: finite_vimageD finite_vimageI)
307 lemma finite_Collect_bex [simp]:
309 shows "finite {x. \<exists>y\<in>A. Q x y} \<longleftrightarrow> (\<forall>y\<in>A. finite {x. Q x y})"
311 have "{x. \<exists>y\<in>A. Q x y} = (\<Union>y\<in>A. {x. Q x y})" by auto
312 with assms show ?thesis by simp
315 lemma finite_Collect_bounded_ex [simp]:
316 assumes "finite {y. P y}"
317 shows "finite {x. \<exists>y. P y \<and> Q x y} \<longleftrightarrow> (\<forall>y. P y \<longrightarrow> finite {x. Q x y})"
319 have "{x. EX y. P y & Q x y} = (\<Union>y\<in>{y. P y}. {x. Q x y})" by auto
320 with assms show ?thesis by simp
324 "finite A \<Longrightarrow> finite B \<Longrightarrow> finite (A <+> B)"
325 by (simp add: Plus_def)
328 fixes A :: "'a set" and B :: "'b set"
329 assumes fin: "finite (A <+> B)"
330 shows "finite A" "finite B"
332 have "Inl ` A \<subseteq> A <+> B" by auto
333 then have "finite (Inl ` A :: ('a + 'b) set)" using fin by (rule finite_subset)
334 then show "finite A" by (rule finite_imageD) (auto intro: inj_onI)
336 have "Inr ` B \<subseteq> A <+> B" by auto
337 then have "finite (Inr ` B :: ('a + 'b) set)" using fin by (rule finite_subset)
338 then show "finite B" by (rule finite_imageD) (auto intro: inj_onI)
341 lemma finite_Plus_iff [simp]:
342 "finite (A <+> B) \<longleftrightarrow> finite A \<and> finite B"
343 by (auto intro: finite_PlusD finite_Plus)
345 lemma finite_Plus_UNIV_iff [simp]:
346 "finite (UNIV :: ('a + 'b) set) \<longleftrightarrow> finite (UNIV :: 'a set) \<and> finite (UNIV :: 'b set)"
347 by (subst UNIV_Plus_UNIV [symmetric]) (rule finite_Plus_iff)
349 lemma finite_SigmaI [simp, intro]:
350 "finite A \<Longrightarrow> (\<And>a. a\<in>A \<Longrightarrow> finite (B a)) ==> finite (SIGMA a:A. B a)"
351 by (unfold Sigma_def) blast
353 lemma finite_cartesian_product:
354 "finite A \<Longrightarrow> finite B \<Longrightarrow> finite (A \<times> B)"
355 by (rule finite_SigmaI)
357 lemma finite_Prod_UNIV:
358 "finite (UNIV :: 'a set) \<Longrightarrow> finite (UNIV :: 'b set) \<Longrightarrow> finite (UNIV :: ('a \<times> 'b) set)"
359 by (simp only: UNIV_Times_UNIV [symmetric] finite_cartesian_product)
361 lemma finite_cartesian_productD1:
362 assumes "finite (A \<times> B)" and "B \<noteq> {}"
365 from assms obtain n f where "A \<times> B = f ` {i::nat. i < n}"
366 by (auto simp add: finite_conv_nat_seg_image)
367 then have "fst ` (A \<times> B) = fst ` f ` {i::nat. i < n}" by simp
368 with `B \<noteq> {}` have "A = (fst \<circ> f) ` {i::nat. i < n}"
369 by (simp add: image_compose)
370 then have "\<exists>n f. A = f ` {i::nat. i < n}" by blast
372 by (auto simp add: finite_conv_nat_seg_image)
375 lemma finite_cartesian_productD2:
376 assumes "finite (A \<times> B)" and "A \<noteq> {}"
379 from assms obtain n f where "A \<times> B = f ` {i::nat. i < n}"
380 by (auto simp add: finite_conv_nat_seg_image)
381 then have "snd ` (A \<times> B) = snd ` f ` {i::nat. i < n}" by simp
382 with `A \<noteq> {}` have "B = (snd \<circ> f) ` {i::nat. i < n}"
383 by (simp add: image_compose)
384 then have "\<exists>n f. B = f ` {i::nat. i < n}" by blast
386 by (auto simp add: finite_conv_nat_seg_image)
389 lemma finite_Pow_iff [iff]:
390 "finite (Pow A) \<longleftrightarrow> finite A"
392 assume "finite (Pow A)"
393 then have "finite ((%x. {x}) ` A)" by (blast intro: finite_subset)
394 then show "finite A" by (rule finite_imageD [unfolded inj_on_def]) simp
397 then show "finite (Pow A)"
398 by induct (simp_all add: Pow_insert)
401 corollary finite_Collect_subsets [simp, intro]:
402 "finite A \<Longrightarrow> finite {B. B \<subseteq> A}"
403 by (simp add: Pow_def [symmetric])
405 lemma finite_UnionD: "finite(\<Union>A) \<Longrightarrow> finite A"
406 by (blast intro: finite_subset [OF subset_Pow_Union])
409 subsubsection {* Further induction rules on finite sets *}
411 lemma finite_ne_induct [case_names singleton insert, consumes 2]:
412 assumes "finite F" and "F \<noteq> {}"
413 assumes "\<And>x. P {x}"
414 and "\<And>x F. finite F \<Longrightarrow> F \<noteq> {} \<Longrightarrow> x \<notin> F \<Longrightarrow> P F \<Longrightarrow> P (insert x F)"
416 using assms proof induct
417 case empty then show ?case by simp
419 case (insert x F) then show ?case by cases auto
422 lemma finite_subset_induct [consumes 2, case_names empty insert]:
423 assumes "finite F" and "F \<subseteq> A"
424 assumes empty: "P {}"
425 and insert: "\<And>a F. finite F \<Longrightarrow> a \<in> A \<Longrightarrow> a \<notin> F \<Longrightarrow> P F \<Longrightarrow> P (insert a F)"
427 using `finite F` `F \<subseteq> A` proof induct
431 assume "finite F" and "x \<notin> F" and
432 P: "F \<subseteq> A \<Longrightarrow> P F" and i: "insert x F \<subseteq> A"
433 show "P (insert x F)"
435 from i show "x \<in> A" by blast
436 from i have "F \<subseteq> A" by blast
438 show "finite F" by fact
439 show "x \<notin> F" by fact
443 lemma finite_empty_induct:
446 and remove: "\<And>a A. finite A \<Longrightarrow> a \<in> A \<Longrightarrow> P A \<Longrightarrow> P (A - {a})"
449 have "\<And>B. B \<subseteq> A \<Longrightarrow> P (A - B)"
452 assume "B \<subseteq> A"
453 with `finite A` have "finite B" by (rule rev_finite_subset)
454 from this `B \<subseteq> A` show "P (A - B)"
457 from `P A` show ?case by simp
460 have "P (A - B - {b})"
462 from `finite A` show "finite (A - B)" by induct auto
463 from insert show "b \<in> A - B" by simp
464 from insert show "P (A - B)" by simp
466 also have "A - B - {b} = A - insert b B" by (rule Diff_insert [symmetric])
470 then have "P (A - A)" by blast
471 then show ?thesis by simp
475 subsection {* Class @{text finite} *}
478 assumes finite_UNIV: "finite (UNIV \<Colon> 'a set)"
481 lemma finite [simp]: "finite (A \<Colon> 'a set)"
482 by (rule subset_UNIV finite_UNIV finite_subset)+
484 lemma finite_code [code]: "finite (A \<Colon> 'a set) \<longleftrightarrow> True"
489 instance prod :: (finite, finite) finite proof
490 qed (simp only: UNIV_Times_UNIV [symmetric] finite_cartesian_product finite)
492 lemma inj_graph: "inj (%f. {(x, y). y = f x})"
493 by (rule inj_onI, auto simp add: set_eq_iff fun_eq_iff)
495 instance "fun" :: (finite, finite) finite
497 show "finite (UNIV :: ('a => 'b) set)"
498 proof (rule finite_imageD)
499 let ?graph = "%f::'a => 'b. {(x, y). y = f x}"
500 have "range ?graph \<subseteq> Pow UNIV" by simp
501 moreover have "finite (Pow (UNIV :: ('a * 'b) set))"
502 by (simp only: finite_Pow_iff finite)
503 ultimately show "finite (range ?graph)"
504 by (rule finite_subset)
505 show "inj ?graph" by (rule inj_graph)
509 instance bool :: finite proof
510 qed (simp add: UNIV_bool)
512 instance set :: (finite) finite
513 by default (simp only: Pow_UNIV [symmetric] finite_Pow_iff finite)
515 instance unit :: finite proof
516 qed (simp add: UNIV_unit)
518 instance sum :: (finite, finite) finite proof
519 qed (simp only: UNIV_Plus_UNIV [symmetric] finite_Plus finite)
521 lemma finite_option_UNIV [simp]:
522 "finite (UNIV :: 'a option set) = finite (UNIV :: 'a set)"
523 by (auto simp add: UNIV_option_conv elim: finite_imageD intro: inj_Some)
525 instance option :: (finite) finite proof
526 qed (simp add: UNIV_option_conv)
529 subsection {* A basic fold functional for finite sets *}
531 text {* The intended behaviour is
532 @{text "fold f z {x\<^isub>1, ..., x\<^isub>n} = f x\<^isub>1 (\<dots> (f x\<^isub>n z)\<dots>)"}
533 if @{text f} is ``left-commutative'':
536 locale comp_fun_commute =
537 fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b"
538 assumes comp_fun_commute: "f y \<circ> f x = f x \<circ> f y"
541 lemma fun_left_comm: "f x (f y z) = f y (f x z)"
542 using comp_fun_commute by (simp add: fun_eq_iff)
546 inductive fold_graph :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> bool"
547 for f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b" and z :: 'b where
548 emptyI [intro]: "fold_graph f z {} z" |
549 insertI [intro]: "x \<notin> A \<Longrightarrow> fold_graph f z A y
550 \<Longrightarrow> fold_graph f z (insert x A) (f x y)"
552 inductive_cases empty_fold_graphE [elim!]: "fold_graph f z {} x"
554 definition fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b" where
555 "fold f z A = (THE y. fold_graph f z A y)"
557 text{*A tempting alternative for the definiens is
558 @{term "if finite A then THE y. fold_graph f z A y else e"}.
559 It allows the removal of finiteness assumptions from the theorems
560 @{text fold_comm}, @{text fold_reindex} and @{text fold_distrib}.
561 The proofs become ugly. It is not worth the effort. (???) *}
563 lemma finite_imp_fold_graph: "finite A \<Longrightarrow> \<exists>x. fold_graph f z A x"
564 by (induct rule: finite_induct) auto
567 subsubsection{*From @{const fold_graph} to @{term fold}*}
569 context comp_fun_commute
572 lemma fold_graph_insertE_aux:
573 "fold_graph f z A y \<Longrightarrow> a \<in> A \<Longrightarrow> \<exists>y'. y = f a y' \<and> fold_graph f z (A - {a}) y'"
574 proof (induct set: fold_graph)
575 case (insertI x A y) show ?case
576 proof (cases "x = a")
577 assume "x = a" with insertI show ?case by auto
579 assume "x \<noteq> a"
580 then obtain y' where y: "y = f a y'" and y': "fold_graph f z (A - {a}) y'"
581 using insertI by auto
582 have "f x y = f a (f x y')"
583 unfolding y by (rule fun_left_comm)
584 moreover have "fold_graph f z (insert x A - {a}) (f x y')"
585 using y' and `x \<noteq> a` and `x \<notin> A`
586 by (simp add: insert_Diff_if fold_graph.insertI)
587 ultimately show ?case by fast
591 lemma fold_graph_insertE:
592 assumes "fold_graph f z (insert x A) v" and "x \<notin> A"
593 obtains y where "v = f x y" and "fold_graph f z A y"
594 using assms by (auto dest: fold_graph_insertE_aux [OF _ insertI1])
596 lemma fold_graph_determ:
597 "fold_graph f z A x \<Longrightarrow> fold_graph f z A y \<Longrightarrow> y = x"
598 proof (induct arbitrary: y set: fold_graph)
599 case (insertI x A y v)
600 from `fold_graph f z (insert x A) v` and `x \<notin> A`
601 obtain y' where "v = f x y'" and "fold_graph f z A y'"
602 by (rule fold_graph_insertE)
603 from `fold_graph f z A y'` have "y' = y" by (rule insertI)
604 with `v = f x y'` show "v = f x y" by simp
608 "fold_graph f z A y \<Longrightarrow> fold f z A = y"
609 by (unfold fold_def) (blast intro: fold_graph_determ)
611 lemma fold_graph_fold:
613 shows "fold_graph f z A (fold f z A)"
615 from assms have "\<exists>x. fold_graph f z A x" by (rule finite_imp_fold_graph)
616 moreover note fold_graph_determ
617 ultimately have "\<exists>!x. fold_graph f z A x" by (rule ex_ex1I)
618 then have "fold_graph f z A (The (fold_graph f z A))" by (rule theI')
619 then show ?thesis by (unfold fold_def)
622 text{* The base case for @{text fold}: *}
624 lemma (in -) fold_empty [simp]: "fold f z {} = z"
625 by (unfold fold_def) blast
627 text{* The various recursion equations for @{const fold}: *}
629 lemma fold_insert [simp]:
630 assumes "finite A" and "x \<notin> A"
631 shows "fold f z (insert x A) = f x (fold f z A)"
632 proof (rule fold_equality)
633 from `finite A` have "fold_graph f z A (fold f z A)" by (rule fold_graph_fold)
634 with `x \<notin> A`show "fold_graph f z (insert x A) (f x (fold f z A))" by (rule fold_graph.insertI)
638 "finite A \<Longrightarrow> f x (fold f z A) = fold f (f x z) A"
639 proof (induct rule: finite_induct)
640 case empty then show ?case by simp
642 case (insert y A) then show ?case
643 by (simp add: fun_left_comm[of x])
647 "finite A \<Longrightarrow> x \<notin> A \<Longrightarrow> fold f z (insert x A) = fold f (f x z) A"
648 by (simp add: fold_fun_comm)
651 assumes "finite A" and "x \<in> A"
652 shows "fold f z A = f x (fold f z (A - {x}))"
654 have A: "A = insert x (A - {x})" using `x \<in> A` by blast
655 then have "fold f z A = fold f z (insert x (A - {x}))" by simp
656 also have "\<dots> = f x (fold f z (A - {x}))"
657 by (rule fold_insert) (simp add: `finite A`)+
658 finally show ?thesis .
661 lemma fold_insert_remove:
663 shows "fold f z (insert x A) = f x (fold f z (A - {x}))"
665 from `finite A` have "finite (insert x A)" by auto
666 moreover have "x \<in> insert x A" by auto
667 ultimately have "fold f z (insert x A) = f x (fold f z (insert x A - {x}))"
669 then show ?thesis by simp
674 text{* A simplified version for idempotent functions: *}
676 locale comp_fun_idem = comp_fun_commute +
677 assumes comp_fun_idem: "f x o f x = f x"
680 lemma fun_left_idem: "f x (f x z) = f x z"
681 using comp_fun_idem by (simp add: fun_eq_iff)
683 lemma fold_insert_idem:
684 assumes fin: "finite A"
685 shows "fold f z (insert x A) = f x (fold f z A)"
688 then obtain B where "A = insert x B" and "x \<notin> B" by (rule set_insert)
689 then show ?thesis using assms by (simp add:fun_left_idem)
691 assume "x \<notin> A" then show ?thesis using assms by simp
694 declare fold_insert[simp del] fold_insert_idem[simp]
696 lemma fold_insert_idem2:
697 "finite A \<Longrightarrow> fold f z (insert x A) = fold f (f x z) A"
698 by(simp add:fold_fun_comm)
703 subsubsection {* Expressing set operations via @{const fold} *}
705 lemma (in comp_fun_commute) comp_comp_fun_commute:
706 "comp_fun_commute (f \<circ> g)"
708 qed (simp_all add: comp_fun_commute)
710 lemma (in comp_fun_idem) comp_comp_fun_idem:
711 "comp_fun_idem (f \<circ> g)"
712 by (rule comp_fun_idem.intro, rule comp_comp_fun_commute, unfold_locales)
713 (simp_all add: comp_fun_idem)
715 lemma comp_fun_idem_insert:
716 "comp_fun_idem insert"
720 lemma comp_fun_idem_remove:
721 "comp_fun_idem (\<lambda>x A. A - {x})"
725 lemma (in semilattice_inf) comp_fun_idem_inf:
728 qed (auto simp add: inf_left_commute)
730 lemma (in semilattice_sup) comp_fun_idem_sup:
733 qed (auto simp add: sup_left_commute)
735 lemma union_fold_insert:
737 shows "A \<union> B = fold insert B A"
739 interpret comp_fun_idem insert by (fact comp_fun_idem_insert)
740 from `finite A` show ?thesis by (induct A arbitrary: B) simp_all
743 lemma minus_fold_remove:
745 shows "B - A = fold (\<lambda>x A. A - {x}) B A"
747 interpret comp_fun_idem "\<lambda>x A. A - {x}" by (fact comp_fun_idem_remove)
748 from `finite A` show ?thesis by (induct A arbitrary: B) auto
751 context complete_lattice
754 lemma inf_Inf_fold_inf:
756 shows "inf B (Inf A) = fold inf B A"
758 interpret comp_fun_idem inf by (fact comp_fun_idem_inf)
759 from `finite A` show ?thesis by (induct A arbitrary: B)
760 (simp_all add: inf_commute fold_fun_comm)
763 lemma sup_Sup_fold_sup:
765 shows "sup B (Sup A) = fold sup B A"
767 interpret comp_fun_idem sup by (fact comp_fun_idem_sup)
768 from `finite A` show ?thesis by (induct A arbitrary: B)
769 (simp_all add: sup_commute fold_fun_comm)
774 shows "Inf A = fold inf top A"
775 using assms inf_Inf_fold_inf [of A top] by (simp add: inf_absorb2)
779 shows "Sup A = fold sup bot A"
780 using assms sup_Sup_fold_sup [of A bot] by (simp add: sup_absorb2)
782 lemma inf_INFI_fold_inf:
784 shows "inf B (INFI A f) = fold (inf \<circ> f) B A" (is "?inf = ?fold")
786 interpret comp_fun_idem inf by (fact comp_fun_idem_inf)
787 interpret comp_fun_idem "inf \<circ> f" by (fact comp_comp_fun_idem)
788 from `finite A` show "?fold = ?inf"
789 by (induct A arbitrary: B)
790 (simp_all add: INF_def inf_left_commute)
793 lemma sup_SUPR_fold_sup:
795 shows "sup B (SUPR A f) = fold (sup \<circ> f) B A" (is "?sup = ?fold")
797 interpret comp_fun_idem sup by (fact comp_fun_idem_sup)
798 interpret comp_fun_idem "sup \<circ> f" by (fact comp_comp_fun_idem)
799 from `finite A` show "?fold = ?sup"
800 by (induct A arbitrary: B)
801 (simp_all add: SUP_def sup_left_commute)
806 shows "INFI A f = fold (inf \<circ> f) top A"
807 using assms inf_INFI_fold_inf [of A top] by simp
811 shows "SUPR A f = fold (sup \<circ> f) bot A"
812 using assms sup_SUPR_fold_sup [of A bot] by simp
817 subsection {* The derived combinator @{text fold_image} *}
819 definition fold_image :: "('b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b"
820 where "fold_image f g = fold (\<lambda>x y. f (g x) y)"
822 lemma fold_image_empty[simp]: "fold_image f g z {} = z"
823 by (simp add:fold_image_def)
825 context ab_semigroup_mult
828 lemma fold_image_insert[simp]:
829 assumes "finite A" and "a \<notin> A"
830 shows "fold_image times g z (insert a A) = g a * (fold_image times g z A)"
832 interpret comp_fun_commute "%x y. (g x) * y" proof
833 qed (simp add: fun_eq_iff mult_ac)
834 show ?thesis using assms by (simp add: fold_image_def)
837 lemma fold_image_reindex:
839 shows "inj_on h A \<Longrightarrow> fold_image times g z (h ` A) = fold_image times (g \<circ> h) z A"
840 using assms by induct auto
842 lemma fold_image_cong:
843 assumes "finite A" and g_h: "\<And>x. x\<in>A \<Longrightarrow> g x = h x"
844 shows "fold_image times g z A = fold_image times h z A"
847 have "\<And>C. C <= A --> (ALL x:C. g x = h x) --> fold_image times g z C = fold_image times h z C"
848 proof (induct arbitrary: C)
849 case empty then show ?case by simp
851 case (insert x F) then show ?case apply -
852 apply (simp add: subset_insert_iff, clarify)
853 apply (subgoal_tac "finite C")
854 prefer 2 apply (blast dest: finite_subset [COMP swap_prems_rl])
855 apply (subgoal_tac "C = insert x (C - {x})")
858 apply (simp add: Ball_def del: insert_Diff_single)
861 with g_h show ?thesis by simp
866 context comm_monoid_mult
870 "finite S \<Longrightarrow> (\<forall>x\<in>S. f x = 1) \<Longrightarrow> fold_image op * f 1 S = 1"
871 apply (induct rule: finite_induct)
874 lemma fold_image_Un_Int:
875 "finite A ==> finite B ==>
876 fold_image times g 1 A * fold_image times g 1 B =
877 fold_image times g 1 (A Un B) * fold_image times g 1 (A Int B)"
878 apply (induct rule: finite_induct)
879 by (induct set: finite)
880 (auto simp add: mult_ac insert_absorb Int_insert_left)
882 lemma fold_image_Un_one:
883 assumes fS: "finite S" and fT: "finite T"
884 and I0: "\<forall>x \<in> S\<inter>T. f x = 1"
885 shows "fold_image (op *) f 1 (S \<union> T) = fold_image (op *) f 1 S * fold_image (op *) f 1 T"
887 have "fold_image op * f 1 (S \<inter> T) = 1"
888 apply (rule fold_image_1)
889 using fS fT I0 by auto
890 with fold_image_Un_Int[OF fS fT] show ?thesis by simp
893 corollary fold_Un_disjoint:
894 "finite A ==> finite B ==> A Int B = {} ==>
895 fold_image times g 1 (A Un B) =
896 fold_image times g 1 A * fold_image times g 1 B"
897 by (simp add: fold_image_Un_Int)
899 lemma fold_image_UN_disjoint:
900 "\<lbrakk> finite I; ALL i:I. finite (A i);
901 ALL i:I. ALL j:I. i \<noteq> j --> A i Int A j = {} \<rbrakk>
902 \<Longrightarrow> fold_image times g 1 (UNION I A) =
903 fold_image times (%i. fold_image times g 1 (A i)) 1 I"
904 apply (induct rule: finite_induct)
907 apply (subgoal_tac "ALL i:F. x \<noteq> i")
909 apply (subgoal_tac "A x Int UNION F A = {}")
911 apply (simp add: fold_Un_disjoint)
914 lemma fold_image_Sigma: "finite A ==> ALL x:A. finite (B x) ==>
915 fold_image times (%x. fold_image times (g x) 1 (B x)) 1 A =
916 fold_image times (split g) 1 (SIGMA x:A. B x)"
917 apply (subst Sigma_def)
918 apply (subst fold_image_UN_disjoint, assumption, simp)
920 apply (erule fold_image_cong)
921 apply (subst fold_image_UN_disjoint, simp, simp)
926 lemma fold_image_distrib: "finite A \<Longrightarrow>
927 fold_image times (%x. g x * h x) 1 A =
928 fold_image times g 1 A * fold_image times h 1 A"
929 by (erule finite_induct) (simp_all add: mult_ac)
931 lemma fold_image_related:
933 and Rop: "\<forall>x1 y1 x2 y2. R x1 x2 \<and> R y1 y2 \<longrightarrow> R (x1 * y1) (x2 * y2)"
934 and fS: "finite S" and Rfg: "\<forall>x\<in>S. R (h x) (g x)"
935 shows "R (fold_image (op *) h e S) (fold_image (op *) g e S)"
936 using fS by (rule finite_subset_induct) (insert assms, auto)
938 lemma fold_image_eq_general:
939 assumes fS: "finite S"
940 and h: "\<forall>y\<in>S'. \<exists>!x. x\<in> S \<and> h(x) = y"
941 and f12: "\<forall>x\<in>S. h x \<in> S' \<and> f2(h x) = f1 x"
942 shows "fold_image (op *) f1 e S = fold_image (op *) f2 e S'"
944 from h f12 have hS: "h ` S = S'" by auto
945 {fix x y assume H: "x \<in> S" "y \<in> S" "h x = h y"
946 from f12 h H have "x = y" by auto }
947 hence hinj: "inj_on h S" unfolding inj_on_def Ex1_def by blast
948 from f12 have th: "\<And>x. x \<in> S \<Longrightarrow> (f2 \<circ> h) x = f1 x" by auto
949 from hS have "fold_image (op *) f2 e S' = fold_image (op *) f2 e (h ` S)" by simp
950 also have "\<dots> = fold_image (op *) (f2 o h) e S"
951 using fold_image_reindex[OF fS hinj, of f2 e] .
952 also have "\<dots> = fold_image (op *) f1 e S " using th fold_image_cong[OF fS, of "f2 o h" f1 e]
954 finally show ?thesis ..
957 lemma fold_image_eq_general_inverses:
958 assumes fS: "finite S"
959 and kh: "\<And>y. y \<in> T \<Longrightarrow> k y \<in> S \<and> h (k y) = y"
960 and hk: "\<And>x. x \<in> S \<Longrightarrow> h x \<in> T \<and> k (h x) = x \<and> g (h x) = f x"
961 shows "fold_image (op *) f e S = fold_image (op *) g e T"
962 (* metis solves it, but not yet available here *)
963 apply (rule fold_image_eq_general[OF fS, of T h g f e])
969 apply (drule hk) apply simp
971 apply (erule conjunct1[OF conjunct2[OF hk]])
980 subsection {* A fold functional for non-empty sets *}
982 text{* Does not require start value. *}
985 fold1Set :: "('a => 'a => 'a) => 'a set => 'a => bool"
986 for f :: "'a => 'a => 'a"
988 fold1Set_insertI [intro]:
989 "\<lbrakk> fold_graph f a A x; a \<notin> A \<rbrakk> \<Longrightarrow> fold1Set f (insert a A) x"
991 definition fold1 :: "('a => 'a => 'a) => 'a set => 'a" where
992 "fold1 f A == THE x. fold1Set f A x"
994 lemma fold1Set_nonempty:
995 "fold1Set f A x \<Longrightarrow> A \<noteq> {}"
996 by(erule fold1Set.cases, simp_all)
998 inductive_cases empty_fold1SetE [elim!]: "fold1Set f {} x"
1000 inductive_cases insert_fold1SetE [elim!]: "fold1Set f (insert a X) x"
1003 lemma fold1Set_sing [iff]: "(fold1Set f {a} b) = (a = b)"
1004 by (blast elim: fold_graph.cases)
1006 lemma fold1_singleton [simp]: "fold1 f {a} = a"
1007 by (unfold fold1_def) blast
1009 lemma finite_nonempty_imp_fold1Set:
1010 "\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> EX x. fold1Set f A x"
1011 apply (induct A rule: finite_induct)
1012 apply (auto dest: finite_imp_fold_graph [of _ f])
1015 text{*First, some lemmas about @{const fold_graph}.*}
1017 context ab_semigroup_mult
1020 lemma comp_fun_commute: "comp_fun_commute (op *)" proof
1021 qed (simp add: fun_eq_iff mult_ac)
1023 lemma fold_graph_insert_swap:
1024 assumes fold: "fold_graph times (b::'a) A y" and "b \<notin> A"
1025 shows "fold_graph times z (insert b A) (z * y)"
1027 interpret comp_fun_commute "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule comp_fun_commute)
1028 from assms show ?thesis
1029 proof (induct rule: fold_graph.induct)
1030 case emptyI show ?case by (subst mult_commute [of z b], fast)
1032 case (insertI x A y)
1033 have "fold_graph times z (insert x (insert b A)) (x * (z * y))"
1034 using insertI by force --{*how does @{term id} get unfolded?*}
1035 thus ?case by (simp add: insert_commute mult_ac)
1039 lemma fold_graph_permute_diff:
1040 assumes fold: "fold_graph times b A x"
1041 shows "!!a. \<lbrakk>a \<in> A; b \<notin> A\<rbrakk> \<Longrightarrow> fold_graph times a (insert b (A-{a})) x"
1043 proof (induct rule: fold_graph.induct)
1044 case emptyI thus ?case by simp
1046 case (insertI x A y)
1047 have "a = x \<or> a \<in> A" using insertI by simp
1051 with insertI show ?thesis
1052 by (simp add: id_def [symmetric], blast intro: fold_graph_insert_swap)
1054 assume ainA: "a \<in> A"
1055 hence "fold_graph times a (insert x (insert b (A - {a}))) (x * y)"
1056 using insertI by force
1058 have "insert x (insert b (A - {a})) = insert b (insert x A - {a})"
1059 using ainA insertI by blast
1060 ultimately show ?thesis by simp
1064 lemma fold1_eq_fold:
1065 assumes "finite A" "a \<notin> A" shows "fold1 times (insert a A) = fold times a A"
1067 interpret comp_fun_commute "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule comp_fun_commute)
1068 from assms show ?thesis
1069 apply (simp add: fold1_def fold_def)
1070 apply (rule the_equality)
1071 apply (best intro: fold_graph_determ theI dest: finite_imp_fold_graph [of _ times])
1072 apply (rule sym, clarify)
1073 apply (case_tac "Aa=A")
1074 apply (best intro: fold_graph_determ)
1075 apply (subgoal_tac "fold_graph times a A x")
1076 apply (best intro: fold_graph_determ)
1077 apply (subgoal_tac "insert aa (Aa - {a}) = A")
1078 prefer 2 apply (blast elim: equalityE)
1079 apply (auto dest: fold_graph_permute_diff [where a=a])
1083 lemma nonempty_iff: "(A \<noteq> {}) = (\<exists>x B. A = insert x B & x \<notin> B)"
1086 apply (drule_tac x=x in spec)
1087 apply (drule_tac x="A-{x}" in spec, auto)
1091 assumes nonempty: "A \<noteq> {}" and A: "finite A" "x \<notin> A"
1092 shows "fold1 times (insert x A) = x * fold1 times A"
1094 interpret comp_fun_commute "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule comp_fun_commute)
1095 from nonempty obtain a A' where "A = insert a A' & a ~: A'"
1096 by (auto simp add: nonempty_iff)
1098 by (simp add: insert_commute [of x] fold1_eq_fold eq_commute)
1103 context ab_semigroup_idem_mult
1106 lemma comp_fun_idem: "comp_fun_idem (op *)" proof
1107 qed (simp_all add: fun_eq_iff mult_left_commute)
1109 lemma fold1_insert_idem [simp]:
1110 assumes nonempty: "A \<noteq> {}" and A: "finite A"
1111 shows "fold1 times (insert x A) = x * fold1 times A"
1113 interpret comp_fun_idem "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a"
1114 by (rule comp_fun_idem)
1115 from nonempty obtain a A' where A': "A = insert a A' & a ~: A'"
1116 by (auto simp add: nonempty_iff)
1123 with A' a show ?thesis by simp
1125 assume "A' \<noteq> {}"
1126 with A A' a show ?thesis
1127 by (simp add: fold1_insert mult_assoc [symmetric])
1130 assume "a \<noteq> x"
1131 with A A' show ?thesis
1132 by (simp add: insert_commute fold1_eq_fold)
1136 lemma hom_fold1_commute:
1137 assumes hom: "!!x y. h (x * y) = h x * h y"
1138 and N: "finite N" "N \<noteq> {}" shows "h (fold1 times N) = fold1 times (h ` N)"
1139 using N proof (induct rule: finite_ne_induct)
1140 case singleton thus ?case by simp
1143 then have "h (fold1 times (insert n N)) = h (n * fold1 times N)" by simp
1144 also have "\<dots> = h n * h (fold1 times N)" by(rule hom)
1145 also have "h (fold1 times N) = fold1 times (h ` N)" by(rule insert)
1146 also have "times (h n) \<dots> = fold1 times (insert (h n) (h ` N))"
1147 using insert by(simp)
1148 also have "insert (h n) (h ` N) = h ` insert n N" by simp
1149 finally show ?case .
1152 lemma fold1_eq_fold_idem:
1154 shows "fold1 times (insert a A) = fold times a A"
1155 proof (cases "a \<in> A")
1157 with assms show ?thesis by (simp add: fold1_eq_fold)
1159 interpret comp_fun_idem times by (fact comp_fun_idem)
1160 case True then obtain b B
1161 where A: "A = insert a B" and "a \<notin> B" by (rule set_insert)
1162 with assms have "finite B" by auto
1163 then have "fold times a (insert a B) = fold times (a * a) B"
1164 using `a \<notin> B` by (rule fold_insert2)
1166 using `a \<notin> B` `finite B` by (simp add: fold1_eq_fold A)
1172 text{* Now the recursion rules for definitions: *}
1174 lemma fold1_singleton_def: "g = fold1 f \<Longrightarrow> g {a} = a"
1177 lemma (in ab_semigroup_mult) fold1_insert_def:
1178 "\<lbrakk> g = fold1 times; finite A; x \<notin> A; A \<noteq> {} \<rbrakk> \<Longrightarrow> g (insert x A) = x * g A"
1179 by (simp add:fold1_insert)
1181 lemma (in ab_semigroup_idem_mult) fold1_insert_idem_def:
1182 "\<lbrakk> g = fold1 times; finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> g (insert x A) = x * g A"
1185 subsubsection{* Determinacy for @{term fold1Set} *}
1187 (*Not actually used!!*)
1189 context ab_semigroup_mult
1192 lemma fold_graph_permute:
1193 "[|fold_graph times id b (insert a A) x; a \<notin> A; b \<notin> A|]
1194 ==> fold_graph times id a (insert b A) x"
1196 apply (auto dest: fold_graph_permute_diff)
1199 lemma fold1Set_determ:
1200 "fold1Set times A x ==> fold1Set times A y ==> y = x"
1201 proof (clarify elim!: fold1Set.cases)
1203 assume Ax: "fold_graph times id a A x"
1204 assume By: "fold_graph times id b B y"
1205 assume anotA: "a \<notin> A"
1206 assume bnotB: "b \<notin> B"
1207 assume eq: "insert a A = insert b B"
1211 hence "A=B" using anotA bnotB eq by (blast elim!: equalityE)
1212 thus ?thesis using Ax By same by (blast intro: fold_graph_determ)
1214 assume diff: "a\<noteq>b"
1216 have B: "B = insert a ?D" and A: "A = insert b ?D"
1217 and aB: "a \<in> B" and bA: "b \<in> A"
1218 using eq anotA bnotB diff by (blast elim!:equalityE)+
1220 have "fold_graph times id a (insert b ?D) y"
1221 by (auto intro: fold_graph_permute simp add: insert_absorb)
1223 have "fold_graph times id a (insert b ?D) x"
1224 by (simp add: A [symmetric] Ax)
1225 ultimately show ?thesis by (blast intro: fold_graph_determ)
1229 lemma fold1Set_equality: "fold1Set times A y ==> fold1 times A = y"
1230 by (unfold fold1_def) (blast intro: fold1Set_determ)
1236 empty_fold_graphE [rule del] fold_graph.intros [rule del]
1237 empty_fold1SetE [rule del] insert_fold1SetE [rule del]
1238 -- {* No more proofs involve these relations. *}
1240 subsubsection {* Lemmas about @{text fold1} *}
1242 context ab_semigroup_mult
1246 assumes A: "finite A" "A \<noteq> {}"
1247 shows "finite B \<Longrightarrow> B \<noteq> {} \<Longrightarrow> A Int B = {} \<Longrightarrow>
1248 fold1 times (A Un B) = fold1 times A * fold1 times B"
1249 using A by (induct rule: finite_ne_induct)
1250 (simp_all add: fold1_insert mult_assoc)
1253 assumes A: "finite (A)" "A \<noteq> {}" and elem: "\<And>x y. x * y \<in> {x,y}"
1254 shows "fold1 times A \<in> A"
1256 proof (induct rule:finite_ne_induct)
1257 case singleton thus ?case by simp
1259 case insert thus ?case using elem by (force simp add:fold1_insert)
1264 lemma (in ab_semigroup_idem_mult) fold1_Un2:
1265 assumes A: "finite A" "A \<noteq> {}"
1266 shows "finite B \<Longrightarrow> B \<noteq> {} \<Longrightarrow>
1267 fold1 times (A Un B) = fold1 times A * fold1 times B"
1269 proof(induct rule:finite_ne_induct)
1270 case singleton thus ?case by simp
1272 case insert thus ?case by (simp add: mult_assoc)
1276 subsection {* Locales as mini-packages for fold operations *}
1278 subsubsection {* The natural case *}
1281 fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b"
1282 fixes F :: "'a set \<Rightarrow> 'b \<Rightarrow> 'b"
1283 assumes comp_fun_commute: "f y \<circ> f x = f x \<circ> f y"
1284 assumes eq_fold: "finite A \<Longrightarrow> F A s = fold f s A"
1289 by (simp add: eq_fold fun_eq_iff)
1291 lemma insert [simp]:
1292 assumes "finite A" and "x \<notin> A"
1293 shows "F (insert x A) = F A \<circ> f x"
1295 interpret comp_fun_commute f proof
1296 qed (insert comp_fun_commute, simp add: fun_eq_iff)
1297 from fold_insert2 assms
1298 have "\<And>s. fold f s (insert x A) = fold f (f x s) A" .
1299 with `finite A` show ?thesis by (simp add: eq_fold fun_eq_iff)
1303 assumes "finite A" and "x \<in> A"
1304 shows "F A = F (A - {x}) \<circ> f x"
1306 from `x \<in> A` obtain B where A: "A = insert x B" and "x \<notin> B"
1307 by (auto dest: mk_disjoint_insert)
1308 moreover from `finite A` this have "finite B" by simp
1309 ultimately show ?thesis by simp
1312 lemma insert_remove:
1314 shows "F (insert x A) = F (A - {x}) \<circ> f x"
1315 using assms by (cases "x \<in> A") (simp_all add: remove insert_absorb)
1317 lemma commute_left_comp:
1318 "f y \<circ> (f x \<circ> g) = f x \<circ> (f y \<circ> g)"
1319 by (simp add: o_assoc comp_fun_commute)
1321 lemma comp_fun_commute':
1323 shows "f x \<circ> F A = F A \<circ> f x"
1324 using assms by (induct A)
1325 (simp, simp del: o_apply add: o_assoc, simp del: o_apply add: o_assoc [symmetric] comp_fun_commute)
1327 lemma commute_left_comp':
1329 shows "f x \<circ> (F A \<circ> g) = F A \<circ> (f x \<circ> g)"
1330 using assms by (simp add: o_assoc comp_fun_commute')
1332 lemma comp_fun_commute'':
1333 assumes "finite A" and "finite B"
1334 shows "F B \<circ> F A = F A \<circ> F B"
1335 using assms by (induct A)
1336 (simp_all add: o_assoc, simp add: o_assoc [symmetric] comp_fun_commute')
1338 lemma commute_left_comp'':
1339 assumes "finite A" and "finite B"
1340 shows "F B \<circ> (F A \<circ> g) = F A \<circ> (F B \<circ> g)"
1341 using assms by (simp add: o_assoc comp_fun_commute'')
1343 lemmas comp_fun_commutes = o_assoc [symmetric] comp_fun_commute commute_left_comp
1344 comp_fun_commute' commute_left_comp' comp_fun_commute'' commute_left_comp''
1347 assumes "finite A" and "finite B"
1348 shows "F (A \<union> B) \<circ> F (A \<inter> B) = F A \<circ> F B"
1349 using assms by (induct A)
1350 (simp_all del: o_apply add: insert_absorb Int_insert_left comp_fun_commutes,
1354 assumes "finite A" and "finite B"
1355 and "A \<inter> B = {}"
1356 shows "F (A \<union> B) = F A \<circ> F B"
1358 from union_inter `finite A` `finite B` have "F (A \<union> B) \<circ> F (A \<inter> B) = F A \<circ> F B" .
1359 with `A \<inter> B = {}` show ?thesis by simp
1365 subsubsection {* The natural case with idempotency *}
1367 locale folding_idem = folding +
1368 assumes idem_comp: "f x \<circ> f x = f x"
1371 lemma idem_left_comp:
1372 "f x \<circ> (f x \<circ> g) = f x \<circ> g"
1373 by (simp add: o_assoc idem_comp)
1376 assumes "finite A" and "x \<in> A"
1377 shows "F A \<circ> f x = F A"
1378 using assms by (induct A)
1379 (auto simp add: comp_fun_commutes idem_comp, simp add: commute_left_comp' [symmetric] comp_fun_commute')
1381 lemma subset_comp_idem:
1382 assumes "finite A" and "B \<subseteq> A"
1383 shows "F A \<circ> F B = F A"
1385 from assms have "finite B" by (blast dest: finite_subset)
1386 then show ?thesis using `B \<subseteq> A` by (induct B)
1387 (simp_all add: o_assoc in_comp_idem `finite A`)
1390 declare insert [simp del]
1392 lemma insert_idem [simp]:
1394 shows "F (insert x A) = F A \<circ> f x"
1395 using assms by (cases "x \<in> A") (simp_all add: insert in_comp_idem insert_absorb)
1398 assumes "finite A" and "finite B"
1399 shows "F (A \<union> B) = F A \<circ> F B"
1401 from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
1402 then have "F (A \<union> B) \<circ> F (A \<inter> B) = F (A \<union> B)" by (rule subset_comp_idem)
1403 with assms show ?thesis by (simp add: union_inter)
1409 subsubsection {* The image case with fixed function *}
1411 no_notation times (infixl "*" 70)
1412 no_notation Groups.one ("1")
1414 locale folding_image_simple = comm_monoid +
1415 fixes g :: "('b \<Rightarrow> 'a)"
1416 fixes F :: "'b set \<Rightarrow> 'a"
1417 assumes eq_fold_g: "finite A \<Longrightarrow> F A = fold_image f g 1 A"
1422 by (simp add: eq_fold_g)
1424 lemma insert [simp]:
1425 assumes "finite A" and "x \<notin> A"
1426 shows "F (insert x A) = g x * F A"
1428 interpret comp_fun_commute "%x y. (g x) * y" proof
1429 qed (simp add: ac_simps fun_eq_iff)
1430 with assms have "fold_image (op *) g 1 (insert x A) = g x * fold_image (op *) g 1 A"
1431 by (simp add: fold_image_def)
1432 with `finite A` show ?thesis by (simp add: eq_fold_g)
1436 assumes "finite A" and "x \<in> A"
1437 shows "F A = g x * F (A - {x})"
1439 from `x \<in> A` obtain B where A: "A = insert x B" and "x \<notin> B"
1440 by (auto dest: mk_disjoint_insert)
1441 moreover from `finite A` this have "finite B" by simp
1442 ultimately show ?thesis by simp
1445 lemma insert_remove:
1447 shows "F (insert x A) = g x * F (A - {x})"
1448 using assms by (cases "x \<in> A") (simp_all add: remove insert_absorb)
1451 assumes "finite A" and "\<forall>x\<in>A. g x = 1"
1453 using assms by (induct A) simp_all
1456 assumes "finite A" and "finite B"
1457 shows "F (A \<union> B) * F (A \<inter> B) = F A * F B"
1458 using assms proof (induct A)
1459 case empty then show ?case by simp
1461 case (insert x A) then show ?case
1462 by (auto simp add: insert_absorb Int_insert_left commute [of _ "g x"] assoc left_commute)
1465 corollary union_inter_neutral:
1466 assumes "finite A" and "finite B"
1467 and I0: "\<forall>x \<in> A\<inter>B. g x = 1"
1468 shows "F (A \<union> B) = F A * F B"
1469 using assms by (simp add: union_inter [symmetric] neutral)
1471 corollary union_disjoint:
1472 assumes "finite A" and "finite B"
1473 assumes "A \<inter> B = {}"
1474 shows "F (A \<union> B) = F A * F B"
1475 using assms by (simp add: union_inter_neutral)
1480 subsubsection {* The image case with flexible function *}
1482 locale folding_image = comm_monoid +
1483 fixes F :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b set \<Rightarrow> 'a"
1484 assumes eq_fold: "\<And>g. finite A \<Longrightarrow> F g A = fold_image f g 1 A"
1486 sublocale folding_image < folding_image_simple "op *" 1 g "F g" proof
1489 context folding_image
1492 lemma reindex: (* FIXME polymorhism *)
1493 assumes "finite A" and "inj_on h A"
1494 shows "F g (h ` A) = F (g \<circ> h) A"
1495 using assms by (induct A) auto
1498 assumes "finite A" and "\<And>x. x \<in> A \<Longrightarrow> g x = h x"
1499 shows "F g A = F h A"
1501 from assms have "ALL C. C <= A --> (ALL x:C. g x = h x) --> F g C = F h C"
1502 apply - apply (erule finite_induct) apply simp
1503 apply (simp add: subset_insert_iff, clarify)
1504 apply (subgoal_tac "finite C")
1505 prefer 2 apply (blast dest: finite_subset [COMP swap_prems_rl])
1506 apply (subgoal_tac "C = insert x (C - {x})")
1507 prefer 2 apply blast
1508 apply (erule ssubst)
1510 apply (erule (1) notE impE)
1511 apply (simp add: Ball_def del: insert_Diff_single)
1513 with assms show ?thesis by simp
1516 lemma UNION_disjoint:
1517 assumes "finite I" and "\<forall>i\<in>I. finite (A i)"
1518 and "\<forall>i\<in>I. \<forall>j\<in>I. i \<noteq> j \<longrightarrow> A i \<inter> A j = {}"
1519 shows "F g (UNION I A) = F (F g \<circ> A) I"
1520 apply (insert assms)
1521 apply (induct rule: finite_induct)
1524 apply (subgoal_tac "\<forall>i\<in>Fa. x \<noteq> i")
1525 prefer 2 apply blast
1526 apply (subgoal_tac "A x Int UNION Fa A = {}")
1527 prefer 2 apply blast
1528 apply (simp add: union_disjoint)
1533 shows "F (\<lambda>x. g x * h x) A = F g A * F h A"
1534 using assms by (rule finite_induct) (simp_all add: assoc commute left_commute)
1538 and Rop: "\<forall>x1 y1 x2 y2. R x1 x2 \<and> R y1 y2 \<longrightarrow> R (x1 * y1) (x2 * y2)"
1539 and fS: "finite S" and Rfg: "\<forall>x\<in>S. R (h x) (g x)"
1540 shows "R (F h S) (F g S)"
1541 using fS by (rule finite_subset_induct) (insert assms, auto)
1544 assumes fS: "finite S"
1545 and h: "\<forall>y\<in>S'. \<exists>!x. x \<in> S \<and> h x = y"
1546 and f12: "\<forall>x\<in>S. h x \<in> S' \<and> f2 (h x) = f1 x"
1547 shows "F f1 S = F f2 S'"
1549 from h f12 have hS: "h ` S = S'" by blast
1550 {fix x y assume H: "x \<in> S" "y \<in> S" "h x = h y"
1551 from f12 h H have "x = y" by auto }
1552 hence hinj: "inj_on h S" unfolding inj_on_def Ex1_def by blast
1553 from f12 have th: "\<And>x. x \<in> S \<Longrightarrow> (f2 \<circ> h) x = f1 x" by auto
1554 from hS have "F f2 S' = F f2 (h ` S)" by simp
1555 also have "\<dots> = F (f2 o h) S" using reindex [OF fS hinj, of f2] .
1556 also have "\<dots> = F f1 S " using th cong [OF fS, of "f2 o h" f1]
1558 finally show ?thesis ..
1561 lemma eq_general_inverses:
1562 assumes fS: "finite S"
1563 and kh: "\<And>y. y \<in> T \<Longrightarrow> k y \<in> S \<and> h (k y) = y"
1564 and hk: "\<And>x. x \<in> S \<Longrightarrow> h x \<in> T \<and> k (h x) = x \<and> g (h x) = j x"
1565 shows "F j S = F g T"
1566 (* metis solves it, but not yet available here *)
1567 apply (rule eq_general [OF fS, of T h g j])
1573 apply (drule hk) apply simp
1575 apply (erule conjunct1[OF conjunct2[OF hk]])
1584 subsubsection {* The image case with fixed function and idempotency *}
1586 locale folding_image_simple_idem = folding_image_simple +
1587 assumes idem: "x * x = x"
1589 sublocale folding_image_simple_idem < semilattice proof
1592 context folding_image_simple_idem
1596 assumes "finite A" and "x \<in> A"
1597 shows "g x * F A = F A"
1598 using assms by (induct A) (auto simp add: left_commute)
1601 assumes "finite A" and "B \<subseteq> A"
1602 shows "F B * F A = F A"
1604 from assms have "finite B" by (blast dest: finite_subset)
1605 then show ?thesis using `B \<subseteq> A` by (induct B)
1606 (auto simp add: assoc in_idem `finite A`)
1609 declare insert [simp del]
1611 lemma insert_idem [simp]:
1613 shows "F (insert x A) = g x * F A"
1614 using assms by (cases "x \<in> A") (simp_all add: insert in_idem insert_absorb)
1617 assumes "finite A" and "finite B"
1618 shows "F (A \<union> B) = F A * F B"
1620 from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
1621 then have "F (A \<inter> B) * F (A \<union> B) = F (A \<union> B)" by (rule subset_idem)
1622 with assms show ?thesis by (simp add: union_inter [of A B, symmetric] commute)
1628 subsubsection {* The image case with flexible function and idempotency *}
1630 locale folding_image_idem = folding_image +
1631 assumes idem: "x * x = x"
1633 sublocale folding_image_idem < folding_image_simple_idem "op *" 1 g "F g" proof
1637 subsubsection {* The neutral-less case *}
1639 locale folding_one = abel_semigroup +
1640 fixes F :: "'a set \<Rightarrow> 'a"
1641 assumes eq_fold: "finite A \<Longrightarrow> F A = fold1 f A"
1644 lemma singleton [simp]:
1646 by (simp add: eq_fold)
1649 assumes "finite A" and "x \<notin> A"
1650 shows "F (insert x A) = fold (op *) x A"
1652 interpret ab_semigroup_mult "op *" proof qed (simp_all add: ac_simps)
1653 with assms show ?thesis by (simp add: eq_fold fold1_eq_fold)
1656 lemma insert [simp]:
1657 assumes "finite A" and "x \<notin> A" and "A \<noteq> {}"
1658 shows "F (insert x A) = x * F A"
1660 from `A \<noteq> {}` obtain b where "b \<in> A" by blast
1661 then obtain B where *: "A = insert b B" "b \<notin> B" by (blast dest: mk_disjoint_insert)
1662 with `finite A` have "finite B" by simp
1663 interpret fold: folding "op *" "\<lambda>a b. fold (op *) b a" proof
1664 qed (simp_all add: fun_eq_iff ac_simps)
1665 thm fold.comp_fun_commute' [of B b, simplified fun_eq_iff, simplified]
1666 from `finite B` fold.comp_fun_commute' [of B x]
1667 have "op * x \<circ> (\<lambda>b. fold op * b B) = (\<lambda>b. fold op * b B) \<circ> op * x" by simp
1668 then have A: "x * fold op * b B = fold op * (b * x) B" by (simp add: fun_eq_iff commute)
1669 from `finite B` * fold.insert [of B b]
1670 have "(\<lambda>x. fold op * x (insert b B)) = (\<lambda>x. fold op * x B) \<circ> op * b" by simp
1671 then have B: "fold op * x (insert b B) = fold op * (b * x) B" by (simp add: fun_eq_iff)
1672 from A B assms * show ?thesis by (simp add: eq_fold' del: fold.insert)
1676 assumes "finite A" and "x \<in> A"
1677 shows "F A = (if A - {x} = {} then x else x * F (A - {x}))"
1679 from assms obtain B where "A = insert x B" and "x \<notin> B" by (blast dest: mk_disjoint_insert)
1680 with assms show ?thesis by simp
1683 lemma insert_remove:
1685 shows "F (insert x A) = (if A - {x} = {} then x else x * F (A - {x}))"
1686 using assms by (cases "x \<in> A") (simp_all add: insert_absorb remove)
1688 lemma union_disjoint:
1689 assumes "finite A" "A \<noteq> {}" and "finite B" "B \<noteq> {}" and "A \<inter> B = {}"
1690 shows "F (A \<union> B) = F A * F B"
1691 using assms by (induct A rule: finite_ne_induct) (simp_all add: ac_simps)
1694 assumes "finite A" and "finite B" and "A \<inter> B \<noteq> {}"
1695 shows "F (A \<union> B) * F (A \<inter> B) = F A * F B"
1697 from assms have "A \<noteq> {}" and "B \<noteq> {}" by auto
1698 from `finite A` `A \<noteq> {}` `A \<inter> B \<noteq> {}` show ?thesis proof (induct A rule: finite_ne_induct)
1699 case (singleton x) then show ?case by (simp add: insert_absorb ac_simps)
1701 case (insert x A) show ?case proof (cases "x \<in> B")
1702 case True then have "B \<noteq> {}" by auto
1703 with insert True `finite B` show ?thesis by (cases "A \<inter> B = {}")
1704 (simp_all add: insert_absorb ac_simps union_disjoint)
1706 case False with insert have "F (A \<union> B) * F (A \<inter> B) = F A * F B" by simp
1707 moreover from False `finite B` insert have "finite (A \<union> B)" "x \<notin> A \<union> B" "A \<union> B \<noteq> {}"
1709 ultimately show ?thesis using False `finite A` `x \<notin> A` `A \<noteq> {}` by (simp add: assoc)
1715 assumes "finite A" "A \<noteq> {}" and elem: "\<And>x y. x * y \<in> {x, y}"
1717 using `finite A` `A \<noteq> {}` proof (induct rule: finite_ne_induct)
1718 case singleton then show ?case by simp
1720 case insert with elem show ?case by force
1726 subsubsection {* The neutral-less case with idempotency *}
1728 locale folding_one_idem = folding_one +
1729 assumes idem: "x * x = x"
1731 sublocale folding_one_idem < semilattice proof
1734 context folding_one_idem
1738 assumes "finite A" and "x \<in> A"
1739 shows "x * F A = F A"
1741 from assms have "A \<noteq> {}" by auto
1742 with `finite A` show ?thesis using `x \<in> A` by (induct A rule: finite_ne_induct) (auto simp add: ac_simps)
1746 assumes "finite A" "B \<noteq> {}" and "B \<subseteq> A"
1747 shows "F B * F A = F A"
1749 from assms have "finite B" by (blast dest: finite_subset)
1750 then show ?thesis using `B \<noteq> {}` `B \<subseteq> A` by (induct B rule: finite_ne_induct)
1751 (simp_all add: assoc in_idem `finite A`)
1754 lemma eq_fold_idem':
1756 shows "F (insert a A) = fold (op *) a A"
1758 interpret ab_semigroup_idem_mult "op *" proof qed (simp_all add: ac_simps)
1759 with assms show ?thesis by (simp add: eq_fold fold1_eq_fold_idem)
1762 lemma insert_idem [simp]:
1763 assumes "finite A" and "A \<noteq> {}"
1764 shows "F (insert x A) = x * F A"
1765 proof (cases "x \<in> A")
1766 case False from `finite A` `x \<notin> A` `A \<noteq> {}` show ?thesis by (rule insert)
1769 from `finite A` `A \<noteq> {}` show ?thesis by (simp add: in_idem insert_absorb True)
1773 assumes "finite A" "A \<noteq> {}" and "finite B" "B \<noteq> {}"
1774 shows "F (A \<union> B) = F A * F B"
1775 proof (cases "A \<inter> B = {}")
1776 case True with assms show ?thesis by (simp add: union_disjoint)
1779 from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
1780 with False have "F (A \<inter> B) * F (A \<union> B) = F (A \<union> B)" by (auto intro: subset_idem)
1781 with assms False show ?thesis by (simp add: union_inter [of A B, symmetric] commute)
1785 assumes hom: "\<And>x y. h (x * y) = h x * h y"
1786 and N: "finite N" "N \<noteq> {}" shows "h (F N) = F (h ` N)"
1787 using N proof (induct rule: finite_ne_induct)
1788 case singleton thus ?case by simp
1791 then have "h (F (insert n N)) = h (n * F N)" by simp
1792 also have "\<dots> = h n * h (F N)" by (rule hom)
1793 also have "h (F N) = F (h ` N)" by(rule insert)
1794 also have "h n * \<dots> = F (insert (h n) (h ` N))"
1795 using insert by(simp)
1796 also have "insert (h n) (h ` N) = h ` insert n N" by simp
1797 finally show ?case .
1802 notation times (infixl "*" 70)
1803 notation Groups.one ("1")
1806 subsection {* Finite cardinality *}
1808 text {* This definition, although traditional, is ugly to work with:
1809 @{text "card A == LEAST n. EX f. A = {f i | i. i < n}"}.
1810 But now that we have @{text fold_image} things are easy:
1813 definition card :: "'a set \<Rightarrow> nat" where
1814 "card A = (if finite A then fold_image (op +) (\<lambda>x. 1) 0 A else 0)"
1816 interpretation card: folding_image_simple "op +" 0 "\<lambda>x. 1" card proof
1817 qed (simp add: card_def)
1819 lemma card_infinite [simp]:
1820 "\<not> finite A \<Longrightarrow> card A = 0"
1821 by (simp add: card_def)
1825 by (fact card.empty)
1827 lemma card_insert_disjoint:
1828 "finite A ==> x \<notin> A ==> card (insert x A) = Suc (card A)"
1831 lemma card_insert_if:
1832 "finite A ==> card (insert x A) = (if x \<in> A then card A else Suc (card A))"
1833 by auto (simp add: card.insert_remove card.remove)
1835 lemma card_ge_0_finite:
1836 "card A > 0 \<Longrightarrow> finite A"
1837 by (rule ccontr) simp
1839 lemma card_0_eq [simp, no_atp]:
1840 "finite A \<Longrightarrow> card A = 0 \<longleftrightarrow> A = {}"
1841 by (auto dest: mk_disjoint_insert)
1843 lemma finite_UNIV_card_ge_0:
1844 "finite (UNIV :: 'a set) \<Longrightarrow> card (UNIV :: 'a set) > 0"
1845 by (rule ccontr) simp
1847 lemma card_eq_0_iff:
1848 "card A = 0 \<longleftrightarrow> A = {} \<or> \<not> finite A"
1851 lemma card_gt_0_iff:
1852 "0 < card A \<longleftrightarrow> A \<noteq> {} \<and> finite A"
1853 by (simp add: neq0_conv [symmetric] card_eq_0_iff)
1855 lemma card_Suc_Diff1: "finite A ==> x: A ==> Suc (card (A - {x})) = card A"
1856 apply(rule_tac t = A in insert_Diff [THEN subst], assumption)
1857 apply(simp del:insert_Diff_single)
1860 lemma card_Diff_singleton:
1861 "finite A ==> x: A ==> card (A - {x}) = card A - 1"
1862 by (simp add: card_Suc_Diff1 [symmetric])
1864 lemma card_Diff_singleton_if:
1865 "finite A ==> card (A - {x}) = (if x : A then card A - 1 else card A)"
1866 by (simp add: card_Diff_singleton)
1868 lemma card_Diff_insert[simp]:
1869 assumes "finite A" and "a:A" and "a ~: B"
1870 shows "card(A - insert a B) = card(A - B) - 1"
1872 have "A - insert a B = (A - B) - {a}" using assms by blast
1873 then show ?thesis using assms by(simp add:card_Diff_singleton)
1876 lemma card_insert: "finite A ==> card (insert x A) = Suc (card (A - {x}))"
1877 by (simp add: card_insert_if card_Suc_Diff1 del:card_Diff_insert)
1879 lemma card_insert_le: "finite A ==> card A <= card (insert x A)"
1880 by (simp add: card_insert_if)
1882 lemma card_Collect_less_nat[simp]: "card{i::nat. i < n} = n"
1883 by (induct n) (simp_all add:less_Suc_eq Collect_disj_eq)
1885 lemma card_Collect_le_nat[simp]: "card{i::nat. i <= n} = Suc n"
1886 using card_Collect_less_nat[of "Suc n"] by(simp add: less_Suc_eq_le)
1889 assumes "finite B" and "A \<subseteq> B"
1890 shows "card A \<le> card B"
1892 from assms have "finite A" by (auto intro: finite_subset)
1893 then show ?thesis using assms proof (induct A arbitrary: B)
1894 case empty then show ?case by simp
1897 then have "x \<in> B" by simp
1898 from insert have "A \<subseteq> B - {x}" and "finite (B - {x})" by auto
1899 with insert.hyps have "card A \<le> card (B - {x})" by auto
1900 with `finite A` `x \<notin> A` `finite B` `x \<in> B` show ?case by simp (simp only: card.remove)
1904 lemma card_seteq: "finite B ==> (!!A. A <= B ==> card B <= card A ==> A = B)"
1905 apply (induct rule: finite_induct)
1908 apply (subgoal_tac "finite A & A - {x} <= F")
1909 prefer 2 apply (blast intro: finite_subset, atomize)
1910 apply (drule_tac x = "A - {x}" in spec)
1911 apply (simp add: card_Diff_singleton_if split add: split_if_asm)
1912 apply (case_tac "card A", auto)
1915 lemma psubset_card_mono: "finite B ==> A < B ==> card A < card B"
1916 apply (simp add: psubset_eq linorder_not_le [symmetric])
1917 apply (blast dest: card_seteq)
1920 lemma card_Un_Int: "finite A ==> finite B
1921 ==> card A + card B = card (A Un B) + card (A Int B)"
1922 by (fact card.union_inter [symmetric])
1924 lemma card_Un_disjoint: "finite A ==> finite B
1925 ==> A Int B = {} ==> card (A Un B) = card A + card B"
1926 by (fact card.union_disjoint)
1928 lemma card_Diff_subset:
1929 assumes "finite B" and "B \<subseteq> A"
1930 shows "card (A - B) = card A - card B"
1931 proof (cases "finite A")
1932 case False with assms show ?thesis by simp
1934 case True with assms show ?thesis by (induct B arbitrary: A) simp_all
1937 lemma card_Diff_subset_Int:
1938 assumes AB: "finite (A \<inter> B)" shows "card (A - B) = card A - card (A \<inter> B)"
1940 have "A - B = A - A \<inter> B" by auto
1942 by (simp add: card_Diff_subset AB)
1945 lemma diff_card_le_card_Diff:
1946 assumes "finite B" shows "card A - card B \<le> card(A - B)"
1948 have "card A - card B \<le> card A - card (A \<inter> B)"
1949 using card_mono[OF assms Int_lower2, of A] by arith
1950 also have "\<dots> = card(A-B)" using assms by(simp add: card_Diff_subset_Int)
1951 finally show ?thesis .
1954 lemma card_Diff1_less: "finite A ==> x: A ==> card (A - {x}) < card A"
1955 apply (rule Suc_less_SucD)
1956 apply (simp add: card_Suc_Diff1 del:card_Diff_insert)
1959 lemma card_Diff2_less:
1960 "finite A ==> x: A ==> y: A ==> card (A - {x} - {y}) < card A"
1961 apply (case_tac "x = y")
1962 apply (simp add: card_Diff1_less del:card_Diff_insert)
1963 apply (rule less_trans)
1964 prefer 2 apply (auto intro!: card_Diff1_less simp del:card_Diff_insert)
1967 lemma card_Diff1_le: "finite A ==> card (A - {x}) <= card A"
1968 apply (case_tac "x : A")
1969 apply (simp_all add: card_Diff1_less less_imp_le)
1972 lemma card_psubset: "finite B ==> A \<subseteq> B ==> card A < card B ==> A < B"
1973 by (erule psubsetI, blast)
1975 lemma insert_partition:
1976 "\<lbrakk> x \<notin> F; \<forall>c1 \<in> insert x F. \<forall>c2 \<in> insert x F. c1 \<noteq> c2 \<longrightarrow> c1 \<inter> c2 = {} \<rbrakk>
1977 \<Longrightarrow> x \<inter> \<Union> F = {}"
1980 lemma finite_psubset_induct[consumes 1, case_names psubset]:
1981 assumes fin: "finite A"
1982 and major: "\<And>A. finite A \<Longrightarrow> (\<And>B. B \<subset> A \<Longrightarrow> P B) \<Longrightarrow> P A"
1985 proof (induct A taking: card rule: measure_induct_rule)
1987 have fin: "finite A" by fact
1988 have ih: "\<And>B. \<lbrakk>card B < card A; finite B\<rbrakk> \<Longrightarrow> P B" by fact
1990 assume asm: "B \<subset> A"
1991 from asm have "card B < card A" using psubset_card_mono fin by blast
1993 from asm have "B \<subseteq> A" by auto
1994 then have "finite B" using fin finite_subset by blast
1996 have "P B" using ih by simp
1998 with fin show "P A" using major by blast
2001 text{* main cardinality theorem *}
2002 lemma card_partition [rule_format]:
2004 finite (\<Union> C) -->
2005 (\<forall>c\<in>C. card c = k) -->
2006 (\<forall>c1 \<in> C. \<forall>c2 \<in> C. c1 \<noteq> c2 --> c1 \<inter> c2 = {}) -->
2007 k * card(C) = card (\<Union> C)"
2008 apply (erule finite_induct, simp)
2009 apply (simp add: card_Un_disjoint insert_partition
2010 finite_subset [of _ "\<Union> (insert x F)"])
2013 lemma card_eq_UNIV_imp_eq_UNIV:
2014 assumes fin: "finite (UNIV :: 'a set)"
2015 and card: "card A = card (UNIV :: 'a set)"
2016 shows "A = (UNIV :: 'a set)"
2018 show "A \<subseteq> UNIV" by simp
2019 show "UNIV \<subseteq> A"
2024 assume "x \<notin> A"
2025 then have "A \<subset> UNIV" by auto
2026 with fin have "card A < card (UNIV :: 'a set)" by (fact psubset_card_mono)
2027 with card show False by simp
2032 text{*The form of a finite set of given cardinality*}
2035 assumes "card A = Suc k"
2036 shows "\<exists>b B. A = insert b B & b \<notin> B & card B = k & (k=0 \<longrightarrow> B={})"
2038 have fin: "finite A" using assms by (auto intro: ccontr)
2039 moreover have "card A \<noteq> 0" using assms by auto
2040 ultimately obtain b where b: "b \<in> A" by auto
2042 proof (intro exI conjI)
2043 show "A = insert b (A-{b})" using b by blast
2044 show "b \<notin> A - {b}" by blast
2045 show "card (A - {b}) = k" and "k = 0 \<longrightarrow> A - {b} = {}"
2046 using assms b fin by(fastforce dest:mk_disjoint_insert)+
2052 (\<exists>b B. A = insert b B & b \<notin> B & card B = k & (k=0 \<longrightarrow> B={}))"
2054 apply(erule card_eq_SucD)
2056 apply(subst card_insert)
2057 apply(auto intro:ccontr)
2060 lemma card_le_Suc_iff: "finite A \<Longrightarrow>
2061 Suc n \<le> card A = (\<exists>a B. A = insert a B \<and> a \<notin> B \<and> n \<le> card B \<and> finite B)"
2062 by (fastforce simp: card_Suc_eq less_eq_nat.simps(2) insert_eq_iff
2063 dest: subset_singletonD split: nat.splits if_splits)
2065 lemma finite_fun_UNIVD2:
2066 assumes fin: "finite (UNIV :: ('a \<Rightarrow> 'b) set)"
2067 shows "finite (UNIV :: 'b set)"
2069 from fin have "finite (range (\<lambda>f :: 'a \<Rightarrow> 'b. f arbitrary))"
2070 by(rule finite_imageI)
2071 moreover have "UNIV = range (\<lambda>f :: 'a \<Rightarrow> 'b. f arbitrary)"
2072 by(rule UNIV_eq_I) auto
2073 ultimately show "finite (UNIV :: 'b set)" by simp
2076 lemma card_UNIV_unit: "card (UNIV :: unit set) = 1"
2077 unfolding UNIV_unit by simp
2080 subsubsection {* Cardinality of image *}
2082 lemma card_image_le: "finite A ==> card (f ` A) <= card A"
2083 apply (induct rule: finite_induct)
2085 apply (simp add: le_SucI card_insert_if)
2089 assumes "inj_on f A"
2090 shows "card (f ` A) = card A"
2091 proof (cases "finite A")
2092 case True then show ?thesis using assms by (induct A) simp_all
2094 case False then have "\<not> finite (f ` A)" using assms by (auto dest: finite_imageD)
2095 with False show ?thesis by simp
2098 lemma bij_betw_same_card: "bij_betw f A B \<Longrightarrow> card A = card B"
2099 by(auto simp: card_image bij_betw_def)
2101 lemma endo_inj_surj: "finite A ==> f ` A \<subseteq> A ==> inj_on f A ==> f ` A = A"
2102 by (simp add: card_seteq card_image)
2104 lemma eq_card_imp_inj_on:
2105 "[| finite A; card(f ` A) = card A |] ==> inj_on f A"
2106 apply (induct rule:finite_induct)
2108 apply(frule card_image_le[where f = f])
2109 apply(simp add:card_insert_if split:if_splits)
2112 lemma inj_on_iff_eq_card:
2113 "finite A ==> inj_on f A = (card(f ` A) = card A)"
2114 by(blast intro: card_image eq_card_imp_inj_on)
2117 lemma card_inj_on_le:
2118 "[|inj_on f A; f ` A \<subseteq> B; finite B |] ==> card A \<le> card B"
2119 apply (subgoal_tac "finite A")
2120 apply (force intro: card_mono simp add: card_image [symmetric])
2121 apply (blast intro: finite_imageD dest: finite_subset)
2125 "[|inj_on f A; f ` A \<subseteq> B; inj_on g B; g ` B \<subseteq> A;
2126 finite A; finite B |] ==> card A = card B"
2127 by (auto intro: le_antisym card_inj_on_le)
2129 lemma bij_betw_finite:
2130 assumes "bij_betw f A B"
2131 shows "finite A \<longleftrightarrow> finite B"
2132 using assms unfolding bij_betw_def
2133 using finite_imageD[of f A] by auto
2136 subsubsection {* Pigeonhole Principles *}
2138 lemma pigeonhole: "card A > card(f ` A) \<Longrightarrow> ~ inj_on f A "
2139 by (auto dest: card_image less_irrefl_nat)
2141 lemma pigeonhole_infinite:
2142 assumes "~ finite A" and "finite(f`A)"
2143 shows "EX a0:A. ~finite{a:A. f a = f a0}"
2145 have "finite(f`A) \<Longrightarrow> ~ finite A \<Longrightarrow> EX a0:A. ~finite{a:A. f a = f a0}"
2146 proof(induct "f`A" arbitrary: A rule: finite_induct)
2147 case empty thus ?case by simp
2152 assume "finite{a:A. f a = b}"
2153 hence "~ finite(A - {a:A. f a = b})" using `\<not> finite A` by simp
2154 also have "A - {a:A. f a = b} = {a:A. f a \<noteq> b}" by blast
2155 finally have "~ finite({a:A. f a \<noteq> b})" .
2156 from insert(3)[OF _ this]
2157 show ?thesis using insert(2,4) by simp (blast intro: rev_finite_subset)
2159 assume 1: "~finite{a:A. f a = b}"
2160 hence "{a \<in> A. f a = b} \<noteq> {}" by force
2161 thus ?thesis using 1 by blast
2164 from this[OF assms(2,1)] show ?thesis .
2167 lemma pigeonhole_infinite_rel:
2168 assumes "~finite A" and "finite B" and "ALL a:A. EX b:B. R a b"
2169 shows "EX b:B. ~finite{a:A. R a b}"
2171 let ?F = "%a. {b:B. R a b}"
2172 from finite_Pow_iff[THEN iffD2, OF `finite B`]
2173 have "finite(?F ` A)" by(blast intro: rev_finite_subset)
2174 from pigeonhole_infinite[where f = ?F, OF assms(1) this]
2175 obtain a0 where "a0\<in>A" and 1: "\<not> finite {a\<in>A. ?F a = ?F a0}" ..
2176 obtain b0 where "b0 : B" and "R a0 b0" using `a0:A` assms(3) by blast
2177 { assume "finite{a:A. R a b0}"
2178 then have "finite {a\<in>A. ?F a = ?F a0}"
2179 using `b0 : B` `R a0 b0` by(blast intro: rev_finite_subset)
2181 with 1 `b0 : B` show ?thesis by blast
2185 subsubsection {* Cardinality of sums *}
2188 assumes "finite A" and "finite B"
2189 shows "card (A <+> B) = card A + card B"
2191 have "Inl`A \<inter> Inr`B = {}" by fast
2192 with assms show ?thesis
2194 by (simp add: card_Un_disjoint card_image)
2197 lemma card_Plus_conv_if:
2198 "card (A <+> B) = (if finite A \<and> finite B then card A + card B else 0)"
2199 by (auto simp add: card_Plus)
2202 subsubsection {* Cardinality of the Powerset *}
2204 lemma card_Pow: "finite A ==> card (Pow A) = Suc (Suc 0) ^ card A" (* FIXME numeral 2 (!?) *)
2205 apply (induct rule: finite_induct)
2206 apply (simp_all add: Pow_insert)
2207 apply (subst card_Un_disjoint, blast)
2208 apply (blast, blast)
2209 apply (subgoal_tac "inj_on (insert x) (Pow F)")
2210 apply (simp add: card_image Pow_insert)
2211 apply (unfold inj_on_def)
2212 apply (blast elim!: equalityE)
2215 text {* Relates to equivalence classes. Based on a theorem of F. Kamm\"uller. *}
2217 lemma dvd_partition:
2218 "finite (Union C) ==>
2219 ALL c : C. k dvd card c ==>
2220 (ALL c1: C. ALL c2: C. c1 \<noteq> c2 --> c1 Int c2 = {}) ==>
2221 k dvd card (Union C)"
2222 apply (frule finite_UnionD)
2223 apply (rotate_tac -1)
2224 apply (induct rule: finite_induct)
2227 apply (subst card_Un_disjoint)
2228 apply (auto simp add: disjoint_eq_subset_Compl)
2232 subsubsection {* Relating injectivity and surjectivity *}
2234 lemma finite_surj_inj: "finite A \<Longrightarrow> A \<subseteq> f ` A \<Longrightarrow> inj_on f A"
2235 apply(rule eq_card_imp_inj_on, assumption)
2236 apply(frule finite_imageI)
2237 apply(drule (1) card_seteq)
2238 apply(erule card_image_le)
2242 lemma finite_UNIV_surj_inj: fixes f :: "'a \<Rightarrow> 'a"
2243 shows "finite(UNIV:: 'a set) \<Longrightarrow> surj f \<Longrightarrow> inj f"
2244 by (blast intro: finite_surj_inj subset_UNIV)
2246 lemma finite_UNIV_inj_surj: fixes f :: "'a \<Rightarrow> 'a"
2247 shows "finite(UNIV:: 'a set) \<Longrightarrow> inj f \<Longrightarrow> surj f"
2248 by(fastforce simp:surj_def dest!: endo_inj_surj)
2250 corollary infinite_UNIV_nat[iff]: "~finite(UNIV::nat set)"
2252 assume "finite(UNIV::nat set)"
2253 with finite_UNIV_inj_surj[of Suc]
2254 show False by simp (blast dest: Suc_neq_Zero surjD)
2257 (* Often leads to bogus ATP proofs because of reduced type information, hence no_atp *)
2258 lemma infinite_UNIV_char_0[no_atp]:
2259 "\<not> finite (UNIV::'a::semiring_char_0 set)"
2261 assume "finite (UNIV::'a set)"
2262 with subset_UNIV have "finite (range of_nat::'a set)"
2263 by (rule finite_subset)
2264 moreover have "inj (of_nat::nat \<Rightarrow> 'a)"
2265 by (simp add: inj_on_def)
2266 ultimately have "finite (UNIV::nat set)"
2267 by (rule finite_imageD)
2272 hide_const (open) Finite_Set.fold