wenzelm@12396
|
1 |
(* Title: HOL/Finite_Set.thy
|
wenzelm@12396
|
2 |
Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel
|
avigad@16775
|
3 |
with contributions by Jeremy Avigad
|
wenzelm@12396
|
4 |
*)
|
wenzelm@12396
|
5 |
|
wenzelm@12396
|
6 |
header {* Finite sets *}
|
wenzelm@12396
|
7 |
|
nipkow@15131
|
8 |
theory Finite_Set
|
haftmann@38626
|
9 |
imports Option Power
|
nipkow@15131
|
10 |
begin
|
wenzelm@12396
|
11 |
|
haftmann@35817
|
12 |
subsection {* Predicate for finite sets *}
|
wenzelm@12396
|
13 |
|
berghofe@23736
|
14 |
inductive finite :: "'a set => bool"
|
berghofe@22262
|
15 |
where
|
berghofe@22262
|
16 |
emptyI [simp, intro!]: "finite {}"
|
berghofe@22262
|
17 |
| insertI [simp, intro!]: "finite A ==> finite (insert a A)"
|
wenzelm@12396
|
18 |
|
nipkow@13737
|
19 |
lemma ex_new_if_finite: -- "does not depend on def of finite at all"
|
wenzelm@14661
|
20 |
assumes "\<not> finite (UNIV :: 'a set)" and "finite A"
|
wenzelm@14661
|
21 |
shows "\<exists>a::'a. a \<notin> A"
|
wenzelm@14661
|
22 |
proof -
|
haftmann@28823
|
23 |
from assms have "A \<noteq> UNIV" by blast
|
wenzelm@14661
|
24 |
thus ?thesis by blast
|
wenzelm@14661
|
25 |
qed
|
wenzelm@12396
|
26 |
|
berghofe@22262
|
27 |
lemma finite_induct [case_names empty insert, induct set: finite]:
|
wenzelm@12396
|
28 |
"finite F ==>
|
nipkow@15327
|
29 |
P {} ==> (!!x F. finite F ==> x \<notin> F ==> P F ==> P (insert x F)) ==> P F"
|
wenzelm@12396
|
30 |
-- {* Discharging @{text "x \<notin> F"} entails extra work. *}
|
wenzelm@12396
|
31 |
proof -
|
wenzelm@13421
|
32 |
assume "P {}" and
|
nipkow@15327
|
33 |
insert: "!!x F. finite F ==> x \<notin> F ==> P F ==> P (insert x F)"
|
wenzelm@12396
|
34 |
assume "finite F"
|
wenzelm@12396
|
35 |
thus "P F"
|
wenzelm@12396
|
36 |
proof induct
|
wenzelm@23389
|
37 |
show "P {}" by fact
|
nipkow@15327
|
38 |
fix x F assume F: "finite F" and P: "P F"
|
wenzelm@12396
|
39 |
show "P (insert x F)"
|
wenzelm@12396
|
40 |
proof cases
|
wenzelm@12396
|
41 |
assume "x \<in> F"
|
wenzelm@12396
|
42 |
hence "insert x F = F" by (rule insert_absorb)
|
wenzelm@12396
|
43 |
with P show ?thesis by (simp only:)
|
wenzelm@12396
|
44 |
next
|
wenzelm@12396
|
45 |
assume "x \<notin> F"
|
wenzelm@12396
|
46 |
from F this P show ?thesis by (rule insert)
|
wenzelm@12396
|
47 |
qed
|
wenzelm@12396
|
48 |
qed
|
wenzelm@12396
|
49 |
qed
|
wenzelm@12396
|
50 |
|
nipkow@15484
|
51 |
lemma finite_ne_induct[case_names singleton insert, consumes 2]:
|
nipkow@15484
|
52 |
assumes fin: "finite F" shows "F \<noteq> {} \<Longrightarrow>
|
nipkow@15484
|
53 |
\<lbrakk> \<And>x. P{x};
|
nipkow@15484
|
54 |
\<And>x F. \<lbrakk> finite F; F \<noteq> {}; x \<notin> F; P F \<rbrakk> \<Longrightarrow> P (insert x F) \<rbrakk>
|
nipkow@15484
|
55 |
\<Longrightarrow> P F"
|
nipkow@15484
|
56 |
using fin
|
nipkow@15484
|
57 |
proof induct
|
nipkow@15484
|
58 |
case empty thus ?case by simp
|
nipkow@15484
|
59 |
next
|
nipkow@15484
|
60 |
case (insert x F)
|
nipkow@15484
|
61 |
show ?case
|
nipkow@15484
|
62 |
proof cases
|
wenzelm@23389
|
63 |
assume "F = {}"
|
wenzelm@23389
|
64 |
thus ?thesis using `P {x}` by simp
|
nipkow@15484
|
65 |
next
|
wenzelm@23389
|
66 |
assume "F \<noteq> {}"
|
wenzelm@23389
|
67 |
thus ?thesis using insert by blast
|
nipkow@15484
|
68 |
qed
|
nipkow@15484
|
69 |
qed
|
nipkow@15484
|
70 |
|
wenzelm@12396
|
71 |
lemma finite_subset_induct [consumes 2, case_names empty insert]:
|
wenzelm@23389
|
72 |
assumes "finite F" and "F \<subseteq> A"
|
wenzelm@23389
|
73 |
and empty: "P {}"
|
wenzelm@23389
|
74 |
and insert: "!!a F. finite F ==> a \<in> A ==> a \<notin> F ==> P F ==> P (insert a F)"
|
wenzelm@23389
|
75 |
shows "P F"
|
wenzelm@12396
|
76 |
proof -
|
wenzelm@23389
|
77 |
from `finite F` and `F \<subseteq> A`
|
wenzelm@23389
|
78 |
show ?thesis
|
wenzelm@12396
|
79 |
proof induct
|
wenzelm@23389
|
80 |
show "P {}" by fact
|
wenzelm@23389
|
81 |
next
|
wenzelm@23389
|
82 |
fix x F
|
wenzelm@23389
|
83 |
assume "finite F" and "x \<notin> F" and
|
wenzelm@23389
|
84 |
P: "F \<subseteq> A ==> P F" and i: "insert x F \<subseteq> A"
|
wenzelm@12396
|
85 |
show "P (insert x F)"
|
wenzelm@12396
|
86 |
proof (rule insert)
|
wenzelm@12396
|
87 |
from i show "x \<in> A" by blast
|
wenzelm@12396
|
88 |
from i have "F \<subseteq> A" by blast
|
wenzelm@12396
|
89 |
with P show "P F" .
|
wenzelm@23389
|
90 |
show "finite F" by fact
|
wenzelm@23389
|
91 |
show "x \<notin> F" by fact
|
wenzelm@12396
|
92 |
qed
|
wenzelm@12396
|
93 |
qed
|
wenzelm@12396
|
94 |
qed
|
wenzelm@12396
|
95 |
|
nipkow@32006
|
96 |
|
nipkow@29860
|
97 |
text{* A finite choice principle. Does not need the SOME choice operator. *}
|
nipkow@29860
|
98 |
lemma finite_set_choice:
|
nipkow@29860
|
99 |
"finite A \<Longrightarrow> ALL x:A. (EX y. P x y) \<Longrightarrow> EX f. ALL x:A. P x (f x)"
|
nipkow@29860
|
100 |
proof (induct set: finite)
|
nipkow@29860
|
101 |
case empty thus ?case by simp
|
nipkow@29860
|
102 |
next
|
nipkow@29860
|
103 |
case (insert a A)
|
nipkow@29860
|
104 |
then obtain f b where f: "ALL x:A. P x (f x)" and ab: "P a b" by auto
|
nipkow@29860
|
105 |
show ?case (is "EX f. ?P f")
|
nipkow@29860
|
106 |
proof
|
nipkow@29860
|
107 |
show "?P(%x. if x = a then b else f x)" using f ab by auto
|
nipkow@29860
|
108 |
qed
|
nipkow@29860
|
109 |
qed
|
nipkow@29860
|
110 |
|
haftmann@23878
|
111 |
|
nipkow@15392
|
112 |
text{* Finite sets are the images of initial segments of natural numbers: *}
|
nipkow@15392
|
113 |
|
paulson@15510
|
114 |
lemma finite_imp_nat_seg_image_inj_on:
|
paulson@15510
|
115 |
assumes fin: "finite A"
|
paulson@15510
|
116 |
shows "\<exists> (n::nat) f. A = f ` {i. i<n} & inj_on f {i. i<n}"
|
nipkow@15392
|
117 |
using fin
|
nipkow@15392
|
118 |
proof induct
|
nipkow@15392
|
119 |
case empty
|
paulson@15510
|
120 |
show ?case
|
paulson@15510
|
121 |
proof show "\<exists>f. {} = f ` {i::nat. i < 0} & inj_on f {i. i<0}" by simp
|
paulson@15510
|
122 |
qed
|
nipkow@15392
|
123 |
next
|
nipkow@15392
|
124 |
case (insert a A)
|
wenzelm@23389
|
125 |
have notinA: "a \<notin> A" by fact
|
paulson@15510
|
126 |
from insert.hyps obtain n f
|
paulson@15510
|
127 |
where "A = f ` {i::nat. i < n}" "inj_on f {i. i < n}" by blast
|
paulson@15510
|
128 |
hence "insert a A = f(n:=a) ` {i. i < Suc n}"
|
paulson@15510
|
129 |
"inj_on (f(n:=a)) {i. i < Suc n}" using notinA
|
paulson@15510
|
130 |
by (auto simp add: image_def Ball_def inj_on_def less_Suc_eq)
|
nipkow@15392
|
131 |
thus ?case by blast
|
nipkow@15392
|
132 |
qed
|
nipkow@15392
|
133 |
|
nipkow@15392
|
134 |
lemma nat_seg_image_imp_finite:
|
nipkow@15392
|
135 |
"!!f A. A = f ` {i::nat. i<n} \<Longrightarrow> finite A"
|
nipkow@15392
|
136 |
proof (induct n)
|
nipkow@15392
|
137 |
case 0 thus ?case by simp
|
nipkow@15392
|
138 |
next
|
nipkow@15392
|
139 |
case (Suc n)
|
nipkow@15392
|
140 |
let ?B = "f ` {i. i < n}"
|
nipkow@15392
|
141 |
have finB: "finite ?B" by(rule Suc.hyps[OF refl])
|
nipkow@15392
|
142 |
show ?case
|
nipkow@15392
|
143 |
proof cases
|
nipkow@15392
|
144 |
assume "\<exists>k<n. f n = f k"
|
nipkow@15392
|
145 |
hence "A = ?B" using Suc.prems by(auto simp:less_Suc_eq)
|
nipkow@15392
|
146 |
thus ?thesis using finB by simp
|
nipkow@15392
|
147 |
next
|
nipkow@15392
|
148 |
assume "\<not>(\<exists> k<n. f n = f k)"
|
nipkow@15392
|
149 |
hence "A = insert (f n) ?B" using Suc.prems by(auto simp:less_Suc_eq)
|
nipkow@15392
|
150 |
thus ?thesis using finB by simp
|
nipkow@15392
|
151 |
qed
|
nipkow@15392
|
152 |
qed
|
nipkow@15392
|
153 |
|
nipkow@15392
|
154 |
lemma finite_conv_nat_seg_image:
|
nipkow@15392
|
155 |
"finite A = (\<exists> (n::nat) f. A = f ` {i::nat. i<n})"
|
paulson@15510
|
156 |
by(blast intro: nat_seg_image_imp_finite dest: finite_imp_nat_seg_image_inj_on)
|
nipkow@15392
|
157 |
|
nipkow@32988
|
158 |
lemma finite_imp_inj_to_nat_seg:
|
nipkow@32988
|
159 |
assumes "finite A"
|
nipkow@32988
|
160 |
shows "EX f n::nat. f`A = {i. i<n} & inj_on f A"
|
nipkow@32988
|
161 |
proof -
|
nipkow@32988
|
162 |
from finite_imp_nat_seg_image_inj_on[OF `finite A`]
|
nipkow@32988
|
163 |
obtain f and n::nat where bij: "bij_betw f {i. i<n} A"
|
nipkow@32988
|
164 |
by (auto simp:bij_betw_def)
|
nipkow@33057
|
165 |
let ?f = "the_inv_into {i. i<n} f"
|
nipkow@32988
|
166 |
have "inj_on ?f A & ?f ` A = {i. i<n}"
|
nipkow@33057
|
167 |
by (fold bij_betw_def) (rule bij_betw_the_inv_into[OF bij])
|
nipkow@32988
|
168 |
thus ?thesis by blast
|
nipkow@32988
|
169 |
qed
|
nipkow@32988
|
170 |
|
nipkow@29857
|
171 |
lemma finite_Collect_less_nat[iff]: "finite{n::nat. n<k}"
|
nipkow@29857
|
172 |
by(fastsimp simp: finite_conv_nat_seg_image)
|
nipkow@29857
|
173 |
|
haftmann@35817
|
174 |
text {* Finiteness and set theoretic constructions *}
|
nipkow@15392
|
175 |
|
wenzelm@12396
|
176 |
lemma finite_UnI: "finite F ==> finite G ==> finite (F Un G)"
|
nipkow@29838
|
177 |
by (induct set: finite) simp_all
|
wenzelm@12396
|
178 |
|
wenzelm@12396
|
179 |
lemma finite_subset: "A \<subseteq> B ==> finite B ==> finite A"
|
wenzelm@12396
|
180 |
-- {* Every subset of a finite set is finite. *}
|
wenzelm@12396
|
181 |
proof -
|
wenzelm@12396
|
182 |
assume "finite B"
|
wenzelm@12396
|
183 |
thus "!!A. A \<subseteq> B ==> finite A"
|
wenzelm@12396
|
184 |
proof induct
|
wenzelm@12396
|
185 |
case empty
|
wenzelm@12396
|
186 |
thus ?case by simp
|
wenzelm@12396
|
187 |
next
|
nipkow@15327
|
188 |
case (insert x F A)
|
wenzelm@23389
|
189 |
have A: "A \<subseteq> insert x F" and r: "A - {x} \<subseteq> F ==> finite (A - {x})" by fact+
|
wenzelm@12396
|
190 |
show "finite A"
|
wenzelm@12396
|
191 |
proof cases
|
wenzelm@12396
|
192 |
assume x: "x \<in> A"
|
wenzelm@12396
|
193 |
with A have "A - {x} \<subseteq> F" by (simp add: subset_insert_iff)
|
wenzelm@12396
|
194 |
with r have "finite (A - {x})" .
|
wenzelm@12396
|
195 |
hence "finite (insert x (A - {x}))" ..
|
wenzelm@23389
|
196 |
also have "insert x (A - {x}) = A" using x by (rule insert_Diff)
|
wenzelm@12396
|
197 |
finally show ?thesis .
|
wenzelm@12396
|
198 |
next
|
wenzelm@23389
|
199 |
show "A \<subseteq> F ==> ?thesis" by fact
|
wenzelm@12396
|
200 |
assume "x \<notin> A"
|
wenzelm@12396
|
201 |
with A show "A \<subseteq> F" by (simp add: subset_insert_iff)
|
wenzelm@12396
|
202 |
qed
|
wenzelm@12396
|
203 |
qed
|
wenzelm@12396
|
204 |
qed
|
wenzelm@12396
|
205 |
|
huffman@34109
|
206 |
lemma rev_finite_subset: "finite B ==> A \<subseteq> B ==> finite A"
|
huffman@34109
|
207 |
by (rule finite_subset)
|
huffman@34109
|
208 |
|
wenzelm@12396
|
209 |
lemma finite_Un [iff]: "finite (F Un G) = (finite F & finite G)"
|
nipkow@29838
|
210 |
by (blast intro: finite_subset [of _ "X Un Y", standard] finite_UnI)
|
nipkow@29838
|
211 |
|
nipkow@29853
|
212 |
lemma finite_Collect_disjI[simp]:
|
nipkow@29838
|
213 |
"finite{x. P x | Q x} = (finite{x. P x} & finite{x. Q x})"
|
nipkow@29838
|
214 |
by(simp add:Collect_disj_eq)
|
wenzelm@12396
|
215 |
|
wenzelm@12396
|
216 |
lemma finite_Int [simp, intro]: "finite F | finite G ==> finite (F Int G)"
|
wenzelm@12396
|
217 |
-- {* The converse obviously fails. *}
|
nipkow@29838
|
218 |
by (blast intro: finite_subset)
|
nipkow@29838
|
219 |
|
nipkow@29853
|
220 |
lemma finite_Collect_conjI [simp, intro]:
|
nipkow@29838
|
221 |
"finite{x. P x} | finite{x. Q x} ==> finite{x. P x & Q x}"
|
nipkow@29838
|
222 |
-- {* The converse obviously fails. *}
|
nipkow@29838
|
223 |
by(simp add:Collect_conj_eq)
|
wenzelm@12396
|
224 |
|
nipkow@29857
|
225 |
lemma finite_Collect_le_nat[iff]: "finite{n::nat. n<=k}"
|
nipkow@29857
|
226 |
by(simp add: le_eq_less_or_eq)
|
nipkow@29857
|
227 |
|
wenzelm@12396
|
228 |
lemma finite_insert [simp]: "finite (insert a A) = finite A"
|
wenzelm@12396
|
229 |
apply (subst insert_is_Un)
|
paulson@14208
|
230 |
apply (simp only: finite_Un, blast)
|
wenzelm@12396
|
231 |
done
|
wenzelm@12396
|
232 |
|
nipkow@15281
|
233 |
lemma finite_Union[simp, intro]:
|
nipkow@15281
|
234 |
"\<lbrakk> finite A; !!M. M \<in> A \<Longrightarrow> finite M \<rbrakk> \<Longrightarrow> finite(\<Union>A)"
|
nipkow@15281
|
235 |
by (induct rule:finite_induct) simp_all
|
nipkow@15281
|
236 |
|
nipkow@31992
|
237 |
lemma finite_Inter[intro]: "EX A:M. finite(A) \<Longrightarrow> finite(Inter M)"
|
nipkow@31992
|
238 |
by (blast intro: Inter_lower finite_subset)
|
nipkow@31992
|
239 |
|
nipkow@31992
|
240 |
lemma finite_INT[intro]: "EX x:I. finite(A x) \<Longrightarrow> finite(INT x:I. A x)"
|
nipkow@31992
|
241 |
by (blast intro: INT_lower finite_subset)
|
nipkow@31992
|
242 |
|
wenzelm@12396
|
243 |
lemma finite_empty_induct:
|
wenzelm@23389
|
244 |
assumes "finite A"
|
wenzelm@23389
|
245 |
and "P A"
|
wenzelm@23389
|
246 |
and "!!a A. finite A ==> a:A ==> P A ==> P (A - {a})"
|
wenzelm@23389
|
247 |
shows "P {}"
|
wenzelm@12396
|
248 |
proof -
|
wenzelm@12396
|
249 |
have "P (A - A)"
|
wenzelm@12396
|
250 |
proof -
|
wenzelm@23389
|
251 |
{
|
wenzelm@23389
|
252 |
fix c b :: "'a set"
|
wenzelm@23389
|
253 |
assume c: "finite c" and b: "finite b"
|
wenzelm@32962
|
254 |
and P1: "P b" and P2: "!!x y. finite y ==> x \<in> y ==> P y ==> P (y - {x})"
|
wenzelm@23389
|
255 |
have "c \<subseteq> b ==> P (b - c)"
|
wenzelm@32962
|
256 |
using c
|
wenzelm@23389
|
257 |
proof induct
|
wenzelm@32962
|
258 |
case empty
|
wenzelm@32962
|
259 |
from P1 show ?case by simp
|
wenzelm@23389
|
260 |
next
|
wenzelm@32962
|
261 |
case (insert x F)
|
wenzelm@32962
|
262 |
have "P (b - F - {x})"
|
wenzelm@32962
|
263 |
proof (rule P2)
|
wenzelm@23389
|
264 |
from _ b show "finite (b - F)" by (rule finite_subset) blast
|
wenzelm@23389
|
265 |
from insert show "x \<in> b - F" by simp
|
wenzelm@23389
|
266 |
from insert show "P (b - F)" by simp
|
wenzelm@32962
|
267 |
qed
|
wenzelm@32962
|
268 |
also have "b - F - {x} = b - insert x F" by (rule Diff_insert [symmetric])
|
wenzelm@32962
|
269 |
finally show ?case .
|
wenzelm@12396
|
270 |
qed
|
wenzelm@23389
|
271 |
}
|
wenzelm@23389
|
272 |
then show ?thesis by this (simp_all add: assms)
|
wenzelm@12396
|
273 |
qed
|
wenzelm@23389
|
274 |
then show ?thesis by simp
|
wenzelm@12396
|
275 |
qed
|
wenzelm@12396
|
276 |
|
nipkow@29838
|
277 |
lemma finite_Diff [simp]: "finite A ==> finite (A - B)"
|
nipkow@29838
|
278 |
by (rule Diff_subset [THEN finite_subset])
|
nipkow@29838
|
279 |
|
nipkow@29838
|
280 |
lemma finite_Diff2 [simp]:
|
nipkow@29838
|
281 |
assumes "finite B" shows "finite (A - B) = finite A"
|
nipkow@29838
|
282 |
proof -
|
nipkow@29838
|
283 |
have "finite A \<longleftrightarrow> finite((A-B) Un (A Int B))" by(simp add: Un_Diff_Int)
|
nipkow@29838
|
284 |
also have "\<dots> \<longleftrightarrow> finite(A-B)" using `finite B` by(simp)
|
nipkow@29838
|
285 |
finally show ?thesis ..
|
nipkow@29838
|
286 |
qed
|
nipkow@29838
|
287 |
|
nipkow@29838
|
288 |
lemma finite_compl[simp]:
|
nipkow@29838
|
289 |
"finite(A::'a set) \<Longrightarrow> finite(-A) = finite(UNIV::'a set)"
|
nipkow@29838
|
290 |
by(simp add:Compl_eq_Diff_UNIV)
|
wenzelm@12396
|
291 |
|
nipkow@29853
|
292 |
lemma finite_Collect_not[simp]:
|
nipkow@29840
|
293 |
"finite{x::'a. P x} \<Longrightarrow> finite{x. ~P x} = finite(UNIV::'a set)"
|
nipkow@29840
|
294 |
by(simp add:Collect_neg_eq)
|
nipkow@29840
|
295 |
|
wenzelm@12396
|
296 |
lemma finite_Diff_insert [iff]: "finite (A - insert a B) = finite (A - B)"
|
wenzelm@12396
|
297 |
apply (subst Diff_insert)
|
wenzelm@12396
|
298 |
apply (case_tac "a : A - B")
|
wenzelm@12396
|
299 |
apply (rule finite_insert [symmetric, THEN trans])
|
paulson@14208
|
300 |
apply (subst insert_Diff, simp_all)
|
wenzelm@12396
|
301 |
done
|
wenzelm@12396
|
302 |
|
wenzelm@12396
|
303 |
|
nipkow@15392
|
304 |
text {* Image and Inverse Image over Finite Sets *}
|
paulson@13825
|
305 |
|
paulson@13825
|
306 |
lemma finite_imageI[simp]: "finite F ==> finite (h ` F)"
|
paulson@13825
|
307 |
-- {* The image of a finite set is finite. *}
|
berghofe@22262
|
308 |
by (induct set: finite) simp_all
|
paulson@13825
|
309 |
|
haftmann@31764
|
310 |
lemma finite_image_set [simp]:
|
haftmann@31764
|
311 |
"finite {x. P x} \<Longrightarrow> finite { f x | x. P x }"
|
haftmann@31764
|
312 |
by (simp add: image_Collect [symmetric])
|
haftmann@31764
|
313 |
|
paulson@14430
|
314 |
lemma finite_surj: "finite A ==> B <= f ` A ==> finite B"
|
paulson@14430
|
315 |
apply (frule finite_imageI)
|
paulson@14430
|
316 |
apply (erule finite_subset, assumption)
|
paulson@14430
|
317 |
done
|
paulson@14430
|
318 |
|
paulson@13825
|
319 |
lemma finite_range_imageI:
|
paulson@13825
|
320 |
"finite (range g) ==> finite (range (%x. f (g x)))"
|
huffman@27418
|
321 |
apply (drule finite_imageI, simp add: range_composition)
|
paulson@13825
|
322 |
done
|
paulson@13825
|
323 |
|
wenzelm@12396
|
324 |
lemma finite_imageD: "finite (f`A) ==> inj_on f A ==> finite A"
|
wenzelm@12396
|
325 |
proof -
|
wenzelm@12396
|
326 |
have aux: "!!A. finite (A - {}) = finite A" by simp
|
wenzelm@12396
|
327 |
fix B :: "'a set"
|
wenzelm@12396
|
328 |
assume "finite B"
|
wenzelm@12396
|
329 |
thus "!!A. f`A = B ==> inj_on f A ==> finite A"
|
wenzelm@12396
|
330 |
apply induct
|
wenzelm@12396
|
331 |
apply simp
|
wenzelm@12396
|
332 |
apply (subgoal_tac "EX y:A. f y = x & F = f ` (A - {y})")
|
wenzelm@12396
|
333 |
apply clarify
|
wenzelm@12396
|
334 |
apply (simp (no_asm_use) add: inj_on_def)
|
paulson@14208
|
335 |
apply (blast dest!: aux [THEN iffD1], atomize)
|
wenzelm@12396
|
336 |
apply (erule_tac V = "ALL A. ?PP (A)" in thin_rl)
|
paulson@14208
|
337 |
apply (frule subsetD [OF equalityD2 insertI1], clarify)
|
wenzelm@12396
|
338 |
apply (rule_tac x = xa in bexI)
|
wenzelm@12396
|
339 |
apply (simp_all add: inj_on_image_set_diff)
|
wenzelm@12396
|
340 |
done
|
wenzelm@12396
|
341 |
qed (rule refl)
|
wenzelm@12396
|
342 |
|
wenzelm@12396
|
343 |
|
paulson@13825
|
344 |
lemma inj_vimage_singleton: "inj f ==> f-`{a} \<subseteq> {THE x. f x = a}"
|
paulson@13825
|
345 |
-- {* The inverse image of a singleton under an injective function
|
paulson@13825
|
346 |
is included in a singleton. *}
|
paulson@14430
|
347 |
apply (auto simp add: inj_on_def)
|
paulson@14430
|
348 |
apply (blast intro: the_equality [symmetric])
|
paulson@13825
|
349 |
done
|
paulson@13825
|
350 |
|
paulson@13825
|
351 |
lemma finite_vimageI: "[|finite F; inj h|] ==> finite (h -` F)"
|
paulson@13825
|
352 |
-- {* The inverse image of a finite set under an injective function
|
paulson@13825
|
353 |
is finite. *}
|
berghofe@22262
|
354 |
apply (induct set: finite)
|
wenzelm@21575
|
355 |
apply simp_all
|
paulson@14430
|
356 |
apply (subst vimage_insert)
|
huffman@35208
|
357 |
apply (simp add: finite_subset [OF inj_vimage_singleton])
|
paulson@13825
|
358 |
done
|
paulson@13825
|
359 |
|
huffman@34109
|
360 |
lemma finite_vimageD:
|
huffman@34109
|
361 |
assumes fin: "finite (h -` F)" and surj: "surj h"
|
huffman@34109
|
362 |
shows "finite F"
|
huffman@34109
|
363 |
proof -
|
huffman@34109
|
364 |
have "finite (h ` (h -` F))" using fin by (rule finite_imageI)
|
huffman@34109
|
365 |
also have "h ` (h -` F) = F" using surj by (rule surj_image_vimage_eq)
|
huffman@34109
|
366 |
finally show "finite F" .
|
huffman@34109
|
367 |
qed
|
huffman@34109
|
368 |
|
huffman@34109
|
369 |
lemma finite_vimage_iff: "bij h \<Longrightarrow> finite (h -` F) \<longleftrightarrow> finite F"
|
huffman@34109
|
370 |
unfolding bij_def by (auto elim: finite_vimageD finite_vimageI)
|
huffman@34109
|
371 |
|
paulson@13825
|
372 |
|
nipkow@15392
|
373 |
text {* The finite UNION of finite sets *}
|
wenzelm@12396
|
374 |
|
wenzelm@12396
|
375 |
lemma finite_UN_I: "finite A ==> (!!a. a:A ==> finite (B a)) ==> finite (UN a:A. B a)"
|
berghofe@22262
|
376 |
by (induct set: finite) simp_all
|
wenzelm@12396
|
377 |
|
wenzelm@12396
|
378 |
text {*
|
wenzelm@12396
|
379 |
Strengthen RHS to
|
paulson@14430
|
380 |
@{prop "((ALL x:A. finite (B x)) & finite {x. x:A & B x \<noteq> {}})"}?
|
wenzelm@12396
|
381 |
|
wenzelm@12396
|
382 |
We'd need to prove
|
paulson@14430
|
383 |
@{prop "finite C ==> ALL A B. (UNION A B) <= C --> finite {x. x:A & B x \<noteq> {}}"}
|
wenzelm@12396
|
384 |
by induction. *}
|
wenzelm@12396
|
385 |
|
nipkow@29855
|
386 |
lemma finite_UN [simp]:
|
nipkow@29855
|
387 |
"finite A ==> finite (UNION A B) = (ALL x:A. finite (B x))"
|
nipkow@29855
|
388 |
by (blast intro: finite_UN_I finite_subset)
|
wenzelm@12396
|
389 |
|
nipkow@29857
|
390 |
lemma finite_Collect_bex[simp]: "finite A \<Longrightarrow>
|
nipkow@29857
|
391 |
finite{x. EX y:A. Q x y} = (ALL y:A. finite{x. Q x y})"
|
nipkow@29857
|
392 |
apply(subgoal_tac "{x. EX y:A. Q x y} = UNION A (%y. {x. Q x y})")
|
nipkow@29857
|
393 |
apply auto
|
nipkow@29857
|
394 |
done
|
nipkow@29857
|
395 |
|
nipkow@29857
|
396 |
lemma finite_Collect_bounded_ex[simp]: "finite{y. P y} \<Longrightarrow>
|
nipkow@29857
|
397 |
finite{x. EX y. P y & Q x y} = (ALL y. P y \<longrightarrow> finite{x. Q x y})"
|
nipkow@29857
|
398 |
apply(subgoal_tac "{x. EX y. P y & Q x y} = UNION {y. P y} (%y. {x. Q x y})")
|
nipkow@29857
|
399 |
apply auto
|
nipkow@29857
|
400 |
done
|
nipkow@29857
|
401 |
|
nipkow@29857
|
402 |
|
nipkow@17022
|
403 |
lemma finite_Plus: "[| finite A; finite B |] ==> finite (A <+> B)"
|
nipkow@17022
|
404 |
by (simp add: Plus_def)
|
nipkow@17022
|
405 |
|
nipkow@31080
|
406 |
lemma finite_PlusD:
|
nipkow@31080
|
407 |
fixes A :: "'a set" and B :: "'b set"
|
nipkow@31080
|
408 |
assumes fin: "finite (A <+> B)"
|
nipkow@31080
|
409 |
shows "finite A" "finite B"
|
nipkow@31080
|
410 |
proof -
|
nipkow@31080
|
411 |
have "Inl ` A \<subseteq> A <+> B" by auto
|
nipkow@31080
|
412 |
hence "finite (Inl ` A :: ('a + 'b) set)" using fin by(rule finite_subset)
|
nipkow@31080
|
413 |
thus "finite A" by(rule finite_imageD)(auto intro: inj_onI)
|
nipkow@31080
|
414 |
next
|
nipkow@31080
|
415 |
have "Inr ` B \<subseteq> A <+> B" by auto
|
nipkow@31080
|
416 |
hence "finite (Inr ` B :: ('a + 'b) set)" using fin by(rule finite_subset)
|
nipkow@31080
|
417 |
thus "finite B" by(rule finite_imageD)(auto intro: inj_onI)
|
nipkow@31080
|
418 |
qed
|
nipkow@31080
|
419 |
|
nipkow@31080
|
420 |
lemma finite_Plus_iff[simp]: "finite (A <+> B) \<longleftrightarrow> finite A \<and> finite B"
|
nipkow@31080
|
421 |
by(auto intro: finite_PlusD finite_Plus)
|
nipkow@31080
|
422 |
|
nipkow@31080
|
423 |
lemma finite_Plus_UNIV_iff[simp]:
|
nipkow@31080
|
424 |
"finite (UNIV :: ('a + 'b) set) =
|
nipkow@31080
|
425 |
(finite (UNIV :: 'a set) & finite (UNIV :: 'b set))"
|
nipkow@31080
|
426 |
by(subst UNIV_Plus_UNIV[symmetric])(rule finite_Plus_iff)
|
nipkow@31080
|
427 |
|
nipkow@31080
|
428 |
|
nipkow@15392
|
429 |
text {* Sigma of finite sets *}
|
wenzelm@12396
|
430 |
|
wenzelm@12396
|
431 |
lemma finite_SigmaI [simp]:
|
wenzelm@12396
|
432 |
"finite A ==> (!!a. a:A ==> finite (B a)) ==> finite (SIGMA a:A. B a)"
|
wenzelm@12396
|
433 |
by (unfold Sigma_def) (blast intro!: finite_UN_I)
|
wenzelm@12396
|
434 |
|
nipkow@15402
|
435 |
lemma finite_cartesian_product: "[| finite A; finite B |] ==>
|
nipkow@15402
|
436 |
finite (A <*> B)"
|
nipkow@15402
|
437 |
by (rule finite_SigmaI)
|
nipkow@15402
|
438 |
|
wenzelm@12396
|
439 |
lemma finite_Prod_UNIV:
|
wenzelm@12396
|
440 |
"finite (UNIV::'a set) ==> finite (UNIV::'b set) ==> finite (UNIV::('a * 'b) set)"
|
wenzelm@12396
|
441 |
apply (subgoal_tac "(UNIV:: ('a * 'b) set) = Sigma UNIV (%x. UNIV)")
|
wenzelm@12396
|
442 |
apply (erule ssubst)
|
paulson@14208
|
443 |
apply (erule finite_SigmaI, auto)
|
wenzelm@12396
|
444 |
done
|
wenzelm@12396
|
445 |
|
paulson@15409
|
446 |
lemma finite_cartesian_productD1:
|
paulson@15409
|
447 |
"[| finite (A <*> B); B \<noteq> {} |] ==> finite A"
|
paulson@15409
|
448 |
apply (auto simp add: finite_conv_nat_seg_image)
|
paulson@15409
|
449 |
apply (drule_tac x=n in spec)
|
paulson@15409
|
450 |
apply (drule_tac x="fst o f" in spec)
|
paulson@15409
|
451 |
apply (auto simp add: o_def)
|
paulson@15409
|
452 |
prefer 2 apply (force dest!: equalityD2)
|
paulson@15409
|
453 |
apply (drule equalityD1)
|
paulson@15409
|
454 |
apply (rename_tac y x)
|
paulson@15409
|
455 |
apply (subgoal_tac "\<exists>k. k<n & f k = (x,y)")
|
paulson@15409
|
456 |
prefer 2 apply force
|
paulson@15409
|
457 |
apply clarify
|
paulson@15409
|
458 |
apply (rule_tac x=k in image_eqI, auto)
|
paulson@15409
|
459 |
done
|
paulson@15409
|
460 |
|
paulson@15409
|
461 |
lemma finite_cartesian_productD2:
|
paulson@15409
|
462 |
"[| finite (A <*> B); A \<noteq> {} |] ==> finite B"
|
paulson@15409
|
463 |
apply (auto simp add: finite_conv_nat_seg_image)
|
paulson@15409
|
464 |
apply (drule_tac x=n in spec)
|
paulson@15409
|
465 |
apply (drule_tac x="snd o f" in spec)
|
paulson@15409
|
466 |
apply (auto simp add: o_def)
|
paulson@15409
|
467 |
prefer 2 apply (force dest!: equalityD2)
|
paulson@15409
|
468 |
apply (drule equalityD1)
|
paulson@15409
|
469 |
apply (rename_tac x y)
|
paulson@15409
|
470 |
apply (subgoal_tac "\<exists>k. k<n & f k = (x,y)")
|
paulson@15409
|
471 |
prefer 2 apply force
|
paulson@15409
|
472 |
apply clarify
|
paulson@15409
|
473 |
apply (rule_tac x=k in image_eqI, auto)
|
paulson@15409
|
474 |
done
|
paulson@15409
|
475 |
|
paulson@15409
|
476 |
|
nipkow@15392
|
477 |
text {* The powerset of a finite set *}
|
wenzelm@12396
|
478 |
|
wenzelm@12396
|
479 |
lemma finite_Pow_iff [iff]: "finite (Pow A) = finite A"
|
wenzelm@12396
|
480 |
proof
|
wenzelm@12396
|
481 |
assume "finite (Pow A)"
|
wenzelm@12396
|
482 |
with _ have "finite ((%x. {x}) ` A)" by (rule finite_subset) blast
|
wenzelm@12396
|
483 |
thus "finite A" by (rule finite_imageD [unfolded inj_on_def]) simp
|
wenzelm@12396
|
484 |
next
|
wenzelm@12396
|
485 |
assume "finite A"
|
wenzelm@12396
|
486 |
thus "finite (Pow A)"
|
huffman@35208
|
487 |
by induct (simp_all add: Pow_insert)
|
wenzelm@12396
|
488 |
qed
|
wenzelm@12396
|
489 |
|
nipkow@29853
|
490 |
lemma finite_Collect_subsets[simp,intro]: "finite A \<Longrightarrow> finite{B. B \<subseteq> A}"
|
nipkow@29853
|
491 |
by(simp add: Pow_def[symmetric])
|
nipkow@15392
|
492 |
|
nipkow@29855
|
493 |
|
nipkow@15392
|
494 |
lemma finite_UnionD: "finite(\<Union>A) \<Longrightarrow> finite A"
|
nipkow@15392
|
495 |
by(blast intro: finite_subset[OF subset_Pow_Union])
|
nipkow@15392
|
496 |
|
nipkow@15392
|
497 |
|
nipkow@31427
|
498 |
lemma finite_subset_image:
|
nipkow@31427
|
499 |
assumes "finite B"
|
nipkow@31427
|
500 |
shows "B \<subseteq> f ` A \<Longrightarrow> \<exists>C\<subseteq>A. finite C \<and> B = f ` C"
|
nipkow@31427
|
501 |
using assms proof(induct)
|
nipkow@31427
|
502 |
case empty thus ?case by simp
|
nipkow@31427
|
503 |
next
|
nipkow@31427
|
504 |
case insert thus ?case
|
nipkow@31427
|
505 |
by (clarsimp simp del: image_insert simp add: image_insert[symmetric])
|
nipkow@31427
|
506 |
blast
|
nipkow@31427
|
507 |
qed
|
nipkow@31427
|
508 |
|
nipkow@31427
|
509 |
|
haftmann@26441
|
510 |
subsection {* Class @{text finite} *}
|
haftmann@26041
|
511 |
|
haftmann@29734
|
512 |
class finite =
|
haftmann@26041
|
513 |
assumes finite_UNIV: "finite (UNIV \<Colon> 'a set)"
|
huffman@27430
|
514 |
begin
|
huffman@27430
|
515 |
|
huffman@27430
|
516 |
lemma finite [simp]: "finite (A \<Colon> 'a set)"
|
haftmann@26441
|
517 |
by (rule subset_UNIV finite_UNIV finite_subset)+
|
haftmann@26041
|
518 |
|
huffman@27430
|
519 |
end
|
huffman@27430
|
520 |
|
blanchet@35828
|
521 |
lemma UNIV_unit [no_atp]:
|
haftmann@26041
|
522 |
"UNIV = {()}" by auto
|
haftmann@26041
|
523 |
|
haftmann@35715
|
524 |
instance unit :: finite proof
|
haftmann@35715
|
525 |
qed (simp add: UNIV_unit)
|
haftmann@26146
|
526 |
|
blanchet@35828
|
527 |
lemma UNIV_bool [no_atp]:
|
haftmann@26041
|
528 |
"UNIV = {False, True}" by auto
|
haftmann@26041
|
529 |
|
haftmann@35715
|
530 |
instance bool :: finite proof
|
haftmann@35715
|
531 |
qed (simp add: UNIV_bool)
|
haftmann@26146
|
532 |
|
haftmann@37678
|
533 |
instance prod :: (finite, finite) finite proof
|
haftmann@35715
|
534 |
qed (simp only: UNIV_Times_UNIV [symmetric] finite_cartesian_product finite)
|
haftmann@35715
|
535 |
|
haftmann@35715
|
536 |
lemma finite_option_UNIV [simp]:
|
haftmann@35715
|
537 |
"finite (UNIV :: 'a option set) = finite (UNIV :: 'a set)"
|
haftmann@35715
|
538 |
by (auto simp add: UNIV_option_conv elim: finite_imageD intro: inj_Some)
|
haftmann@35715
|
539 |
|
haftmann@35715
|
540 |
instance option :: (finite) finite proof
|
haftmann@35715
|
541 |
qed (simp add: UNIV_option_conv)
|
haftmann@26146
|
542 |
|
haftmann@26041
|
543 |
lemma inj_graph: "inj (%f. {(x, y). y = f x})"
|
nipkow@39535
|
544 |
by (rule inj_onI, auto simp add: set_eq_iff fun_eq_iff)
|
haftmann@26041
|
545 |
|
haftmann@26146
|
546 |
instance "fun" :: (finite, finite) finite
|
haftmann@26146
|
547 |
proof
|
haftmann@26041
|
548 |
show "finite (UNIV :: ('a => 'b) set)"
|
haftmann@26041
|
549 |
proof (rule finite_imageD)
|
haftmann@26041
|
550 |
let ?graph = "%f::'a => 'b. {(x, y). y = f x}"
|
berghofe@26792
|
551 |
have "range ?graph \<subseteq> Pow UNIV" by simp
|
berghofe@26792
|
552 |
moreover have "finite (Pow (UNIV :: ('a * 'b) set))"
|
berghofe@26792
|
553 |
by (simp only: finite_Pow_iff finite)
|
berghofe@26792
|
554 |
ultimately show "finite (range ?graph)"
|
berghofe@26792
|
555 |
by (rule finite_subset)
|
haftmann@26041
|
556 |
show "inj ?graph" by (rule inj_graph)
|
haftmann@26041
|
557 |
qed
|
haftmann@26041
|
558 |
qed
|
haftmann@26041
|
559 |
|
haftmann@37678
|
560 |
instance sum :: (finite, finite) finite proof
|
haftmann@35715
|
561 |
qed (simp only: UNIV_Plus_UNIV [symmetric] finite_Plus finite)
|
haftmann@27981
|
562 |
|
haftmann@26041
|
563 |
|
haftmann@35817
|
564 |
subsection {* A basic fold functional for finite sets *}
|
nipkow@15392
|
565 |
|
nipkow@15392
|
566 |
text {* The intended behaviour is
|
wenzelm@31910
|
567 |
@{text "fold f z {x\<^isub>1, ..., x\<^isub>n} = f x\<^isub>1 (\<dots> (f x\<^isub>n z)\<dots>)"}
|
nipkow@28853
|
568 |
if @{text f} is ``left-commutative'':
|
nipkow@15392
|
569 |
*}
|
nipkow@15392
|
570 |
|
nipkow@28853
|
571 |
locale fun_left_comm =
|
nipkow@28853
|
572 |
fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b"
|
nipkow@28853
|
573 |
assumes fun_left_comm: "f x (f y z) = f y (f x z)"
|
nipkow@28853
|
574 |
begin
|
nipkow@28853
|
575 |
|
nipkow@28853
|
576 |
text{* On a functional level it looks much nicer: *}
|
nipkow@28853
|
577 |
|
nipkow@28853
|
578 |
lemma fun_comp_comm: "f x \<circ> f y = f y \<circ> f x"
|
nipkow@39535
|
579 |
by (simp add: fun_left_comm fun_eq_iff)
|
nipkow@28853
|
580 |
|
nipkow@28853
|
581 |
end
|
nipkow@28853
|
582 |
|
nipkow@28853
|
583 |
inductive fold_graph :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> bool"
|
nipkow@28853
|
584 |
for f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b" and z :: 'b where
|
nipkow@28853
|
585 |
emptyI [intro]: "fold_graph f z {} z" |
|
nipkow@28853
|
586 |
insertI [intro]: "x \<notin> A \<Longrightarrow> fold_graph f z A y
|
nipkow@28853
|
587 |
\<Longrightarrow> fold_graph f z (insert x A) (f x y)"
|
nipkow@28853
|
588 |
|
nipkow@28853
|
589 |
inductive_cases empty_fold_graphE [elim!]: "fold_graph f z {} x"
|
nipkow@28853
|
590 |
|
nipkow@28853
|
591 |
definition fold :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b" where
|
haftmann@37767
|
592 |
"fold f z A = (THE y. fold_graph f z A y)"
|
nipkow@15392
|
593 |
|
paulson@15498
|
594 |
text{*A tempting alternative for the definiens is
|
nipkow@28853
|
595 |
@{term "if finite A then THE y. fold_graph f z A y else e"}.
|
paulson@15498
|
596 |
It allows the removal of finiteness assumptions from the theorems
|
nipkow@28853
|
597 |
@{text fold_comm}, @{text fold_reindex} and @{text fold_distrib}.
|
nipkow@28853
|
598 |
The proofs become ugly. It is not worth the effort. (???) *}
|
nipkow@28853
|
599 |
|
nipkow@28853
|
600 |
|
nipkow@28853
|
601 |
lemma Diff1_fold_graph:
|
nipkow@28853
|
602 |
"fold_graph f z (A - {x}) y \<Longrightarrow> x \<in> A \<Longrightarrow> fold_graph f z A (f x y)"
|
nipkow@28853
|
603 |
by (erule insert_Diff [THEN subst], rule fold_graph.intros, auto)
|
nipkow@28853
|
604 |
|
nipkow@28853
|
605 |
lemma fold_graph_imp_finite: "fold_graph f z A x \<Longrightarrow> finite A"
|
nipkow@28853
|
606 |
by (induct set: fold_graph) auto
|
nipkow@28853
|
607 |
|
nipkow@28853
|
608 |
lemma finite_imp_fold_graph: "finite A \<Longrightarrow> \<exists>x. fold_graph f z A x"
|
nipkow@28853
|
609 |
by (induct set: finite) auto
|
nipkow@28853
|
610 |
|
nipkow@28853
|
611 |
|
nipkow@28853
|
612 |
subsubsection{*From @{const fold_graph} to @{term fold}*}
|
nipkow@15392
|
613 |
|
nipkow@28853
|
614 |
context fun_left_comm
|
haftmann@26041
|
615 |
begin
|
haftmann@26041
|
616 |
|
huffman@36045
|
617 |
lemma fold_graph_insertE_aux:
|
huffman@36045
|
618 |
"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'"
|
huffman@36045
|
619 |
proof (induct set: fold_graph)
|
huffman@36045
|
620 |
case (insertI x A y) show ?case
|
huffman@36045
|
621 |
proof (cases "x = a")
|
huffman@36045
|
622 |
assume "x = a" with insertI show ?case by auto
|
nipkow@28853
|
623 |
next
|
huffman@36045
|
624 |
assume "x \<noteq> a"
|
huffman@36045
|
625 |
then obtain y' where y: "y = f a y'" and y': "fold_graph f z (A - {a}) y'"
|
huffman@36045
|
626 |
using insertI by auto
|
huffman@36045
|
627 |
have 1: "f x y = f a (f x y')"
|
huffman@36045
|
628 |
unfolding y by (rule fun_left_comm)
|
huffman@36045
|
629 |
have 2: "fold_graph f z (insert x A - {a}) (f x y')"
|
huffman@36045
|
630 |
using y' and `x \<noteq> a` and `x \<notin> A`
|
huffman@36045
|
631 |
by (simp add: insert_Diff_if fold_graph.insertI)
|
huffman@36045
|
632 |
from 1 2 show ?case by fast
|
nipkow@15392
|
633 |
qed
|
huffman@36045
|
634 |
qed simp
|
huffman@36045
|
635 |
|
huffman@36045
|
636 |
lemma fold_graph_insertE:
|
huffman@36045
|
637 |
assumes "fold_graph f z (insert x A) v" and "x \<notin> A"
|
huffman@36045
|
638 |
obtains y where "v = f x y" and "fold_graph f z A y"
|
huffman@36045
|
639 |
using assms by (auto dest: fold_graph_insertE_aux [OF _ insertI1])
|
nipkow@28853
|
640 |
|
nipkow@28853
|
641 |
lemma fold_graph_determ:
|
nipkow@28853
|
642 |
"fold_graph f z A x \<Longrightarrow> fold_graph f z A y \<Longrightarrow> y = x"
|
huffman@36045
|
643 |
proof (induct arbitrary: y set: fold_graph)
|
huffman@36045
|
644 |
case (insertI x A y v)
|
huffman@36045
|
645 |
from `fold_graph f z (insert x A) v` and `x \<notin> A`
|
huffman@36045
|
646 |
obtain y' where "v = f x y'" and "fold_graph f z A y'"
|
huffman@36045
|
647 |
by (rule fold_graph_insertE)
|
huffman@36045
|
648 |
from `fold_graph f z A y'` have "y' = y" by (rule insertI)
|
huffman@36045
|
649 |
with `v = f x y'` show "v = f x y" by simp
|
huffman@36045
|
650 |
qed fast
|
nipkow@15392
|
651 |
|
nipkow@28853
|
652 |
lemma fold_equality:
|
nipkow@28853
|
653 |
"fold_graph f z A y \<Longrightarrow> fold f z A = y"
|
nipkow@28853
|
654 |
by (unfold fold_def) (blast intro: fold_graph_determ)
|
nipkow@15392
|
655 |
|
huffman@36045
|
656 |
lemma fold_graph_fold: "finite A \<Longrightarrow> fold_graph f z A (fold f z A)"
|
huffman@36045
|
657 |
unfolding fold_def
|
huffman@36045
|
658 |
apply (rule theI')
|
huffman@36045
|
659 |
apply (rule ex_ex1I)
|
huffman@36045
|
660 |
apply (erule finite_imp_fold_graph)
|
huffman@36045
|
661 |
apply (erule (1) fold_graph_determ)
|
huffman@36045
|
662 |
done
|
huffman@36045
|
663 |
|
nipkow@15392
|
664 |
text{* The base case for @{text fold}: *}
|
nipkow@15392
|
665 |
|
nipkow@28853
|
666 |
lemma (in -) fold_empty [simp]: "fold f z {} = z"
|
nipkow@28853
|
667 |
by (unfold fold_def) blast
|
nipkow@28853
|
668 |
|
nipkow@28853
|
669 |
text{* The various recursion equations for @{const fold}: *}
|
nipkow@28853
|
670 |
|
haftmann@26041
|
671 |
lemma fold_insert [simp]:
|
nipkow@28853
|
672 |
"finite A ==> x \<notin> A ==> fold f z (insert x A) = f x (fold f z A)"
|
huffman@36045
|
673 |
apply (rule fold_equality)
|
huffman@36045
|
674 |
apply (erule fold_graph.insertI)
|
huffman@36045
|
675 |
apply (erule fold_graph_fold)
|
nipkow@28853
|
676 |
done
|
nipkow@28853
|
677 |
|
nipkow@28853
|
678 |
lemma fold_fun_comm:
|
nipkow@28853
|
679 |
"finite A \<Longrightarrow> f x (fold f z A) = fold f (f x z) A"
|
nipkow@28853
|
680 |
proof (induct rule: finite_induct)
|
nipkow@28853
|
681 |
case empty then show ?case by simp
|
nipkow@28853
|
682 |
next
|
nipkow@28853
|
683 |
case (insert y A) then show ?case
|
nipkow@28853
|
684 |
by (simp add: fun_left_comm[of x])
|
nipkow@28853
|
685 |
qed
|
nipkow@28853
|
686 |
|
nipkow@28853
|
687 |
lemma fold_insert2:
|
nipkow@28853
|
688 |
"finite A \<Longrightarrow> x \<notin> A \<Longrightarrow> fold f z (insert x A) = fold f (f x z) A"
|
huffman@35208
|
689 |
by (simp add: fold_fun_comm)
|
nipkow@15392
|
690 |
|
haftmann@26041
|
691 |
lemma fold_rec:
|
nipkow@28853
|
692 |
assumes "finite A" and "x \<in> A"
|
nipkow@28853
|
693 |
shows "fold f z A = f x (fold f z (A - {x}))"
|
nipkow@28853
|
694 |
proof -
|
nipkow@28853
|
695 |
have A: "A = insert x (A - {x})" using `x \<in> A` by blast
|
nipkow@28853
|
696 |
then have "fold f z A = fold f z (insert x (A - {x}))" by simp
|
nipkow@28853
|
697 |
also have "\<dots> = f x (fold f z (A - {x}))"
|
nipkow@28853
|
698 |
by (rule fold_insert) (simp add: `finite A`)+
|
nipkow@15535
|
699 |
finally show ?thesis .
|
nipkow@15535
|
700 |
qed
|
nipkow@15535
|
701 |
|
nipkow@28853
|
702 |
lemma fold_insert_remove:
|
nipkow@28853
|
703 |
assumes "finite A"
|
nipkow@28853
|
704 |
shows "fold f z (insert x A) = f x (fold f z (A - {x}))"
|
nipkow@28853
|
705 |
proof -
|
nipkow@28853
|
706 |
from `finite A` have "finite (insert x A)" by auto
|
nipkow@28853
|
707 |
moreover have "x \<in> insert x A" by auto
|
nipkow@28853
|
708 |
ultimately have "fold f z (insert x A) = f x (fold f z (insert x A - {x}))"
|
nipkow@28853
|
709 |
by (rule fold_rec)
|
nipkow@28853
|
710 |
then show ?thesis by simp
|
nipkow@28853
|
711 |
qed
|
nipkow@28853
|
712 |
|
haftmann@26041
|
713 |
end
|
nipkow@15392
|
714 |
|
nipkow@15480
|
715 |
text{* A simplified version for idempotent functions: *}
|
nipkow@15480
|
716 |
|
nipkow@28853
|
717 |
locale fun_left_comm_idem = fun_left_comm +
|
nipkow@28853
|
718 |
assumes fun_left_idem: "f x (f x z) = f x z"
|
haftmann@26041
|
719 |
begin
|
haftmann@26041
|
720 |
|
nipkow@28853
|
721 |
text{* The nice version: *}
|
nipkow@28853
|
722 |
lemma fun_comp_idem : "f x o f x = f x"
|
nipkow@39535
|
723 |
by (simp add: fun_left_idem fun_eq_iff)
|
nipkow@28853
|
724 |
|
haftmann@26041
|
725 |
lemma fold_insert_idem:
|
nipkow@28853
|
726 |
assumes fin: "finite A"
|
nipkow@28853
|
727 |
shows "fold f z (insert x A) = f x (fold f z A)"
|
nipkow@15480
|
728 |
proof cases
|
nipkow@28853
|
729 |
assume "x \<in> A"
|
nipkow@28853
|
730 |
then obtain B where "A = insert x B" and "x \<notin> B" by (rule set_insert)
|
nipkow@28853
|
731 |
then show ?thesis using assms by (simp add:fun_left_idem)
|
nipkow@15480
|
732 |
next
|
nipkow@28853
|
733 |
assume "x \<notin> A" then show ?thesis using assms by simp
|
nipkow@15480
|
734 |
qed
|
nipkow@15480
|
735 |
|
nipkow@28853
|
736 |
declare fold_insert[simp del] fold_insert_idem[simp]
|
nipkow@28853
|
737 |
|
nipkow@28853
|
738 |
lemma fold_insert_idem2:
|
nipkow@28853
|
739 |
"finite A \<Longrightarrow> fold f z (insert x A) = fold f (f x z) A"
|
nipkow@28853
|
740 |
by(simp add:fold_fun_comm)
|
nipkow@15484
|
741 |
|
haftmann@26041
|
742 |
end
|
haftmann@26041
|
743 |
|
nipkow@31992
|
744 |
|
haftmann@35817
|
745 |
subsubsection {* Expressing set operations via @{const fold} *}
|
haftmann@31453
|
746 |
|
haftmann@31453
|
747 |
lemma (in fun_left_comm) fun_left_comm_apply:
|
haftmann@31453
|
748 |
"fun_left_comm (\<lambda>x. f (g x))"
|
haftmann@31453
|
749 |
proof
|
haftmann@31453
|
750 |
qed (simp_all add: fun_left_comm)
|
haftmann@31453
|
751 |
|
haftmann@31453
|
752 |
lemma (in fun_left_comm_idem) fun_left_comm_idem_apply:
|
haftmann@31453
|
753 |
"fun_left_comm_idem (\<lambda>x. f (g x))"
|
haftmann@31453
|
754 |
by (rule fun_left_comm_idem.intro, rule fun_left_comm_apply, unfold_locales)
|
haftmann@31453
|
755 |
(simp_all add: fun_left_idem)
|
haftmann@31453
|
756 |
|
haftmann@31453
|
757 |
lemma fun_left_comm_idem_insert:
|
haftmann@31453
|
758 |
"fun_left_comm_idem insert"
|
haftmann@31453
|
759 |
proof
|
haftmann@31453
|
760 |
qed auto
|
haftmann@31453
|
761 |
|
haftmann@31453
|
762 |
lemma fun_left_comm_idem_remove:
|
haftmann@31453
|
763 |
"fun_left_comm_idem (\<lambda>x A. A - {x})"
|
haftmann@31453
|
764 |
proof
|
haftmann@31453
|
765 |
qed auto
|
haftmann@31453
|
766 |
|
haftmann@35028
|
767 |
lemma (in semilattice_inf) fun_left_comm_idem_inf:
|
haftmann@33998
|
768 |
"fun_left_comm_idem inf"
|
haftmann@31453
|
769 |
proof
|
haftmann@33998
|
770 |
qed (auto simp add: inf_left_commute)
|
haftmann@33998
|
771 |
|
haftmann@35028
|
772 |
lemma (in semilattice_sup) fun_left_comm_idem_sup:
|
haftmann@33998
|
773 |
"fun_left_comm_idem sup"
|
haftmann@31453
|
774 |
proof
|
haftmann@33998
|
775 |
qed (auto simp add: sup_left_commute)
|
haftmann@31453
|
776 |
|
haftmann@31453
|
777 |
lemma union_fold_insert:
|
haftmann@31453
|
778 |
assumes "finite A"
|
haftmann@31453
|
779 |
shows "A \<union> B = fold insert B A"
|
haftmann@31453
|
780 |
proof -
|
haftmann@31453
|
781 |
interpret fun_left_comm_idem insert by (fact fun_left_comm_idem_insert)
|
haftmann@31453
|
782 |
from `finite A` show ?thesis by (induct A arbitrary: B) simp_all
|
haftmann@31453
|
783 |
qed
|
haftmann@31453
|
784 |
|
haftmann@31453
|
785 |
lemma minus_fold_remove:
|
haftmann@31453
|
786 |
assumes "finite A"
|
haftmann@31453
|
787 |
shows "B - A = fold (\<lambda>x A. A - {x}) B A"
|
haftmann@31453
|
788 |
proof -
|
haftmann@31453
|
789 |
interpret fun_left_comm_idem "\<lambda>x A. A - {x}" by (fact fun_left_comm_idem_remove)
|
haftmann@31453
|
790 |
from `finite A` show ?thesis by (induct A arbitrary: B) auto
|
haftmann@31453
|
791 |
qed
|
haftmann@31453
|
792 |
|
haftmann@33998
|
793 |
context complete_lattice
|
haftmann@33998
|
794 |
begin
|
haftmann@33998
|
795 |
|
haftmann@33998
|
796 |
lemma inf_Inf_fold_inf:
|
haftmann@31453
|
797 |
assumes "finite A"
|
haftmann@33998
|
798 |
shows "inf B (Inf A) = fold inf B A"
|
haftmann@31453
|
799 |
proof -
|
haftmann@33998
|
800 |
interpret fun_left_comm_idem inf by (fact fun_left_comm_idem_inf)
|
haftmann@31453
|
801 |
from `finite A` show ?thesis by (induct A arbitrary: B)
|
haftmann@33998
|
802 |
(simp_all add: Inf_empty Inf_insert inf_commute fold_fun_comm)
|
haftmann@31453
|
803 |
qed
|
haftmann@31453
|
804 |
|
haftmann@33998
|
805 |
lemma sup_Sup_fold_sup:
|
haftmann@31453
|
806 |
assumes "finite A"
|
haftmann@33998
|
807 |
shows "sup B (Sup A) = fold sup B A"
|
haftmann@31453
|
808 |
proof -
|
haftmann@33998
|
809 |
interpret fun_left_comm_idem sup by (fact fun_left_comm_idem_sup)
|
haftmann@31453
|
810 |
from `finite A` show ?thesis by (induct A arbitrary: B)
|
haftmann@33998
|
811 |
(simp_all add: Sup_empty Sup_insert sup_commute fold_fun_comm)
|
haftmann@31453
|
812 |
qed
|
haftmann@31453
|
813 |
|
haftmann@33998
|
814 |
lemma Inf_fold_inf:
|
haftmann@31453
|
815 |
assumes "finite A"
|
haftmann@33998
|
816 |
shows "Inf A = fold inf top A"
|
haftmann@33998
|
817 |
using assms inf_Inf_fold_inf [of A top] by (simp add: inf_absorb2)
|
haftmann@33998
|
818 |
|
haftmann@33998
|
819 |
lemma Sup_fold_sup:
|
haftmann@31453
|
820 |
assumes "finite A"
|
haftmann@33998
|
821 |
shows "Sup A = fold sup bot A"
|
haftmann@33998
|
822 |
using assms sup_Sup_fold_sup [of A bot] by (simp add: sup_absorb2)
|
haftmann@33998
|
823 |
|
haftmann@33998
|
824 |
lemma inf_INFI_fold_inf:
|
haftmann@31453
|
825 |
assumes "finite A"
|
haftmann@33998
|
826 |
shows "inf B (INFI A f) = fold (\<lambda>A. inf (f A)) B A" (is "?inf = ?fold")
|
haftmann@31453
|
827 |
proof (rule sym)
|
haftmann@33998
|
828 |
interpret fun_left_comm_idem inf by (fact fun_left_comm_idem_inf)
|
haftmann@33998
|
829 |
interpret fun_left_comm_idem "\<lambda>A. inf (f A)" by (fact fun_left_comm_idem_apply)
|
haftmann@33998
|
830 |
from `finite A` show "?fold = ?inf"
|
haftmann@33998
|
831 |
by (induct A arbitrary: B)
|
haftmann@33998
|
832 |
(simp_all add: INFI_def Inf_empty Inf_insert inf_left_commute)
|
haftmann@31453
|
833 |
qed
|
haftmann@31453
|
834 |
|
haftmann@33998
|
835 |
lemma sup_SUPR_fold_sup:
|
haftmann@31453
|
836 |
assumes "finite A"
|
haftmann@33998
|
837 |
shows "sup B (SUPR A f) = fold (\<lambda>A. sup (f A)) B A" (is "?sup = ?fold")
|
haftmann@31453
|
838 |
proof (rule sym)
|
haftmann@33998
|
839 |
interpret fun_left_comm_idem sup by (fact fun_left_comm_idem_sup)
|
haftmann@33998
|
840 |
interpret fun_left_comm_idem "\<lambda>A. sup (f A)" by (fact fun_left_comm_idem_apply)
|
haftmann@33998
|
841 |
from `finite A` show "?fold = ?sup"
|
haftmann@33998
|
842 |
by (induct A arbitrary: B)
|
haftmann@33998
|
843 |
(simp_all add: SUPR_def Sup_empty Sup_insert sup_left_commute)
|
haftmann@31453
|
844 |
qed
|
haftmann@31453
|
845 |
|
haftmann@33998
|
846 |
lemma INFI_fold_inf:
|
haftmann@31453
|
847 |
assumes "finite A"
|
haftmann@33998
|
848 |
shows "INFI A f = fold (\<lambda>A. inf (f A)) top A"
|
haftmann@33998
|
849 |
using assms inf_INFI_fold_inf [of A top] by simp
|
haftmann@33998
|
850 |
|
haftmann@33998
|
851 |
lemma SUPR_fold_sup:
|
haftmann@31453
|
852 |
assumes "finite A"
|
haftmann@33998
|
853 |
shows "SUPR A f = fold (\<lambda>A. sup (f A)) bot A"
|
haftmann@33998
|
854 |
using assms sup_SUPR_fold_sup [of A bot] by simp
|
haftmann@31453
|
855 |
|
haftmann@25571
|
856 |
end
|
haftmann@33998
|
857 |
|
haftmann@35715
|
858 |
|
haftmann@35817
|
859 |
subsection {* The derived combinator @{text fold_image} *}
|
haftmann@35817
|
860 |
|
haftmann@35817
|
861 |
definition fold_image :: "('b \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b"
|
haftmann@35817
|
862 |
where "fold_image f g = fold (%x y. f (g x) y)"
|
haftmann@35817
|
863 |
|
haftmann@35817
|
864 |
lemma fold_image_empty[simp]: "fold_image f g z {} = z"
|
haftmann@35817
|
865 |
by(simp add:fold_image_def)
|
haftmann@35817
|
866 |
|
haftmann@35817
|
867 |
context ab_semigroup_mult
|
haftmann@35817
|
868 |
begin
|
haftmann@35817
|
869 |
|
haftmann@35817
|
870 |
lemma fold_image_insert[simp]:
|
haftmann@35817
|
871 |
assumes "finite A" and "a \<notin> A"
|
haftmann@35817
|
872 |
shows "fold_image times g z (insert a A) = g a * (fold_image times g z A)"
|
haftmann@35817
|
873 |
proof -
|
haftmann@35817
|
874 |
interpret I: fun_left_comm "%x y. (g x) * y"
|
haftmann@35817
|
875 |
by unfold_locales (simp add: mult_ac)
|
haftmann@35817
|
876 |
show ?thesis using assms by(simp add:fold_image_def)
|
haftmann@35817
|
877 |
qed
|
haftmann@35817
|
878 |
|
haftmann@35817
|
879 |
(*
|
haftmann@35817
|
880 |
lemma fold_commute:
|
haftmann@35817
|
881 |
"finite A ==> (!!z. x * (fold times g z A) = fold times g (x * z) A)"
|
haftmann@35817
|
882 |
apply (induct set: finite)
|
haftmann@35817
|
883 |
apply simp
|
haftmann@35817
|
884 |
apply (simp add: mult_left_commute [of x])
|
haftmann@35817
|
885 |
done
|
haftmann@35817
|
886 |
|
haftmann@35817
|
887 |
lemma fold_nest_Un_Int:
|
haftmann@35817
|
888 |
"finite A ==> finite B
|
haftmann@35817
|
889 |
==> fold times g (fold times g z B) A = fold times g (fold times g z (A Int B)) (A Un B)"
|
haftmann@35817
|
890 |
apply (induct set: finite)
|
haftmann@35817
|
891 |
apply simp
|
haftmann@35817
|
892 |
apply (simp add: fold_commute Int_insert_left insert_absorb)
|
haftmann@35817
|
893 |
done
|
haftmann@35817
|
894 |
|
haftmann@35817
|
895 |
lemma fold_nest_Un_disjoint:
|
haftmann@35817
|
896 |
"finite A ==> finite B ==> A Int B = {}
|
haftmann@35817
|
897 |
==> fold times g z (A Un B) = fold times g (fold times g z B) A"
|
haftmann@35817
|
898 |
by (simp add: fold_nest_Un_Int)
|
haftmann@35817
|
899 |
*)
|
haftmann@35817
|
900 |
|
haftmann@35817
|
901 |
lemma fold_image_reindex:
|
haftmann@35817
|
902 |
assumes fin: "finite A"
|
haftmann@35817
|
903 |
shows "inj_on h A \<Longrightarrow> fold_image times g z (h`A) = fold_image times (g\<circ>h) z A"
|
haftmann@35817
|
904 |
using fin by induct auto
|
haftmann@35817
|
905 |
|
haftmann@35817
|
906 |
(*
|
haftmann@35817
|
907 |
text{*
|
haftmann@35817
|
908 |
Fusion theorem, as described in Graham Hutton's paper,
|
haftmann@35817
|
909 |
A Tutorial on the Universality and Expressiveness of Fold,
|
haftmann@35817
|
910 |
JFP 9:4 (355-372), 1999.
|
haftmann@35817
|
911 |
*}
|
haftmann@35817
|
912 |
|
haftmann@35817
|
913 |
lemma fold_fusion:
|
haftmann@35817
|
914 |
assumes "ab_semigroup_mult g"
|
haftmann@35817
|
915 |
assumes fin: "finite A"
|
haftmann@35817
|
916 |
and hyp: "\<And>x y. h (g x y) = times x (h y)"
|
haftmann@35817
|
917 |
shows "h (fold g j w A) = fold times j (h w) A"
|
haftmann@35817
|
918 |
proof -
|
haftmann@35817
|
919 |
class_interpret ab_semigroup_mult [g] by fact
|
haftmann@35817
|
920 |
show ?thesis using fin hyp by (induct set: finite) simp_all
|
haftmann@35817
|
921 |
qed
|
haftmann@35817
|
922 |
*)
|
haftmann@35817
|
923 |
|
haftmann@35817
|
924 |
lemma fold_image_cong:
|
haftmann@35817
|
925 |
"finite A \<Longrightarrow>
|
haftmann@35817
|
926 |
(!!x. x:A ==> g x = h x) ==> fold_image times g z A = fold_image times h z A"
|
haftmann@35817
|
927 |
apply (subgoal_tac "ALL C. C <= A --> (ALL x:C. g x = h x) --> fold_image times g z C = fold_image times h z C")
|
haftmann@35817
|
928 |
apply simp
|
haftmann@35817
|
929 |
apply (erule finite_induct, simp)
|
haftmann@35817
|
930 |
apply (simp add: subset_insert_iff, clarify)
|
haftmann@35817
|
931 |
apply (subgoal_tac "finite C")
|
haftmann@35817
|
932 |
prefer 2 apply (blast dest: finite_subset [COMP swap_prems_rl])
|
haftmann@35817
|
933 |
apply (subgoal_tac "C = insert x (C - {x})")
|
haftmann@35817
|
934 |
prefer 2 apply blast
|
haftmann@35817
|
935 |
apply (erule ssubst)
|
haftmann@35817
|
936 |
apply (drule spec)
|
haftmann@35817
|
937 |
apply (erule (1) notE impE)
|
haftmann@35817
|
938 |
apply (simp add: Ball_def del: insert_Diff_single)
|
haftmann@35817
|
939 |
done
|
haftmann@35817
|
940 |
|
haftmann@35817
|
941 |
end
|
haftmann@35817
|
942 |
|
haftmann@35817
|
943 |
context comm_monoid_mult
|
haftmann@35817
|
944 |
begin
|
haftmann@35817
|
945 |
|
haftmann@35817
|
946 |
lemma fold_image_1:
|
haftmann@35817
|
947 |
"finite S \<Longrightarrow> (\<forall>x\<in>S. f x = 1) \<Longrightarrow> fold_image op * f 1 S = 1"
|
haftmann@35817
|
948 |
apply (induct set: finite)
|
haftmann@35817
|
949 |
apply simp by auto
|
haftmann@35817
|
950 |
|
haftmann@35817
|
951 |
lemma fold_image_Un_Int:
|
haftmann@35817
|
952 |
"finite A ==> finite B ==>
|
haftmann@35817
|
953 |
fold_image times g 1 A * fold_image times g 1 B =
|
haftmann@35817
|
954 |
fold_image times g 1 (A Un B) * fold_image times g 1 (A Int B)"
|
haftmann@35817
|
955 |
by (induct set: finite)
|
haftmann@35817
|
956 |
(auto simp add: mult_ac insert_absorb Int_insert_left)
|
haftmann@35817
|
957 |
|
haftmann@35817
|
958 |
lemma fold_image_Un_one:
|
haftmann@35817
|
959 |
assumes fS: "finite S" and fT: "finite T"
|
haftmann@35817
|
960 |
and I0: "\<forall>x \<in> S\<inter>T. f x = 1"
|
haftmann@35817
|
961 |
shows "fold_image (op *) f 1 (S \<union> T) = fold_image (op *) f 1 S * fold_image (op *) f 1 T"
|
haftmann@35817
|
962 |
proof-
|
haftmann@35817
|
963 |
have "fold_image op * f 1 (S \<inter> T) = 1"
|
haftmann@35817
|
964 |
apply (rule fold_image_1)
|
haftmann@35817
|
965 |
using fS fT I0 by auto
|
haftmann@35817
|
966 |
with fold_image_Un_Int[OF fS fT] show ?thesis by simp
|
haftmann@35817
|
967 |
qed
|
haftmann@35817
|
968 |
|
haftmann@35817
|
969 |
corollary fold_Un_disjoint:
|
haftmann@35817
|
970 |
"finite A ==> finite B ==> A Int B = {} ==>
|
haftmann@35817
|
971 |
fold_image times g 1 (A Un B) =
|
haftmann@35817
|
972 |
fold_image times g 1 A * fold_image times g 1 B"
|
haftmann@35817
|
973 |
by (simp add: fold_image_Un_Int)
|
haftmann@35817
|
974 |
|
haftmann@35817
|
975 |
lemma fold_image_UN_disjoint:
|
haftmann@35817
|
976 |
"\<lbrakk> finite I; ALL i:I. finite (A i);
|
haftmann@35817
|
977 |
ALL i:I. ALL j:I. i \<noteq> j --> A i Int A j = {} \<rbrakk>
|
haftmann@35817
|
978 |
\<Longrightarrow> fold_image times g 1 (UNION I A) =
|
haftmann@35817
|
979 |
fold_image times (%i. fold_image times g 1 (A i)) 1 I"
|
haftmann@35817
|
980 |
apply (induct set: finite, simp, atomize)
|
haftmann@35817
|
981 |
apply (subgoal_tac "ALL i:F. x \<noteq> i")
|
haftmann@35817
|
982 |
prefer 2 apply blast
|
haftmann@35817
|
983 |
apply (subgoal_tac "A x Int UNION F A = {}")
|
haftmann@35817
|
984 |
prefer 2 apply blast
|
haftmann@35817
|
985 |
apply (simp add: fold_Un_disjoint)
|
haftmann@35817
|
986 |
done
|
haftmann@35817
|
987 |
|
haftmann@35817
|
988 |
lemma fold_image_Sigma: "finite A ==> ALL x:A. finite (B x) ==>
|
haftmann@35817
|
989 |
fold_image times (%x. fold_image times (g x) 1 (B x)) 1 A =
|
haftmann@35817
|
990 |
fold_image times (split g) 1 (SIGMA x:A. B x)"
|
haftmann@35817
|
991 |
apply (subst Sigma_def)
|
haftmann@35817
|
992 |
apply (subst fold_image_UN_disjoint, assumption, simp)
|
haftmann@35817
|
993 |
apply blast
|
haftmann@35817
|
994 |
apply (erule fold_image_cong)
|
haftmann@35817
|
995 |
apply (subst fold_image_UN_disjoint, simp, simp)
|
haftmann@35817
|
996 |
apply blast
|
haftmann@35817
|
997 |
apply simp
|
haftmann@35817
|
998 |
done
|
haftmann@35817
|
999 |
|
haftmann@35817
|
1000 |
lemma fold_image_distrib: "finite A \<Longrightarrow>
|
haftmann@35817
|
1001 |
fold_image times (%x. g x * h x) 1 A =
|
haftmann@35817
|
1002 |
fold_image times g 1 A * fold_image times h 1 A"
|
haftmann@35817
|
1003 |
by (erule finite_induct) (simp_all add: mult_ac)
|
haftmann@35817
|
1004 |
|
haftmann@35817
|
1005 |
lemma fold_image_related:
|
haftmann@35817
|
1006 |
assumes Re: "R e e"
|
haftmann@35817
|
1007 |
and Rop: "\<forall>x1 y1 x2 y2. R x1 x2 \<and> R y1 y2 \<longrightarrow> R (x1 * y1) (x2 * y2)"
|
haftmann@35817
|
1008 |
and fS: "finite S" and Rfg: "\<forall>x\<in>S. R (h x) (g x)"
|
haftmann@35817
|
1009 |
shows "R (fold_image (op *) h e S) (fold_image (op *) g e S)"
|
haftmann@35817
|
1010 |
using fS by (rule finite_subset_induct) (insert assms, auto)
|
haftmann@35817
|
1011 |
|
haftmann@35817
|
1012 |
lemma fold_image_eq_general:
|
haftmann@35817
|
1013 |
assumes fS: "finite S"
|
haftmann@35817
|
1014 |
and h: "\<forall>y\<in>S'. \<exists>!x. x\<in> S \<and> h(x) = y"
|
haftmann@35817
|
1015 |
and f12: "\<forall>x\<in>S. h x \<in> S' \<and> f2(h x) = f1 x"
|
haftmann@35817
|
1016 |
shows "fold_image (op *) f1 e S = fold_image (op *) f2 e S'"
|
haftmann@35817
|
1017 |
proof-
|
haftmann@35817
|
1018 |
from h f12 have hS: "h ` S = S'" by auto
|
haftmann@35817
|
1019 |
{fix x y assume H: "x \<in> S" "y \<in> S" "h x = h y"
|
haftmann@35817
|
1020 |
from f12 h H have "x = y" by auto }
|
haftmann@35817
|
1021 |
hence hinj: "inj_on h S" unfolding inj_on_def Ex1_def by blast
|
haftmann@35817
|
1022 |
from f12 have th: "\<And>x. x \<in> S \<Longrightarrow> (f2 \<circ> h) x = f1 x" by auto
|
haftmann@35817
|
1023 |
from hS have "fold_image (op *) f2 e S' = fold_image (op *) f2 e (h ` S)" by simp
|
haftmann@35817
|
1024 |
also have "\<dots> = fold_image (op *) (f2 o h) e S"
|
haftmann@35817
|
1025 |
using fold_image_reindex[OF fS hinj, of f2 e] .
|
haftmann@35817
|
1026 |
also have "\<dots> = fold_image (op *) f1 e S " using th fold_image_cong[OF fS, of "f2 o h" f1 e]
|
haftmann@35817
|
1027 |
by blast
|
haftmann@35817
|
1028 |
finally show ?thesis ..
|
haftmann@35817
|
1029 |
qed
|
haftmann@35817
|
1030 |
|
haftmann@35817
|
1031 |
lemma fold_image_eq_general_inverses:
|
haftmann@35817
|
1032 |
assumes fS: "finite S"
|
haftmann@35817
|
1033 |
and kh: "\<And>y. y \<in> T \<Longrightarrow> k y \<in> S \<and> h (k y) = y"
|
haftmann@35817
|
1034 |
and hk: "\<And>x. x \<in> S \<Longrightarrow> h x \<in> T \<and> k (h x) = x \<and> g (h x) = f x"
|
haftmann@35817
|
1035 |
shows "fold_image (op *) f e S = fold_image (op *) g e T"
|
haftmann@35817
|
1036 |
(* metis solves it, but not yet available here *)
|
haftmann@35817
|
1037 |
apply (rule fold_image_eq_general[OF fS, of T h g f e])
|
haftmann@35817
|
1038 |
apply (rule ballI)
|
haftmann@35817
|
1039 |
apply (frule kh)
|
haftmann@35817
|
1040 |
apply (rule ex1I[])
|
haftmann@35817
|
1041 |
apply blast
|
haftmann@35817
|
1042 |
apply clarsimp
|
haftmann@35817
|
1043 |
apply (drule hk) apply simp
|
haftmann@35817
|
1044 |
apply (rule sym)
|
haftmann@35817
|
1045 |
apply (erule conjunct1[OF conjunct2[OF hk]])
|
haftmann@35817
|
1046 |
apply (rule ballI)
|
haftmann@35817
|
1047 |
apply (drule hk)
|
haftmann@35817
|
1048 |
apply blast
|
haftmann@35817
|
1049 |
done
|
haftmann@35817
|
1050 |
|
haftmann@35817
|
1051 |
end
|
haftmann@35817
|
1052 |
|
haftmann@35817
|
1053 |
|
haftmann@35817
|
1054 |
subsection {* A fold functional for non-empty sets *}
|
haftmann@35817
|
1055 |
|
haftmann@35817
|
1056 |
text{* Does not require start value. *}
|
haftmann@35817
|
1057 |
|
haftmann@35817
|
1058 |
inductive
|
haftmann@35817
|
1059 |
fold1Set :: "('a => 'a => 'a) => 'a set => 'a => bool"
|
haftmann@35817
|
1060 |
for f :: "'a => 'a => 'a"
|
haftmann@35817
|
1061 |
where
|
haftmann@35817
|
1062 |
fold1Set_insertI [intro]:
|
haftmann@35817
|
1063 |
"\<lbrakk> fold_graph f a A x; a \<notin> A \<rbrakk> \<Longrightarrow> fold1Set f (insert a A) x"
|
haftmann@35817
|
1064 |
|
haftmann@35817
|
1065 |
definition fold1 :: "('a => 'a => 'a) => 'a set => 'a" where
|
haftmann@35817
|
1066 |
"fold1 f A == THE x. fold1Set f A x"
|
haftmann@35817
|
1067 |
|
haftmann@35817
|
1068 |
lemma fold1Set_nonempty:
|
haftmann@35817
|
1069 |
"fold1Set f A x \<Longrightarrow> A \<noteq> {}"
|
haftmann@35817
|
1070 |
by(erule fold1Set.cases, simp_all)
|
haftmann@35817
|
1071 |
|
haftmann@35817
|
1072 |
inductive_cases empty_fold1SetE [elim!]: "fold1Set f {} x"
|
haftmann@35817
|
1073 |
|
haftmann@35817
|
1074 |
inductive_cases insert_fold1SetE [elim!]: "fold1Set f (insert a X) x"
|
haftmann@35817
|
1075 |
|
haftmann@35817
|
1076 |
|
haftmann@35817
|
1077 |
lemma fold1Set_sing [iff]: "(fold1Set f {a} b) = (a = b)"
|
haftmann@35817
|
1078 |
by (blast elim: fold_graph.cases)
|
haftmann@35817
|
1079 |
|
haftmann@35817
|
1080 |
lemma fold1_singleton [simp]: "fold1 f {a} = a"
|
haftmann@35817
|
1081 |
by (unfold fold1_def) blast
|
haftmann@35817
|
1082 |
|
haftmann@35817
|
1083 |
lemma finite_nonempty_imp_fold1Set:
|
haftmann@35817
|
1084 |
"\<lbrakk> finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> EX x. fold1Set f A x"
|
haftmann@35817
|
1085 |
apply (induct A rule: finite_induct)
|
haftmann@35817
|
1086 |
apply (auto dest: finite_imp_fold_graph [of _ f])
|
haftmann@35817
|
1087 |
done
|
haftmann@35817
|
1088 |
|
haftmann@35817
|
1089 |
text{*First, some lemmas about @{const fold_graph}.*}
|
haftmann@35817
|
1090 |
|
haftmann@35817
|
1091 |
context ab_semigroup_mult
|
haftmann@35817
|
1092 |
begin
|
haftmann@35817
|
1093 |
|
haftmann@35817
|
1094 |
lemma fun_left_comm: "fun_left_comm(op *)"
|
haftmann@35817
|
1095 |
by unfold_locales (simp add: mult_ac)
|
haftmann@35817
|
1096 |
|
haftmann@35817
|
1097 |
lemma fold_graph_insert_swap:
|
haftmann@35817
|
1098 |
assumes fold: "fold_graph times (b::'a) A y" and "b \<notin> A"
|
haftmann@35817
|
1099 |
shows "fold_graph times z (insert b A) (z * y)"
|
haftmann@35817
|
1100 |
proof -
|
haftmann@35817
|
1101 |
interpret fun_left_comm "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule fun_left_comm)
|
haftmann@35817
|
1102 |
from assms show ?thesis
|
haftmann@35817
|
1103 |
proof (induct rule: fold_graph.induct)
|
huffman@36045
|
1104 |
case emptyI show ?case by (subst mult_commute [of z b], fast)
|
haftmann@35817
|
1105 |
next
|
haftmann@35817
|
1106 |
case (insertI x A y)
|
haftmann@35817
|
1107 |
have "fold_graph times z (insert x (insert b A)) (x * (z * y))"
|
haftmann@35817
|
1108 |
using insertI by force --{*how does @{term id} get unfolded?*}
|
haftmann@35817
|
1109 |
thus ?case by (simp add: insert_commute mult_ac)
|
haftmann@35817
|
1110 |
qed
|
haftmann@35817
|
1111 |
qed
|
haftmann@35817
|
1112 |
|
haftmann@35817
|
1113 |
lemma fold_graph_permute_diff:
|
haftmann@35817
|
1114 |
assumes fold: "fold_graph times b A x"
|
haftmann@35817
|
1115 |
shows "!!a. \<lbrakk>a \<in> A; b \<notin> A\<rbrakk> \<Longrightarrow> fold_graph times a (insert b (A-{a})) x"
|
haftmann@35817
|
1116 |
using fold
|
haftmann@35817
|
1117 |
proof (induct rule: fold_graph.induct)
|
haftmann@35817
|
1118 |
case emptyI thus ?case by simp
|
haftmann@35817
|
1119 |
next
|
haftmann@35817
|
1120 |
case (insertI x A y)
|
haftmann@35817
|
1121 |
have "a = x \<or> a \<in> A" using insertI by simp
|
haftmann@35817
|
1122 |
thus ?case
|
haftmann@35817
|
1123 |
proof
|
haftmann@35817
|
1124 |
assume "a = x"
|
haftmann@35817
|
1125 |
with insertI show ?thesis
|
haftmann@35817
|
1126 |
by (simp add: id_def [symmetric], blast intro: fold_graph_insert_swap)
|
haftmann@35817
|
1127 |
next
|
haftmann@35817
|
1128 |
assume ainA: "a \<in> A"
|
haftmann@35817
|
1129 |
hence "fold_graph times a (insert x (insert b (A - {a}))) (x * y)"
|
haftmann@35817
|
1130 |
using insertI by force
|
haftmann@35817
|
1131 |
moreover
|
haftmann@35817
|
1132 |
have "insert x (insert b (A - {a})) = insert b (insert x A - {a})"
|
haftmann@35817
|
1133 |
using ainA insertI by blast
|
haftmann@35817
|
1134 |
ultimately show ?thesis by simp
|
haftmann@35817
|
1135 |
qed
|
haftmann@35817
|
1136 |
qed
|
haftmann@35817
|
1137 |
|
haftmann@35817
|
1138 |
lemma fold1_eq_fold:
|
haftmann@35817
|
1139 |
assumes "finite A" "a \<notin> A" shows "fold1 times (insert a A) = fold times a A"
|
haftmann@35817
|
1140 |
proof -
|
haftmann@35817
|
1141 |
interpret fun_left_comm "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule fun_left_comm)
|
haftmann@35817
|
1142 |
from assms show ?thesis
|
haftmann@35817
|
1143 |
apply (simp add: fold1_def fold_def)
|
haftmann@35817
|
1144 |
apply (rule the_equality)
|
haftmann@35817
|
1145 |
apply (best intro: fold_graph_determ theI dest: finite_imp_fold_graph [of _ times])
|
haftmann@35817
|
1146 |
apply (rule sym, clarify)
|
haftmann@35817
|
1147 |
apply (case_tac "Aa=A")
|
haftmann@35817
|
1148 |
apply (best intro: fold_graph_determ)
|
haftmann@35817
|
1149 |
apply (subgoal_tac "fold_graph times a A x")
|
haftmann@35817
|
1150 |
apply (best intro: fold_graph_determ)
|
haftmann@35817
|
1151 |
apply (subgoal_tac "insert aa (Aa - {a}) = A")
|
haftmann@35817
|
1152 |
prefer 2 apply (blast elim: equalityE)
|
haftmann@35817
|
1153 |
apply (auto dest: fold_graph_permute_diff [where a=a])
|
haftmann@35817
|
1154 |
done
|
haftmann@35817
|
1155 |
qed
|
haftmann@35817
|
1156 |
|
haftmann@35817
|
1157 |
lemma nonempty_iff: "(A \<noteq> {}) = (\<exists>x B. A = insert x B & x \<notin> B)"
|
haftmann@35817
|
1158 |
apply safe
|
haftmann@35817
|
1159 |
apply simp
|
haftmann@35817
|
1160 |
apply (drule_tac x=x in spec)
|
haftmann@35817
|
1161 |
apply (drule_tac x="A-{x}" in spec, auto)
|
haftmann@35817
|
1162 |
done
|
haftmann@35817
|
1163 |
|
haftmann@35817
|
1164 |
lemma fold1_insert:
|
haftmann@35817
|
1165 |
assumes nonempty: "A \<noteq> {}" and A: "finite A" "x \<notin> A"
|
haftmann@35817
|
1166 |
shows "fold1 times (insert x A) = x * fold1 times A"
|
haftmann@35817
|
1167 |
proof -
|
haftmann@35817
|
1168 |
interpret fun_left_comm "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a" by (rule fun_left_comm)
|
haftmann@35817
|
1169 |
from nonempty obtain a A' where "A = insert a A' & a ~: A'"
|
haftmann@35817
|
1170 |
by (auto simp add: nonempty_iff)
|
haftmann@35817
|
1171 |
with A show ?thesis
|
haftmann@35817
|
1172 |
by (simp add: insert_commute [of x] fold1_eq_fold eq_commute)
|
haftmann@35817
|
1173 |
qed
|
haftmann@35817
|
1174 |
|
haftmann@35817
|
1175 |
end
|
haftmann@35817
|
1176 |
|
haftmann@35817
|
1177 |
context ab_semigroup_idem_mult
|
haftmann@35817
|
1178 |
begin
|
haftmann@35817
|
1179 |
|
haftmann@35817
|
1180 |
lemma fun_left_comm_idem: "fun_left_comm_idem(op *)"
|
haftmann@35817
|
1181 |
apply unfold_locales
|
haftmann@35817
|
1182 |
apply (rule mult_left_commute)
|
haftmann@35817
|
1183 |
apply (rule mult_left_idem)
|
haftmann@35817
|
1184 |
done
|
haftmann@35817
|
1185 |
|
haftmann@35817
|
1186 |
lemma fold1_insert_idem [simp]:
|
haftmann@35817
|
1187 |
assumes nonempty: "A \<noteq> {}" and A: "finite A"
|
haftmann@35817
|
1188 |
shows "fold1 times (insert x A) = x * fold1 times A"
|
haftmann@35817
|
1189 |
proof -
|
haftmann@35817
|
1190 |
interpret fun_left_comm_idem "op *::'a \<Rightarrow> 'a \<Rightarrow> 'a"
|
haftmann@35817
|
1191 |
by (rule fun_left_comm_idem)
|
haftmann@35817
|
1192 |
from nonempty obtain a A' where A': "A = insert a A' & a ~: A'"
|
haftmann@35817
|
1193 |
by (auto simp add: nonempty_iff)
|
haftmann@35817
|
1194 |
show ?thesis
|
haftmann@35817
|
1195 |
proof cases
|
haftmann@35817
|
1196 |
assume "a = x"
|
haftmann@35817
|
1197 |
thus ?thesis
|
haftmann@35817
|
1198 |
proof cases
|
haftmann@35817
|
1199 |
assume "A' = {}"
|
haftmann@35817
|
1200 |
with prems show ?thesis by simp
|
haftmann@35817
|
1201 |
next
|
haftmann@35817
|
1202 |
assume "A' \<noteq> {}"
|
haftmann@35817
|
1203 |
with prems show ?thesis
|
haftmann@35817
|
1204 |
by (simp add: fold1_insert mult_assoc [symmetric])
|
haftmann@35817
|
1205 |
qed
|
haftmann@35817
|
1206 |
next
|
haftmann@35817
|
1207 |
assume "a \<noteq> x"
|
haftmann@35817
|
1208 |
with prems show ?thesis
|
haftmann@35817
|
1209 |
by (simp add: insert_commute fold1_eq_fold)
|
haftmann@35817
|
1210 |
qed
|
haftmann@35817
|
1211 |
qed
|
haftmann@35817
|
1212 |
|
haftmann@35817
|
1213 |
lemma hom_fold1_commute:
|
haftmann@35817
|
1214 |
assumes hom: "!!x y. h (x * y) = h x * h y"
|
haftmann@35817
|
1215 |
and N: "finite N" "N \<noteq> {}" shows "h (fold1 times N) = fold1 times (h ` N)"
|
haftmann@35817
|
1216 |
using N proof (induct rule: finite_ne_induct)
|
haftmann@35817
|
1217 |
case singleton thus ?case by simp
|
haftmann@35817
|
1218 |
next
|
haftmann@35817
|
1219 |
case (insert n N)
|
haftmann@35817
|
1220 |
then have "h (fold1 times (insert n N)) = h (n * fold1 times N)" by simp
|
haftmann@35817
|
1221 |
also have "\<dots> = h n * h (fold1 times N)" by(rule hom)
|
haftmann@35817
|
1222 |
also have "h (fold1 times N) = fold1 times (h ` N)" by(rule insert)
|
haftmann@35817
|
1223 |
also have "times (h n) \<dots> = fold1 times (insert (h n) (h ` N))"
|
haftmann@35817
|
1224 |
using insert by(simp)
|
haftmann@35817
|
1225 |
also have "insert (h n) (h ` N) = h ` insert n N" by simp
|
haftmann@35817
|
1226 |
finally show ?case .
|
haftmann@35817
|
1227 |
qed
|
haftmann@35817
|
1228 |
|
haftmann@35817
|
1229 |
lemma fold1_eq_fold_idem:
|
haftmann@35817
|
1230 |
assumes "finite A"
|
haftmann@35817
|
1231 |
shows "fold1 times (insert a A) = fold times a A"
|
haftmann@35817
|
1232 |
proof (cases "a \<in> A")
|
haftmann@35817
|
1233 |
case False
|
haftmann@35817
|
1234 |
with assms show ?thesis by (simp add: fold1_eq_fold)
|
haftmann@35817
|
1235 |
next
|
haftmann@35817
|
1236 |
interpret fun_left_comm_idem times by (fact fun_left_comm_idem)
|
haftmann@35817
|
1237 |
case True then obtain b B
|
haftmann@35817
|
1238 |
where A: "A = insert a B" and "a \<notin> B" by (rule set_insert)
|
haftmann@35817
|
1239 |
with assms have "finite B" by auto
|
haftmann@35817
|
1240 |
then have "fold times a (insert a B) = fold times (a * a) B"
|
haftmann@35817
|
1241 |
using `a \<notin> B` by (rule fold_insert2)
|
haftmann@35817
|
1242 |
then show ?thesis
|
haftmann@35817
|
1243 |
using `a \<notin> B` `finite B` by (simp add: fold1_eq_fold A)
|
haftmann@35817
|
1244 |
qed
|
haftmann@35817
|
1245 |
|
haftmann@35817
|
1246 |
end
|
haftmann@35817
|
1247 |
|
haftmann@35817
|
1248 |
|
haftmann@35817
|
1249 |
text{* Now the recursion rules for definitions: *}
|
haftmann@35817
|
1250 |
|
haftmann@35817
|
1251 |
lemma fold1_singleton_def: "g = fold1 f \<Longrightarrow> g {a} = a"
|
haftmann@35817
|
1252 |
by simp
|
haftmann@35817
|
1253 |
|
haftmann@35817
|
1254 |
lemma (in ab_semigroup_mult) fold1_insert_def:
|
haftmann@35817
|
1255 |
"\<lbrakk> g = fold1 times; finite A; x \<notin> A; A \<noteq> {} \<rbrakk> \<Longrightarrow> g (insert x A) = x * g A"
|
haftmann@35817
|
1256 |
by (simp add:fold1_insert)
|
haftmann@35817
|
1257 |
|
haftmann@35817
|
1258 |
lemma (in ab_semigroup_idem_mult) fold1_insert_idem_def:
|
haftmann@35817
|
1259 |
"\<lbrakk> g = fold1 times; finite A; A \<noteq> {} \<rbrakk> \<Longrightarrow> g (insert x A) = x * g A"
|
haftmann@35817
|
1260 |
by simp
|
haftmann@35817
|
1261 |
|
haftmann@35817
|
1262 |
subsubsection{* Determinacy for @{term fold1Set} *}
|
haftmann@35817
|
1263 |
|
haftmann@35817
|
1264 |
(*Not actually used!!*)
|
haftmann@35817
|
1265 |
(*
|
haftmann@35817
|
1266 |
context ab_semigroup_mult
|
haftmann@35817
|
1267 |
begin
|
haftmann@35817
|
1268 |
|
haftmann@35817
|
1269 |
lemma fold_graph_permute:
|
haftmann@35817
|
1270 |
"[|fold_graph times id b (insert a A) x; a \<notin> A; b \<notin> A|]
|
haftmann@35817
|
1271 |
==> fold_graph times id a (insert b A) x"
|
haftmann@35817
|
1272 |
apply (cases "a=b")
|
haftmann@35817
|
1273 |
apply (auto dest: fold_graph_permute_diff)
|
haftmann@35817
|
1274 |
done
|
haftmann@35817
|
1275 |
|
haftmann@35817
|
1276 |
lemma fold1Set_determ:
|
haftmann@35817
|
1277 |
"fold1Set times A x ==> fold1Set times A y ==> y = x"
|
haftmann@35817
|
1278 |
proof (clarify elim!: fold1Set.cases)
|
haftmann@35817
|
1279 |
fix A x B y a b
|
haftmann@35817
|
1280 |
assume Ax: "fold_graph times id a A x"
|
haftmann@35817
|
1281 |
assume By: "fold_graph times id b B y"
|
haftmann@35817
|
1282 |
assume anotA: "a \<notin> A"
|
haftmann@35817
|
1283 |
assume bnotB: "b \<notin> B"
|
haftmann@35817
|
1284 |
assume eq: "insert a A = insert b B"
|
haftmann@35817
|
1285 |
show "y=x"
|
haftmann@35817
|
1286 |
proof cases
|
haftmann@35817
|
1287 |
assume same: "a=b"
|
haftmann@35817
|
1288 |
hence "A=B" using anotA bnotB eq by (blast elim!: equalityE)
|
haftmann@35817
|
1289 |
thus ?thesis using Ax By same by (blast intro: fold_graph_determ)
|
haftmann@35817
|
1290 |
next
|
haftmann@35817
|
1291 |
assume diff: "a\<noteq>b"
|
haftmann@35817
|
1292 |
let ?D = "B - {a}"
|
haftmann@35817
|
1293 |
have B: "B = insert a ?D" and A: "A = insert b ?D"
|
haftmann@35817
|
1294 |
and aB: "a \<in> B" and bA: "b \<in> A"
|
haftmann@35817
|
1295 |
using eq anotA bnotB diff by (blast elim!:equalityE)+
|
haftmann@35817
|
1296 |
with aB bnotB By
|
haftmann@35817
|
1297 |
have "fold_graph times id a (insert b ?D) y"
|
haftmann@35817
|
1298 |
by (auto intro: fold_graph_permute simp add: insert_absorb)
|
haftmann@35817
|
1299 |
moreover
|
haftmann@35817
|
1300 |
have "fold_graph times id a (insert b ?D) x"
|
haftmann@35817
|
1301 |
by (simp add: A [symmetric] Ax)
|
haftmann@35817
|
1302 |
ultimately show ?thesis by (blast intro: fold_graph_determ)
|
haftmann@35817
|
1303 |
qed
|
haftmann@35817
|
1304 |
qed
|
haftmann@35817
|
1305 |
|
haftmann@35817
|
1306 |
lemma fold1Set_equality: "fold1Set times A y ==> fold1 times A = y"
|
haftmann@35817
|
1307 |
by (unfold fold1_def) (blast intro: fold1Set_determ)
|
haftmann@35817
|
1308 |
|
haftmann@35817
|
1309 |
end
|
haftmann@35817
|
1310 |
*)
|
haftmann@35817
|
1311 |
|
haftmann@35817
|
1312 |
declare
|
haftmann@35817
|
1313 |
empty_fold_graphE [rule del] fold_graph.intros [rule del]
|
haftmann@35817
|
1314 |
empty_fold1SetE [rule del] insert_fold1SetE [rule del]
|
haftmann@35817
|
1315 |
-- {* No more proofs involve these relations. *}
|
haftmann@35817
|
1316 |
|
haftmann@35817
|
1317 |
subsubsection {* Lemmas about @{text fold1} *}
|
haftmann@35817
|
1318 |
|
haftmann@35817
|
1319 |
context ab_semigroup_mult
|
haftmann@35817
|
1320 |
begin
|
haftmann@35817
|
1321 |
|
haftmann@35817
|
1322 |
lemma fold1_Un:
|
haftmann@35817
|
1323 |
assumes A: "finite A" "A \<noteq> {}"
|
haftmann@35817
|
1324 |
shows "finite B \<Longrightarrow> B \<noteq> {} \<Longrightarrow> A Int B = {} \<Longrightarrow>
|
haftmann@35817
|
1325 |
fold1 times (A Un B) = fold1 times A * fold1 times B"
|
haftmann@35817
|
1326 |
using A by (induct rule: finite_ne_induct)
|
haftmann@35817
|
1327 |
(simp_all add: fold1_insert mult_assoc)
|
haftmann@35817
|
1328 |
|
haftmann@35817
|
1329 |
lemma fold1_in:
|
haftmann@35817
|
1330 |
assumes A: "finite (A)" "A \<noteq> {}" and elem: "\<And>x y. x * y \<in> {x,y}"
|
haftmann@35817
|
1331 |
shows "fold1 times A \<in> A"
|
haftmann@35817
|
1332 |
using A
|
haftmann@35817
|
1333 |
proof (induct rule:finite_ne_induct)
|
haftmann@35817
|
1334 |
case singleton thus ?case by simp
|
haftmann@35817
|
1335 |
next
|
haftmann@35817
|
1336 |
case insert thus ?case using elem by (force simp add:fold1_insert)
|
haftmann@35817
|
1337 |
qed
|
haftmann@35817
|
1338 |
|
haftmann@35817
|
1339 |
end
|
haftmann@35817
|
1340 |
|
haftmann@35817
|
1341 |
lemma (in ab_semigroup_idem_mult) fold1_Un2:
|
haftmann@35817
|
1342 |
assumes A: "finite A" "A \<noteq> {}"
|
haftmann@35817
|
1343 |
shows "finite B \<Longrightarrow> B \<noteq> {} \<Longrightarrow>
|
haftmann@35817
|
1344 |
fold1 times (A Un B) = fold1 times A * fold1 times B"
|
haftmann@35817
|
1345 |
using A
|
haftmann@35817
|
1346 |
proof(induct rule:finite_ne_induct)
|
haftmann@35817
|
1347 |
case singleton thus ?case by simp
|
haftmann@35817
|
1348 |
next
|
haftmann@35817
|
1349 |
case insert thus ?case by (simp add: mult_assoc)
|
haftmann@35817
|
1350 |
qed
|
haftmann@35817
|
1351 |
|
haftmann@35817
|
1352 |
|
haftmann@35817
|
1353 |
subsection {* Locales as mini-packages for fold operations *}
|
haftmann@35817
|
1354 |
|
haftmann@35817
|
1355 |
subsubsection {* The natural case *}
|
haftmann@35715
|
1356 |
|
haftmann@35715
|
1357 |
locale folding =
|
haftmann@35715
|
1358 |
fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> 'b"
|
haftmann@35715
|
1359 |
fixes F :: "'a set \<Rightarrow> 'b \<Rightarrow> 'b"
|
haftmann@35817
|
1360 |
assumes commute_comp: "f y \<circ> f x = f x \<circ> f y"
|
haftmann@35718
|
1361 |
assumes eq_fold: "finite A \<Longrightarrow> F A s = fold f s A"
|
haftmann@35715
|
1362 |
begin
|
haftmann@35715
|
1363 |
|
haftmann@35715
|
1364 |
lemma empty [simp]:
|
haftmann@35715
|
1365 |
"F {} = id"
|
nipkow@39535
|
1366 |
by (simp add: eq_fold fun_eq_iff)
|
haftmann@35715
|
1367 |
|
haftmann@35715
|
1368 |
lemma insert [simp]:
|
haftmann@35715
|
1369 |
assumes "finite A" and "x \<notin> A"
|
haftmann@35715
|
1370 |
shows "F (insert x A) = F A \<circ> f x"
|
haftmann@35715
|
1371 |
proof -
|
haftmann@35817
|
1372 |
interpret fun_left_comm f proof
|
nipkow@39535
|
1373 |
qed (insert commute_comp, simp add: fun_eq_iff)
|
haftmann@35715
|
1374 |
from fold_insert2 assms
|
haftmann@35718
|
1375 |
have "\<And>s. fold f s (insert x A) = fold f (f x s) A" .
|
nipkow@39535
|
1376 |
with `finite A` show ?thesis by (simp add: eq_fold fun_eq_iff)
|
haftmann@35715
|
1377 |
qed
|
haftmann@35715
|
1378 |
|
haftmann@35715
|
1379 |
lemma remove:
|
haftmann@35715
|
1380 |
assumes "finite A" and "x \<in> A"
|
haftmann@35715
|
1381 |
shows "F A = F (A - {x}) \<circ> f x"
|
haftmann@35715
|
1382 |
proof -
|
haftmann@35715
|
1383 |
from `x \<in> A` obtain B where A: "A = insert x B" and "x \<notin> B"
|
haftmann@35715
|
1384 |
by (auto dest: mk_disjoint_insert)
|
haftmann@35715
|
1385 |
moreover from `finite A` this have "finite B" by simp
|
haftmann@35715
|
1386 |
ultimately show ?thesis by simp
|
haftmann@35715
|
1387 |
qed
|
haftmann@35715
|
1388 |
|
haftmann@35715
|
1389 |
lemma insert_remove:
|
haftmann@35715
|
1390 |
assumes "finite A"
|
haftmann@35715
|
1391 |
shows "F (insert x A) = F (A - {x}) \<circ> f x"
|
haftmann@35718
|
1392 |
using assms by (cases "x \<in> A") (simp_all add: remove insert_absorb)
|
haftmann@35715
|
1393 |
|
haftmann@35817
|
1394 |
lemma commute_left_comp:
|
haftmann@35817
|
1395 |
"f y \<circ> (f x \<circ> g) = f x \<circ> (f y \<circ> g)"
|
haftmann@35817
|
1396 |
by (simp add: o_assoc commute_comp)
|
haftmann@35817
|
1397 |
|
haftmann@35715
|
1398 |
lemma commute_comp':
|
haftmann@35715
|
1399 |
assumes "finite A"
|
haftmann@35715
|
1400 |
shows "f x \<circ> F A = F A \<circ> f x"
|
haftmann@35817
|
1401 |
using assms by (induct A)
|
haftmann@35817
|
1402 |
(simp, simp del: o_apply add: o_assoc, simp del: o_apply add: o_assoc [symmetric] commute_comp)
|
haftmann@35715
|
1403 |
|
haftmann@35817
|
1404 |
lemma commute_left_comp':
|
haftmann@35715
|
1405 |
assumes "finite A"
|
haftmann@35817
|
1406 |
shows "f x \<circ> (F A \<circ> g) = F A \<circ> (f x \<circ> g)"
|
haftmann@35817
|
1407 |
using assms by (simp add: o_assoc commute_comp')
|
haftmann@35817
|
1408 |
|
haftmann@35817
|
1409 |
lemma commute_comp'':
|
haftmann@35817
|
1410 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1411 |
shows "F B \<circ> F A = F A \<circ> F B"
|
haftmann@35817
|
1412 |
using assms by (induct A)
|
haftmann@35817
|
1413 |
(simp_all add: o_assoc, simp add: o_assoc [symmetric] commute_comp')
|
haftmann@35817
|
1414 |
|
haftmann@35817
|
1415 |
lemma commute_left_comp'':
|
haftmann@35817
|
1416 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1417 |
shows "F B \<circ> (F A \<circ> g) = F A \<circ> (F B \<circ> g)"
|
haftmann@35817
|
1418 |
using assms by (simp add: o_assoc commute_comp'')
|
haftmann@35817
|
1419 |
|
haftmann@35817
|
1420 |
lemmas commute_comps = o_assoc [symmetric] commute_comp commute_left_comp
|
haftmann@35817
|
1421 |
commute_comp' commute_left_comp' commute_comp'' commute_left_comp''
|
haftmann@35817
|
1422 |
|
haftmann@35817
|
1423 |
lemma union_inter:
|
haftmann@35817
|
1424 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1425 |
shows "F (A \<union> B) \<circ> F (A \<inter> B) = F A \<circ> F B"
|
haftmann@35817
|
1426 |
using assms by (induct A)
|
haftmann@35817
|
1427 |
(simp_all del: o_apply add: insert_absorb Int_insert_left commute_comps,
|
haftmann@35817
|
1428 |
simp add: o_assoc)
|
haftmann@35715
|
1429 |
|
haftmann@35715
|
1430 |
lemma union:
|
haftmann@35715
|
1431 |
assumes "finite A" and "finite B"
|
haftmann@35715
|
1432 |
and "A \<inter> B = {}"
|
haftmann@35715
|
1433 |
shows "F (A \<union> B) = F A \<circ> F B"
|
haftmann@35817
|
1434 |
proof -
|
haftmann@35817
|
1435 |
from union_inter `finite A` `finite B` have "F (A \<union> B) \<circ> F (A \<inter> B) = F A \<circ> F B" .
|
haftmann@35817
|
1436 |
with `A \<inter> B = {}` show ?thesis by simp
|
haftmann@35715
|
1437 |
qed
|
haftmann@35715
|
1438 |
|
haftmann@33998
|
1439 |
end
|
haftmann@35715
|
1440 |
|
haftmann@35817
|
1441 |
|
haftmann@35817
|
1442 |
subsubsection {* The natural case with idempotency *}
|
haftmann@35817
|
1443 |
|
haftmann@35715
|
1444 |
locale folding_idem = folding +
|
haftmann@35715
|
1445 |
assumes idem_comp: "f x \<circ> f x = f x"
|
haftmann@35715
|
1446 |
begin
|
haftmann@35715
|
1447 |
|
haftmann@35817
|
1448 |
lemma idem_left_comp:
|
haftmann@35817
|
1449 |
"f x \<circ> (f x \<circ> g) = f x \<circ> g"
|
haftmann@35817
|
1450 |
by (simp add: o_assoc idem_comp)
|
haftmann@35817
|
1451 |
|
haftmann@35817
|
1452 |
lemma in_comp_idem:
|
haftmann@35817
|
1453 |
assumes "finite A" and "x \<in> A"
|
haftmann@35817
|
1454 |
shows "F A \<circ> f x = F A"
|
haftmann@35817
|
1455 |
using assms by (induct A)
|
haftmann@35817
|
1456 |
(auto simp add: commute_comps idem_comp, simp add: commute_left_comp' [symmetric] commute_comp')
|
haftmann@35817
|
1457 |
|
haftmann@35817
|
1458 |
lemma subset_comp_idem:
|
haftmann@35817
|
1459 |
assumes "finite A" and "B \<subseteq> A"
|
haftmann@35817
|
1460 |
shows "F A \<circ> F B = F A"
|
haftmann@35817
|
1461 |
proof -
|
haftmann@35817
|
1462 |
from assms have "finite B" by (blast dest: finite_subset)
|
haftmann@35817
|
1463 |
then show ?thesis using `B \<subseteq> A` by (induct B)
|
haftmann@35817
|
1464 |
(simp_all add: o_assoc in_comp_idem `finite A`)
|
haftmann@35817
|
1465 |
qed
|
haftmann@35817
|
1466 |
|
haftmann@35715
|
1467 |
declare insert [simp del]
|
haftmann@35715
|
1468 |
|
haftmann@35715
|
1469 |
lemma insert_idem [simp]:
|
haftmann@35715
|
1470 |
assumes "finite A"
|
haftmann@35715
|
1471 |
shows "F (insert x A) = F A \<circ> f x"
|
haftmann@35817
|
1472 |
using assms by (cases "x \<in> A") (simp_all add: insert in_comp_idem insert_absorb)
|
haftmann@35715
|
1473 |
|
haftmann@35715
|
1474 |
lemma union_idem:
|
haftmann@35715
|
1475 |
assumes "finite A" and "finite B"
|
haftmann@35715
|
1476 |
shows "F (A \<union> B) = F A \<circ> F B"
|
haftmann@35817
|
1477 |
proof -
|
haftmann@35817
|
1478 |
from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
|
haftmann@35817
|
1479 |
then have "F (A \<union> B) \<circ> F (A \<inter> B) = F (A \<union> B)" by (rule subset_comp_idem)
|
haftmann@35817
|
1480 |
with assms show ?thesis by (simp add: union_inter)
|
haftmann@35715
|
1481 |
qed
|
haftmann@35715
|
1482 |
|
haftmann@35715
|
1483 |
end
|
haftmann@35715
|
1484 |
|
haftmann@35817
|
1485 |
|
haftmann@35817
|
1486 |
subsubsection {* The image case with fixed function *}
|
haftmann@35817
|
1487 |
|
haftmann@35796
|
1488 |
no_notation times (infixl "*" 70)
|
haftmann@35796
|
1489 |
no_notation Groups.one ("1")
|
haftmann@35718
|
1490 |
|
haftmann@35718
|
1491 |
locale folding_image_simple = comm_monoid +
|
haftmann@35718
|
1492 |
fixes g :: "('b \<Rightarrow> 'a)"
|
haftmann@35718
|
1493 |
fixes F :: "'b set \<Rightarrow> 'a"
|
haftmann@35817
|
1494 |
assumes eq_fold_g: "finite A \<Longrightarrow> F A = fold_image f g 1 A"
|
haftmann@35718
|
1495 |
begin
|
haftmann@35718
|
1496 |
|
haftmann@35718
|
1497 |
lemma empty [simp]:
|
haftmann@35718
|
1498 |
"F {} = 1"
|
haftmann@35817
|
1499 |
by (simp add: eq_fold_g)
|
haftmann@35718
|
1500 |
|
haftmann@35718
|
1501 |
lemma insert [simp]:
|
haftmann@35718
|
1502 |
assumes "finite A" and "x \<notin> A"
|
haftmann@35718
|
1503 |
shows "F (insert x A) = g x * F A"
|
haftmann@35718
|
1504 |
proof -
|
haftmann@35718
|
1505 |
interpret fun_left_comm "%x y. (g x) * y" proof
|
haftmann@35718
|
1506 |
qed (simp add: ac_simps)
|
haftmann@35718
|
1507 |
with assms have "fold_image (op *) g 1 (insert x A) = g x * fold_image (op *) g 1 A"
|
haftmann@35718
|
1508 |
by (simp add: fold_image_def)
|
haftmann@35817
|
1509 |
with `finite A` show ?thesis by (simp add: eq_fold_g)
|
haftmann@35718
|
1510 |
qed
|
haftmann@35718
|
1511 |
|
haftmann@35718
|
1512 |
lemma remove:
|
haftmann@35718
|
1513 |
assumes "finite A" and "x \<in> A"
|
haftmann@35718
|
1514 |
shows "F A = g x * F (A - {x})"
|
haftmann@35718
|
1515 |
proof -
|
haftmann@35718
|
1516 |
from `x \<in> A` obtain B where A: "A = insert x B" and "x \<notin> B"
|
haftmann@35718
|
1517 |
by (auto dest: mk_disjoint_insert)
|
haftmann@35718
|
1518 |
moreover from `finite A` this have "finite B" by simp
|
haftmann@35718
|
1519 |
ultimately show ?thesis by simp
|
haftmann@35718
|
1520 |
qed
|
haftmann@35718
|
1521 |
|
haftmann@35718
|
1522 |
lemma insert_remove:
|
haftmann@35718
|
1523 |
assumes "finite A"
|
haftmann@35718
|
1524 |
shows "F (insert x A) = g x * F (A - {x})"
|
haftmann@35718
|
1525 |
using assms by (cases "x \<in> A") (simp_all add: remove insert_absorb)
|
haftmann@35718
|
1526 |
|
haftmann@35817
|
1527 |
lemma neutral:
|
haftmann@35817
|
1528 |
assumes "finite A" and "\<forall>x\<in>A. g x = 1"
|
haftmann@35817
|
1529 |
shows "F A = 1"
|
haftmann@35817
|
1530 |
using assms by (induct A) simp_all
|
haftmann@35817
|
1531 |
|
haftmann@35718
|
1532 |
lemma union_inter:
|
haftmann@35718
|
1533 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1534 |
shows "F (A \<union> B) * F (A \<inter> B) = F A * F B"
|
haftmann@35718
|
1535 |
using assms proof (induct A)
|
haftmann@35718
|
1536 |
case empty then show ?case by simp
|
haftmann@35718
|
1537 |
next
|
haftmann@35718
|
1538 |
case (insert x A) then show ?case
|
haftmann@35718
|
1539 |
by (auto simp add: insert_absorb Int_insert_left commute [of _ "g x"] assoc left_commute)
|
haftmann@35718
|
1540 |
qed
|
haftmann@35718
|
1541 |
|
haftmann@35817
|
1542 |
corollary union_inter_neutral:
|
haftmann@35817
|
1543 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1544 |
and I0: "\<forall>x \<in> A\<inter>B. g x = 1"
|
haftmann@35817
|
1545 |
shows "F (A \<union> B) = F A * F B"
|
haftmann@35817
|
1546 |
using assms by (simp add: union_inter [symmetric] neutral)
|
haftmann@35817
|
1547 |
|
haftmann@35718
|
1548 |
corollary union_disjoint:
|
haftmann@35718
|
1549 |
assumes "finite A" and "finite B"
|
haftmann@35718
|
1550 |
assumes "A \<inter> B = {}"
|
haftmann@35718
|
1551 |
shows "F (A \<union> B) = F A * F B"
|
haftmann@35817
|
1552 |
using assms by (simp add: union_inter_neutral)
|
haftmann@35718
|
1553 |
|
haftmann@35715
|
1554 |
end
|
haftmann@35718
|
1555 |
|
haftmann@35817
|
1556 |
|
haftmann@35817
|
1557 |
subsubsection {* The image case with flexible function *}
|
haftmann@35817
|
1558 |
|
haftmann@35718
|
1559 |
locale folding_image = comm_monoid +
|
haftmann@35718
|
1560 |
fixes F :: "('b \<Rightarrow> 'a) \<Rightarrow> 'b set \<Rightarrow> 'a"
|
haftmann@35718
|
1561 |
assumes eq_fold: "\<And>g. finite A \<Longrightarrow> F g A = fold_image f g 1 A"
|
haftmann@35718
|
1562 |
|
haftmann@35718
|
1563 |
sublocale folding_image < folding_image_simple "op *" 1 g "F g" proof
|
haftmann@35718
|
1564 |
qed (fact eq_fold)
|
haftmann@35718
|
1565 |
|
haftmann@35718
|
1566 |
context folding_image
|
haftmann@35718
|
1567 |
begin
|
haftmann@35718
|
1568 |
|
haftmann@35817
|
1569 |
lemma reindex: (* FIXME polymorhism *)
|
haftmann@35718
|
1570 |
assumes "finite A" and "inj_on h A"
|
haftmann@35718
|
1571 |
shows "F g (h ` A) = F (g \<circ> h) A"
|
haftmann@35718
|
1572 |
using assms by (induct A) auto
|
haftmann@35718
|
1573 |
|
haftmann@35718
|
1574 |
lemma cong:
|
haftmann@35718
|
1575 |
assumes "finite A" and "\<And>x. x \<in> A \<Longrightarrow> g x = h x"
|
haftmann@35718
|
1576 |
shows "F g A = F h A"
|
haftmann@35718
|
1577 |
proof -
|
haftmann@35718
|
1578 |
from assms have "ALL C. C <= A --> (ALL x:C. g x = h x) --> F g C = F h C"
|
haftmann@35718
|
1579 |
apply - apply (erule finite_induct) apply simp
|
haftmann@35718
|
1580 |
apply (simp add: subset_insert_iff, clarify)
|
haftmann@35718
|
1581 |
apply (subgoal_tac "finite C")
|
haftmann@35718
|
1582 |
prefer 2 apply (blast dest: finite_subset [COMP swap_prems_rl])
|
haftmann@35718
|
1583 |
apply (subgoal_tac "C = insert x (C - {x})")
|
haftmann@35718
|
1584 |
prefer 2 apply blast
|
haftmann@35718
|
1585 |
apply (erule ssubst)
|
haftmann@35718
|
1586 |
apply (drule spec)
|
haftmann@35718
|
1587 |
apply (erule (1) notE impE)
|
haftmann@35718
|
1588 |
apply (simp add: Ball_def del: insert_Diff_single)
|
haftmann@35718
|
1589 |
done
|
haftmann@35718
|
1590 |
with assms show ?thesis by simp
|
haftmann@35718
|
1591 |
qed
|
haftmann@35718
|
1592 |
|
haftmann@35718
|
1593 |
lemma UNION_disjoint:
|
haftmann@35718
|
1594 |
assumes "finite I" and "\<forall>i\<in>I. finite (A i)"
|
haftmann@35718
|
1595 |
and "\<forall>i\<in>I. \<forall>j\<in>I. i \<noteq> j \<longrightarrow> A i \<inter> A j = {}"
|
haftmann@35718
|
1596 |
shows "F g (UNION I A) = F (F g \<circ> A) I"
|
haftmann@35718
|
1597 |
apply (insert assms)
|
haftmann@35718
|
1598 |
apply (induct set: finite, simp, atomize)
|
haftmann@35718
|
1599 |
apply (subgoal_tac "\<forall>i\<in>Fa. x \<noteq> i")
|
haftmann@35718
|
1600 |
prefer 2 apply blast
|
haftmann@35718
|
1601 |
apply (subgoal_tac "A x Int UNION Fa A = {}")
|
haftmann@35718
|
1602 |
prefer 2 apply blast
|
haftmann@35718
|
1603 |
apply (simp add: union_disjoint)
|
haftmann@35718
|
1604 |
done
|
haftmann@35718
|
1605 |
|
haftmann@35718
|
1606 |
lemma distrib:
|
haftmann@35718
|
1607 |
assumes "finite A"
|
haftmann@35718
|
1608 |
shows "F (\<lambda>x. g x * h x) A = F g A * F h A"
|
haftmann@35718
|
1609 |
using assms by (rule finite_induct) (simp_all add: assoc commute left_commute)
|
haftmann@35718
|
1610 |
|
haftmann@35718
|
1611 |
lemma related:
|
haftmann@35718
|
1612 |
assumes Re: "R 1 1"
|
haftmann@35718
|
1613 |
and Rop: "\<forall>x1 y1 x2 y2. R x1 x2 \<and> R y1 y2 \<longrightarrow> R (x1 * y1) (x2 * y2)"
|
haftmann@35718
|
1614 |
and fS: "finite S" and Rfg: "\<forall>x\<in>S. R (h x) (g x)"
|
haftmann@35718
|
1615 |
shows "R (F h S) (F g S)"
|
haftmann@35718
|
1616 |
using fS by (rule finite_subset_induct) (insert assms, auto)
|
haftmann@35718
|
1617 |
|
haftmann@35718
|
1618 |
lemma eq_general:
|
haftmann@35718
|
1619 |
assumes fS: "finite S"
|
haftmann@35718
|
1620 |
and h: "\<forall>y\<in>S'. \<exists>!x. x \<in> S \<and> h x = y"
|
haftmann@35718
|
1621 |
and f12: "\<forall>x\<in>S. h x \<in> S' \<and> f2 (h x) = f1 x"
|
haftmann@35718
|
1622 |
shows "F f1 S = F f2 S'"
|
haftmann@35718
|
1623 |
proof-
|
haftmann@35718
|
1624 |
from h f12 have hS: "h ` S = S'" by blast
|
haftmann@35718
|
1625 |
{fix x y assume H: "x \<in> S" "y \<in> S" "h x = h y"
|
haftmann@35718
|
1626 |
from f12 h H have "x = y" by auto }
|
haftmann@35718
|
1627 |
hence hinj: "inj_on h S" unfolding inj_on_def Ex1_def by blast
|
haftmann@35718
|
1628 |
from f12 have th: "\<And>x. x \<in> S \<Longrightarrow> (f2 \<circ> h) x = f1 x" by auto
|
haftmann@35718
|
1629 |
from hS have "F f2 S' = F f2 (h ` S)" by simp
|
haftmann@35718
|
1630 |
also have "\<dots> = F (f2 o h) S" using reindex [OF fS hinj, of f2] .
|
haftmann@35718
|
1631 |
also have "\<dots> = F f1 S " using th cong [OF fS, of "f2 o h" f1]
|
haftmann@35718
|
1632 |
by blast
|
haftmann@35718
|
1633 |
finally show ?thesis ..
|
haftmann@35718
|
1634 |
qed
|
haftmann@35718
|
1635 |
|
haftmann@35718
|
1636 |
lemma eq_general_inverses:
|
haftmann@35718
|
1637 |
assumes fS: "finite S"
|
haftmann@35718
|
1638 |
and kh: "\<And>y. y \<in> T \<Longrightarrow> k y \<in> S \<and> h (k y) = y"
|
haftmann@35718
|
1639 |
and hk: "\<And>x. x \<in> S \<Longrightarrow> h x \<in> T \<and> k (h x) = x \<and> g (h x) = j x"
|
haftmann@35718
|
1640 |
shows "F j S = F g T"
|
haftmann@35718
|
1641 |
(* metis solves it, but not yet available here *)
|
haftmann@35718
|
1642 |
apply (rule eq_general [OF fS, of T h g j])
|
haftmann@35718
|
1643 |
apply (rule ballI)
|
haftmann@35718
|
1644 |
apply (frule kh)
|
haftmann@35718
|
1645 |
apply (rule ex1I[])
|
haftmann@35718
|
1646 |
apply blast
|
haftmann@35718
|
1647 |
apply clarsimp
|
haftmann@35718
|
1648 |
apply (drule hk) apply simp
|
haftmann@35718
|
1649 |
apply (rule sym)
|
haftmann@35718
|
1650 |
apply (erule conjunct1[OF conjunct2[OF hk]])
|
haftmann@35718
|
1651 |
apply (rule ballI)
|
haftmann@35718
|
1652 |
apply (drule hk)
|
haftmann@35718
|
1653 |
apply blast
|
haftmann@35718
|
1654 |
done
|
haftmann@35718
|
1655 |
|
haftmann@35718
|
1656 |
end
|
haftmann@35718
|
1657 |
|
haftmann@35817
|
1658 |
|
haftmann@35817
|
1659 |
subsubsection {* The image case with fixed function and idempotency *}
|
haftmann@35817
|
1660 |
|
haftmann@35817
|
1661 |
locale folding_image_simple_idem = folding_image_simple +
|
haftmann@35817
|
1662 |
assumes idem: "x * x = x"
|
haftmann@35817
|
1663 |
|
haftmann@35817
|
1664 |
sublocale folding_image_simple_idem < semilattice proof
|
haftmann@35817
|
1665 |
qed (fact idem)
|
haftmann@35817
|
1666 |
|
haftmann@35817
|
1667 |
context folding_image_simple_idem
|
haftmann@35817
|
1668 |
begin
|
haftmann@35817
|
1669 |
|
haftmann@35817
|
1670 |
lemma in_idem:
|
haftmann@35817
|
1671 |
assumes "finite A" and "x \<in> A"
|
haftmann@35817
|
1672 |
shows "g x * F A = F A"
|
haftmann@35817
|
1673 |
using assms by (induct A) (auto simp add: left_commute)
|
haftmann@35817
|
1674 |
|
haftmann@35817
|
1675 |
lemma subset_idem:
|
haftmann@35817
|
1676 |
assumes "finite A" and "B \<subseteq> A"
|
haftmann@35817
|
1677 |
shows "F B * F A = F A"
|
haftmann@35817
|
1678 |
proof -
|
haftmann@35817
|
1679 |
from assms have "finite B" by (blast dest: finite_subset)
|
haftmann@35817
|
1680 |
then show ?thesis using `B \<subseteq> A` by (induct B)
|
haftmann@35817
|
1681 |
(auto simp add: assoc in_idem `finite A`)
|
haftmann@35817
|
1682 |
qed
|
haftmann@35817
|
1683 |
|
haftmann@35817
|
1684 |
declare insert [simp del]
|
haftmann@35817
|
1685 |
|
haftmann@35817
|
1686 |
lemma insert_idem [simp]:
|
haftmann@35817
|
1687 |
assumes "finite A"
|
haftmann@35817
|
1688 |
shows "F (insert x A) = g x * F A"
|
haftmann@35817
|
1689 |
using assms by (cases "x \<in> A") (simp_all add: insert in_idem insert_absorb)
|
haftmann@35817
|
1690 |
|
haftmann@35817
|
1691 |
lemma union_idem:
|
haftmann@35817
|
1692 |
assumes "finite A" and "finite B"
|
haftmann@35817
|
1693 |
shows "F (A \<union> B) = F A * F B"
|
haftmann@35817
|
1694 |
proof -
|
haftmann@35817
|
1695 |
from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
|
haftmann@35817
|
1696 |
then have "F (A \<inter> B) * F (A \<union> B) = F (A \<union> B)" by (rule subset_idem)
|
haftmann@35817
|
1697 |
with assms show ?thesis by (simp add: union_inter [of A B, symmetric] commute)
|
haftmann@35817
|
1698 |
qed
|
haftmann@35817
|
1699 |
|
haftmann@35817
|
1700 |
end
|
haftmann@35817
|
1701 |
|
haftmann@35817
|
1702 |
|
haftmann@35817
|
1703 |
subsubsection {* The image case with flexible function and idempotency *}
|
haftmann@35817
|
1704 |
|
haftmann@35817
|
1705 |
locale folding_image_idem = folding_image +
|
haftmann@35817
|
1706 |
assumes idem: "x * x = x"
|
haftmann@35817
|
1707 |
|
haftmann@35817
|
1708 |
sublocale folding_image_idem < folding_image_simple_idem "op *" 1 g "F g" proof
|
haftmann@35817
|
1709 |
qed (fact idem)
|
haftmann@35817
|
1710 |
|
haftmann@35817
|
1711 |
|
haftmann@35817
|
1712 |
subsubsection {* The neutral-less case *}
|
haftmann@35817
|
1713 |
|
haftmann@35817
|
1714 |
locale folding_one = abel_semigroup +
|
haftmann@35817
|
1715 |
fixes F :: "'a set \<Rightarrow> 'a"
|
haftmann@35817
|
1716 |
assumes eq_fold: "finite A \<Longrightarrow> F A = fold1 f A"
|
haftmann@35817
|
1717 |
begin
|
haftmann@35817
|
1718 |
|
haftmann@35817
|
1719 |
lemma singleton [simp]:
|
haftmann@35817
|
1720 |
"F {x} = x"
|
haftmann@35817
|
1721 |
by (simp add: eq_fold)
|
haftmann@35817
|
1722 |
|
haftmann@35817
|
1723 |
lemma eq_fold':
|
haftmann@35817
|
1724 |
assumes "finite A" and "x \<notin> A"
|
haftmann@35817
|
1725 |
shows "F (insert x A) = fold (op *) x A"
|
haftmann@35817
|
1726 |
proof -
|
haftmann@35817
|
1727 |
interpret ab_semigroup_mult "op *" proof qed (simp_all add: ac_simps)
|
haftmann@35817
|
1728 |
with assms show ?thesis by (simp add: eq_fold fold1_eq_fold)
|
haftmann@35817
|
1729 |
qed
|
haftmann@35817
|
1730 |
|
haftmann@35817
|
1731 |
lemma insert [simp]:
|
haftmann@36625
|
1732 |
assumes "finite A" and "x \<notin> A" and "A \<noteq> {}"
|
haftmann@36625
|
1733 |
shows "F (insert x A) = x * F A"
|
haftmann@36625
|
1734 |
proof -
|
haftmann@36625
|
1735 |
from `A \<noteq> {}` obtain b where "b \<in> A" by blast
|
haftmann@35817
|
1736 |
then obtain B where *: "A = insert b B" "b \<notin> B" by (blast dest: mk_disjoint_insert)
|
haftmann@35817
|
1737 |
with `finite A` have "finite B" by simp
|
haftmann@35817
|
1738 |
interpret fold: folding "op *" "\<lambda>a b. fold (op *) b a" proof
|
nipkow@39535
|
1739 |
qed (simp_all add: fun_eq_iff ac_simps)
|
nipkow@39535
|
1740 |
thm fold.commute_comp' [of B b, simplified fun_eq_iff, simplified]
|
haftmann@35817
|
1741 |
from `finite B` fold.commute_comp' [of B x]
|
haftmann@35817
|
1742 |
have "op * x \<circ> (\<lambda>b. fold op * b B) = (\<lambda>b. fold op * b B) \<circ> op * x" by simp
|
nipkow@39535
|
1743 |
then have A: "x * fold op * b B = fold op * (b * x) B" by (simp add: fun_eq_iff commute)
|
haftmann@35817
|
1744 |
from `finite B` * fold.insert [of B b]
|
haftmann@35817
|
1745 |
have "(\<lambda>x. fold op * x (insert b B)) = (\<lambda>x. fold op * x B) \<circ> op * b" by simp
|
nipkow@39535
|
1746 |
then have B: "fold op * x (insert b B) = fold op * (b * x) B" by (simp add: fun_eq_iff)
|
haftmann@35817
|
1747 |
from A B assms * show ?thesis by (simp add: eq_fold' del: fold.insert)
|
haftmann@35817
|
1748 |
qed
|
haftmann@35817
|
1749 |
|
haftmann@35817
|
1750 |
lemma remove:
|
haftmann@35817
|
1751 |
assumes "finite A" and "x \<in> A"
|
haftmann@35817
|
1752 |
shows "F A = (if A - {x} = {} then x else x * F (A - {x}))"
|
haftmann@35817
|
1753 |
proof -
|
haftmann@35817
|
1754 |
from assms obtain B where "A = insert x B" and "x \<notin> B" by (blast dest: mk_disjoint_insert)
|
haftmann@35817
|
1755 |
with assms show ?thesis by simp
|
haftmann@35817
|
1756 |
qed
|
haftmann@35817
|
1757 |
|
haftmann@35817
|
1758 |
lemma insert_remove:
|
haftmann@35817
|
1759 |
assumes "finite A"
|
haftmann@35817
|
1760 |
shows "F (insert x A) = (if A - {x} = {} then x else x * F (A - {x}))"
|
haftmann@35817
|
1761 |
using assms by (cases "x \<in> A") (simp_all add: insert_absorb remove)
|
haftmann@35817
|
1762 |
|
haftmann@35817
|
1763 |
lemma union_disjoint:
|
haftmann@35817
|
1764 |
assumes "finite A" "A \<noteq> {}" and "finite B" "B \<noteq> {}" and "A \<inter> B = {}"
|
haftmann@35817
|
1765 |
shows "F (A \<union> B) = F A * F B"
|
haftmann@35817
|
1766 |
using assms by (induct A rule: finite_ne_induct) (simp_all add: ac_simps)
|
haftmann@35817
|
1767 |
|
haftmann@35817
|
1768 |
lemma union_inter:
|
haftmann@35817
|
1769 |
assumes "finite A" and "finite B" and "A \<inter> B \<noteq> {}"
|
haftmann@35817
|
1770 |
shows "F (A \<union> B) * F (A \<inter> B) = F A * F B"
|
haftmann@35817
|
1771 |
proof -
|
haftmann@35817
|
1772 |
from assms have "A \<noteq> {}" and "B \<noteq> {}" by auto
|
haftmann@35817
|
1773 |
from `finite A` `A \<noteq> {}` `A \<inter> B \<noteq> {}` show ?thesis proof (induct A rule: finite_ne_induct)
|
haftmann@35817
|
1774 |
case (singleton x) then show ?case by (simp add: insert_absorb ac_simps)
|
haftmann@35817
|
1775 |
next
|
haftmann@35817
|
1776 |
case (insert x A) show ?case proof (cases "x \<in> B")
|
haftmann@35817
|
1777 |
case True then have "B \<noteq> {}" by auto
|
haftmann@35817
|
1778 |
with insert True `finite B` show ?thesis by (cases "A \<inter> B = {}")
|
haftmann@35817
|
1779 |
(simp_all add: insert_absorb ac_simps union_disjoint)
|
haftmann@35817
|
1780 |
next
|
haftmann@35817
|
1781 |
case False with insert have "F (A \<union> B) * F (A \<inter> B) = F A * F B" by simp
|
haftmann@35817
|
1782 |
moreover from False `finite B` insert have "finite (A \<union> B)" "x \<notin> A \<union> B" "A \<union> B \<noteq> {}"
|
haftmann@35817
|
1783 |
by auto
|
haftmann@35817
|
1784 |
ultimately show ?thesis using False `finite A` `x \<notin> A` `A \<noteq> {}` by (simp add: assoc)
|
haftmann@35817
|
1785 |
qed
|
haftmann@35817
|
1786 |
qed
|
haftmann@35817
|
1787 |
qed
|
haftmann@35817
|
1788 |
|
haftmann@35817
|
1789 |
lemma closed:
|
haftmann@35817
|
1790 |
assumes "finite A" "A \<noteq> {}" and elem: "\<And>x y. x * y \<in> {x, y}"
|
haftmann@35817
|
1791 |
shows "F A \<in> A"
|
haftmann@35817
|
1792 |
using `finite A` `A \<noteq> {}` proof (induct rule: finite_ne_induct)
|
haftmann@35817
|
1793 |
case singleton then show ?case by simp
|
haftmann@35817
|
1794 |
next
|
haftmann@35817
|
1795 |
case insert with elem show ?case by force
|
haftmann@35817
|
1796 |
qed
|
haftmann@35817
|
1797 |
|
haftmann@35817
|
1798 |
end
|
haftmann@35817
|
1799 |
|
haftmann@35817
|
1800 |
|
haftmann@35817
|
1801 |
subsubsection {* The neutral-less case with idempotency *}
|
haftmann@35817
|
1802 |
|
haftmann@35817
|
1803 |
locale folding_one_idem = folding_one +
|
haftmann@35817
|
1804 |
assumes idem: "x * x = x"
|
haftmann@35817
|
1805 |
|
haftmann@35817
|
1806 |
sublocale folding_one_idem < semilattice proof
|
haftmann@35817
|
1807 |
qed (fact idem)
|
haftmann@35817
|
1808 |
|
haftmann@35817
|
1809 |
context folding_one_idem
|
haftmann@35817
|
1810 |
begin
|
haftmann@35817
|
1811 |
|
haftmann@35817
|
1812 |
lemma in_idem:
|
haftmann@35817
|
1813 |
assumes "finite A" and "x \<in> A"
|
haftmann@35817
|
1814 |
shows "x * F A = F A"
|
haftmann@35817
|
1815 |
proof -
|
haftmann@35817
|
1816 |
from assms have "A \<noteq> {}" by auto
|
haftmann@35817
|
1817 |
with `finite A` show ?thesis using `x \<in> A` by (induct A rule: finite_ne_induct) (auto simp add: ac_simps)
|
haftmann@35817
|
1818 |
qed
|
haftmann@35817
|
1819 |
|
haftmann@35817
|
1820 |
lemma subset_idem:
|
haftmann@35817
|
1821 |
assumes "finite A" "B \<noteq> {}" and "B \<subseteq> A"
|
haftmann@35817
|
1822 |
shows "F B * F A = F A"
|
haftmann@35817
|
1823 |
proof -
|
haftmann@35817
|
1824 |
from assms have "finite B" by (blast dest: finite_subset)
|
haftmann@35817
|
1825 |
then show ?thesis using `B \<noteq> {}` `B \<subseteq> A` by (induct B rule: finite_ne_induct)
|
haftmann@35817
|
1826 |
(simp_all add: assoc in_idem `finite A`)
|
haftmann@35817
|
1827 |
qed
|
haftmann@35817
|
1828 |
|
haftmann@35817
|
1829 |
lemma eq_fold_idem':
|
haftmann@35817
|
1830 |
assumes "finite A"
|
haftmann@35817
|
1831 |
shows "F (insert a A) = fold (op *) a A"
|
haftmann@35817
|
1832 |
proof -
|
haftmann@35817
|
1833 |
interpret ab_semigroup_idem_mult "op *" proof qed (simp_all add: ac_simps)
|
haftmann@35817
|
1834 |
with assms show ?thesis by (simp add: eq_fold fold1_eq_fold_idem)
|
haftmann@35817
|
1835 |
qed
|
haftmann@35817
|
1836 |
|
haftmann@35817
|
1837 |
lemma insert_idem [simp]:
|
haftmann@36625
|
1838 |
assumes "finite A" and "A \<noteq> {}"
|
haftmann@36625
|
1839 |
shows "F (insert x A) = x * F A"
|
haftmann@35817
|
1840 |
proof (cases "x \<in> A")
|
haftmann@36625
|
1841 |
case False from `finite A` `x \<notin> A` `A \<noteq> {}` show ?thesis by (rule insert)
|
haftmann@35817
|
1842 |
next
|
haftmann@36625
|
1843 |
case True
|
haftmann@36625
|
1844 |
from `finite A` `A \<noteq> {}` show ?thesis by (simp add: in_idem insert_absorb True)
|
haftmann@35817
|
1845 |
qed
|
haftmann@35817
|
1846 |
|
haftmann@35817
|
1847 |
lemma union_idem:
|
haftmann@35817
|
1848 |
assumes "finite A" "A \<noteq> {}" and "finite B" "B \<noteq> {}"
|
haftmann@35817
|
1849 |
shows "F (A \<union> B) = F A * F B"
|
haftmann@35817
|
1850 |
proof (cases "A \<inter> B = {}")
|
haftmann@35817
|
1851 |
case True with assms show ?thesis by (simp add: union_disjoint)
|
haftmann@35817
|
1852 |
next
|
haftmann@35817
|
1853 |
case False
|
haftmann@35817
|
1854 |
from assms have "finite (A \<union> B)" and "A \<inter> B \<subseteq> A \<union> B" by auto
|
haftmann@35817
|
1855 |
with False have "F (A \<inter> B) * F (A \<union> B) = F (A \<union> B)" by (auto intro: subset_idem)
|
haftmann@35817
|
1856 |
with assms False show ?thesis by (simp add: union_inter [of A B, symmetric] commute)
|
haftmann@35817
|
1857 |
qed
|
haftmann@35817
|
1858 |
|
haftmann@35817
|
1859 |
lemma hom_commute:
|
haftmann@35817
|
1860 |
assumes hom: "\<And>x y. h (x * y) = h x * h y"
|
haftmann@35817
|
1861 |
and N: "finite N" "N \<noteq> {}" shows "h (F N) = F (h ` N)"
|
haftmann@35817
|
1862 |
using N proof (induct rule: finite_ne_induct)
|
haftmann@35817
|
1863 |
case singleton thus ?case by simp
|
haftmann@35817
|
1864 |
next
|
haftmann@35817
|
1865 |
case (insert n N)
|
haftmann@35817
|
1866 |
then have "h (F (insert n N)) = h (n * F N)" by simp
|
haftmann@35817
|
1867 |
also have "\<dots> = h n * h (F N)" by (rule hom)
|
haftmann@35817
|
1868 |
also have "h (F N) = F (h ` N)" by(rule insert)
|
haftmann@35817
|
1869 |
also have "h n * \<dots> = F (insert (h n) (h ` N))"
|
haftmann@35817
|
1870 |
using insert by(simp)
|
haftmann@35817
|
1871 |
also have "insert (h n) (h ` N) = h ` insert n N" by simp
|
haftmann@35817
|
1872 |
finally show ?case .
|
haftmann@35817
|
1873 |
qed
|
haftmann@35817
|
1874 |
|
haftmann@35817
|
1875 |
end
|
haftmann@35817
|
1876 |
|
haftmann@35796
|
1877 |
notation times (infixl "*" 70)
|
haftmann@35796
|
1878 |
notation Groups.one ("1")
|
haftmann@35718
|
1879 |
|
haftmann@35718
|
1880 |
|
haftmann@35718
|
1881 |
subsection {* Finite cardinality *}
|
haftmann@35718
|
1882 |
|
haftmann@35718
|
1883 |
text {* This definition, although traditional, is ugly to work with:
|
haftmann@35718
|
1884 |
@{text "card A == LEAST n. EX f. A = {f i | i. i < n}"}.
|
haftmann@35718
|
1885 |
But now that we have @{text fold_image} things are easy:
|
haftmann@35718
|
1886 |
*}
|
haftmann@35718
|
1887 |
|
haftmann@35718
|
1888 |
definition card :: "'a set \<Rightarrow> nat" where
|
haftmann@35718
|
1889 |
"card A = (if finite A then fold_image (op +) (\<lambda>x. 1) 0 A else 0)"
|
haftmann@35718
|
1890 |
|
haftmann@37770
|
1891 |
interpretation card: folding_image_simple "op +" 0 "\<lambda>x. 1" card proof
|
haftmann@35718
|
1892 |
qed (simp add: card_def)
|
haftmann@35718
|
1893 |
|
haftmann@35718
|
1894 |
lemma card_infinite [simp]:
|
haftmann@35718
|
1895 |
"\<not> finite A \<Longrightarrow> card A = 0"
|
haftmann@35718
|
1896 |
by (simp add: card_def)
|
haftmann@35718
|
1897 |
|
haftmann@35718
|
1898 |
lemma card_empty:
|
haftmann@35718
|
1899 |
"card {} = 0"
|
haftmann@35718
|
1900 |
by (fact card.empty)
|
haftmann@35718
|
1901 |
|
haftmann@35718
|
1902 |
lemma card_insert_disjoint:
|
haftmann@35718
|
1903 |
"finite A ==> x \<notin> A ==> card (insert x A) = Suc (card A)"
|
haftmann@35718
|
1904 |
by simp
|
haftmann@35718
|
1905 |
|
haftmann@35718
|
1906 |
lemma card_insert_if:
|
haftmann@35718
|
1907 |
"finite A ==> card (insert x A) = (if x \<in> A then card A else Suc (card A))"
|
haftmann@35718
|
1908 |
by auto (simp add: card.insert_remove card.remove)
|
haftmann@35718
|
1909 |
|
haftmann@35718
|
1910 |
lemma card_ge_0_finite:
|
haftmann@35718
|
1911 |
"card A > 0 \<Longrightarrow> finite A"
|
haftmann@35718
|
1912 |
by (rule ccontr) simp
|
haftmann@35718
|
1913 |
|
blanchet@35828
|
1914 |
lemma card_0_eq [simp, no_atp]:
|
haftmann@35718
|
1915 |
"finite A \<Longrightarrow> card A = 0 \<longleftrightarrow> A = {}"
|
haftmann@35718
|
1916 |
by (auto dest: mk_disjoint_insert)
|
haftmann@35718
|
1917 |
|
haftmann@35718
|
1918 |
lemma finite_UNIV_card_ge_0:
|
haftmann@35718
|
1919 |
"finite (UNIV :: 'a set) \<Longrightarrow> card (UNIV :: 'a set) > 0"
|
haftmann@35718
|
1920 |
by (rule ccontr) simp
|
haftmann@35718
|
1921 |
|
haftmann@35718
|
1922 |
lemma card_eq_0_iff:
|
haftmann@35718
|
1923 |
"card A = 0 \<longleftrightarrow> A = {} \<or> \<not> finite A"
|
haftmann@35718
|
1924 |
by auto
|
haftmann@35718
|
1925 |
|
haftmann@35718
|
1926 |
lemma card_gt_0_iff:
|
haftmann@35718
|
1927 |
"0 < card A \<longleftrightarrow> A \<noteq> {} \<and> finite A"
|
haftmann@35718
|
1928 |
by (simp add: neq0_conv [symmetric] card_eq_0_iff)
|
haftmann@35718
|
1929 |
|
haftmann@35718
|
1930 |
lemma card_Suc_Diff1: "finite A ==> x: A ==> Suc (card (A - {x})) = card A"
|
haftmann@35718
|
1931 |
apply(rule_tac t = A in insert_Diff [THEN subst], assumption)
|
haftmann@35718
|
1932 |
apply(simp del:insert_Diff_single)
|
haftmann@35718
|
1933 |
done
|
haftmann@35718
|
1934 |
|
haftmann@35718
|
1935 |
lemma card_Diff_singleton:
|
haftmann@35718
|
1936 |
"finite A ==> x: A ==> card (A - {x}) = card A - 1"
|
haftmann@35718
|
1937 |
by (simp add: card_Suc_Diff1 [symmetric])
|
haftmann@35718
|
1938 |
|
haftmann@35718
|
1939 |
lemma card_Diff_singleton_if:
|
haftmann@35718
|
1940 |
"finite A ==> card (A-{x}) = (if x : A then card A - 1 else card A)"
|
haftmann@35718
|
1941 |
by (simp add: card_Diff_singleton)
|
haftmann@35718
|
1942 |
|
haftmann@35718
|
1943 |
lemma card_Diff_insert[simp]:
|
haftmann@35718
|
1944 |
assumes "finite A" and "a:A" and "a ~: B"
|
haftmann@35718
|
1945 |
shows "card(A - insert a B) = card(A - B) - 1"
|
haftmann@35718
|
1946 |
proof -
|
haftmann@35718
|
1947 |
have "A - insert a B = (A - B) - {a}" using assms by blast
|
haftmann@35718
|
1948 |
then show ?thesis using assms by(simp add:card_Diff_singleton)
|
haftmann@35718
|
1949 |
qed
|
haftmann@35718
|
1950 |
|
haftmann@35718
|
1951 |
lemma card_insert: "finite A ==> card (insert x A) = Suc (card (A - {x}))"
|
haftmann@35718
|
1952 |
by (simp add: card_insert_if card_Suc_Diff1 del:card_Diff_insert)
|
haftmann@35718
|
1953 |
|
haftmann@35718
|
1954 |
lemma card_insert_le: "finite A ==> card A <= card (insert x A)"
|
haftmann@35718
|
1955 |
by (simp add: card_insert_if)
|
haftmann@35718
|
1956 |
|
haftmann@35718
|
1957 |
lemma card_mono:
|
haftmann@35718
|
1958 |
assumes "finite B" and "A \<subseteq> B"
|
haftmann@35718
|
1959 |
shows "card A \<le> card B"
|
haftmann@35718
|
1960 |
proof -
|
haftmann@35718
|
1961 |
from assms have "finite A" by (auto intro: finite_subset)
|
haftmann@35718
|
1962 |
then show ?thesis using assms proof (induct A arbitrary: B)
|
haftmann@35718
|
1963 |
case empty then show ?case by simp
|
haftmann@35718
|
1964 |
next
|
haftmann@35718
|
1965 |
case (insert x A)
|
haftmann@35718
|
1966 |
then have "x \<in> B" by simp
|
haftmann@35718
|
1967 |
from insert have "A \<subseteq> B - {x}" and "finite (B - {x})" by auto
|
haftmann@35718
|
1968 |
with insert.hyps have "card A \<le> card (B - {x})" by auto
|
haftmann@35718
|
1969 |
with `finite A` `x \<notin> A` `finite B` `x \<in> B` show ?case by simp (simp only: card.remove)
|
haftmann@35718
|
1970 |
qed
|
haftmann@35718
|
1971 |
qed
|
haftmann@35718
|
1972 |
|
haftmann@35718
|
1973 |
lemma card_seteq: "finite B ==> (!!A. A <= B ==> card B <= card A ==> A = B)"
|
haftmann@35718
|
1974 |
apply (induct set: finite, simp, clarify)
|
haftmann@35718
|
1975 |
apply (subgoal_tac "finite A & A - {x} <= F")
|
haftmann@35718
|
1976 |
prefer 2 apply (blast intro: finite_subset, atomize)
|
haftmann@35718
|
1977 |
apply (drule_tac x = "A - {x}" in spec)
|
haftmann@35718
|
1978 |
apply (simp add: card_Diff_singleton_if split add: split_if_asm)
|
haftmann@35718
|
1979 |
apply (case_tac "card A", auto)
|
haftmann@35718
|
1980 |
done
|
haftmann@35718
|
1981 |
|
haftmann@35718
|
1982 |
lemma psubset_card_mono: "finite B ==> A < B ==> card A < card B"
|
haftmann@35718
|
1983 |
apply (simp add: psubset_eq linorder_not_le [symmetric])
|
haftmann@35718
|
1984 |
apply (blast dest: card_seteq)
|
haftmann@35718
|
1985 |
done
|
haftmann@35718
|
1986 |
|
haftmann@35718
|
1987 |
lemma card_Un_Int: "finite A ==> finite B
|
haftmann@35718
|
1988 |
==> card A + card B = card (A Un B) + card (A Int B)"
|
haftmann@35817
|
1989 |
by (fact card.union_inter [symmetric])
|
haftmann@35718
|
1990 |
|
haftmann@35718
|
1991 |
lemma card_Un_disjoint: "finite A ==> finite B
|
haftmann@35718
|
1992 |
==> A Int B = {} ==> card (A Un B) = card A + card B"
|
haftmann@35718
|
1993 |
by (fact card.union_disjoint)
|
haftmann@35718
|
1994 |
|
haftmann@35718
|
1995 |
lemma card_Diff_subset:
|
haftmann@35718
|
1996 |
assumes "finite B" and "B \<subseteq> A"
|
haftmann@35718
|
1997 |
shows "card (A - B) = card A - card B"
|
haftmann@35718
|
1998 |
proof (cases "finite A")
|
haftmann@35718
|
1999 |
case False with assms show ?thesis by simp
|
haftmann@35718
|
2000 |
next
|
haftmann@35718
|
2001 |
case True with assms show ?thesis by (induct B arbitrary: A) simp_all
|
haftmann@35718
|
2002 |
qed
|
haftmann@35718
|
2003 |
|
haftmann@35718
|
2004 |
lemma card_Diff_subset_Int:
|
haftmann@35718
|
2005 |
assumes AB: "finite (A \<inter> B)" shows "card (A - B) = card A - card (A \<inter> B)"
|
haftmann@35718
|
2006 |
proof -
|
haftmann@35718
|
2007 |
have "A - B = A - A \<inter> B" by auto
|
haftmann@35718
|
2008 |
thus ?thesis
|
haftmann@35718
|
2009 |
by (simp add: card_Diff_subset AB)
|
haftmann@35718
|
2010 |
qed
|
haftmann@35718
|
2011 |
|
haftmann@35718
|
2012 |
lemma card_Diff1_less: "finite A ==> x: A ==> card (A - {x}) < card A"
|
haftmann@35718
|
2013 |
apply (rule Suc_less_SucD)
|
haftmann@35718
|
2014 |
apply (simp add: card_Suc_Diff1 del:card_Diff_insert)
|
haftmann@35718
|
2015 |
done
|
haftmann@35718
|
2016 |
|
haftmann@35718
|
2017 |
lemma card_Diff2_less:
|
haftmann@35718
|
2018 |
"finite A ==> x: A ==> y: A ==> card (A - {x} - {y}) < card A"
|
haftmann@35718
|
2019 |
apply (case_tac "x = y")
|
haftmann@35718
|
2020 |
apply (simp add: card_Diff1_less del:card_Diff_insert)
|
haftmann@35718
|
2021 |
apply (rule less_trans)
|
haftmann@35718
|
2022 |
prefer 2 apply (auto intro!: card_Diff1_less simp del:card_Diff_insert)
|
haftmann@35718
|
2023 |
done
|
haftmann@35718
|
2024 |
|
haftmann@35718
|
2025 |
lemma card_Diff1_le: "finite A ==> card (A - {x}) <= card A"
|
haftmann@35718
|
2026 |
apply (case_tac "x : A")
|
haftmann@35718
|
2027 |
apply (simp_all add: card_Diff1_less less_imp_le)
|
haftmann@35718
|
2028 |
done
|
haftmann@35718
|
2029 |
|
haftmann@35718
|
2030 |
lemma card_psubset: "finite B ==> A \<subseteq> B ==> card A < card B ==> A < B"
|
haftmann@35718
|
2031 |
by (erule psubsetI, blast)
|
haftmann@35718
|
2032 |
|
haftmann@35718
|
2033 |
lemma insert_partition:
|
haftmann@35718
|
2034 |
"\<lbrakk> x \<notin> F; \<forall>c1 \<in> insert x F. \<forall>c2 \<in> insert x F. c1 \<noteq> c2 \<longrightarrow> c1 \<inter> c2 = {} \<rbrakk>
|
haftmann@35718
|
2035 |
\<Longrightarrow> x \<inter> \<Union> F = {}"
|
haftmann@35718
|
2036 |
by auto
|
haftmann@35718
|
2037 |
|
haftmann@35718
|
2038 |
lemma finite_psubset_induct[consumes 1, case_names psubset]:
|
urbanc@36079
|
2039 |
assumes fin: "finite A"
|
urbanc@36079
|
2040 |
and major: "\<And>A. finite A \<Longrightarrow> (\<And>B. B \<subset> A \<Longrightarrow> P B) \<Longrightarrow> P A"
|
urbanc@36079
|
2041 |
shows "P A"
|
urbanc@36079
|
2042 |
using fin
|
urbanc@36079
|
2043 |
proof (induct A taking: card rule: measure_induct_rule)
|
haftmann@35718
|
2044 |
case (less A)
|
urbanc@36079
|
2045 |
have fin: "finite A" by fact
|
urbanc@36079
|
2046 |
have ih: "\<And>B. \<lbrakk>card B < card A; finite B\<rbrakk> \<Longrightarrow> P B" by fact
|
urbanc@36079
|
2047 |
{ fix B
|
urbanc@36079
|
2048 |
assume asm: "B \<subset> A"
|
urbanc@36079
|
2049 |
from asm have "card B < card A" using psubset_card_mono fin by blast
|
urbanc@36079
|
2050 |
moreover
|
urbanc@36079
|
2051 |
from asm have "B \<subseteq> A" by auto
|
urbanc@36079
|
2052 |
then have "finite B" using fin finite_subset by blast
|
urbanc@36079
|
2053 |
ultimately
|
urbanc@36079
|
2054 |
have "P B" using ih by simp
|
urbanc@36079
|
2055 |
}
|
urbanc@36079
|
2056 |
with fin show "P A" using major by blast
|
haftmann@35718
|
2057 |
qed
|
haftmann@35718
|
2058 |
|
haftmann@35718
|
2059 |
text{* main cardinality theorem *}
|
haftmann@35718
|
2060 |
lemma card_partition [rule_format]:
|
haftmann@35718
|
2061 |
"finite C ==>
|
haftmann@35718
|
2062 |
finite (\<Union> C) -->
|
haftmann@35718
|
2063 |
(\<forall>c\<in>C. card c = k) -->
|
haftmann@35718
|
2064 |
(\<forall>c1 \<in> C. \<forall>c2 \<in> C. c1 \<noteq> c2 --> c1 \<inter> c2 = {}) -->
|
haftmann@35718
|
2065 |
k * card(C) = card (\<Union> C)"
|
haftmann@35718
|
2066 |
apply (erule finite_induct, simp)
|
haftmann@35718
|
2067 |
apply (simp add: card_Un_disjoint insert_partition
|
haftmann@35718
|
2068 |
finite_subset [of _ "\<Union> (insert x F)"])
|
haftmann@35718
|
2069 |
done
|
haftmann@35718
|
2070 |
|
haftmann@35718
|
2071 |
lemma card_eq_UNIV_imp_eq_UNIV:
|
haftmann@35718
|
2072 |
assumes fin: "finite (UNIV :: 'a set)"
|
haftmann@35718
|
2073 |
and card: "card A = card (UNIV :: 'a set)"
|
haftmann@35718
|
2074 |
shows "A = (UNIV :: 'a set)"
|
haftmann@35718
|
2075 |
proof
|
haftmann@35718
|
2076 |
show "A \<subseteq> UNIV" by simp
|
haftmann@35718
|
2077 |
show "UNIV \<subseteq> A"
|
haftmann@35718
|
2078 |
proof
|
haftmann@35718
|
2079 |
fix x
|
haftmann@35718
|
2080 |
show "x \<in> A"
|
haftmann@35718
|
2081 |
proof (rule ccontr)
|
haftmann@35718
|
2082 |
assume "x \<notin> A"
|
haftmann@35718
|
2083 |
then have "A \<subset> UNIV" by auto
|
haftmann@35718
|
2084 |
with fin have "card A < card (UNIV :: 'a set)" by (fact psubset_card_mono)
|
haftmann@35718
|
2085 |
with card show False by simp
|
haftmann@35718
|
2086 |
qed
|
haftmann@35718
|
2087 |
qed
|
haftmann@35718
|
2088 |
qed
|
haftmann@35718
|
2089 |
|
haftmann@35718
|
2090 |
text{*The form of a finite set of given cardinality*}
|
haftmann@35718
|
2091 |
|
haftmann@35718
|
2092 |
lemma card_eq_SucD:
|
haftmann@35718
|
2093 |
assumes "card A = Suc k"
|
haftmann@35718
|
2094 |
shows "\<exists>b B. A = insert b B & b \<notin> B & card B = k & (k=0 \<longrightarrow> B={})"
|
haftmann@35718
|
2095 |
proof -
|
haftmann@35718
|
2096 |
have fin: "finite A" using assms by (auto intro: ccontr)
|
haftmann@35718
|
2097 |
moreover have "card A \<noteq> 0" using assms by auto
|
haftmann@35718
|
2098 |
ultimately obtain b where b: "b \<in> A" by auto
|
haftmann@35718
|
2099 |
show ?thesis
|
haftmann@35718
|
2100 |
proof (intro exI conjI)
|
haftmann@35718
|
2101 |
show "A = insert b (A-{b})" using b by blast
|
haftmann@35718
|
2102 |
show "b \<notin> A - {b}" by blast
|
haftmann@35718
|
2103 |
show "card (A - {b}) = k" and "k = 0 \<longrightarrow> A - {b} = {}"
|
haftmann@35718
|
2104 |
using assms b fin by(fastsimp dest:mk_disjoint_insert)+
|
haftmann@35718
|
2105 |
qed
|
haftmann@35718
|
2106 |
qed
|
haftmann@35718
|
2107 |
|
haftmann@35718
|
2108 |
lemma card_Suc_eq:
|
haftmann@35718
|
2109 |
"(card A = Suc k) =
|
haftmann@35718
|
2110 |
(\<exists>b B. A = insert b B & b \<notin> B & card B = k & (k=0 \<longrightarrow> B={}))"
|
haftmann@35718
|
2111 |
apply(rule iffI)
|
haftmann@35718
|
2112 |
apply(erule card_eq_SucD)
|
haftmann@35718
|
2113 |
apply(auto)
|
haftmann@35718
|
2114 |
apply(subst card_insert)
|
haftmann@35718
|
2115 |
apply(auto intro:ccontr)
|
haftmann@35718
|
2116 |
done
|
haftmann@35718
|
2117 |
|
haftmann@35718
|
2118 |
lemma finite_fun_UNIVD2:
|
haftmann@35718
|
2119 |
assumes fin: "finite (UNIV :: ('a \<Rightarrow> 'b) set)"
|
haftmann@35718
|
2120 |
shows "finite (UNIV :: 'b set)"
|
haftmann@35718
|
2121 |
proof -
|
haftmann@35718
|
2122 |
from fin have "finite (range (\<lambda>f :: 'a \<Rightarrow> 'b. f arbitrary))"
|
haftmann@35718
|
2123 |
by(rule finite_imageI)
|
haftmann@35718
|
2124 |
moreover have "UNIV = range (\<lambda>f :: 'a \<Rightarrow> 'b. f arbitrary)"
|
haftmann@35718
|
2125 |
by(rule UNIV_eq_I) auto
|
haftmann@35718
|
2126 |
ultimately show "finite (UNIV :: 'b set)" by simp
|
haftmann@35718
|
2127 |
qed
|
haftmann@35718
|
2128 |
|
haftmann@35718
|
2129 |
lemma card_UNIV_unit: "card (UNIV :: unit set) = 1"
|
haftmann@35718
|
2130 |
unfolding UNIV_unit by simp
|
haftmann@35718
|
2131 |
|
haftmann@35718
|
2132 |
|
haftmann@35718
|
2133 |
subsubsection {* Cardinality of image *}
|
haftmann@35718
|
2134 |
|
haftmann@35718
|
2135 |
lemma card_image_le: "finite A ==> card (f ` A) <= card A"
|
haftmann@35718
|
2136 |
apply (induct set: finite)
|
haftmann@35718
|
2137 |
apply simp
|
haftmann@35718
|
2138 |
apply (simp add: le_SucI card_insert_if)
|
haftmann@35718
|
2139 |
done
|
haftmann@35718
|
2140 |
|
haftmann@35718
|
2141 |
lemma card_image:
|
haftmann@35718
|
2142 |
assumes "inj_on f A"
|
haftmann@35718
|
2143 |
shows "card (f ` A) = card A"
|
haftmann@35718
|
2144 |
proof (cases "finite A")
|
haftmann@35718
|
2145 |
case True then show ?thesis using assms by (induct A) simp_all
|
haftmann@35718
|
2146 |
next
|
haftmann@35718
|
2147 |
case False then have "\<not> finite (f ` A)" using assms by (auto dest: finite_imageD)
|
haftmann@35718
|
2148 |
with False show ?thesis by simp
|
haftmann@35718
|
2149 |
qed
|
haftmann@35718
|
2150 |
|
haftmann@35718
|
2151 |
lemma bij_betw_same_card: "bij_betw f A B \<Longrightarrow> card A = card B"
|
haftmann@35718
|
2152 |
by(auto simp: card_image bij_betw_def)
|
haftmann@35718
|
2153 |
|
haftmann@35718
|
2154 |
lemma endo_inj_surj: "finite A ==> f ` A \<subseteq> A ==> inj_on f A ==> f ` A = A"
|
haftmann@35718
|
2155 |
by (simp add: card_seteq card_image)
|
haftmann@35718
|
2156 |
|
haftmann@35718
|
2157 |
lemma eq_card_imp_inj_on:
|
haftmann@35718
|
2158 |
"[| finite A; card(f ` A) = card A |] ==> inj_on f A"
|
haftmann@35718
|
2159 |
apply (induct rule:finite_induct)
|
haftmann@35718
|
2160 |
apply simp
|
haftmann@35718
|
2161 |
apply(frule card_image_le[where f = f])
|
haftmann@35718
|
2162 |
apply(simp add:card_insert_if split:if_splits)
|
haftmann@35718
|
2163 |
done
|
haftmann@35718
|
2164 |
|
haftmann@35718
|
2165 |
lemma inj_on_iff_eq_card:
|
haftmann@35718
|
2166 |
"finite A ==> inj_on f A = (card(f ` A) = card A)"
|
haftmann@35718
|
2167 |
by(blast intro: card_image eq_card_imp_inj_on)
|
haftmann@35718
|
2168 |
|
haftmann@35718
|
2169 |
|
haftmann@35718
|
2170 |
lemma card_inj_on_le:
|
haftmann@35718
|
2171 |
"[|inj_on f A; f ` A \<subseteq> B; finite B |] ==> card A \<le> card B"
|
haftmann@35718
|
2172 |
apply (subgoal_tac "finite A")
|
haftmann@35718
|
2173 |
apply (force intro: card_mono simp add: card_image [symmetric])
|
haftmann@35718
|
2174 |
apply (blast intro: finite_imageD dest: finite_subset)
|
haftmann@35718
|
2175 |
done
|
haftmann@35718
|
2176 |
|
haftmann@35718
|
2177 |
lemma card_bij_eq:
|
haftmann@35718
|
2178 |
"[|inj_on f A; f ` A \<subseteq> B; inj_on g B; g ` B \<subseteq> A;
|
haftmann@35718
|
2179 |
finite A; finite B |] ==> card A = card B"
|
haftmann@35718
|
2180 |
by (auto intro: le_antisym card_inj_on_le)
|
haftmann@35718
|
2181 |
|
haftmann@35718
|
2182 |
|
nipkow@37441
|
2183 |
subsubsection {* Pigeonhole Principles *}
|
nipkow@37441
|
2184 |
|
nipkow@40557
|
2185 |
lemma pigeonhole: "card A > card(f ` A) \<Longrightarrow> ~ inj_on f A "
|
nipkow@37441
|
2186 |
by (auto dest: card_image less_irrefl_nat)
|
nipkow@37441
|
2187 |
|
nipkow@37441
|
2188 |
lemma pigeonhole_infinite:
|
nipkow@37441
|
2189 |
assumes "~ finite A" and "finite(f`A)"
|
nipkow@37441
|
2190 |
shows "EX a0:A. ~finite{a:A. f a = f a0}"
|
nipkow@37441
|
2191 |
proof -
|
nipkow@37441
|
2192 |
have "finite(f`A) \<Longrightarrow> ~ finite A \<Longrightarrow> EX a0:A. ~finite{a:A. f a = f a0}"
|
nipkow@37441
|
2193 |
proof(induct "f`A" arbitrary: A rule: finite_induct)
|
nipkow@37441
|
2194 |
case empty thus ?case by simp
|
nipkow@37441
|
2195 |
next
|
nipkow@37441
|
2196 |
case (insert b F)
|
nipkow@37441
|
2197 |
show ?case
|
nipkow@37441
|
2198 |
proof cases
|
nipkow@37441
|
2199 |
assume "finite{a:A. f a = b}"
|
nipkow@37441
|
2200 |
hence "~ finite(A - {a:A. f a = b})" using `\<not> finite A` by simp
|
nipkow@37441
|
2201 |
also have "A - {a:A. f a = b} = {a:A. f a \<noteq> b}" by blast
|
nipkow@37441
|
2202 |
finally have "~ finite({a:A. f a \<noteq> b})" .
|
nipkow@37441
|
2203 |
from insert(3)[OF _ this]
|
nipkow@37441
|
2204 |
show ?thesis using insert(2,4) by simp (blast intro: rev_finite_subset)
|
nipkow@37441
|
2205 |
next
|
nipkow@37441
|
2206 |
assume 1: "~finite{a:A. f a = b}"
|
nipkow@37441
|
2207 |
hence "{a \<in> A. f a = b} \<noteq> {}" by force
|
nipkow@37441
|
2208 |
thus ?thesis using 1 by blast
|
nipkow@37441
|
2209 |
qed
|
nipkow@37441
|
2210 |
qed
|
nipkow@37441
|
2211 |
from this[OF assms(2,1)] show ?thesis .
|
nipkow@37441
|
2212 |
qed
|
nipkow@37441
|
2213 |
|
nipkow@37441
|
2214 |
lemma pigeonhole_infinite_rel:
|
nipkow@37441
|
2215 |
assumes "~finite A" and "finite B" and "ALL a:A. EX b:B. R a b"
|
nipkow@37441
|
2216 |
shows "EX b:B. ~finite{a:A. R a b}"
|
nipkow@37441
|
2217 |
proof -
|
nipkow@37441
|
2218 |
let ?F = "%a. {b:B. R a b}"
|
nipkow@37441
|
2219 |
from finite_Pow_iff[THEN iffD2, OF `finite B`]
|
nipkow@37441
|
2220 |
have "finite(?F ` A)" by(blast intro: rev_finite_subset)
|
nipkow@37441
|
2221 |
from pigeonhole_infinite[where f = ?F, OF assms(1) this]
|
nipkow@37441
|
2222 |
obtain a0 where "a0\<in>A" and 1: "\<not> finite {a\<in>A. ?F a = ?F a0}" ..
|
nipkow@37441
|
2223 |
obtain b0 where "b0 : B" and "R a0 b0" using `a0:A` assms(3) by blast
|
nipkow@37441
|
2224 |
{ assume "finite{a:A. R a b0}"
|
nipkow@37441
|
2225 |
then have "finite {a\<in>A. ?F a = ?F a0}"
|
nipkow@37441
|
2226 |
using `b0 : B` `R a0 b0` by(blast intro: rev_finite_subset)
|
nipkow@37441
|
2227 |
}
|
nipkow@37441
|
2228 |
with 1 `b0 : B` show ?thesis by blast
|
nipkow@37441
|
2229 |
qed
|
nipkow@37441
|
2230 |
|
nipkow@37441
|
2231 |
|
haftmann@35718
|
2232 |
subsubsection {* Cardinality of sums *}
|
haftmann@35718
|
2233 |
|
haftmann@35718
|
2234 |
lemma card_Plus:
|
haftmann@35718
|
2235 |
assumes "finite A" and "finite B"
|
haftmann@35718
|
2236 |
shows "card (A <+> B) = card A + card B"
|
haftmann@35718
|
2237 |
proof -
|
haftmann@35718
|
2238 |
have "Inl`A \<inter> Inr`B = {}" by fast
|
haftmann@35718
|
2239 |
with assms show ?thesis
|
haftmann@35718
|
2240 |
unfolding Plus_def
|
haftmann@35718
|
2241 |
by (simp add: card_Un_disjoint card_image)
|
haftmann@35718
|
2242 |
qed
|
haftmann@35718
|
2243 |
|
haftmann@35718
|
2244 |
lemma card_Plus_conv_if:
|
haftmann@35718
|
2245 |
"card (A <+> B) = (if finite A \<and> finite B then card A + card B else 0)"
|
haftmann@35718
|
2246 |
by (auto simp add: card_Plus)
|
haftmann@35718
|
2247 |
|
haftmann@35718
|
2248 |
|
haftmann@35718
|
2249 |
subsubsection {* Cardinality of the Powerset *}
|
haftmann@35718
|
2250 |
|
haftmann@35718
|
2251 |
lemma card_Pow: "finite A ==> card (Pow A) = Suc (Suc 0) ^ card A" (* FIXME numeral 2 (!?) *)
|
haftmann@35718
|
2252 |
apply (induct set: finite)
|
haftmann@35718
|
2253 |
apply (simp_all add: Pow_insert)
|
haftmann@35718
|
2254 |
apply (subst card_Un_disjoint, blast)
|
haftmann@35718
|
2255 |
apply (blast intro: finite_imageI, blast)
|
haftmann@35718
|
2256 |
apply (subgoal_tac "inj_on (insert x) (Pow F)")
|
haftmann@35718
|
2257 |
apply (simp add: card_image Pow_insert)
|
haftmann@35718
|
2258 |
apply (unfold inj_on_def)
|
haftmann@35718
|
2259 |
apply (blast elim!: equalityE)
|
haftmann@35718
|
2260 |
done
|
haftmann@35718
|
2261 |
|
nipkow@37441
|
2262 |
text {* Relates to equivalence classes. Based on a theorem of F. Kammüller. *}
|
haftmann@35718
|
2263 |
|
haftmann@35718
|
2264 |
lemma dvd_partition:
|
haftmann@35718
|
2265 |
"finite (Union C) ==>
|
haftmann@35718
|
2266 |
ALL c : C. k dvd card c ==>
|
haftmann@35718
|
2267 |
(ALL c1: C. ALL c2: C. c1 \<noteq> c2 --> c1 Int c2 = {}) ==>
|
haftmann@35718
|
2268 |
k dvd card (Union C)"
|
haftmann@35718
|
2269 |
apply(frule finite_UnionD)
|
haftmann@35718
|
2270 |
apply(rotate_tac -1)
|
haftmann@35718
|
2271 |
apply (induct set: finite, simp_all, clarify)
|
haftmann@35718
|
2272 |
apply (subst card_Un_disjoint)
|
haftmann@35718
|
2273 |
apply (auto simp add: disjoint_eq_subset_Compl)
|
haftmann@35718
|
2274 |
done
|
haftmann@35718
|
2275 |
|
haftmann@35718
|
2276 |
|
haftmann@35718
|
2277 |
subsubsection {* Relating injectivity and surjectivity *}
|
haftmann@35718
|
2278 |
|
haftmann@35718
|
2279 |
lemma finite_surj_inj: "finite(A) \<Longrightarrow> A <= f`A \<Longrightarrow> inj_on f A"
|
haftmann@35718
|
2280 |
apply(rule eq_card_imp_inj_on, assumption)
|
haftmann@35718
|
2281 |
apply(frule finite_imageI)
|
haftmann@35718
|
2282 |
apply(drule (1) card_seteq)
|
haftmann@35718
|
2283 |
apply(erule card_image_le)
|
haftmann@35718
|
2284 |
apply simp
|
haftmann@35718
|
2285 |
done
|
haftmann@35718
|
2286 |
|
haftmann@35718
|
2287 |
lemma finite_UNIV_surj_inj: fixes f :: "'a \<Rightarrow> 'a"
|
haftmann@35718
|
2288 |
shows "finite(UNIV:: 'a set) \<Longrightarrow> surj f \<Longrightarrow> inj f"
|
hoelzl@40950
|
2289 |
by (blast intro: finite_surj_inj subset_UNIV)
|
haftmann@35718
|
2290 |
|
haftmann@35718
|
2291 |
lemma finite_UNIV_inj_surj: fixes f :: "'a \<Rightarrow> 'a"
|
haftmann@35718
|
2292 |
shows "finite(UNIV:: 'a set) \<Longrightarrow> inj f \<Longrightarrow> surj f"
|
haftmann@35718
|
2293 |
by(fastsimp simp:surj_def dest!: endo_inj_surj)
|
haftmann@35718
|
2294 |
|
haftmann@35718
|
2295 |
corollary infinite_UNIV_nat[iff]: "~finite(UNIV::nat set)"
|
haftmann@35718
|
2296 |
proof
|
haftmann@35718
|
2297 |
assume "finite(UNIV::nat set)"
|
haftmann@35718
|
2298 |
with finite_UNIV_inj_surj[of Suc]
|
haftmann@35718
|
2299 |
show False by simp (blast dest: Suc_neq_Zero surjD)
|
haftmann@35718
|
2300 |
qed
|
haftmann@35718
|
2301 |
|
blanchet@35828
|
2302 |
(* Often leads to bogus ATP proofs because of reduced type information, hence no_atp *)
|
blanchet@35828
|
2303 |
lemma infinite_UNIV_char_0[no_atp]:
|
haftmann@35718
|
2304 |
"\<not> finite (UNIV::'a::semiring_char_0 set)"
|
haftmann@35718
|
2305 |
proof
|
haftmann@35718
|
2306 |
assume "finite (UNIV::'a set)"
|
haftmann@35718
|
2307 |
with subset_UNIV have "finite (range of_nat::'a set)"
|
haftmann@35718
|
2308 |
by (rule finite_subset)
|
haftmann@35718
|
2309 |
moreover have "inj (of_nat::nat \<Rightarrow> 'a)"
|
haftmann@35718
|
2310 |
by (simp add: inj_on_def)
|
haftmann@35718
|
2311 |
ultimately have "finite (UNIV::nat set)"
|
haftmann@35718
|
2312 |
by (rule finite_imageD)
|
haftmann@35718
|
2313 |
then show "False"
|
haftmann@35718
|
2314 |
by simp
|
haftmann@35718
|
2315 |
qed
|
haftmann@35718
|
2316 |
|
haftmann@35718
|
2317 |
end
|