author | haftmann |
Sun, 17 Jul 2011 15:15:58 +0200 | |
changeset 43865 | db18f4d0cc7d |
parent 43854 | f1d23df1adde |
child 43866 | 8a50dc70cbff |
permissions | -rw-r--r-- |
32139 | 1 |
(* Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *) |
11979 | 2 |
|
32139 | 3 |
header {* Complete lattices, with special focus on sets *} |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
4 |
|
32139 | 5 |
theory Complete_Lattice |
6 |
imports Set |
|
7 |
begin |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
8 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
9 |
notation |
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
10 |
less_eq (infix "\<sqsubseteq>" 50) and |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
11 |
less (infix "\<sqsubset>" 50) and |
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
12 |
inf (infixl "\<sqinter>" 70) and |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
13 |
sup (infixl "\<squnion>" 65) and |
32678 | 14 |
top ("\<top>") and |
15 |
bot ("\<bottom>") |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
16 |
|
32139 | 17 |
|
32879 | 18 |
subsection {* Syntactic infimum and supremum operations *} |
19 |
||
20 |
class Inf = |
|
21 |
fixes Inf :: "'a set \<Rightarrow> 'a" ("\<Sqinter>_" [900] 900) |
|
22 |
||
23 |
class Sup = |
|
24 |
fixes Sup :: "'a set \<Rightarrow> 'a" ("\<Squnion>_" [900] 900) |
|
25 |
||
32139 | 26 |
subsection {* Abstract complete lattices *} |
27 |
||
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
28 |
class complete_lattice = bounded_lattice + Inf + Sup + |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
29 |
assumes Inf_lower: "x \<in> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> x" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
30 |
and Inf_greatest: "(\<And>x. x \<in> A \<Longrightarrow> z \<sqsubseteq> x) \<Longrightarrow> z \<sqsubseteq> \<Sqinter>A" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
31 |
assumes Sup_upper: "x \<in> A \<Longrightarrow> x \<sqsubseteq> \<Squnion>A" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
32 |
and Sup_least: "(\<And>x. x \<in> A \<Longrightarrow> x \<sqsubseteq> z) \<Longrightarrow> \<Squnion>A \<sqsubseteq> z" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
33 |
begin |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
34 |
|
32678 | 35 |
lemma dual_complete_lattice: |
36635
080b755377c0
locale predicates of classes carry a mandatory "class" prefix
haftmann
parents:
36364
diff
changeset
|
36 |
"class.complete_lattice Sup Inf (op \<ge>) (op >) (op \<squnion>) (op \<sqinter>) \<top> \<bottom>" |
080b755377c0
locale predicates of classes carry a mandatory "class" prefix
haftmann
parents:
36364
diff
changeset
|
37 |
by (auto intro!: class.complete_lattice.intro dual_bounded_lattice) |
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
38 |
(unfold_locales, (fact bot_least top_greatest |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
39 |
Sup_upper Sup_least Inf_lower Inf_greatest)+) |
32678 | 40 |
|
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
41 |
lemma Inf_Sup: "\<Sqinter>A = \<Squnion>{b. \<forall>a \<in> A. b \<sqsubseteq> a}" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
42 |
by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
43 |
|
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
44 |
lemma Sup_Inf: "\<Squnion>A = \<Sqinter>{b. \<forall>a \<in> A. a \<sqsubseteq> b}" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
45 |
by (auto intro: antisym Inf_lower Inf_greatest Sup_upper Sup_least) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
46 |
|
41080 | 47 |
lemma Inf_empty [simp]: |
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
48 |
"\<Sqinter>{} = \<top>" |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
49 |
by (auto intro: antisym Inf_greatest) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
50 |
|
41080 | 51 |
lemma Sup_empty [simp]: |
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
52 |
"\<Squnion>{} = \<bottom>" |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
32879
diff
changeset
|
53 |
by (auto intro: antisym Sup_least) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
54 |
|
41080 | 55 |
lemma Inf_UNIV [simp]: |
56 |
"\<Sqinter>UNIV = \<bottom>" |
|
57 |
by (simp add: Sup_Inf Sup_empty [symmetric]) |
|
58 |
||
59 |
lemma Sup_UNIV [simp]: |
|
60 |
"\<Squnion>UNIV = \<top>" |
|
61 |
by (simp add: Inf_Sup Inf_empty [symmetric]) |
|
62 |
||
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
63 |
lemma Inf_insert: "\<Sqinter>insert a A = a \<sqinter> \<Sqinter>A" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
64 |
by (auto intro: le_infI le_infI1 le_infI2 antisym Inf_greatest Inf_lower) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
65 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
66 |
lemma Sup_insert: "\<Squnion>insert a A = a \<squnion> \<Squnion>A" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
67 |
by (auto intro: le_supI le_supI1 le_supI2 antisym Sup_least Sup_upper) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
68 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
69 |
lemma Inf_singleton [simp]: |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
70 |
"\<Sqinter>{a} = a" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
71 |
by (auto intro: antisym Inf_lower Inf_greatest) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
72 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
73 |
lemma Sup_singleton [simp]: |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
74 |
"\<Squnion>{a} = a" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
75 |
by (auto intro: antisym Sup_upper Sup_least) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
76 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
77 |
lemma Inf_binary: |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
78 |
"\<Sqinter>{a, b} = a \<sqinter> b" |
43831 | 79 |
by (simp add: Inf_insert) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
80 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
81 |
lemma Sup_binary: |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
82 |
"\<Squnion>{a, b} = a \<squnion> b" |
43831 | 83 |
by (simp add: Sup_insert) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
84 |
|
43754 | 85 |
lemma le_Inf_iff: "b \<sqsubseteq> \<Sqinter>A \<longleftrightarrow> (\<forall>a\<in>A. b \<sqsubseteq> a)" |
35629 | 86 |
by (auto intro: Inf_greatest dest: Inf_lower) |
87 |
||
43741 | 88 |
lemma Sup_le_iff: "\<Squnion>A \<sqsubseteq> b \<longleftrightarrow> (\<forall>a\<in>A. a \<sqsubseteq> b)" |
41082 | 89 |
by (auto intro: Sup_least dest: Sup_upper) |
38705 | 90 |
|
91 |
lemma Inf_mono: |
|
41971 | 92 |
assumes "\<And>b. b \<in> B \<Longrightarrow> \<exists>a\<in>A. a \<sqsubseteq> b" |
43741 | 93 |
shows "\<Sqinter>A \<sqsubseteq> \<Sqinter>B" |
38705 | 94 |
proof (rule Inf_greatest) |
95 |
fix b assume "b \<in> B" |
|
41971 | 96 |
with assms obtain a where "a \<in> A" and "a \<sqsubseteq> b" by blast |
43741 | 97 |
from `a \<in> A` have "\<Sqinter>A \<sqsubseteq> a" by (rule Inf_lower) |
98 |
with `a \<sqsubseteq> b` show "\<Sqinter>A \<sqsubseteq> b" by auto |
|
38705 | 99 |
qed |
100 |
||
41082 | 101 |
lemma Sup_mono: |
41971 | 102 |
assumes "\<And>a. a \<in> A \<Longrightarrow> \<exists>b\<in>B. a \<sqsubseteq> b" |
43741 | 103 |
shows "\<Squnion>A \<sqsubseteq> \<Squnion>B" |
41082 | 104 |
proof (rule Sup_least) |
105 |
fix a assume "a \<in> A" |
|
41971 | 106 |
with assms obtain b where "b \<in> B" and "a \<sqsubseteq> b" by blast |
43741 | 107 |
from `b \<in> B` have "b \<sqsubseteq> \<Squnion>B" by (rule Sup_upper) |
108 |
with `a \<sqsubseteq> b` show "a \<sqsubseteq> \<Squnion>B" by auto |
|
41082 | 109 |
qed |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
110 |
|
43741 | 111 |
lemma Sup_upper2: "u \<in> A \<Longrightarrow> v \<sqsubseteq> u \<Longrightarrow> v \<sqsubseteq> \<Squnion>A" |
41971 | 112 |
using Sup_upper[of u A] by auto |
113 |
||
43741 | 114 |
lemma Inf_lower2: "u \<in> A \<Longrightarrow> u \<sqsubseteq> v \<Longrightarrow> \<Sqinter>A \<sqsubseteq> v" |
41971 | 115 |
using Inf_lower[of u A] by auto |
116 |
||
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
117 |
definition INFI :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where |
32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset
|
118 |
"INFI A f = \<Sqinter> (f ` A)" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
119 |
|
41082 | 120 |
definition SUPR :: "'b set \<Rightarrow> ('b \<Rightarrow> 'a) \<Rightarrow> 'a" where |
121 |
"SUPR A f = \<Squnion> (f ` A)" |
|
122 |
||
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
123 |
end |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
124 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
125 |
syntax |
41082 | 126 |
"_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3INF _./ _)" [0, 10] 10) |
127 |
"_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3INF _:_./ _)" [0, 0, 10] 10) |
|
41080 | 128 |
"_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3SUP _./ _)" [0, 10] 10) |
129 |
"_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3SUP _:_./ _)" [0, 0, 10] 10) |
|
130 |
||
131 |
syntax (xsymbols) |
|
41082 | 132 |
"_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_./ _)" [0, 10] 10) |
133 |
"_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10) |
|
41080 | 134 |
"_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_./ _)" [0, 10] 10) |
135 |
"_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10) |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
136 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
137 |
translations |
41082 | 138 |
"INF x y. B" == "INF x. INF y. B" |
139 |
"INF x. B" == "CONST INFI CONST UNIV (%x. B)" |
|
140 |
"INF x. B" == "INF x:CONST UNIV. B" |
|
141 |
"INF x:A. B" == "CONST INFI A (%x. B)" |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
142 |
"SUP x y. B" == "SUP x. SUP y. B" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
143 |
"SUP x. B" == "CONST SUPR CONST UNIV (%x. B)" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
144 |
"SUP x. B" == "SUP x:CONST UNIV. B" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
145 |
"SUP x:A. B" == "CONST SUPR A (%x. B)" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
146 |
|
35115 | 147 |
print_translation {* |
42284 | 148 |
[Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"}, |
149 |
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax SUPR} @{syntax_const "_SUP"}] |
|
35115 | 150 |
*} -- {* to avoid eta-contraction of body *} |
11979 | 151 |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
152 |
context complete_lattice |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
153 |
begin |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
154 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
155 |
lemma INF_empty: "(\<Sqinter>x\<in>{}. f x) = \<top>" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
156 |
by (simp add: INFI_def) |
41971 | 157 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
158 |
lemma INF_insert: "(\<Sqinter>x\<in>insert a A. f x) = f a \<sqinter> INFI A f" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
159 |
by (simp add: INFI_def Inf_insert) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
160 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
161 |
lemma INF_leI: "i \<in> A \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> f i" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
162 |
by (auto simp add: INFI_def intro: Inf_lower) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
163 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
164 |
lemma INF_leI2: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> u \<Longrightarrow> (\<Sqinter>i\<in>A. f i) \<sqsubseteq> u" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
165 |
using INF_leI [of i A f] by auto |
41971 | 166 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
167 |
lemma le_INFI: "(\<And>i. i \<in> A \<Longrightarrow> u \<sqsubseteq> f i) \<Longrightarrow> u \<sqsubseteq> (\<Sqinter>i\<in>A. f i)" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
168 |
by (auto simp add: INFI_def intro: Inf_greatest) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
169 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
170 |
lemma le_INF_iff: "u \<sqsubseteq> (\<Sqinter>i\<in>A. f i) \<longleftrightarrow> (\<forall>i \<in> A. u \<sqsubseteq> f i)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
171 |
by (auto simp add: INFI_def le_Inf_iff) |
35629 | 172 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
173 |
lemma INF_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Sqinter>i\<in>A. f) = f" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
174 |
by (auto intro: antisym INF_leI le_INFI) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
175 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
176 |
lemma INF_cong: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
177 |
"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)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
178 |
by (simp add: INFI_def image_def) |
38705 | 179 |
|
180 |
lemma INF_mono: |
|
43753 | 181 |
"(\<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)" |
38705 | 182 |
by (force intro!: Inf_mono simp: INFI_def) |
183 |
||
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
184 |
lemma INF_subset: "A \<subseteq> B \<Longrightarrow> INFI B f \<sqsubseteq> INFI A f" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
185 |
by (intro INF_mono) auto |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
186 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
187 |
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)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
188 |
by (iprover intro: INF_leI le_INFI order_trans antisym) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
189 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
190 |
lemma SUP_cong: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
191 |
"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)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
192 |
by (simp add: SUPR_def image_def) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
193 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
194 |
lemma le_SUPI: "i \<in> A \<Longrightarrow> f i \<sqsubseteq> (\<Squnion>i\<in>A. f i)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
195 |
by (auto simp add: SUPR_def intro: Sup_upper) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
196 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
197 |
lemma le_SUPI2: "i \<in> A \<Longrightarrow> u \<sqsubseteq> f i \<Longrightarrow> u \<sqsubseteq> (\<Squnion>i\<in>A. f i)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
198 |
using le_SUPI [of i A f] by auto |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
199 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
200 |
lemma SUP_leI: "(\<And>i. i \<in> A \<Longrightarrow> f i \<sqsubseteq> u) \<Longrightarrow> (\<Squnion>i\<in>A. f i) \<sqsubseteq> u" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
201 |
by (auto simp add: SUPR_def intro: Sup_least) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
202 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
203 |
lemma SUP_le_iff: "(\<Squnion>i\<in>A. f i) \<sqsubseteq> u \<longleftrightarrow> (\<forall>i \<in> A. f i \<sqsubseteq> u)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
204 |
unfolding SUPR_def by (auto simp add: Sup_le_iff) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
205 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
206 |
lemma SUP_const [simp]: "A \<noteq> {} \<Longrightarrow> (\<Squnion>i\<in>A. f) = f" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
207 |
by (auto intro: antisym SUP_leI le_SUPI) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
208 |
|
41082 | 209 |
lemma SUP_mono: |
43753 | 210 |
"(\<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)" |
41082 | 211 |
by (force intro!: Sup_mono simp: SUPR_def) |
40872 | 212 |
|
43753 | 213 |
lemma SUP_subset: "A \<subseteq> B \<Longrightarrow> SUPR A f \<sqsubseteq> SUPR B f" |
41082 | 214 |
by (intro SUP_mono) auto |
40872 | 215 |
|
43753 | 216 |
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)" |
41082 | 217 |
by (iprover intro: SUP_leI le_SUPI order_trans antisym) |
218 |
||
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
219 |
lemma SUP_empty: "(\<Squnion>x\<in>{}. f x) = \<bottom>" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
220 |
by (simp add: SUPR_def) |
43854 | 221 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
222 |
lemma SUP_insert: "(\<Squnion>x\<in>insert a A. f x) = f a \<squnion> SUPR A f" |
43854 | 223 |
by (simp add: SUPR_def Sup_insert) |
224 |
||
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
225 |
end |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
226 |
|
41082 | 227 |
lemma Inf_less_iff: |
228 |
fixes a :: "'a\<Colon>{complete_lattice,linorder}" |
|
43753 | 229 |
shows "\<Sqinter>S \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>S. x \<sqsubset> a)" |
43754 | 230 |
unfolding not_le [symmetric] le_Inf_iff by auto |
41082 | 231 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
232 |
lemma INF_less_iff: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
233 |
fixes a :: "'a::{complete_lattice,linorder}" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
234 |
shows "(\<Sqinter>i\<in>A. f i) \<sqsubset> a \<longleftrightarrow> (\<exists>x\<in>A. f x \<sqsubset> a)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
235 |
unfolding INFI_def Inf_less_iff by auto |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
236 |
|
38705 | 237 |
lemma less_Sup_iff: |
238 |
fixes a :: "'a\<Colon>{complete_lattice,linorder}" |
|
43753 | 239 |
shows "a \<sqsubset> \<Squnion>S \<longleftrightarrow> (\<exists>x\<in>S. a \<sqsubset> x)" |
43754 | 240 |
unfolding not_le [symmetric] Sup_le_iff by auto |
38705 | 241 |
|
40872 | 242 |
lemma less_SUP_iff: |
243 |
fixes a :: "'a::{complete_lattice,linorder}" |
|
43753 | 244 |
shows "a \<sqsubset> (\<Squnion>i\<in>A. f i) \<longleftrightarrow> (\<exists>x\<in>A. a \<sqsubset> f x)" |
40872 | 245 |
unfolding SUPR_def less_Sup_iff by auto |
246 |
||
32139 | 247 |
subsection {* @{typ bool} and @{typ "_ \<Rightarrow> _"} as complete lattice *} |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
248 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
249 |
instantiation bool :: complete_lattice |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
250 |
begin |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
251 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
252 |
definition |
41080 | 253 |
"\<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x)" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
254 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
255 |
definition |
41080 | 256 |
"\<Squnion>A \<longleftrightarrow> (\<exists>x\<in>A. x)" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
257 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
258 |
instance proof |
43852 | 259 |
qed (auto simp add: Inf_bool_def Sup_bool_def) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
260 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
261 |
end |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
262 |
|
41080 | 263 |
lemma INFI_bool_eq [simp]: |
32120
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
264 |
"INFI = Ball" |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
265 |
proof (rule ext)+ |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
266 |
fix A :: "'a set" |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
267 |
fix P :: "'a \<Rightarrow> bool" |
43753 | 268 |
show "(\<Sqinter>x\<in>A. P x) \<longleftrightarrow> (\<forall>x\<in>A. P x)" |
32120
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
269 |
by (auto simp add: Ball_def INFI_def Inf_bool_def) |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
270 |
qed |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
271 |
|
41080 | 272 |
lemma SUPR_bool_eq [simp]: |
32120
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
273 |
"SUPR = Bex" |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
274 |
proof (rule ext)+ |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
275 |
fix A :: "'a set" |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
276 |
fix P :: "'a \<Rightarrow> bool" |
43753 | 277 |
show "(\<Squnion>x\<in>A. P x) \<longleftrightarrow> (\<exists>x\<in>A. P x)" |
32120
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
278 |
by (auto simp add: Bex_def SUPR_def Sup_bool_def) |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
279 |
qed |
53a21a5e6889
attempt for more concise setup of non-etacontracting binders
haftmann
parents:
32117
diff
changeset
|
280 |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
281 |
instantiation "fun" :: (type, complete_lattice) complete_lattice |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
282 |
begin |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
283 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
284 |
definition |
41080 | 285 |
"\<Sqinter>A = (\<lambda>x. \<Sqinter>{y. \<exists>f\<in>A. y = f x})" |
286 |
||
287 |
lemma Inf_apply: |
|
288 |
"(\<Sqinter>A) x = \<Sqinter>{y. \<exists>f\<in>A. y = f x}" |
|
289 |
by (simp add: Inf_fun_def) |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
290 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
291 |
definition |
41080 | 292 |
"\<Squnion>A = (\<lambda>x. \<Squnion>{y. \<exists>f\<in>A. y = f x})" |
293 |
||
294 |
lemma Sup_apply: |
|
295 |
"(\<Squnion>A) x = \<Squnion>{y. \<exists>f\<in>A. y = f x}" |
|
296 |
by (simp add: Sup_fun_def) |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
297 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
298 |
instance proof |
41080 | 299 |
qed (auto simp add: le_fun_def Inf_apply Sup_apply |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
300 |
intro: Inf_lower Sup_upper Inf_greatest Sup_least) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
301 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
302 |
end |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
303 |
|
41080 | 304 |
lemma INFI_apply: |
305 |
"(\<Sqinter>y\<in>A. f y) x = (\<Sqinter>y\<in>A. f y x)" |
|
306 |
by (auto intro: arg_cong [of _ _ Inf] simp add: INFI_def Inf_apply) |
|
38705 | 307 |
|
41080 | 308 |
lemma SUPR_apply: |
309 |
"(\<Squnion>y\<in>A. f y) x = (\<Squnion>y\<in>A. f y x)" |
|
310 |
by (auto intro: arg_cong [of _ _ Sup] simp add: SUPR_def Sup_apply) |
|
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
311 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
312 |
|
41082 | 313 |
subsection {* Inter *} |
314 |
||
315 |
abbreviation Inter :: "'a set set \<Rightarrow> 'a set" where |
|
316 |
"Inter S \<equiv> \<Sqinter>S" |
|
317 |
||
318 |
notation (xsymbols) |
|
319 |
Inter ("\<Inter>_" [90] 90) |
|
320 |
||
321 |
lemma Inter_eq: |
|
322 |
"\<Inter>A = {x. \<forall>B \<in> A. x \<in> B}" |
|
323 |
proof (rule set_eqI) |
|
324 |
fix x |
|
325 |
have "(\<forall>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<forall>B\<in>A. x \<in> B)" |
|
326 |
by auto |
|
327 |
then show "x \<in> \<Inter>A \<longleftrightarrow> x \<in> {x. \<forall>B \<in> A. x \<in> B}" |
|
328 |
by (simp add: Inf_fun_def Inf_bool_def) (simp add: mem_def) |
|
329 |
qed |
|
330 |
||
43741 | 331 |
lemma Inter_iff [simp,no_atp]: "A \<in> \<Inter>C \<longleftrightarrow> (\<forall>X\<in>C. A \<in> X)" |
41082 | 332 |
by (unfold Inter_eq) blast |
333 |
||
43741 | 334 |
lemma InterI [intro!]: "(\<And>X. X \<in> C \<Longrightarrow> A \<in> X) \<Longrightarrow> A \<in> \<Inter>C" |
41082 | 335 |
by (simp add: Inter_eq) |
336 |
||
337 |
text {* |
|
338 |
\medskip A ``destruct'' rule -- every @{term X} in @{term C} |
|
43741 | 339 |
contains @{term A} as an element, but @{prop "A \<in> X"} can hold when |
340 |
@{prop "X \<in> C"} does not! This rule is analogous to @{text spec}. |
|
41082 | 341 |
*} |
342 |
||
43741 | 343 |
lemma InterD [elim, Pure.elim]: "A \<in> \<Inter>C \<Longrightarrow> X \<in> C \<Longrightarrow> A \<in> X" |
41082 | 344 |
by auto |
345 |
||
43741 | 346 |
lemma InterE [elim]: "A \<in> \<Inter>C \<Longrightarrow> (X \<notin> C \<Longrightarrow> R) \<Longrightarrow> (A \<in> X \<Longrightarrow> R) \<Longrightarrow> R" |
41082 | 347 |
-- {* ``Classical'' elimination rule -- does not require proving |
43741 | 348 |
@{prop "X \<in> C"}. *} |
41082 | 349 |
by (unfold Inter_eq) blast |
350 |
||
43741 | 351 |
lemma Inter_lower: "B \<in> A \<Longrightarrow> \<Inter>A \<subseteq> B" |
43740 | 352 |
by (fact Inf_lower) |
353 |
||
354 |
lemma (in complete_lattice) Inf_less_eq: |
|
355 |
assumes "\<And>v. v \<in> A \<Longrightarrow> v \<sqsubseteq> u" |
|
356 |
and "A \<noteq> {}" |
|
43753 | 357 |
shows "\<Sqinter>A \<sqsubseteq> u" |
43740 | 358 |
proof - |
359 |
from `A \<noteq> {}` obtain v where "v \<in> A" by blast |
|
360 |
moreover with assms have "v \<sqsubseteq> u" by blast |
|
361 |
ultimately show ?thesis by (rule Inf_lower2) |
|
362 |
qed |
|
41082 | 363 |
|
364 |
lemma Inter_subset: |
|
43755 | 365 |
"(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> B) \<Longrightarrow> A \<noteq> {} \<Longrightarrow> \<Inter>A \<subseteq> B" |
43740 | 366 |
by (fact Inf_less_eq) |
41082 | 367 |
|
43755 | 368 |
lemma Inter_greatest: "(\<And>X. X \<in> A \<Longrightarrow> C \<subseteq> X) \<Longrightarrow> C \<subseteq> Inter A" |
43740 | 369 |
by (fact Inf_greatest) |
41082 | 370 |
|
371 |
lemma Int_eq_Inter: "A \<inter> B = \<Inter>{A, B}" |
|
43739 | 372 |
by (fact Inf_binary [symmetric]) |
41082 | 373 |
|
374 |
lemma Inter_empty [simp]: "\<Inter>{} = UNIV" |
|
375 |
by (fact Inf_empty) |
|
376 |
||
377 |
lemma Inter_UNIV [simp]: "\<Inter>UNIV = {}" |
|
43739 | 378 |
by (fact Inf_UNIV) |
41082 | 379 |
|
380 |
lemma Inter_insert [simp]: "\<Inter>(insert a B) = a \<inter> \<Inter>B" |
|
43739 | 381 |
by (fact Inf_insert) |
41082 | 382 |
|
43741 | 383 |
lemma (in complete_lattice) Inf_inter_less: "\<Sqinter>A \<squnion> \<Sqinter>B \<sqsubseteq> \<Sqinter>(A \<inter> B)" |
384 |
by (auto intro: Inf_greatest Inf_lower) |
|
385 |
||
41082 | 386 |
lemma Inter_Un_subset: "\<Inter>A \<union> \<Inter>B \<subseteq> \<Inter>(A \<inter> B)" |
43741 | 387 |
by (fact Inf_inter_less) |
388 |
||
43756 | 389 |
lemma (in complete_lattice) Inf_union_distrib: "\<Sqinter>(A \<union> B) = \<Sqinter>A \<sqinter> \<Sqinter>B" |
390 |
by (rule antisym) (auto intro: Inf_greatest Inf_lower le_infI1 le_infI2) |
|
41082 | 391 |
|
392 |
lemma Inter_Un_distrib: "\<Inter>(A \<union> B) = \<Inter>A \<inter> \<Inter>B" |
|
43756 | 393 |
by (fact Inf_union_distrib) |
394 |
||
43801 | 395 |
lemma (in complete_lattice) Inf_top_conv [no_atp]: |
396 |
"\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" |
|
397 |
"\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" |
|
398 |
proof - |
|
399 |
show "\<Sqinter>A = \<top> \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" |
|
400 |
proof |
|
401 |
assume "\<forall>x\<in>A. x = \<top>" |
|
402 |
then have "A = {} \<or> A = {\<top>}" by auto |
|
403 |
then show "\<Sqinter>A = \<top>" by auto |
|
404 |
next |
|
405 |
assume "\<Sqinter>A = \<top>" |
|
406 |
show "\<forall>x\<in>A. x = \<top>" |
|
407 |
proof (rule ccontr) |
|
408 |
assume "\<not> (\<forall>x\<in>A. x = \<top>)" |
|
409 |
then obtain x where "x \<in> A" and "x \<noteq> \<top>" by blast |
|
410 |
then obtain B where "A = insert x B" by blast |
|
411 |
with `\<Sqinter>A = \<top>` `x \<noteq> \<top>` show False by (simp add: Inf_insert) |
|
412 |
qed |
|
413 |
qed |
|
414 |
then show "\<top> = \<Sqinter>A \<longleftrightarrow> (\<forall>x\<in>A. x = \<top>)" by auto |
|
415 |
qed |
|
41082 | 416 |
|
417 |
lemma Inter_UNIV_conv [simp,no_atp]: |
|
43741 | 418 |
"\<Inter>A = UNIV \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)" |
419 |
"UNIV = \<Inter>A \<longleftrightarrow> (\<forall>x\<in>A. x = UNIV)" |
|
43801 | 420 |
by (fact Inf_top_conv)+ |
41082 | 421 |
|
43756 | 422 |
lemma (in complete_lattice) Inf_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Sqinter>A \<sqsubseteq> \<Sqinter>B" |
423 |
by (auto intro: Inf_greatest Inf_lower) |
|
424 |
||
43741 | 425 |
lemma Inter_anti_mono: "B \<subseteq> A \<Longrightarrow> \<Inter>A \<subseteq> \<Inter>B" |
43756 | 426 |
by (fact Inf_anti_mono) |
41082 | 427 |
|
428 |
||
429 |
subsection {* Intersections of families *} |
|
430 |
||
431 |
abbreviation INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where |
|
432 |
"INTER \<equiv> INFI" |
|
433 |
||
434 |
syntax |
|
435 |
"_INTER1" :: "pttrns => 'b set => 'b set" ("(3INT _./ _)" [0, 10] 10) |
|
436 |
"_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3INT _:_./ _)" [0, 0, 10] 10) |
|
437 |
||
438 |
syntax (xsymbols) |
|
439 |
"_INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>_./ _)" [0, 10] 10) |
|
440 |
"_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Inter>_\<in>_./ _)" [0, 0, 10] 10) |
|
441 |
||
442 |
syntax (latex output) |
|
443 |
"_INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10) |
|
444 |
"_INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10) |
|
445 |
||
446 |
translations |
|
447 |
"INT x y. B" == "INT x. INT y. B" |
|
448 |
"INT x. B" == "CONST INTER CONST UNIV (%x. B)" |
|
449 |
"INT x. B" == "INT x:CONST UNIV. B" |
|
450 |
"INT x:A. B" == "CONST INTER A (%x. B)" |
|
451 |
||
452 |
print_translation {* |
|
42284 | 453 |
[Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INTER} @{syntax_const "_INTER"}] |
41082 | 454 |
*} -- {* to avoid eta-contraction of body *} |
455 |
||
456 |
lemma INTER_eq_Inter_image: |
|
457 |
"(\<Inter>x\<in>A. B x) = \<Inter>(B`A)" |
|
458 |
by (fact INFI_def) |
|
459 |
||
460 |
lemma Inter_def: |
|
461 |
"\<Inter>S = (\<Inter>x\<in>S. x)" |
|
462 |
by (simp add: INTER_eq_Inter_image image_def) |
|
463 |
||
464 |
lemma INTER_def: |
|
465 |
"(\<Inter>x\<in>A. B x) = {y. \<forall>x\<in>A. y \<in> B x}" |
|
466 |
by (auto simp add: INTER_eq_Inter_image Inter_eq) |
|
467 |
||
468 |
lemma Inter_image_eq [simp]: |
|
469 |
"\<Inter>(B`A) = (\<Inter>x\<in>A. B x)" |
|
43801 | 470 |
by (rule sym) (fact INFI_def) |
41082 | 471 |
|
43817 | 472 |
lemma INT_iff [simp]: "b \<in> (\<Inter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. b \<in> B x)" |
41082 | 473 |
by (unfold INTER_def) blast |
474 |
||
43817 | 475 |
lemma INT_I [intro!]: "(\<And>x. x \<in> A \<Longrightarrow> b \<in> B x) \<Longrightarrow> b \<in> (\<Inter>x\<in>A. B x)" |
41082 | 476 |
by (unfold INTER_def) blast |
477 |
||
43852 | 478 |
lemma INT_D [elim, Pure.elim]: "b \<in> (\<Inter>x\<in>A. B x) \<Longrightarrow> a \<in> A \<Longrightarrow> b \<in> B a" |
41082 | 479 |
by auto |
480 |
||
43852 | 481 |
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" |
482 |
-- {* "Classical" elimination -- by the Excluded Middle on @{prop "a\<in>A"}. *} |
|
41082 | 483 |
by (unfold INTER_def) blast |
484 |
||
485 |
lemma INT_cong [cong]: |
|
43854 | 486 |
"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)" |
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
487 |
by (fact INF_cong) |
41082 | 488 |
|
489 |
lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})" |
|
490 |
by blast |
|
491 |
||
492 |
lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})" |
|
493 |
by blast |
|
494 |
||
43817 | 495 |
lemma INT_lower: "a \<in> A \<Longrightarrow> (\<Inter>x\<in>A. B x) \<subseteq> B a" |
41082 | 496 |
by (fact INF_leI) |
497 |
||
43817 | 498 |
lemma INT_greatest: "(\<And>x. x \<in> A \<Longrightarrow> C \<subseteq> B x) \<Longrightarrow> C \<subseteq> (\<Inter>x\<in>A. B x)" |
41082 | 499 |
by (fact le_INFI) |
500 |
||
43854 | 501 |
lemma (in complete_lattice) INFI_empty: |
502 |
"(\<Sqinter>x\<in>{}. B x) = \<top>" |
|
503 |
by (simp add: INFI_def) |
|
504 |
||
41082 | 505 |
lemma INT_empty [simp]: "(\<Inter>x\<in>{}. B x) = UNIV" |
43854 | 506 |
by (fact INFI_empty) |
507 |
||
508 |
lemma (in complete_lattice) INFI_absorb: |
|
509 |
assumes "k \<in> I" |
|
510 |
shows "A k \<sqinter> (\<Sqinter>i\<in>I. A i) = (\<Sqinter>i\<in>I. A i)" |
|
511 |
proof - |
|
512 |
from assms obtain J where "I = insert k J" by blast |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
513 |
then show ?thesis by (simp add: INF_insert) |
43854 | 514 |
qed |
41082 | 515 |
|
43817 | 516 |
lemma INT_absorb: "k \<in> I \<Longrightarrow> A k \<inter> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. A i)" |
43854 | 517 |
by (fact INFI_absorb) |
41082 | 518 |
|
43854 | 519 |
lemma INT_subset_iff: "B \<subseteq> (\<Inter>i\<in>I. A i) \<longleftrightarrow> (\<forall>i\<in>I. B \<subseteq> A i)" |
41082 | 520 |
by (fact le_INF_iff) |
521 |
||
522 |
lemma INT_insert [simp]: "(\<Inter>x \<in> insert a A. B x) = B a \<inter> INTER A B" |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
523 |
by (fact INF_insert) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
524 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
525 |
lemma (in complete_lattice) INF_union: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
526 |
"(\<Sqinter>i \<in> A \<union> B. M i) = (\<Sqinter>i \<in> A. M i) \<sqinter> (\<Sqinter>i\<in>B. M i)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
527 |
by (auto intro!: antisym INF_mono intro: le_infI1 le_infI2 le_INFI INF_leI) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
528 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
529 |
lemma INT_Un: "(\<Inter>i \<in> A \<union> B. M i) = (\<Inter>i \<in> A. M i) \<inter> (\<Inter>i\<in>B. M i)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
530 |
by (fact INF_union) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
531 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
532 |
lemma INT_insert_distrib: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
533 |
"u \<in> A \<Longrightarrow> (\<Inter>x\<in>A. insert a (B x)) = insert a (\<Inter>x\<in>A. B x)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
534 |
by blast |
43854 | 535 |
|
536 |
-- {* continue generalization from here *} |
|
41082 | 537 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
538 |
lemma (in complete_lattice) INF_constant: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
539 |
"(\<Sqinter>y\<in>A. c) = (if A = {} then \<top> else c)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
540 |
by (simp add: INF_empty) |
41082 | 541 |
|
542 |
lemma INT_constant [simp]: "(\<Inter>y\<in>A. c) = (if A = {} then UNIV else c)" |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
543 |
by (fact INF_constant) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
544 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
545 |
lemma (in complete_lattice) INF_eq: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
546 |
"(\<Sqinter>x\<in>A. B x) = \<Sqinter>({Y. \<exists>x\<in>A. Y = B x})" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
547 |
by (simp add: INFI_def image_def) |
41082 | 548 |
|
549 |
lemma INT_eq: "(\<Inter>x\<in>A. B x) = \<Inter>({Y. \<exists>x\<in>A. Y = B x})" |
|
550 |
-- {* Look: it has an \emph{existential} quantifier *} |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
551 |
by (fact INF_eq) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
552 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
553 |
lemma (in complete_lattice) INF_top_conv: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
554 |
"\<top> = (\<Sqinter>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
555 |
"(\<Sqinter>x\<in>A. B x) = \<top> \<longleftrightarrow> (\<forall>x\<in>A. B x = \<top>)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
556 |
by (auto simp add: INFI_def Inf_top_conv) |
41082 | 557 |
|
43854 | 558 |
lemma INTER_UNIV_conv [simp]: |
43817 | 559 |
"(UNIV = (\<Inter>x\<in>A. B x)) = (\<forall>x\<in>A. B x = UNIV)" |
560 |
"((\<Inter>x\<in>A. B x) = UNIV) = (\<forall>x\<in>A. B x = UNIV)" |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
561 |
by (fact INF_top_conv)+ |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
562 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
563 |
lemma (in complete_lattice) INFI_UNIV_range: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
564 |
"(\<Sqinter>x\<in>UNIV. f x) = \<Sqinter>range f" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
565 |
by (simp add: INFI_def) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
566 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
567 |
lemma UNIV_bool [no_atp]: -- "FIXME move" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
568 |
"UNIV = {False, True}" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
569 |
by auto |
41082 | 570 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
571 |
lemma (in complete_lattice) INF_bool_eq: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
572 |
"(\<Sqinter>b. A b) = A True \<sqinter> A False" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
573 |
by (simp add: UNIV_bool INF_empty INF_insert inf_commute) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
574 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
575 |
lemma INT_bool_eq: "(\<Inter>b. A b) = A True \<inter> A False" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
576 |
by (fact INF_bool_eq) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
577 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
578 |
lemma (in complete_lattice) INF_anti_mono: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
579 |
"B \<subseteq> A \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow> (\<Inter>x\<in>A. f x) \<subseteq> (\<Inter>x\<in>A. g x)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
580 |
-- {* The last inclusion is POSITIVE! *} |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
581 |
by (blast dest: subsetD) |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
582 |
|
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
583 |
lemma INT_anti_mono: |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
584 |
"B \<subseteq> A \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow> (\<Inter>x\<in>A. f x) \<subseteq> (\<Inter>x\<in>A. g x)" |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
585 |
-- {* The last inclusion is POSITIVE! *} |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43854
diff
changeset
|
586 |
by (blast dest: subsetD) |
41082 | 587 |
|
588 |
lemma Pow_INT_eq: "Pow (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. Pow (B x))" |
|
589 |
by blast |
|
590 |
||
43817 | 591 |
lemma vimage_INT: "f -` (\<Inter>x\<in>A. B x) = (\<Inter>x\<in>A. f -` B x)" |
41082 | 592 |
by blast |
593 |
||
594 |
||
32139 | 595 |
subsection {* Union *} |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
596 |
|
32587
caa5ada96a00
Inter and Union are mere abbreviations for Inf and Sup
haftmann
parents:
32436
diff
changeset
|
597 |
abbreviation Union :: "'a set set \<Rightarrow> 'a set" where |
caa5ada96a00
Inter and Union are mere abbreviations for Inf and Sup
haftmann
parents:
32436
diff
changeset
|
598 |
"Union S \<equiv> \<Squnion>S" |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
599 |
|
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
600 |
notation (xsymbols) |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
601 |
Union ("\<Union>_" [90] 90) |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
602 |
|
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
603 |
lemma Union_eq: |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
604 |
"\<Union>A = {x. \<exists>B \<in> A. x \<in> B}" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
38705
diff
changeset
|
605 |
proof (rule set_eqI) |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
606 |
fix x |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
607 |
have "(\<exists>Q\<in>{P. \<exists>B\<in>A. P \<longleftrightarrow> x \<in> B}. Q) \<longleftrightarrow> (\<exists>B\<in>A. x \<in> B)" |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
608 |
by auto |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
609 |
then show "x \<in> \<Union>A \<longleftrightarrow> x \<in> {x. \<exists>B\<in>A. x \<in> B}" |
32587
caa5ada96a00
Inter and Union are mere abbreviations for Inf and Sup
haftmann
parents:
32436
diff
changeset
|
610 |
by (simp add: Sup_fun_def Sup_bool_def) (simp add: mem_def) |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
611 |
qed |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
612 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
613 |
lemma Union_iff [simp, no_atp]: |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
614 |
"A \<in> \<Union>C \<longleftrightarrow> (\<exists>X\<in>C. A\<in>X)" |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
615 |
by (unfold Union_eq) blast |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
616 |
|
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
617 |
lemma UnionI [intro]: |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
618 |
"X \<in> C \<Longrightarrow> A \<in> X \<Longrightarrow> A \<in> \<Union>C" |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
619 |
-- {* The order of the premises presupposes that @{term C} is rigid; |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
620 |
@{term A} may be flexible. *} |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
621 |
by auto |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
622 |
|
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
623 |
lemma UnionE [elim!]: |
43817 | 624 |
"A \<in> \<Union>C \<Longrightarrow> (\<And>X. A \<in> X \<Longrightarrow> X \<in> C \<Longrightarrow> R) \<Longrightarrow> R" |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
625 |
by auto |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
626 |
|
43817 | 627 |
lemma Union_upper: "B \<in> A \<Longrightarrow> B \<subseteq> \<Union>A" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
628 |
by (iprover intro: subsetI UnionI) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
629 |
|
43817 | 630 |
lemma Union_least: "(\<And>X. X \<in> A \<Longrightarrow> X \<subseteq> C) \<Longrightarrow> \<Union>A \<subseteq> C" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
631 |
by (iprover intro: subsetI elim: UnionE dest: subsetD) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
632 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
633 |
lemma Un_eq_Union: "A \<union> B = \<Union>{A, B}" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
634 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
635 |
|
43817 | 636 |
lemma Union_empty [simp]: "\<Union>{} = {}" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
637 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
638 |
|
43817 | 639 |
lemma Union_UNIV [simp]: "\<Union>UNIV = UNIV" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
640 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
641 |
|
43817 | 642 |
lemma Union_insert [simp]: "\<Union>insert a B = a \<union> \<Union>B" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
643 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
644 |
|
43817 | 645 |
lemma Union_Un_distrib [simp]: "\<Union>(A \<union> B) = \<Union>A \<union> \<Union>B" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
646 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
647 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
648 |
lemma Union_Int_subset: "\<Union>(A \<inter> B) \<subseteq> \<Union>A \<inter> \<Union>B" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
649 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
650 |
|
43817 | 651 |
lemma Union_empty_conv [simp,no_atp]: "(\<Union>A = {}) \<longleftrightarrow> (\<forall>x\<in>A. x = {})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
652 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
653 |
|
43817 | 654 |
lemma empty_Union_conv [simp,no_atp]: "({} = \<Union>A) \<longleftrightarrow> (\<forall>x\<in>A. x = {})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
655 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
656 |
|
43817 | 657 |
lemma Union_disjoint: "(\<Union>C \<inter> A = {}) \<longleftrightarrow> (\<forall>B\<in>C. B \<inter> A = {})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
658 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
659 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
660 |
lemma subset_Pow_Union: "A \<subseteq> Pow (\<Union>A)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
661 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
662 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
663 |
lemma Union_Pow_eq [simp]: "\<Union>(Pow A) = A" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
664 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
665 |
|
43817 | 666 |
lemma Union_mono: "A \<subseteq> B \<Longrightarrow> \<Union>A \<subseteq> \<Union>B" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
667 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
668 |
|
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
669 |
|
32139 | 670 |
subsection {* Unions of families *} |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
671 |
|
32606
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32587
diff
changeset
|
672 |
abbreviation UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where |
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32587
diff
changeset
|
673 |
"UNION \<equiv> SUPR" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
674 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
675 |
syntax |
35115 | 676 |
"_UNION1" :: "pttrns => 'b set => 'b set" ("(3UN _./ _)" [0, 10] 10) |
36364
0e2679025aeb
fix syntax precedence declarations for UNION, INTER, SUP, INF
huffman
parents:
35828
diff
changeset
|
677 |
"_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3UN _:_./ _)" [0, 0, 10] 10) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
678 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
679 |
syntax (xsymbols) |
35115 | 680 |
"_UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>_./ _)" [0, 10] 10) |
36364
0e2679025aeb
fix syntax precedence declarations for UNION, INTER, SUP, INF
huffman
parents:
35828
diff
changeset
|
681 |
"_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Union>_\<in>_./ _)" [0, 0, 10] 10) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
682 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
683 |
syntax (latex output) |
35115 | 684 |
"_UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10) |
36364
0e2679025aeb
fix syntax precedence declarations for UNION, INTER, SUP, INF
huffman
parents:
35828
diff
changeset
|
685 |
"_UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 0, 10] 10) |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
686 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
687 |
translations |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
688 |
"UN x y. B" == "UN x. UN y. B" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
689 |
"UN x. B" == "CONST UNION CONST UNIV (%x. B)" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
690 |
"UN x. B" == "UN x:CONST UNIV. B" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
691 |
"UN x:A. B" == "CONST UNION A (%x. B)" |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
692 |
|
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
693 |
text {* |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
694 |
Note the difference between ordinary xsymbol syntax of indexed |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
695 |
unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}) |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
696 |
and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
697 |
former does not make the index expression a subscript of the |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
698 |
union/intersection symbol because this leads to problems with nested |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
699 |
subscripts in Proof General. |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
700 |
*} |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
701 |
|
35115 | 702 |
print_translation {* |
42284 | 703 |
[Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax UNION} @{syntax_const "_UNION"}] |
35115 | 704 |
*} -- {* to avoid eta-contraction of body *} |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
705 |
|
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
706 |
lemma UNION_eq_Union_image: |
43817 | 707 |
"(\<Union>x\<in>A. B x) = \<Union>(B ` A)" |
32606
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32587
diff
changeset
|
708 |
by (fact SUPR_def) |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
709 |
|
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
710 |
lemma Union_def: |
32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset
|
711 |
"\<Union>S = (\<Union>x\<in>S. x)" |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
712 |
by (simp add: UNION_eq_Union_image image_def) |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
713 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
714 |
lemma UNION_def [no_atp]: |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
715 |
"(\<Union>x\<in>A. B x) = {y. \<exists>x\<in>A. y \<in> B x}" |
32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset
|
716 |
by (auto simp add: UNION_eq_Union_image Union_eq) |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
717 |
|
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
718 |
lemma Union_image_eq [simp]: |
43817 | 719 |
"\<Union>(B ` A) = (\<Union>x\<in>A. B x)" |
32115
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
720 |
by (rule sym) (fact UNION_eq_Union_image) |
8f10fb3bb46e
swapped bootstrap order of UNION/Union and INTER/Inter in theory Set
haftmann
parents:
32082
diff
changeset
|
721 |
|
43852 | 722 |
lemma UN_iff [simp]: "(b \<in> (\<Union>x\<in>A. B x)) = (\<exists>x\<in>A. b \<in> B x)" |
11979 | 723 |
by (unfold UNION_def) blast |
724 |
||
43852 | 725 |
lemma UN_I [intro]: "a \<in> A \<Longrightarrow> b \<in> B a \<Longrightarrow> b \<in> (\<Union>x\<in>A. B x)" |
11979 | 726 |
-- {* The order of the premises presupposes that @{term A} is rigid; |
727 |
@{term b} may be flexible. *} |
|
728 |
by auto |
|
729 |
||
43852 | 730 |
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" |
11979 | 731 |
by (unfold UNION_def) blast |
923 | 732 |
|
11979 | 733 |
lemma UN_cong [cong]: |
43852 | 734 |
"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)" |
11979 | 735 |
by (simp add: UNION_def) |
736 |
||
29691 | 737 |
lemma strong_UN_cong: |
43852 | 738 |
"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)" |
29691 | 739 |
by (simp add: UNION_def simp_implies_def) |
740 |
||
43817 | 741 |
lemma image_eq_UN: "f ` A = (\<Union>x\<in>A. {f x})" |
32077
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
742 |
by blast |
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset
|
743 |
|
43817 | 744 |
lemma UN_upper: "a \<in> A \<Longrightarrow> B a \<subseteq> (\<Union>x\<in>A. B x)" |
32606
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32587
diff
changeset
|
745 |
by (fact le_SUPI) |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
746 |
|
43817 | 747 |
lemma UN_least: "(\<And>x. x \<in> A \<Longrightarrow> B x \<subseteq> C) \<Longrightarrow> (\<Union>x\<in>A. B x) \<subseteq> C" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
748 |
by (iprover intro: subsetI elim: UN_E dest: subsetD) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
749 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
750 |
lemma Collect_bex_eq [no_atp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
751 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
752 |
|
43817 | 753 |
lemma UN_insert_distrib: "u \<in> A \<Longrightarrow> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
754 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
755 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
756 |
lemma UN_empty [simp,no_atp]: "(\<Union>x\<in>{}. B x) = {}" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
757 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
758 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
759 |
lemma UN_empty2 [simp]: "(\<Union>x\<in>A. {}) = {}" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
760 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
761 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
762 |
lemma UN_singleton [simp]: "(\<Union>x\<in>A. {x}) = A" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
763 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
764 |
|
43817 | 765 |
lemma UN_absorb: "k \<in> I \<Longrightarrow> A k \<union> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. A i)" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
766 |
by auto |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
767 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
768 |
lemma UN_insert [simp]: "(\<Union>x\<in>insert a A. B x) = B a \<union> UNION A B" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
769 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
770 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
771 |
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)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
772 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
773 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
774 |
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)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
775 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
776 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
777 |
lemma UN_subset_iff: "((\<Union>i\<in>I. A i) \<subseteq> B) = (\<forall>i\<in>I. A i \<subseteq> B)" |
35629 | 778 |
by (fact SUP_le_iff) |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
779 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
780 |
lemma image_Union: "f ` \<Union>S = (\<Union>x\<in>S. f ` x)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
781 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
782 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
783 |
lemma UN_constant [simp]: "(\<Union>y\<in>A. c) = (if A = {} then {} else c)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
784 |
by auto |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
785 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
786 |
lemma UN_eq: "(\<Union>x\<in>A. B x) = \<Union>({Y. \<exists>x\<in>A. Y = B x})" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
787 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
788 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
789 |
lemma UNION_empty_conv[simp]: |
43817 | 790 |
"{} = (\<Union>x\<in>A. B x) \<longleftrightarrow> (\<forall>x\<in>A. B x = {})" |
791 |
"(\<Union>x\<in>A. B x) = {} \<longleftrightarrow> (\<forall>x\<in>A. B x = {})" |
|
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
792 |
by blast+ |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
793 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
794 |
lemma Collect_ex_eq [no_atp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
795 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
796 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
797 |
lemma ball_UN: "(\<forall>z \<in> UNION A B. P z) = (\<forall>x\<in>A. \<forall>z \<in> B x. P z)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
798 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
799 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
800 |
lemma bex_UN: "(\<exists>z \<in> UNION A B. P z) = (\<exists>x\<in>A. \<exists>z\<in>B x. P z)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
801 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
802 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
803 |
lemma Un_eq_UN: "A \<union> B = (\<Union>b. if b then A else B)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
804 |
by (auto simp add: split_if_mem2) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
805 |
|
43817 | 806 |
lemma UN_bool_eq: "(\<Union>b. A b) = (A True \<union> A False)" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
807 |
by (auto intro: bool_contrapos) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
808 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
809 |
lemma UN_Pow_subset: "(\<Union>x\<in>A. Pow (B x)) \<subseteq> Pow (\<Union>x\<in>A. B x)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
810 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
811 |
|
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
812 |
lemma UN_mono: |
43817 | 813 |
"A \<subseteq> B \<Longrightarrow> (\<And>x. x \<in> A \<Longrightarrow> f x \<subseteq> g x) \<Longrightarrow> |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
814 |
(\<Union>x\<in>A. f x) \<subseteq> (\<Union>x\<in>B. g x)" |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
815 |
by (blast dest: subsetD) |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
816 |
|
43817 | 817 |
lemma vimage_Union: "f -` (\<Union>A) = (\<Union>X\<in>A. f -` X)" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
818 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
819 |
|
43817 | 820 |
lemma vimage_UN: "f -` (\<Union>x\<in>A. B x) = (\<Union>x\<in>A. f -` B x)" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
821 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
822 |
|
43817 | 823 |
lemma vimage_eq_UN: "f -` B = (\<Union>y\<in>B. f -` {y})" |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
824 |
-- {* NOT suitable for rewriting *} |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
825 |
by blast |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
826 |
|
43817 | 827 |
lemma image_UN: "f ` UNION A B = (\<Union>x\<in>A. f ` B x)" |
828 |
by blast |
|
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
829 |
|
11979 | 830 |
|
32139 | 831 |
subsection {* Distributive laws *} |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
832 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
833 |
lemma Int_Union: "A \<inter> \<Union>B = (\<Union>C\<in>B. A \<inter> C)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
834 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
835 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
836 |
lemma Int_Union2: "\<Union>B \<inter> A = (\<Union>C\<in>B. C \<inter> A)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
837 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
838 |
|
43817 | 839 |
lemma Un_Union_image: "(\<Union>x\<in>C. A x \<union> B x) = \<Union>(A ` C) \<union> \<Union>(B ` C)" |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
840 |
-- {* Devlin, Fundamentals of Contemporary Set Theory, page 12, exercise 5: *} |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
841 |
-- {* Union of a family of unions *} |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
842 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
843 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
844 |
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)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
845 |
-- {* Equivalent version *} |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
846 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
847 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
848 |
lemma Un_Inter: "A \<union> \<Inter>B = (\<Inter>C\<in>B. A \<union> C)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
849 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
850 |
|
43817 | 851 |
lemma Int_Inter_image: "(\<Inter>x\<in>C. A x \<inter> B x) = \<Inter>(A ` C) \<inter> \<Inter>(B ` C)" |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
852 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
853 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
854 |
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)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
855 |
-- {* Equivalent version *} |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
856 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
857 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
858 |
lemma Int_UN_distrib: "B \<inter> (\<Union>i\<in>I. A i) = (\<Union>i\<in>I. B \<inter> A i)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
859 |
-- {* Halmos, Naive Set Theory, page 35. *} |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
860 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
861 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
862 |
lemma Un_INT_distrib: "B \<union> (\<Inter>i\<in>I. A i) = (\<Inter>i\<in>I. B \<union> A i)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
863 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
864 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
865 |
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)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
866 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
867 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
868 |
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)" |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
869 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
870 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
871 |
|
32139 | 872 |
subsection {* Complement *} |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
873 |
|
43817 | 874 |
lemma Compl_UN [simp]: "- (\<Union>x\<in>A. B x) = (\<Inter>x\<in>A. -B x)" |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
875 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
876 |
|
43817 | 877 |
lemma Compl_INT [simp]: "- (\<Inter>x\<in>A. B x) = (\<Union>x\<in>A. -B x)" |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
878 |
by blast |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
879 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
880 |
|
32139 | 881 |
subsection {* Miniscoping and maxiscoping *} |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
882 |
|
13860 | 883 |
text {* \medskip Miniscoping: pushing in quantifiers and big Unions |
884 |
and Intersections. *} |
|
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
885 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
886 |
lemma UN_simps [simp]: |
43817 | 887 |
"\<And>a B C. (\<Union>x\<in>C. insert a (B x)) = (if C={} then {} else insert a (\<Union>x\<in>C. B x))" |
43852 | 888 |
"\<And>A B C. (\<Union>x\<in>C. A x \<union> B) = ((if C={} then {} else (\<Union>x\<in>C. A x) \<union> B))" |
889 |
"\<And>A B C. (\<Union>x\<in>C. A \<union> B x) = ((if C={} then {} else A \<union> (\<Union>x\<in>C. B x)))" |
|
890 |
"\<And>A B C. (\<Union>x\<in>C. A x \<inter> B) = ((\<Union>x\<in>C. A x) \<inter>B)" |
|
891 |
"\<And>A B C. (\<Union>x\<in>C. A \<inter> B x) = (A \<inter>(\<Union>x\<in>C. B x))" |
|
892 |
"\<And>A B C. (\<Union>x\<in>C. A x - B) = ((\<Union>x\<in>C. A x) - B)" |
|
893 |
"\<And>A B C. (\<Union>x\<in>C. A - B x) = (A - (\<Inter>x\<in>C. B x))" |
|
894 |
"\<And>A B. (\<Union>x\<in>\<Union>A. B x) = (\<Union>y\<in>A. \<Union>x\<in>y. B x)" |
|
895 |
"\<And>A B C. (\<Union>z\<in>UNION A B. C z) = (\<Union>x\<in>A. \<Union>z\<in>B x. C z)" |
|
43831 | 896 |
"\<And>A B f. (\<Union>x\<in>f`A. B x) = (\<Union>a\<in>A. B (f a))" |
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
897 |
by auto |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
898 |
|
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
899 |
lemma INT_simps [simp]: |
43831 | 900 |
"\<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)" |
901 |
"\<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))" |
|
43852 | 902 |
"\<And>A B C. (\<Inter>x\<in>C. A x - B) = (if C={} then UNIV else (\<Inter>x\<in>C. A x) - B)" |
903 |
"\<And>A B C. (\<Inter>x\<in>C. A - B x) = (if C={} then UNIV else A - (\<Union>x\<in>C. B x))" |
|
43817 | 904 |
"\<And>a B C. (\<Inter>x\<in>C. insert a (B x)) = insert a (\<Inter>x\<in>C. B x)" |
43852 | 905 |
"\<And>A B C. (\<Inter>x\<in>C. A x \<union> B) = ((\<Inter>x\<in>C. A x) \<union> B)" |
906 |
"\<And>A B C. (\<Inter>x\<in>C. A \<union> B x) = (A \<union> (\<Inter>x\<in>C. B x))" |
|
907 |
"\<And>A B. (\<Inter>x\<in>\<Union>A. B x) = (\<Inter>y\<in>A. \<Inter>x\<in>y. B x)" |
|
908 |
"\<And>A B C. (\<Inter>z\<in>UNION A B. C z) = (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z)" |
|
909 |
"\<And>A B f. (\<Inter>x\<in>f`A. B x) = (\<Inter>a\<in>A. B (f a))" |
|
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
910 |
by auto |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
911 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
912 |
lemma ball_simps [simp,no_atp]: |
43852 | 913 |
"\<And>A P Q. (\<forall>x\<in>A. P x \<or> Q) \<longleftrightarrow> ((\<forall>x\<in>A. P x) \<or> Q)" |
914 |
"\<And>A P Q. (\<forall>x\<in>A. P \<or> Q x) \<longleftrightarrow> (P \<or> (\<forall>x\<in>A. Q x))" |
|
915 |
"\<And>A P Q. (\<forall>x\<in>A. P \<longrightarrow> Q x) \<longleftrightarrow> (P \<longrightarrow> (\<forall>x\<in>A. Q x))" |
|
916 |
"\<And>A P Q. (\<forall>x\<in>A. P x \<longrightarrow> Q) \<longleftrightarrow> ((\<exists>x\<in>A. P x) \<longrightarrow> Q)" |
|
917 |
"\<And>P. (\<forall>x\<in>{}. P x) \<longleftrightarrow> True" |
|
918 |
"\<And>P. (\<forall>x\<in>UNIV. P x) \<longleftrightarrow> (\<forall>x. P x)" |
|
919 |
"\<And>a B P. (\<forall>x\<in>insert a B. P x) \<longleftrightarrow> (P a \<and> (\<forall>x\<in>B. P x))" |
|
920 |
"\<And>A P. (\<forall>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<forall>y\<in>A. \<forall>x\<in>y. P x)" |
|
921 |
"\<And>A B P. (\<forall>x\<in> UNION A B. P x) = (\<forall>a\<in>A. \<forall>x\<in> B a. P x)" |
|
922 |
"\<And>P Q. (\<forall>x\<in>Collect Q. P x) \<longleftrightarrow> (\<forall>x. Q x \<longrightarrow> P x)" |
|
923 |
"\<And>A P f. (\<forall>x\<in>f`A. P x) \<longleftrightarrow> (\<forall>x\<in>A. P (f x))" |
|
924 |
"\<And>A P. (\<not> (\<forall>x\<in>A. P x)) \<longleftrightarrow> (\<exists>x\<in>A. \<not> P x)" |
|
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
925 |
by auto |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
926 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35629
diff
changeset
|
927 |
lemma bex_simps [simp,no_atp]: |
43852 | 928 |
"\<And>A P Q. (\<exists>x\<in>A. P x \<and> Q) \<longleftrightarrow> ((\<exists>x\<in>A. P x) \<and> Q)" |
929 |
"\<And>A P Q. (\<exists>x\<in>A. P \<and> Q x) \<longleftrightarrow> (P \<and> (\<exists>x\<in>A. Q x))" |
|
930 |
"\<And>P. (\<exists>x\<in>{}. P x) \<longleftrightarrow> False" |
|
931 |
"\<And>P. (\<exists>x\<in>UNIV. P x) \<longleftrightarrow> (\<exists>x. P x)" |
|
932 |
"\<And>a B P. (\<exists>x\<in>insert a B. P x) \<longleftrightarrow> (P a | (\<exists>x\<in>B. P x))" |
|
933 |
"\<And>A P. (\<exists>x\<in>\<Union>A. P x) \<longleftrightarrow> (\<exists>y\<in>A. \<exists>x\<in>y. P x)" |
|
934 |
"\<And>A B P. (\<exists>x\<in>UNION A B. P x) \<longleftrightarrow> (\<exists>a\<in>A. \<exists>x\<in>B a. P x)" |
|
935 |
"\<And>P Q. (\<exists>x\<in>Collect Q. P x) \<longleftrightarrow> (\<exists>x. Q x \<and> P x)" |
|
936 |
"\<And>A P f. (\<exists>x\<in>f`A. P x) \<longleftrightarrow> (\<exists>x\<in>A. P (f x))" |
|
937 |
"\<And>A P. (\<not>(\<exists>x\<in>A. P x)) \<longleftrightarrow> (\<forall>x\<in>A. \<not> P x)" |
|
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
938 |
by auto |
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset
|
939 |
|
13860 | 940 |
text {* \medskip Maxiscoping: pulling out big Unions and Intersections. *} |
941 |
||
942 |
lemma UN_extend_simps: |
|
43817 | 943 |
"\<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)))" |
43852 | 944 |
"\<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))" |
945 |
"\<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))" |
|
946 |
"\<And>A B C. ((\<Union>x\<in>C. A x) \<inter> B) = (\<Union>x\<in>C. A x \<inter> B)" |
|
947 |
"\<And>A B C. (A \<inter> (\<Union>x\<in>C. B x)) = (\<Union>x\<in>C. A \<inter> B x)" |
|
43817 | 948 |
"\<And>A B C. ((\<Union>x\<in>C. A x) - B) = (\<Union>x\<in>C. A x - B)" |
949 |
"\<And>A B C. (A - (\<Inter>x\<in>C. B x)) = (\<Union>x\<in>C. A - B x)" |
|
43852 | 950 |
"\<And>A B. (\<Union>y\<in>A. \<Union>x\<in>y. B x) = (\<Union>x\<in>\<Union>A. B x)" |
951 |
"\<And>A B C. (\<Union>x\<in>A. \<Union>z\<in>B x. C z) = (\<Union>z\<in>UNION A B. C z)" |
|
43831 | 952 |
"\<And>A B f. (\<Union>a\<in>A. B (f a)) = (\<Union>x\<in>f`A. B x)" |
13860 | 953 |
by auto |
954 |
||
955 |
lemma INT_extend_simps: |
|
43852 | 956 |
"\<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))" |
957 |
"\<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))" |
|
958 |
"\<And>A B C. (\<Inter>x\<in>C. A x) - B = (if C={} then UNIV - B else (\<Inter>x\<in>C. A x - B))" |
|
959 |
"\<And>A B C. A - (\<Union>x\<in>C. B x) = (if C={} then A else (\<Inter>x\<in>C. A - B x))" |
|
43817 | 960 |
"\<And>a B C. insert a (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. insert a (B x))" |
43852 | 961 |
"\<And>A B C. ((\<Inter>x\<in>C. A x) \<union> B) = (\<Inter>x\<in>C. A x \<union> B)" |
962 |
"\<And>A B C. A \<union> (\<Inter>x\<in>C. B x) = (\<Inter>x\<in>C. A \<union> B x)" |
|
963 |
"\<And>A B. (\<Inter>y\<in>A. \<Inter>x\<in>y. B x) = (\<Inter>x\<in>\<Union>A. B x)" |
|
964 |
"\<And>A B C. (\<Inter>x\<in>A. \<Inter>z\<in>B x. C z) = (\<Inter>z\<in>UNION A B. C z)" |
|
965 |
"\<And>A B f. (\<Inter>a\<in>A. B (f a)) = (\<Inter>x\<in>f`A. B x)" |
|
13860 | 966 |
by auto |
967 |
||
968 |
||
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
969 |
no_notation |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
970 |
less_eq (infix "\<sqsubseteq>" 50) and |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
971 |
less (infix "\<sqsubset>" 50) and |
41082 | 972 |
bot ("\<bottom>") and |
973 |
top ("\<top>") and |
|
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
974 |
inf (infixl "\<sqinter>" 70) and |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
975 |
sup (infixl "\<squnion>" 65) and |
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
976 |
Inf ("\<Sqinter>_" [900] 900) and |
41082 | 977 |
Sup ("\<Squnion>_" [900] 900) |
32135
f645b51e8e54
set intersection and union now named inter and union; closer connection between set and lattice operations; factored out complete lattice
haftmann
parents:
32120
diff
changeset
|
978 |
|
41080 | 979 |
no_syntax (xsymbols) |
41082 | 980 |
"_INF1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_./ _)" [0, 10] 10) |
981 |
"_INF" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sqinter>_\<in>_./ _)" [0, 0, 10] 10) |
|
41080 | 982 |
"_SUP1" :: "pttrns \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_./ _)" [0, 10] 10) |
983 |
"_SUP" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Squnion>_\<in>_./ _)" [0, 0, 10] 10) |
|
984 |
||
30596 | 985 |
lemmas mem_simps = |
986 |
insert_iff empty_iff Un_iff Int_iff Compl_iff Diff_iff |
|
987 |
mem_Collect_eq UN_iff Union_iff INT_iff Inter_iff |
|
988 |
-- {* Each of these has ALREADY been added @{text "[simp]"} above. *} |
|
21669 | 989 |
|
11979 | 990 |
end |