1 (* Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *)
3 header {* Complete lattices, with special focus on sets *}
5 theory Complete_Lattice
10 less_eq (infix "\<sqsubseteq>" 50) and
11 less (infix "\<sqsubset>" 50) and
12 inf (infixl "\<sqinter>" 70) and
13 sup (infixl "\<squnion>" 65) and
18 subsection {* Syntactic infimum and supremum operations *}
21 fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900)
24 fixes Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900)
26 subsection {* Abstract complete lattices *}
28 class complete_lattice = bounded_lattice + Inf + Sup +
29 assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x"
30 and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A"
31 assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A"
32 and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z"
35 lemma dual_complete_lattice:
36 "class.complete_lattice Sup Inf (op \<ge>) (op >) sup inf \<top> \<bottom>"
37 by (auto intro!: class.complete_lattice.intro dual_bounded_lattice)
38 (unfold_locales, (fact bot_least top_greatest
39 Sup_upper Sup_least Inf_lower Inf_greatest)+)
41 lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<sqsubseteq> a}"
42 by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
44 lemma Sup_Inf: "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<sqsubseteq> b}"
45 by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least)
47 lemma Inf_empty [simp]:
48 "\<Sqinter>{} = \<top>"
49 by (auto intro: antisym Inf_greatest)
51 lemma Sup_empty [simp]:
52 "\<Squnion>{} = \<bottom>"
53 by (auto intro: antisym Sup_least)
55 lemma Inf_UNIV [simp]:
56 "\<Sqinter>UNIV = \<bottom>"
57 by (simp add: Sup_Inf Sup_empty [symmetric])
59 lemma Sup_UNIV [simp]:
60 "\<Squnion>UNIV = \<top>"
61 by (simp add: Inf_Sup Inf_empty [symmetric])
63 lemma Inf_insert: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A"
64 by (auto intro: le_infI le_infI1 le_infI2 antisym Inf_greatest Inf_lower)
66 lemma Sup_insert: "\<Squnion>insert a A = a \<squnion> \<Squnion>A"
67 by (auto intro: le_supI le_supI1 le_supI2 antisym Sup_least Sup_upper)
69 lemma Inf_singleton [simp]:
71 by (auto intro: antisym Inf_lower Inf_greatest)
73 lemma Sup_singleton [simp]:
75 by (auto intro: antisym Sup_upper Sup_least)
78 "\<Sqinter>{a, b} = a \<sqinter> b"
79 by (simp add: Inf_insert)
82 "\<Squnion>{a, b} = a \<squnion> b"
83 by (simp add: Sup_insert)
85 lemma le_Inf_iff: "b \<sqsubseteq> \<Sqinter>A \<longleftrightarrow> (\<forall>a\<in>A. b \<sqsubseteq> a)"
86 by (auto intro: Inf_greatest dest: Inf_lower)
88 lemma Sup_le_iff: "\<Squnion>A \<sqsubseteq> b \<longleftrightarrow> (\<forall>a\<in>A. a \<sqsubseteq> b)"
89 by (auto intro: Sup_least dest: Sup_upper)
91 lemma Inf_superset_mono: "B \<subseteq> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> \<Sqinter>B"
92 by (auto intro: Inf_greatest Inf_lower)
94 lemma Sup_subset_mono: "A \<subseteq> B \<Longrightarrow> \<Squnion>A \<sqsubseteq> \<Squnion>B"
95 by (auto intro: Sup_least Sup_upper)
98 assumes "\<And>b. b \<in> B \<Longrightarrow> \<exists>a\<in>A. a \<sqsubseteq> b"
99 shows "\<Sqinter>A \<sqsubseteq> \<Sqinter>B"
100 proof (rule Inf_greatest)
101 fix b assume "b \<in> B"
102 with assms obtain a where "a \<in> A" and "a \<sqsubseteq> b" by blast
103 from `a \<in> A` have "\<Sqinter>A \<sqsubseteq> a" by (rule Inf_lower)
104 with `a \<sqsubseteq> b` show "\<Sqinter>A \<sqsubseteq> b" by auto
108 assumes "\<And>a. a \<in> A \<Longrightarrow> \<exists>b\<in>B. a \<sqsubseteq> b"
109 shows "\<Squnion>A \<sqsubseteq> \<Squnion>B"
110 proof (rule Sup_least)
111 fix a assume "a \<in> A"
112 with assms obtain b where "b \<in> B" and "a \<sqsubseteq> b" by blast
113 from `b \<in> B` have "b \<sqsubseteq> \<Squnion>B" by (rule Sup_upper)
114 with `a \<sqsubseteq> b` show "a \<sqsubseteq> \<Squnion>B" by auto
117 lemma Sup_upper2: "u \<in> A \<Longrightarrow> v \<sqsubseteq> u \<Longrightarrow> v \<sqsubseteq> \<Squnion>A"
118 using Sup_upper [of u A] by auto
120 lemma Inf_lower2: "u \<in> A \<Longrightarrow> u \<sqsubseteq> v \<Longrightarrow> \<Sqinter>A \<sqsubseteq> v"
121 using Inf_lower [of u A] by auto
124 assumes "\<And>v. v \<in> A \<Longrightarrow> v \<sqsubseteq> u"
126 shows "\<Sqinter>A \<sqsubseteq> u"
128 from `A \<noteq> {}` obtain v where "v \<in> A" by blast
129 moreover with assms have "v \<sqsubseteq> u" by blast
130 ultimately show ?thesis by (rule Inf_lower2)
134 assumes "\<And>v. v \<in> A \<Longrightarrow> u \<sqsubseteq> v"
136 shows "u \<sqsubseteq> \<Squnion>A"
138 from `A \<noteq> {}` obtain v where "v \<in> A" by blast
139 moreover with assms have "u \<sqsubseteq> v" by blast
140 ultimately show ?thesis by (rule Sup_upper2)
143 lemma less_eq_Inf_inter: "\<Sqinter>A \<squnion> \<Sqinter>B \<sqsubseteq> \<Sqinter>(A \<inter> B)"
144 by (auto intro: Inf_greatest Inf_lower)
146 lemma Sup_inter_less_eq: "\<Squnion>(A \<inter> B) \<sqsubseteq> \<Squnion>A \<sqinter> \<Squnion>B "
147 by (auto intro: Sup_least Sup_upper)
149 lemma Inf_union_distrib: "\<Sqinter>(A \<union> B) = \<Sqinter>A \<sqinter> \<Sqinter>B"
150 by (rule antisym) (auto intro: Inf_greatest Inf_lower le_infI1 le_infI2)
152 lemma Sup_union_distrib: "\<Squnion>(A \<union> B) = \<Squnion>A \<squnion> \<Squnion>B"
153 by (rule antisym) (auto intro: Sup_least Sup_upper le_supI1 le_supI2)
155 lemma Inf_top_conv [no_atp]:
156 "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
157 "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
159 show "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)"
161 assume "\<forall>x\<in>A. x = \<top>"
162 then have "A = {} \<or> A = {\<top>}" by auto
163 then show "\<Sqinter>A = \<top>" by auto
165 assume "\<Sqinter>A = \<top>"
166 show "\<forall>x\<in>A. x = \<top>"
168 assume "\<not> (\<forall>x\<in>A. x = \<top>)"
169 then obtain x where "x \<in> A" and "x \<noteq> \<top>" by blast
170 then obtain B where "A = insert x B" by blast
171 with `\<Sqinter>A = \<top>` `x \<noteq> \<top>` show False by (simp add: Inf_insert)
174 then show "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" by auto
177 lemma Sup_bot_conv [no_atp]:
178 "\<Squnion>A = \<bottom> \<longleftrightarrow> (\<forall>x\<in>A. x = \<bottom>)" (is ?P)
179 "\<bottom> = \<Squnion>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<bottom>)" (is ?Q)
181 interpret dual: complete_lattice Sup Inf "op \<ge>" "op >" sup inf \<top> \<bottom>
182 by (fact dual_complete_lattice)
183 from dual.Inf_top_conv show ?P and ?Q by simp_all
186 definition INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
187 INF_def: "INFI A f = \<Sqinter> (f ` A)"
189 definition SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where
190 SUP_def: "SUPR A f = \<Squnion> (f ` A)"
193 Note: must use names @{const INFI} and @{const SUPR} here instead of
194 @{text INF} and @{text SUP} to allow the following syntax coexist
195 with the plain constant names.
201 "_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3INF _./ _)" [0, 10] 10)
202 "_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3INF _:_./ _)" [0, 0, 10] 10)
203 "_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3SUP _./ _)" [0, 10] 10)
204 "_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3SUP _:_./ _)" [0, 0, 10] 10)
207 "_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_./ _)" [0, 10] 10)
208 "_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)
209 "_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_./ _)" [0, 10] 10)
210 "_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)
213 "INF x y. B" == "INF x. INF y. B"
214 "INF x. B" == "CONST INFI CONST UNIV (%x. B)"
215 "INF x. B" == "INF x:CONST UNIV. B"
216 "INF x:A. B" == "CONST INFI A (%x. B)"
217 "SUP x y. B" == "SUP x. SUP y. B"
218 "SUP x. B" == "CONST SUPR CONST UNIV (%x. B)"
219 "SUP x. B" == "SUP x:CONST UNIV. B"
220 "SUP x:A. B" == "CONST SUPR A (%x. B)"
223 [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"},
224 Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax SUPR} @{syntax_const "_SUP"}]
225 *} -- {* to avoid eta-contraction of body *}
227 context complete_lattice
230 lemma INF_empty: "(\<Sqinter>x\<in>{}. f x) = \<top>"
231 by (simp add: INF_def)
233 lemma SUP_empty: "(\<Squnion>x\<in>{}. f x) = \<bottom>"
234 by (simp add: SUP_def)
236 lemma INF_insert: "(\<Sqinter>x\<in>insert a A. f x) = f a \<sqinter> INFI A f"
237 by (simp add: INF_def Inf_insert)
239 lemma SUP_insert: "(\<Squnion>x\<in>insert a A. f x) = f a \<squnion> SUPR A f"
240 by (simp add: SUP_def Sup_insert)
242 lemma INF_leI: "i \<in> A \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> f i"
243 by (auto simp add: INF_def intro: Inf_lower)
245 lemma le_SUP_I: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> (\<Squnion>i\<in>A. f i)"
246 by (auto simp add: SUP_def intro: Sup_upper)
248 lemma INF_leI2: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> u \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> u"
249 using INF_leI [of i A f] by auto
251 lemma le_SUP_I2: "i \<in> A \<Longrightarrow> u \<sqsubseteq> f i \<Longrightarrow> u \<sqsubseteq> (\<Squnion>i\<in>A. f i)"
252 using le_SUP_I [of i A f] by auto
254 lemma le_INF_I: "(\<And>i. i \<in> A \<Longrightarrow> u \<sqsubseteq> f i) \<Longrightarrow> u \<sqsubseteq> (\<Sqinter>i\<in>A. f i)"
255 by (auto simp add: INF_def intro: Inf_greatest)
257 lemma SUP_leI: "(\<And>i. i \<in> A \<Longrightarrow> f i \<sqsubseteq> u) \<Longrightarrow> (\<Squnion>i\<in>A. f i) \<sqsubseteq> u"
258 by (auto simp add: SUP_def intro: Sup_least)
260 lemma le_INF_iff: "u \<sqsubseteq> (\<Sqinter>i\<in>A. f i) \<longleftrightarrow> (\<forall>i \<in> A. u \<sqsubseteq> f i)"
261 by (auto simp add: INF_def le_Inf_iff)
263 lemma SUP_le_iff: "(\<Squnion>i\<in>A. f i) \<sqsubseteq> u \<longleftrightarrow> (\<forall>i \<in> A. f i \<sqsubseteq> u)"
264 by (auto simp add: SUP_def Sup_le_iff)
266 lemma INF_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Sqinter>i\<in>A. f) = f"
267 by (auto intro: antisym INF_leI le_INF_I)
269 lemma SUP_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Squnion>i\<in>A. f) = f"
270 by (auto intro: antisym SUP_leI le_SUP_I)
272 lemma INF_top: "(\<Sqinter>x\<in>A. \<top>) = \<top>"
273 by (cases "A = {}") (simp_all add: INF_empty)
275 lemma SUP_bot: "(\<Squnion>x\<in>A. \<bottom>) = \<bottom>"
276 by (cases "A = {}") (simp_all add: SUP_empty)
279 "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Sqinter>x\<in>A. C x) = (\<Sqinter>x\<in>B. D x)"
280 by (simp add: INF_def image_def)
283 "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Squnion>x\<in>A. C x) = (\<Squnion>x\<in>B. D x)"
284 by (simp add: SUP_def image_def)
287 "(\<And>m. m \<in> B \<Longrightarrow> \<exists>n\<in>A. f n \<sqsubseteq> g m) \<Longrightarrow> (\<Sqinter>n\<in>A. f n) \<sqsubseteq> (\<Sqinter>n\<in>B. g n)"
288 by (force intro!: Inf_mono simp: INF_def)
291 "(\<And>n. n \<in> A \<Longrightarrow> \<exists>m\<in>B. f n \<sqsubseteq> g m) \<Longrightarrow> (\<Squnion>n\<in>A. f n) \<sqsubseteq> (\<Squnion>n\<in>B. g n)"
292 by (force intro!: Sup_mono simp: SUP_def)
294 lemma INF_superset_mono:
295 "B \<subseteq> A \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> f x \<sqsubseteq> g x) \<Longrightarrow> (\<Sqinter>x\<in>A. f x) \<sqsubseteq> (\<Sqinter>x\<in>B. g x)"
296 -- {* The last inclusion is POSITIVE! *}
297 by (blast intro: INF_mono dest: subsetD)
299 lemma SUP_subset_mono:
300 "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<sqsubseteq> g x) \<Longrightarrow> (\<Squnion>x\<in>A. f x) \<sqsubseteq> (\<Squnion>x\<in>B. g x)"
301 by (blast intro: SUP_mono dest: subsetD)
303 lemma INF_commute: "(\<Sqinter>i\<in>A. \<Sqinter>j\<in>B. f i j) = (\<Sqinter>j\<in>B. \<Sqinter>i\<in>A. f i j)"
304 by (iprover intro: INF_leI le_INF_I order_trans antisym)
306 lemma SUP_commute: "(\<Squnion>i\<in>A. \<Squnion>j\<in>B. f i j) = (\<Squnion>j\<in>B. \<Squnion>i\<in>A. f i j)"
307 by (iprover intro: SUP_leI le_SUP_I order_trans antisym)
311 shows "A k \<sqinter> (\<Sqinter>i\<in>I. A i) = (\<Sqinter>i\<in>I. A i)"
313 from assms obtain J where "I = insert k J" by blast
314 then show ?thesis by (simp add: INF_insert)
319 shows "A k \<squnion> (\<Squnion>i\<in>I. A i) = (\<Squnion>i\<in>I. A i)"
321 from assms obtain J where "I = insert k J" by blast
322 then show ?thesis by (simp add: SUP_insert)
326 "(\<Sqinter>i \<in> A \<union> B. M i) = (\<Sqinter>i \<in> A. M i) \<sqinter> (\<Sqinter>i\<in>B. M i)"
327 by (auto intro!: antisym INF_mono intro: le_infI1 le_infI2 le_INF_I INF_leI)
330 "(\<Squnion>i \<in> A \<union> B. M i) = (\<Squnion>i \<in> A. M i) \<squnion> (\<Squnion>i\<in>B. M i)"
331 by (auto intro!: antisym SUP_mono intro: le_supI1 le_supI2 SUP_leI le_SUP_I)
334 "(\<Sqinter>y\<in>A. c) = (if A = {} then \<top> else c)"
335 by (simp add: INF_empty)
338 "(\<Squnion>y\<in>A. c) = (if A = {} then \<bottom> else c)"
339 by (simp add: SUP_empty)
342 "(\<Sqinter>x\<in>A. B x) = \<Sqinter>({Y. \<exists>x\<in>A. Y = B x})"
343 by (simp add: INF_def image_def)
346 "(\<Squnion>x\<in>A. B x) = \<Squnion>({Y. \<exists>x\<in>A. Y = B x})"
347 by (simp add: SUP_def image_def)
350 "\<top> = (\<Sqinter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)"
351 "(\<Sqinter>x\<in>A. B x) = \<top> \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)"
352 by (auto simp add: INF_def Inf_top_conv)
355 "\<bottom> = (\<Squnion>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = \<bottom>)"
356 "(\<Squnion>x\<in>A. B x) = \<bottom> \<longleftrightarrow> (\<forall>x\<in>A. B x = \<bottom>)"
357 by (auto simp add: SUP_def Sup_bot_conv)
360 assumes "y < (\<Sqinter>i\<in>A. f i)" "i \<in> A" shows "y < f i"
362 note `y < (\<Sqinter>i\<in>A. f i)`
363 also have "(\<Sqinter>i\<in>A. f i) \<le> f i" using `i \<in> A`
365 finally show "y < f i" .
369 assumes "(\<Squnion>i\<in>A. f i) < y" "i \<in> A" shows "f i < y"
371 have "f i \<le> (\<Squnion>i\<in>A. f i)" using `i \<in> A`
373 also note `(\<Squnion>i\<in>A. f i) < y`
374 finally show "f i < y" .
377 lemma INF_UNIV_range:
378 "(\<Sqinter>x. f x) = \<Sqinter>range f"
381 lemma SUP_UNIV_range:
382 "(\<Squnion>x. f x) = \<Squnion>range f"
385 lemma INF_UNIV_bool_expand:
386 "(\<Sqinter>b. A b) = A True \<sqinter> A False"
387 by (simp add: UNIV_bool INF_empty INF_insert inf_commute)
389 lemma SUP_UNIV_bool_expand:
390 "(\<Squnion>b. A b) = A True \<squnion> A False"
391 by (simp add: UNIV_bool SUP_empty SUP_insert sup_commute)
395 class complete_boolean_algebra = boolean_algebra + complete_lattice
398 lemma dual_complete_boolean_algebra:
399 "class.complete_boolean_algebra Sup Inf (op \<ge>) (op >) sup inf \<top> \<bottom> (\<lambda>x y. x \<squnion> - y) uminus"
400 by (rule class.complete_boolean_algebra.intro, rule dual_complete_lattice, rule dual_boolean_algebra)
403 "- (\<Sqinter>A) = \<Squnion>(uminus ` A)"
405 show "- \<Sqinter>A \<le> \<Squnion>(uminus ` A)"
406 by (rule compl_le_swap2, rule Inf_greatest, rule compl_le_swap2, rule Sup_upper) simp
407 show "\<Squnion>(uminus ` A) \<le> - \<Sqinter>A"
408 by (rule Sup_least, rule compl_le_swap1, rule Inf_lower) auto
412 "- (\<Squnion>A) = \<Sqinter>(uminus ` A)"
414 have "\<Squnion>A = - \<Sqinter>(uminus ` A)" by (simp add: image_image uminus_Inf)
415 then show ?thesis by simp
418 lemma uminus_INF: "- (\<Sqinter>x\<in>A. B x) = (\<Squnion>x\<in>A. - B x)"
419 by (simp add: INF_def SUP_def uminus_Inf image_image)
421 lemma uminus_SUP: "- (\<Squnion>x\<in>A. B x) = (\<Sqinter>x\<in>A. - B x)"
422 by (simp add: INF_def SUP_def uminus_Sup image_image)
426 class complete_linorder = linorder + complete_lattice
429 lemma dual_complete_linorder:
430 "class.complete_linorder Sup Inf (op \<ge>) (op >) sup inf \<top> \<bottom>"
431 by (rule class.complete_linorder.intro, rule dual_complete_lattice, rule dual_linorder)
434 "\<Sqinter>S \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>S. x \<sqsubset> a)"
435 unfolding not_le [symmetric] le_Inf_iff by auto
438 "a \<sqsubset> \<Squnion>S \<longleftrightarrow> (\<exists>x\<in>S. a \<sqsubset> x)"
439 unfolding not_le [symmetric] Sup_le_iff by auto
442 "(\<Sqinter>i\<in>A. f i) \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>A. f x \<sqsubset> a)"
443 unfolding INF_def Inf_less_iff by auto
446 "a \<sqsubset> (\<Squnion>i\<in>A. f i) \<longleftrightarrow> (\<exists>x\<in>A. a \<sqsubset> f x)"
447 unfolding SUP_def less_Sup_iff by auto
449 lemma Sup_eq_top_iff:
450 "\<Squnion>A = \<top> \<longleftrightarrow> (\<forall>x<\<top>. \<exists>i\<in>A. x < i)"
452 assume *: "\<Squnion>A = \<top>"
453 show "(\<forall>x<\<top>. \<exists>i\<in>A. x < i)" unfolding * [symmetric]
454 proof (intro allI impI)
455 fix x assume "x < \<Squnion>A" then show "\<exists>i\<in>A. x < i"
456 unfolding less_Sup_iff by auto
459 assume *: "\<forall>x<\<top>. \<exists>i\<in>A. x < i"
460 show "\<Squnion>A = \<top>"
462 assume "\<Squnion>A \<noteq> \<top>"
463 with top_greatest [of "\<Squnion>A"]
464 have "\<Squnion>A < \<top>" unfolding le_less by auto
465 then have "\<Squnion>A < \<Squnion>A"
466 using * unfolding less_Sup_iff by auto
467 then show False by auto
471 lemma Inf_eq_bot_iff:
472 "\<Sqinter>A = \<bottom> \<longleftrightarrow> (\<forall>x>\<bottom>. \<exists>i\<in>A. i < x)"
474 interpret dual: complete_linorder Sup Inf "op \<ge>" "op >" sup inf \<top> \<bottom>
475 by (fact dual_complete_linorder)
476 from dual.Sup_eq_top_iff show ?thesis .
479 lemma INF_eq_bot_iff:
480 "(\<Sqinter>i\<in>A. f i) = \<bottom> \<longleftrightarrow> (\<forall>x>\<bottom>. \<exists>i\<in>A. f i < x)"
481 unfolding INF_def Inf_eq_bot_iff by auto
483 lemma SUP_eq_top_iff:
484 "(\<Squnion>i\<in>A. f i) = \<top> \<longleftrightarrow> (\<forall>x<\<top>. \<exists>i\<in>A. x < f i)"
485 unfolding SUP_def Sup_eq_top_iff by auto
490 subsection {* @{typ bool} and @{typ "_ \<Rightarrow> _"} as complete lattice *}
492 instantiation bool :: complete_boolean_algebra
496 "\<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x)"
499 "\<Squnion>A \<longleftrightarrow> (\<exists>x\<in>A. x)"
502 qed (auto simp add: Inf_bool_def Sup_bool_def)
506 lemma INF_bool_eq [simp]:
510 fix P :: "'a \<Rightarrow> bool"
511 show "(\<Sqinter>x\<in>A. P x) \<longleftrightarrow> (\<forall>x\<in>A. P x)"
512 by (auto simp add: Ball_def INF_def Inf_bool_def)
515 lemma SUP_bool_eq [simp]:
519 fix P :: "'a \<Rightarrow> bool"
520 show "(\<Squnion>x\<in>A. P x) \<longleftrightarrow> (\<exists>x\<in>A. P x)"
521 by (auto simp add: Bex_def SUP_def Sup_bool_def)
524 instantiation "fun" :: (type, complete_lattice) complete_lattice
528 "\<Sqinter>A = (\<lambda>x. \<Sqinter>{y. \<exists>f\<in>A. y = f x})"
531 "(\<Sqinter>A) x = \<Sqinter>{y. \<exists>f\<in>A. y = f x}"
532 by (simp add: Inf_fun_def)
535 "\<Squnion>A = (\<lambda>x. \<Squnion>{y. \<exists>f\<in>A. y = f x})"
538 "(\<Squnion>A) x = \<Squnion>{y. \<exists>f\<in>A. y = f x}"
539 by (simp add: Sup_fun_def)
542 qed (auto simp add: le_fun_def Inf_apply Sup_apply
543 intro: Inf_lower Sup_upper Inf_greatest Sup_least)
548 "(\<Sqinter>y\<in>A. f y) x = (\<Sqinter>y\<in>A. f y x)"
549 by (auto intro: arg_cong [of _ _ Inf] simp add: INF_def Inf_apply)
552 "(\<Squnion>y\<in>A. f y) x = (\<Squnion>y\<in>A. f y x)"
553 by (auto intro: arg_cong [of _ _ Sup] simp add: SUP_def Sup_apply)
555 instance "fun" :: (type, complete_boolean_algebra) complete_boolean_algebra ..
558 subsection {* Inter *}
560 abbreviation Inter :: "'a set set \<Rightarrow> 'a set" where
561 "Inter S \<equiv> \<Sqinter>S"
564 Inter ("\<Inter>_" [90] 90)
567 "\<Inter>A = {x. \<forall>B \<in> A. x \<in> B}"
570 have "(\<forall>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<forall>B\<in>A. x \<in> B)"
572 then show "x \<in> \<Inter>A \<longleftrightarrow> x \<in> {x. \<forall>B \<in> A. x \<in> B}"
573 by (simp add: Inf_fun_def Inf_bool_def) (simp add: mem_def)
576 lemma Inter_iff [simp,no_atp]: "A \<in> \<Inter>C \<longleftrightarrow> (\<forall>X\<in>C. A \<in> X)"
577 by (unfold Inter_eq) blast
579 lemma InterI [intro!]: "(\<And>X. X \<in> C \<Longrightarrow> A \<in> X) \<Longrightarrow> A \<in> \<Inter>C"
580 by (simp add: Inter_eq)
583 \medskip A ``destruct'' rule -- every @{term X} in @{term C}
584 contains @{term A} as an element, but @{prop "A \<in> X"} can hold when
585 @{prop "X \<in> C"} does not! This rule is analogous to @{text spec}.
588 lemma InterD [elim, Pure.elim]: "A \<in> \<Inter>C \<Longrightarrow> X \<in> C \<Longrightarrow> A \<in> X"
591 lemma InterE [elim]: "A \<in> \<Inter>C \<Longrightarrow> (X \<notin> C \<Longrightarrow> R) \<Longrightarrow> (A \<in> X \<Longrightarrow> R) \<Longrightarrow> R"
592 -- {* ``Classical'' elimination rule -- does not require proving
593 @{prop "X \<in> C"}. *}
594 by (unfold Inter_eq) blast
596 lemma Inter_lower: "B \<in> A \<Longrightarrow> \<Inter>A \<subseteq> B"
600 "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> B) \<Longrightarrow> A \<noteq> {} \<Longrightarrow> \<Inter>A \<subseteq> B"
601 by (fact Inf_less_eq)
603 lemma Inter_greatest: "(\<And>X. X \<in> A \<Longrightarrow> C \<subseteq> X) \<Longrightarrow> C \<subseteq> Inter A"
604 by (fact Inf_greatest)
606 lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}"
607 by (fact Inf_binary [symmetric])
609 lemma Inter_empty [simp]: "\<Inter>{} = UNIV"
612 lemma Inter_UNIV [simp]: "\<Inter>UNIV = {}"
615 lemma Inter_insert [simp]: "\<Inter>(insert a B) = a \<inter> \<Inter>B"
618 lemma Inter_Un_subset: "\<Inter>A \<union> \<Inter>B \<subseteq> \<Inter>(A \<inter> B)"
619 by (fact less_eq_Inf_inter)
621 lemma Inter_Un_distrib: "\<Inter>(A \<union> B) = \<Inter>A \<inter> \<Inter>B"
622 by (fact Inf_union_distrib)
624 lemma Inter_UNIV_conv [simp, no_atp]:
625 "\<Inter>A = UNIV \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"
626 "UNIV = \<Inter>A \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)"
627 by (fact Inf_top_conv)+
629 lemma Inter_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Inter>A \<subseteq> \<Inter>B"
630 by (fact Inf_superset_mono)
633 subsection {* Intersections of families *}
635 abbreviation INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
636 "INTER \<equiv> INFI"
639 Note: must use name @{const INTER} here instead of @{text INT}
640 to allow the following syntax coexist with the plain constant name.
644 "_INTER1" :: "pttrns => 'b set => 'b set" ("(3INT _./ _)" [0, 10] 10)
645 "_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3INT _:_./ _)" [0, 0, 10] 10)
648 "_INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>_./ _)" [0, 10] 10)
649 "_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Inter>_\<in>_./ _)" [0, 0, 10] 10)
651 syntax (latex output)
652 "_INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
653 "_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)
656 "INT x y. B" == "INT x. INT y. B"
657 "INT x. B" == "CONST INTER CONST UNIV (%x. B)"
658 "INT x. B" == "INT x:CONST UNIV. B"
659 "INT x:A. B" == "CONST INTER A (%x. B)"
662 [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INTER} @{syntax_const "_INTER"}]
663 *} -- {* to avoid eta-contraction of body *}
665 lemma INTER_eq_Inter_image:
666 "(\<Inter>x\<in>A. B x) = \<Inter>(B`A)"
670 "\<Inter>S = (\<Inter>x\<in>S. x)"
671 by (simp add: INTER_eq_Inter_image image_def)
674 "(\<Inter>x\<in>A. B x) = {y. \<forall>x\<in>A. y \<in> B x}"
675 by (auto simp add: INTER_eq_Inter_image Inter_eq)
677 lemma Inter_image_eq [simp]:
678 "\<Inter>(B`A) = (\<Inter>x\<in>A. B x)"
679 by (rule sym) (fact INF_def)
681 lemma INT_iff [simp]: "b \<in> (\<Inter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. b \<in> B x)"
682 by (unfold INTER_def) blast
684 lemma INT_I [intro!]: "(\<And>x. x \<in> A \<Longrightarrow> b \<in> B x) \<Longrightarrow> b \<in> (\<Inter>x\<in>A. B x)"
685 by (unfold INTER_def) blast
687 lemma INT_D [elim, Pure.elim]: "b \<in> (\<Inter>x\<in>A. B x) \<Longrightarrow> a \<in> A \<Longrightarrow> b \<in> B a"
690 lemma INT_E [elim]: "b \<in> (\<Inter>x\<in>A. B x) \<Longrightarrow> (b \<in> B a \<Longrightarrow> R) \<Longrightarrow> (a \<notin> A \<Longrightarrow> R) \<Longrightarrow> R"
691 -- {* "Classical" elimination -- by the Excluded Middle on @{prop "a\<in>A"}. *}
692 by (unfold INTER_def) blast
694 lemma INT_cong [cong]:
695 "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Inter>x\<in>A. C x) = (\<Inter>x\<in>B. D x)"
698 lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})"
701 lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})"
704 lemma INT_lower: "a \<in> A \<Longrightarrow> (\<Inter>x\<in>A. B x) \<subseteq> B a"
707 lemma INT_greatest: "(\<And>x. x \<in> A \<Longrightarrow> C \<subseteq> B x) \<Longrightarrow> C \<subseteq> (\<Inter>x\<in>A. B x)"
710 lemma INT_empty [simp]: "(\<Inter>x\<in>{}. B x) = UNIV"
713 lemma INT_absorb: "k \<in> I \<Longrightarrow> A k \<inter> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. A i)"
716 lemma INT_subset_iff: "B \<subseteq> (\<Inter>i\<in>I. A i) \<longleftrightarrow> (\<forall>i\<in>I. B \<subseteq> A i)"
719 lemma INT_insert [simp]: "(\<Inter>x \<in> insert a A. B x) = B a \<inter> INTER A B"
722 lemma INT_Un: "(\<Inter>i \<in> A \<union> B. M i) = (\<Inter>i \<in> A. M i) \<inter> (\<Inter>i\<in>B. M i)"
725 lemma INT_insert_distrib:
726 "u \<in> A \<Longrightarrow> (\<Inter>x\<in>A. insert a (B x)) = insert a (\<Inter>x\<in>A. B x)"
729 lemma INT_constant [simp]: "(\<Inter>y\<in>A. c) = (if A = {} then UNIV else c)"
730 by (fact INF_constant)
732 lemma INT_eq: "(\<Inter>x\<in>A. B x) = \<Inter>({Y. \<exists>x\<in>A. Y = B x})"
733 -- {* Look: it has an \emph{existential} quantifier *}
736 lemma INTER_UNIV_conv [simp]:
737 "(UNIV = (\<Inter>x\<in>A. B x)) = (\<forall>x\<in>A. B x = UNIV)"
738 "((\<Inter>x\<in>A. B x) = UNIV) = (\<forall>x\<in>A. B x = UNIV)"
739 by (fact INF_top_conv)+
741 lemma INT_bool_eq: "(\<Inter>b. A b) = A True \<inter> A False"
742 by (fact INF_UNIV_bool_expand)
745 "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow> (\<Inter>x\<in>B. f x) \<subseteq> (\<Inter>x\<in>A. g x)"
746 -- {* The last inclusion is POSITIVE! *}
747 by (fact INF_superset_mono)
749 lemma Pow_INT_eq: "Pow (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. Pow (B x))"
752 lemma vimage_INT: "f -` (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. f -` B x)"
756 subsection {* Union *}
758 abbreviation Union :: "'a set set \<Rightarrow> 'a set" where
759 "Union S \<equiv> \<Squnion>S"
762 Union ("\<Union>_" [90] 90)
765 "\<Union>A = {x. \<exists>B \<in> A. x \<in> B}"
768 have "(\<exists>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<exists>B\<in>A. x \<in> B)"
770 then show "x \<in> \<Union>A \<longleftrightarrow> x \<in> {x. \<exists>B\<in>A. x \<in> B}"
771 by (simp add: Sup_fun_def Sup_bool_def) (simp add: mem_def)
774 lemma Union_iff [simp, no_atp]:
775 "A \<in> \<Union>C \<longleftrightarrow> (\<exists>X\<in>C. A\<in>X)"
776 by (unfold Union_eq) blast
778 lemma UnionI [intro]:
779 "X \<in> C \<Longrightarrow> A \<in> X \<Longrightarrow> A \<in> \<Union>C"
780 -- {* The order of the premises presupposes that @{term C} is rigid;
781 @{term A} may be flexible. *}
784 lemma UnionE [elim!]:
785 "A \<in> \<Union>C \<Longrightarrow> (\<And>X. A \<in> X \<Longrightarrow> X \<in> C \<Longrightarrow> R) \<Longrightarrow> R"
788 lemma Union_upper: "B \<in> A \<Longrightarrow> B \<subseteq> \<Union>A"
791 lemma Union_least: "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> C) \<Longrightarrow> \<Union>A \<subseteq> C"
794 lemma Un_eq_Union: "A \<union> B = \<Union>{A, B}"
797 lemma Union_empty [simp]: "\<Union>{} = {}"
800 lemma Union_UNIV [simp]: "\<Union>UNIV = UNIV"
803 lemma Union_insert [simp]: "\<Union>insert a B = a \<union> \<Union>B"
806 lemma Union_Un_distrib [simp]: "\<Union>(A \<union> B) = \<Union>A \<union> \<Union>B"
807 by (fact Sup_union_distrib)
809 lemma Union_Int_subset: "\<Union>(A \<inter> B) \<subseteq> \<Union>A \<inter> \<Union>B"
810 by (fact Sup_inter_less_eq)
812 lemma Union_empty_conv [simp,no_atp]: "(\<Union>A = {}) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"
813 by (fact Sup_bot_conv)
815 lemma empty_Union_conv [simp,no_atp]: "({} = \<Union>A) \<longleftrightarrow> (\<forall>x\<in>A. x = {})"
816 by (fact Sup_bot_conv)
818 lemma Union_disjoint: "(\<Union>C \<inter> A = {}) \<longleftrightarrow> (\<forall>B\<in>C. B \<inter> A = {})" -- "FIXME generalize"
821 lemma subset_Pow_Union: "A \<subseteq> Pow (\<Union>A)"
824 lemma Union_Pow_eq [simp]: "\<Union>(Pow A) = A"
827 lemma Union_mono: "A \<subseteq> B \<Longrightarrow> \<Union>A \<subseteq> \<Union>B"
828 by (fact Sup_subset_mono)
831 subsection {* Unions of families *}
833 abbreviation UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where
834 "UNION \<equiv> SUPR"
837 Note: must use name @{const UNION} here instead of @{text UN}
838 to allow the following syntax coexist with the plain constant name.
842 "_UNION1" :: "pttrns => 'b set => 'b set" ("(3UN _./ _)" [0, 10] 10)
843 "_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3UN _:_./ _)" [0, 0, 10] 10)
846 "_UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>_./ _)" [0, 10] 10)
847 "_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Union>_\<in>_./ _)" [0, 0, 10] 10)
849 syntax (latex output)
850 "_UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10)
851 "_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10)
854 "UN x y. B" == "UN x. UN y. B"
855 "UN x. B" == "CONST UNION CONST UNIV (%x. B)"
856 "UN x. B" == "UN x:CONST UNIV. B"
857 "UN x:A. B" == "CONST UNION A (%x. B)"
860 Note the difference between ordinary xsymbol syntax of indexed
861 unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"})
862 and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The
863 former does not make the index expression a subscript of the
864 union/intersection symbol because this leads to problems with nested
865 subscripts in Proof General.
869 [Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax UNION} @{syntax_const "_UNION"}]
870 *} -- {* to avoid eta-contraction of body *}
872 lemma UNION_eq_Union_image:
873 "(\<Union>x\<in>A. B x) = \<Union>(B ` A)"
877 "\<Union>S = (\<Union>x\<in>S. x)"
878 by (simp add: UNION_eq_Union_image image_def)
880 lemma UNION_def [no_atp]:
881 "(\<Union>x\<in>A. B x) = {y. \<exists>x\<in>A. y \<in> B x}"
882 by (auto simp add: UNION_eq_Union_image Union_eq)
884 lemma Union_image_eq [simp]:
885 "\<Union>(B ` A) = (\<Union>x\<in>A. B x)"
886 by (rule sym) (fact UNION_eq_Union_image)
888 lemma UN_iff [simp]: "(b \<in> (\<Union>x\<in>A. B x)) = (\<exists>x\<in>A. b \<in> B x)"
889 by (unfold UNION_def) blast
891 lemma UN_I [intro]: "a \<in> A \<Longrightarrow> b \<in> B a \<Longrightarrow> b \<in> (\<Union>x\<in>A. B x)"
892 -- {* The order of the premises presupposes that @{term A} is rigid;
893 @{term b} may be flexible. *}
896 lemma UN_E [elim!]: "b \<in> (\<Union>x\<in>A. B x) \<Longrightarrow> (\<And>x. x\<in>A \<Longrightarrow> b \<in> B x \<Longrightarrow> R) \<Longrightarrow> R"
897 by (unfold UNION_def) blast
899 lemma UN_cong [cong]:
900 "A = B \<Longrightarrow> (\<And>x. x \<in> B \<Longrightarrow> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"
903 lemma strong_UN_cong:
904 "A = B \<Longrightarrow> (\<And>x. x \<in> B =simp=> C x = D x) \<Longrightarrow> (\<Union>x\<in>A. C x) = (\<Union>x\<in>B. D x)"
905 by (unfold simp_implies_def) (fact UN_cong)
907 lemma image_eq_UN: "f ` A = (\<Union>x\<in>A. {f x})"
910 lemma UN_upper: "a \<in> A \<Longrightarrow> B a \<subseteq> (\<Union>x\<in>A. B x)"
913 lemma UN_least: "(\<And>x. x \<in> A \<Longrightarrow> B x \<subseteq> C) \<Longrightarrow> (\<Union>x\<in>A. B x) \<subseteq> C"
916 lemma Collect_bex_eq [no_atp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})"
919 lemma UN_insert_distrib: "u \<in> A \<Longrightarrow> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)"
922 lemma UN_empty [simp, no_atp]: "(\<Union>x\<in>{}. B x) = {}"
925 lemma UN_empty2 [simp]: "(\<Union>x\<in>A. {}) = {}"
928 lemma UN_singleton [simp]: "(\<Union>x\<in>A. {x}) = A"
931 lemma UN_absorb: "k \<in> I \<Longrightarrow> A k \<union> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. A i)"
934 lemma UN_insert [simp]: "(\<Union>x\<in>insert a A. B x) = B a \<union> UNION A B"
937 lemma UN_Un[simp]: "(\<Union>i \<in> A \<union> B. M i) = (\<Union>i\<in>A. M i) \<union> (\<Union>i\<in>B. M i)"
940 lemma UN_UN_flatten: "(\<Union>x \<in> (\<Union>y\<in>A. B y). C x) = (\<Union>y\<in>A. \<Union>x\<in>B y. C x)"
943 lemma UN_subset_iff: "((\<Union>i\<in>I. A i) \<subseteq> B) = (\<forall>i\<in>I. A i \<subseteq> B)"
946 lemma UN_constant [simp]: "(\<Union>y\<in>A. c) = (if A = {} then {} else c)"
947 by (fact SUP_constant)
949 lemma UN_eq: "(\<Union>x\<in>A. B x) = \<Union>({Y. \<exists>x\<in>A. Y = B x})"
952 lemma image_Union: "f ` \<Union>S = (\<Union>x\<in>S. f ` x)"
955 lemma UNION_empty_conv[simp]:
956 "{} = (\<Union>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"
957 "(\<Union>x\<in>A. B x) = {} \<longleftrightarrow> (\<forall>x\<in>A. B x = {})"
958 by (fact SUP_bot_conv)+
960 lemma Collect_ex_eq [no_atp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})"
963 lemma ball_UN: "(\<forall>z \<in> UNION A B. P z) \<longleftrightarrow> (\<forall>x\<in>A. \<forall>z \<in> B x. P z)"
966 lemma bex_UN: "(\<exists>z \<in> UNION A B. P z) \<longleftrightarrow> (\<exists>x\<in>A. \<exists>z\<in>B x. P z)"
969 lemma Un_eq_UN: "A \<union> B = (\<Union>b. if b then A else B)"
970 by (auto simp add: split_if_mem2)
972 lemma UN_bool_eq: "(\<Union>b. A b) = (A True \<union> A False)"
973 by (fact SUP_UNIV_bool_expand)
975 lemma UN_Pow_subset: "(\<Union>x\<in>A. Pow (B x)) \<subseteq> Pow (\<Union>x\<in>A. B x)"
979 "A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow>
980 (\<Union>x\<in>A. f x) \<subseteq> (\<Union>x\<in>B. g x)"
981 by (fact SUP_subset_mono)
983 lemma vimage_Union: "f -` (\<Union>A) = (\<Union>X\<in>A. f -` X)"
986 lemma vimage_UN: "f -` (\<Union>x\<in>A. B x) = (\<Union>x\<in>A. f -` B x)"
989 lemma vimage_eq_UN: "f -` B = (\<Union>y\<in>B. f -` {y})"
990 -- {* NOT suitable for rewriting *}
993 lemma image_UN: "f ` UNION A B = (\<Union>x\<in>A. f ` B x)"
997 subsection {* Distributive laws *}
999 lemma Int_Union: "A \<inter> \<Union>B = (\<Union>C\<in>B. A \<inter> C)"
1002 lemma Int_Union2: "\<Union>B \<inter> A = (\<Union>C\<in>B. C \<inter> A)"
1005 lemma Un_Union_image: "(\<Union>x\<in>C. A x \<union> B x) = \<Union>(A ` C) \<union> \<Union>(B ` C)"
1006 -- {* Devlin, Fundamentals of Contemporary Set Theory, page 12, exercise 5: *}
1007 -- {* Union of a family of unions *}
1010 lemma UN_Un_distrib: "(\<Union>i\<in>I. A i \<union> B i) = (\<Union>i\<in>I. A i) \<union> (\<Union>i\<in>I. B i)"
1011 -- {* Equivalent version *}
1014 lemma Un_Inter: "A \<union> \<Inter>B = (\<Inter>C\<in>B. A \<union> C)"
1017 lemma Int_Inter_image: "(\<Inter>x\<in>C. A x \<inter> B x) = \<Inter>(A ` C) \<inter> \<Inter>(B ` C)"
1020 lemma INT_Int_distrib: "(\<Inter>i\<in>I. A i \<inter> B i) = (\<Inter>i\<in>I. A i) \<inter> (\<Inter>i\<in>I. B i)"
1021 -- {* Equivalent version *}
1024 lemma Int_UN_distrib: "B \<inter> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. B \<inter> A i)"
1025 -- {* Halmos, Naive Set Theory, page 35. *}
1028 lemma Un_INT_distrib: "B \<union> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. B \<union> A i)"
1031 lemma Int_UN_distrib2: "(\<Union>i\<in>I. A i) \<inter> (\<Union>j\<in>J. B j) = (\<Union>i\<in>I. \<Union>j\<in>J. A i \<inter> B j)"
1034 lemma Un_INT_distrib2: "(\<Inter>i\<in>I. A i) \<union> (\<Inter>j\<in>J. B j) = (\<Inter>i\<in>I. \<Inter>j\<in>J. A i \<union> B j)"
1038 subsection {* Complement *}
1040 lemma Compl_INT [simp]: "- (\<Inter>x\<in>A. B x) = (\<Union>x\<in>A. -B x)"
1041 by (fact uminus_INF)
1043 lemma Compl_UN [simp]: "- (\<Union>x\<in>A. B x) = (\<Inter>x\<in>A. -B x)"
1044 by (fact uminus_SUP)
1047 subsection {* Miniscoping and maxiscoping *}
1049 text {* \medskip Miniscoping: pushing in quantifiers and big Unions
1050 and Intersections. *}
1052 lemma UN_simps [simp]:
1053 "\<And>a B C. (\<Union>x\<in>C. insert a (B x)) = (if C={} then {} else insert a (\<Union>x\<in>C. B x))"
1054 "\<And>A B C. (\<Union>x\<in>C. A x \<union> B) = ((if C={} then {} else (\<Union>x\<in>C. A x) \<union> B))"
1055 "\<And>A B C. (\<Union>x\<in>C. A \<union> B x) = ((if C={} then {} else A \<union> (\<Union>x\<in>C. B x)))"
1056 "\<And>A B C. (\<Union>x\<in>C. A x \<inter> B) = ((\<Union>x\<in>C. A x) \<inter>B)"
1057 "\<And>A B C. (\<Union>x\<in>C. A \<inter> B x) = (A \<inter>(\<Union>x\<in>C. B x))"
1058 "\<And>A B C. (\<Union>x\<in>C. A x - B) = ((\<Union>x\<in>C. A x) - B)"
1059 "\<And>A B C. (\<Union>x\<in>C. A - B x) = (A - (\<Inter>x\<in>C. B x))"
1060 "\<And>A B. (\<Union>x\<in>\<Union>A. B x) = (\<Union>y\<in>A. \<Union>x\<in>y. B x)"
1061 "\<And>A B C. (\<Union>z\<in>UNION A B. C z) = (\<Union>x\<in>A. \<Union>z\<in>B x. C z)"
1062 "\<And>A B f. (\<Union>x\<in>f`A. B x) = (\<Union>a\<in>A. B (f a))"
1065 lemma INT_simps [simp]:
1066 "\<And>A B C. (\<Inter>x\<in>C. A x \<inter> B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) \<inter>B)"
1067 "\<And>A B C. (\<Inter>x\<in>C. A \<inter> B x) = (if C={} then UNIV else A \<inter>(\<Inter>x\<in>C. B x))"
1068 "\<And>A B C. (\<Inter>x\<in>C. A x - B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) - B)"
1069 "\<And>A B C. (\<Inter>x\<in>C. A - B x) = (if C={} then UNIV else A - (\<Union>x\<in>C. B x))"
1070 "\<And>a B C. (\<Inter>x\<in>C. insert a (B x)) = insert a (\<Inter>x\<in>C. B x)"
1071 "\<And>A B C. (\<Inter>x\<in>C. A x \<union> B) = ((\<Inter>x\<in>C. A x) \<union> B)"
1072 "\<And>A B C. (\<Inter>x\<in>C. A \<union> B x) = (A \<union> (\<Inter>x\<in>C. B x))"
1073 "\<And>A B. (\<Inter>x\<in>\<Union>A. B x) = (\<Inter>y\<in>A. \<Inter>x\<in>y. B x)"
1074 "\<And>A B C. (\<Inter>z\<in>UNION A B. C z) = (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z)"
1075 "\<And>A B f. (\<Inter>x\<in>f`A. B x) = (\<Inter>a\<in>A. B (f a))"
1078 lemma UN_ball_bex_simps [simp, no_atp]:
1079 "\<And>A P. (\<forall>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<forall>y\<in>A. \<forall>x\<in>y. P x)"
1080 "\<And>A B P. (\<forall>x\<in>UNION A B. P x) = (\<forall>a\<in>A. \<forall>x\<in> B a. P x)"
1081 "\<And>A P. (\<exists>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<exists>y\<in>A. \<exists>x\<in>y. P x)"
1082 "\<And>A B P. (\<exists>x\<in>UNION A B. P x) \<longleftrightarrow> (\<exists>a\<in>A. \<exists>x\<in>B a. P x)"
1086 text {* \medskip Maxiscoping: pulling out big Unions and Intersections. *}
1088 lemma UN_extend_simps:
1089 "\<And>a B C. insert a (\<Union>x\<in>C. B x) = (if C={} then {a} else (\<Union>x\<in>C. insert a (B x)))"
1090 "\<And>A B C. (\<Union>x\<in>C. A x) \<union> B = (if C={} then B else (\<Union>x\<in>C. A x \<union> B))"
1091 "\<And>A B C. A \<union> (\<Union>x\<in>C. B x) = (if C={} then A else (\<Union>x\<in>C. A \<union> B x))"
1092 "\<And>A B C. ((\<Union>x\<in>C. A x) \<inter> B) = (\<Union>x\<in>C. A x \<inter> B)"
1093 "\<And>A B C. (A \<inter> (\<Union>x\<in>C. B x)) = (\<Union>x\<in>C. A \<inter> B x)"
1094 "\<And>A B C. ((\<Union>x\<in>C. A x) - B) = (\<Union>x\<in>C. A x - B)"
1095 "\<And>A B C. (A - (\<Inter>x\<in>C. B x)) = (\<Union>x\<in>C. A - B x)"
1096 "\<And>A B. (\<Union>y\<in>A. \<Union>x\<in>y. B x) = (\<Union>x\<in>\<Union>A. B x)"
1097 "\<And>A B C. (\<Union>x\<in>A. \<Union>z\<in>B x. C z) = (\<Union>z\<in>UNION A B. C z)"
1098 "\<And>A B f. (\<Union>a\<in>A. B (f a)) = (\<Union>x\<in>f`A. B x)"
1101 lemma INT_extend_simps:
1102 "\<And>A B C. (\<Inter>x\<in>C. A x) \<inter> B = (if C={} then B else (\<Inter>x\<in>C. A x \<inter> B))"
1103 "\<And>A B C. A \<inter> (\<Inter>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A \<inter> B x))"
1104 "\<And>A B C. (\<Inter>x\<in>C. A x) - B = (if C={} then UNIV - B else (\<Inter>x\<in>C. A x - B))"
1105 "\<And>A B C. A - (\<Union>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A - B x))"
1106 "\<And>a B C. insert a (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. insert a (B x))"
1107 "\<And>A B C. ((\<Inter>x\<in>C. A x) \<union> B) = (\<Inter>x\<in>C. A x \<union> B)"
1108 "\<And>A B C. A \<union> (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. A \<union> B x)"
1109 "\<And>A B. (\<Inter>y\<in>A. \<Inter>x\<in>y. B x) = (\<Inter>x\<in>\<Union>A. B x)"
1110 "\<And>A B C. (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z) = (\<Inter>z\<in>UNION A B. C z)"
1111 "\<And>A B f. (\<Inter>a\<in>A. B (f a)) = (\<Inter>x\<in>f`A. B x)"
1115 text {* Legacy names *}
1117 lemmas (in complete_lattice) INFI_def = INF_def
1118 lemmas (in complete_lattice) SUPR_def = SUP_def
1119 lemmas (in complete_lattice) le_SUPI = le_SUP_I
1120 lemmas (in complete_lattice) le_SUPI2 = le_SUP_I2
1121 lemmas (in complete_lattice) le_INFI = le_INF_I
1122 lemmas (in complete_lattice) less_INFD = less_INF_D
1124 lemma (in complete_lattice) INF_subset:
1125 "B \<subseteq> A \<Longrightarrow> INFI A f \<sqsubseteq> INFI B f"
1126 by (rule INF_superset_mono) auto
1128 lemmas INFI_apply = INF_apply
1129 lemmas SUPR_apply = SUP_apply
1134 less_eq (infix "\<sqsubseteq>" 50) and
1135 less (infix "\<sqsubset>" 50) and
1136 bot ("\<bottom>") and
1138 inf (infixl "\<sqinter>" 70) and
1139 sup (infixl "\<squnion>" 65) and
1140 Inf ("\<Sqinter>_" [900] 900) and
1141 Sup ("\<Squnion>_" [900] 900)
1143 no_syntax (xsymbols)
1144 "_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_./ _)" [0, 10] 10)
1145 "_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10)
1146 "_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_./ _)" [0, 10] 10)
1147 "_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10)
1150 insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff
1151 mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff
1152 -- {* Each of these has ALREADY been added @{text "[simp]"} above. *}