author  huffman 
Sun, 28 Mar 2010 12:50:38 0700  
changeset 36009  9cdbc5ffc15c 
parent 35828  46cfc4b8112e 
child 37387  3581483cca6c 
permissions  rwrr 
32139  1 
(* Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel *) 
923  2 

11979  3 
header {* Set theory for higherorder logic *} 
4 

15131  5 
theory Set 
30304
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
29901
diff
changeset

6 
imports Lattices 
15131  7 
begin 
11979  8 

32081  9 
subsection {* Sets as predicates *} 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

10 

3947  11 
global 
12 

26800  13 
types 'a set = "'a => bool" 
3820  14 

923  15 
consts 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

16 
Collect :: "('a => bool) => 'a set"  "comprehension" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

17 
"op :" :: "'a => 'a set => bool"  "membership" 
30304
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
29901
diff
changeset

18 

d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
29901
diff
changeset

19 
local 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

20 

21210  21 
notation 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

22 
"op :" ("op :") and 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

23 
"op :" ("(_/ : _)" [50, 51] 50) 
11979  24 

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

25 
defs 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

26 
mem_def [code]: "x : S == S 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

27 
Collect_def [code]: "Collect P == P" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

28 

19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

29 
abbreviation 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

30 
"not_mem x A == ~ (x : A)"  "nonmembership" 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

31 

21210  32 
notation 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

33 
not_mem ("op ~:") and 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

34 
not_mem ("(_/ ~: _)" [50, 51] 50) 
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

35 

21210  36 
notation (xsymbols) 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

37 
"op :" ("op \<in>") and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

38 
"op :" ("(_/ \<in> _)" [50, 51] 50) and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

39 
not_mem ("op \<notin>") and 
30304
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
29901
diff
changeset

40 
not_mem ("(_/ \<notin> _)" [50, 51] 50) 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

41 

21210  42 
notation (HTML output) 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

43 
"op :" ("op \<in>") and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

44 
"op :" ("(_/ \<in> _)" [50, 51] 50) and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

45 
not_mem ("op \<notin>") and 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

46 
not_mem ("(_/ \<notin> _)" [50, 51] 50) 
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

47 

32081  48 
text {* Set comprehensions *} 
49 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

50 
syntax 
35115  51 
"_Coll" :: "pttrn => bool => 'a set" ("(1{_./ _})") 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

52 
translations 
35115  53 
"{x. P}" == "CONST Collect (%x. P)" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

54 

32081  55 
syntax 
35115  56 
"_Collect" :: "idt => 'a set => bool => 'a set" ("(1{_ :/ _./ _})") 
32081  57 
syntax (xsymbols) 
35115  58 
"_Collect" :: "idt => 'a set => bool => 'a set" ("(1{_ \<in>/ _./ _})") 
32081  59 
translations 
35115  60 
"{x:A. P}" => "{x. x:A & P}" 
32081  61 

62 
lemma mem_Collect_eq [iff]: "(a : {x. P(x)}) = P(a)" 

63 
by (simp add: Collect_def mem_def) 

64 

65 
lemma Collect_mem_eq [simp]: "{x. x:A} = A" 

66 
by (simp add: Collect_def mem_def) 

67 

68 
lemma CollectI: "P(a) ==> a : {x. P(x)}" 

69 
by simp 

70 

71 
lemma CollectD: "a : {x. P(x)} ==> P(a)" 

72 
by simp 

73 

74 
lemma Collect_cong: "(!!x. P x = Q x) ==> {x. P(x)} = {x. Q(x)}" 

75 
by simp 

76 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

77 
text {* 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

78 
Simproc for pulling @{text "x=t"} in @{text "{x. \<dots> & x=t & \<dots>}"} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

79 
to the front (and similarly for @{text "t=x"}): 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

80 
*} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

81 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

82 
setup {* 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

83 
let 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

84 
val Coll_perm_tac = rtac @{thm Collect_cong} 1 THEN rtac @{thm iffI} 1 THEN 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

85 
ALLGOALS(EVERY'[REPEAT_DETERM o (etac @{thm conjE}), 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

86 
DEPTH_SOLVE_1 o (ares_tac [@{thm conjI}])]) 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

87 
val defColl_regroup = Simplifier.simproc @{theory} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

88 
"defined Collect" ["{x. P x & Q x}"] 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

89 
(Quantifier1.rearrange_Coll Coll_perm_tac) 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

90 
in 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

91 
Simplifier.map_simpset (fn ss => ss addsimprocs [defColl_regroup]) 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

92 
end 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

93 
*} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

94 

32081  95 
lemmas CollectE = CollectD [elim_format] 
96 

97 
text {* Set enumerations *} 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

98 

32264
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

99 
abbreviation empty :: "'a set" ("{}") where 
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

100 
"{} \<equiv> bot" 
31456  101 

102 
definition insert :: "'a \<Rightarrow> 'a set \<Rightarrow> 'a set" where 

32081  103 
insert_compr: "insert a B = {x. x = a \<or> x \<in> B}" 
31456  104 

105 
syntax 

35115  106 
"_Finset" :: "args => 'a set" ("{(_)}") 
31456  107 
translations 
35115  108 
"{x, xs}" == "CONST insert x {xs}" 
109 
"{x}" == "CONST insert x {}" 

31456  110 

32081  111 

112 
subsection {* Subsets and bounded quantifiers *} 

113 

114 
abbreviation 

115 
subset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 

116 
"subset \<equiv> less" 

117 

118 
abbreviation 

119 
subset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 

120 
"subset_eq \<equiv> less_eq" 

121 

122 
notation (output) 

123 
subset ("op <") and 

124 
subset ("(_/ < _)" [50, 51] 50) and 

125 
subset_eq ("op <=") and 

126 
subset_eq ("(_/ <= _)" [50, 51] 50) 

127 

128 
notation (xsymbols) 

129 
subset ("op \<subset>") and 

130 
subset ("(_/ \<subset> _)" [50, 51] 50) and 

131 
subset_eq ("op \<subseteq>") and 

132 
subset_eq ("(_/ \<subseteq> _)" [50, 51] 50) 

133 

134 
notation (HTML output) 

135 
subset ("op \<subset>") and 

136 
subset ("(_/ \<subset> _)" [50, 51] 50) and 

137 
subset_eq ("op \<subseteq>") and 

138 
subset_eq ("(_/ \<subseteq> _)" [50, 51] 50) 

139 

140 
abbreviation (input) 

141 
supset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 

142 
"supset \<equiv> greater" 

143 

144 
abbreviation (input) 

145 
supset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 

146 
"supset_eq \<equiv> greater_eq" 

147 

148 
notation (xsymbols) 

149 
supset ("op \<supset>") and 

150 
supset ("(_/ \<supset> _)" [50, 51] 50) and 

151 
supset_eq ("op \<supseteq>") and 

152 
supset_eq ("(_/ \<supseteq> _)" [50, 51] 50) 

153 

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

154 
global 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

155 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

156 
consts 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

157 
Ball :: "'a set => ('a => bool) => bool"  "bounded universal quantifiers" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

158 
Bex :: "'a set => ('a => bool) => bool"  "bounded existential quantifiers" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

159 

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 
local 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

161 

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 
defs 
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 
Ball_def: "Ball A P == ALL x. x:A > P(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

164 
Bex_def: "Bex A P == EX x. x:A & P(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

165 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

166 
syntax 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

167 
"_Ball" :: "pttrn => 'a set => bool => bool" ("(3ALL _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

168 
"_Bex" :: "pttrn => 'a set => bool => bool" ("(3EX _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

169 
"_Bex1" :: "pttrn => 'a set => bool => bool" ("(3EX! _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

170 
"_Bleast" :: "id => 'a set => bool => 'a" ("(3LEAST _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

171 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

172 
syntax (HOL) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

173 
"_Ball" :: "pttrn => 'a set => bool => bool" ("(3! _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

174 
"_Bex" :: "pttrn => 'a set => bool => bool" ("(3? _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

175 
"_Bex1" :: "pttrn => 'a set => bool => bool" ("(3?! _:_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

176 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

177 
syntax (xsymbols) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

178 
"_Ball" :: "pttrn => 'a set => bool => bool" ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

179 
"_Bex" :: "pttrn => 'a set => bool => bool" ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

180 
"_Bex1" :: "pttrn => 'a set => bool => bool" ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

181 
"_Bleast" :: "id => 'a set => bool => 'a" ("(3LEAST_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

182 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

183 
syntax (HTML output) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

184 
"_Ball" :: "pttrn => 'a set => bool => bool" ("(3\<forall>_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

185 
"_Bex" :: "pttrn => 'a set => bool => bool" ("(3\<exists>_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

186 
"_Bex1" :: "pttrn => 'a set => bool => bool" ("(3\<exists>!_\<in>_./ _)" [0, 0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

187 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

188 
translations 
35115  189 
"ALL x:A. P" == "CONST Ball A (%x. P)" 
190 
"EX x:A. P" == "CONST Bex A (%x. P)" 

191 
"EX! x:A. P" => "EX! x. x:A & P" 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

192 
"LEAST x:A. P" => "LEAST x. x:A & P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

193 

19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

194 
syntax (output) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

195 
"_setlessAll" :: "[idt, 'a, bool] => bool" ("(3ALL _<_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

196 
"_setlessEx" :: "[idt, 'a, bool] => bool" ("(3EX _<_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

197 
"_setleAll" :: "[idt, 'a, bool] => bool" ("(3ALL _<=_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

198 
"_setleEx" :: "[idt, 'a, bool] => bool" ("(3EX _<=_./ _)" [0, 0, 10] 10) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
19870
diff
changeset

199 
"_setleEx1" :: "[idt, 'a, bool] => bool" ("(3EX! _<=_./ _)" [0, 0, 10] 10) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

200 

8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

201 
syntax (xsymbols) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

202 
"_setlessAll" :: "[idt, 'a, bool] => bool" ("(3\<forall>_\<subset>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

203 
"_setlessEx" :: "[idt, 'a, bool] => bool" ("(3\<exists>_\<subset>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

204 
"_setleAll" :: "[idt, 'a, bool] => bool" ("(3\<forall>_\<subseteq>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

205 
"_setleEx" :: "[idt, 'a, bool] => bool" ("(3\<exists>_\<subseteq>_./ _)" [0, 0, 10] 10) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
19870
diff
changeset

206 
"_setleEx1" :: "[idt, 'a, bool] => bool" ("(3\<exists>!_\<subseteq>_./ _)" [0, 0, 10] 10) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

207 

19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19637
diff
changeset

208 
syntax (HOL output) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

209 
"_setlessAll" :: "[idt, 'a, bool] => bool" ("(3! _<_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

210 
"_setlessEx" :: "[idt, 'a, bool] => bool" ("(3? _<_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

211 
"_setleAll" :: "[idt, 'a, bool] => bool" ("(3! _<=_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

212 
"_setleEx" :: "[idt, 'a, bool] => bool" ("(3? _<=_./ _)" [0, 0, 10] 10) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
19870
diff
changeset

213 
"_setleEx1" :: "[idt, 'a, bool] => bool" ("(3?! _<=_./ _)" [0, 0, 10] 10) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

214 

8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

215 
syntax (HTML output) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

216 
"_setlessAll" :: "[idt, 'a, bool] => bool" ("(3\<forall>_\<subset>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

217 
"_setlessEx" :: "[idt, 'a, bool] => bool" ("(3\<exists>_\<subset>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

218 
"_setleAll" :: "[idt, 'a, bool] => bool" ("(3\<forall>_\<subseteq>_./ _)" [0, 0, 10] 10) 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

219 
"_setleEx" :: "[idt, 'a, bool] => bool" ("(3\<exists>_\<subseteq>_./ _)" [0, 0, 10] 10) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
19870
diff
changeset

220 
"_setleEx1" :: "[idt, 'a, bool] => bool" ("(3\<exists>!_\<subseteq>_./ _)" [0, 0, 10] 10) 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

221 

8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

222 
translations 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

223 
"\<forall>A\<subset>B. P" => "ALL A. A \<subset> B > P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

224 
"\<exists>A\<subset>B. P" => "EX A. A \<subset> B & P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

225 
"\<forall>A\<subseteq>B. P" => "ALL A. A \<subseteq> B > P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

226 
"\<exists>A\<subseteq>B. P" => "EX A. A \<subseteq> B & P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

227 
"\<exists>!A\<subseteq>B. P" => "EX! A. A \<subseteq> B & P" 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

228 

8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

229 
print_translation {* 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

230 
let 
35115  231 
val Type (set_type, _) = @{typ "'a set"}; (* FIXME 'a => bool (!?!) *) 
232 
val All_binder = Syntax.binder_name @{const_syntax All}; 

233 
val Ex_binder = Syntax.binder_name @{const_syntax Ex}; 

22377  234 
val impl = @{const_syntax "op >"}; 
235 
val conj = @{const_syntax "op &"}; 

35115  236 
val sbset = @{const_syntax subset}; 
237 
val sbset_eq = @{const_syntax subset_eq}; 

21819  238 

239 
val trans = 

35115  240 
[((All_binder, impl, sbset), @{syntax_const "_setlessAll"}), 
241 
((All_binder, impl, sbset_eq), @{syntax_const "_setleAll"}), 

242 
((Ex_binder, conj, sbset), @{syntax_const "_setlessEx"}), 

243 
((Ex_binder, conj, sbset_eq), @{syntax_const "_setleEx"})]; 

21819  244 

245 
fun mk v v' c n P = 

246 
if v = v' andalso not (Term.exists_subterm (fn Free (x, _) => x = v  _ => false) n) 

247 
then Syntax.const c $ Syntax.mark_bound v' $ n $ P else raise Match; 

248 

249 
fun tr' q = (q, 

35115  250 
fn [Const (@{syntax_const "_bound"}, _) $ Free (v, Type (T, _)), 
251 
Const (c, _) $ 

252 
(Const (d, _) $ (Const (@{syntax_const "_bound"}, _) $ Free (v', _)) $ n) $ P] => 

253 
if T = set_type then 

254 
(case AList.lookup (op =) trans (q, c, d) of 

255 
NONE => raise Match 

256 
 SOME l => mk v v' l n P) 

257 
else raise Match 

258 
 _ => raise Match); 

14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

259 
in 
21819  260 
[tr' All_binder, tr' Ex_binder] 
14804
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

261 
end 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

262 
*} 
8de39d3e8eb6
Corrected printer bug for bounded quantifiers Q x<=y. P
nipkow
parents:
14752
diff
changeset

263 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

264 

11979  265 
text {* 
266 
\medskip Translate between @{text "{e  x1...xn. P}"} and @{text 

267 
"{u. EX x1..xn. u = e & P}"}; @{text "{y. EX x1..xn. y = e & P}"} is 

268 
only translated if @{text "[0..n] subset bvs(e)"}. 

269 
*} 

270 

35115  271 
syntax 
272 
"_Setcompr" :: "'a => idts => bool => 'a set" ("(1{_ /_./ _})") 

273 

11979  274 
parse_translation {* 
275 
let 

35115  276 
val ex_tr = snd (mk_binder_tr ("EX ", @{const_syntax Ex})); 
3947  277 

35115  278 
fun nvars (Const (@{syntax_const "_idts"}, _) $ _ $ idts) = nvars idts + 1 
11979  279 
 nvars _ = 1; 
280 

281 
fun setcompr_tr [e, idts, b] = 

282 
let 

35115  283 
val eq = Syntax.const @{const_syntax "op ="} $ Bound (nvars idts) $ e; 
284 
val P = Syntax.const @{const_syntax "op &"} $ eq $ b; 

11979  285 
val exP = ex_tr [idts, P]; 
35115  286 
in Syntax.const @{const_syntax Collect} $ Term.absdummy (dummyT, exP) end; 
11979  287 

35115  288 
in [(@{syntax_const "_Setcompr"}, setcompr_tr)] end; 
11979  289 
*} 
923  290 

35115  291 
print_translation {* 
292 
[Syntax.preserve_binder_abs2_tr' @{const_syntax Ball} @{syntax_const "_Ball"}, 

293 
Syntax.preserve_binder_abs2_tr' @{const_syntax Bex} @{syntax_const "_Bex"}] 

294 
*}  {* to avoid etacontraction of body *} 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

295 

13763
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

296 
print_translation {* 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

297 
let 
35115  298 
val ex_tr' = snd (mk_binder_tr' (@{const_syntax Ex}, "DUMMY")); 
13763
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

299 

f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

300 
fun setcompr_tr' [Abs (abs as (_, _, P))] = 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

301 
let 
35115  302 
fun check (Const (@{const_syntax Ex}, _) $ Abs (_, _, P), n) = check (P, n + 1) 
303 
 check (Const (@{const_syntax "op &"}, _) $ 

304 
(Const (@{const_syntax "op ="}, _) $ Bound m $ e) $ P, n) = 

13763
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

305 
n > 0 andalso m = n andalso not (loose_bvar1 (P, n)) andalso 
33038  306 
subset (op =) (0 upto (n  1), add_loose_bnos (e, 0, [])) 
35115  307 
 check _ = false; 
923  308 

11979  309 
fun tr' (_ $ abs) = 
310 
let val _ $ idts $ (_ $ (_ $ _ $ e) $ Q) = ex_tr' [abs] 

35115  311 
in Syntax.const @{syntax_const "_Setcompr"} $ e $ idts $ Q end; 
312 
in 

313 
if check (P, 0) then tr' P 

314 
else 

315 
let 

316 
val (x as _ $ Free(xN, _), t) = atomic_abs_tr' abs; 

317 
val M = Syntax.const @{syntax_const "_Coll"} $ x $ t; 

318 
in 

319 
case t of 

320 
Const (@{const_syntax "op &"}, _) $ 

321 
(Const (@{const_syntax "op :"}, _) $ 

322 
(Const (@{syntax_const "_bound"}, _) $ Free (yN, _)) $ A) $ P => 

323 
if xN = yN then Syntax.const @{syntax_const "_Collect"} $ x $ A $ P else M 

324 
 _ => M 

325 
end 

13763
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

326 
end; 
35115  327 
in [(@{const_syntax Collect}, setcompr_tr')] end; 
11979  328 
*} 
329 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

330 
setup {* 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

331 
let 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

332 
val unfold_bex_tac = unfold_tac @{thms "Bex_def"}; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

333 
fun prove_bex_tac ss = unfold_bex_tac ss THEN Quantifier1.prove_one_point_ex_tac; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

334 
val rearrange_bex = Quantifier1.rearrange_bex prove_bex_tac; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

335 
val unfold_ball_tac = unfold_tac @{thms "Ball_def"}; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

336 
fun prove_ball_tac ss = unfold_ball_tac ss THEN Quantifier1.prove_one_point_all_tac; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

337 
val rearrange_ball = Quantifier1.rearrange_ball prove_ball_tac; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

338 
val defBEX_regroup = Simplifier.simproc @{theory} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

339 
"defined BEX" ["EX x:A. P x & Q x"] rearrange_bex; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

340 
val defBALL_regroup = Simplifier.simproc @{theory} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

341 
"defined BALL" ["ALL x:A. P x > Q x"] rearrange_ball; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

342 
in 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

343 
Simplifier.map_simpset (fn ss => ss addsimprocs [defBALL_regroup, defBEX_regroup]) 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

344 
end 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

345 
*} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

346 

11979  347 
lemma ballI [intro!]: "(!!x. x:A ==> P x) ==> ALL x:A. P x" 
348 
by (simp add: Ball_def) 

349 

350 
lemmas strip = impI allI ballI 

351 

352 
lemma bspec [dest?]: "ALL x:A. P x ==> x:A ==> P x" 

353 
by (simp add: Ball_def) 

354 

355 
text {* 

356 
Gives better instantiation for bound: 

357 
*} 

358 

26339  359 
declaration {* fn _ => 
360 
Classical.map_cs (fn cs => cs addbefore ("bspec", datac @{thm bspec} 1)) 

11979  361 
*} 
362 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

363 
ML {* 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

364 
structure Simpdata = 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

365 
struct 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

366 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

367 
open Simpdata; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

368 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

369 
val mksimps_pairs = [(@{const_name Ball}, @{thms bspec})] @ mksimps_pairs; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

370 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

371 
end; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

372 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

373 
open Simpdata; 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

374 
*} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

375 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

376 
declaration {* fn _ => 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

377 
Simplifier.map_ss (fn ss => ss setmksimps (mksimps mksimps_pairs)) 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

378 
*} 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

379 

0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

380 
lemma ballE [elim]: "ALL x:A. P x ==> (P x ==> Q) ==> (x ~: A ==> Q) ==> Q" 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

381 
by (unfold Ball_def) blast 
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

382 

11979  383 
lemma bexI [intro]: "P x ==> x:A ==> EX x:A. P x" 
384 
 {* Normally the best argument order: @{prop "P x"} constrains the 

385 
choice of @{prop "x:A"}. *} 

386 
by (unfold Bex_def) blast 

387 

13113  388 
lemma rev_bexI [intro?]: "x:A ==> P x ==> EX x:A. P x" 
11979  389 
 {* The best argument order when there is only one @{prop "x:A"}. *} 
390 
by (unfold Bex_def) blast 

391 

392 
lemma bexCI: "(ALL x:A. ~P x ==> P a) ==> a:A ==> EX x:A. P x" 

393 
by (unfold Bex_def) blast 

394 

395 
lemma bexE [elim!]: "EX x:A. P x ==> (!!x. x:A ==> P x ==> Q) ==> Q" 

396 
by (unfold Bex_def) blast 

397 

398 
lemma ball_triv [simp]: "(ALL x:A. P) = ((EX x. x:A) > P)" 

399 
 {* Trival rewrite rule. *} 

400 
by (simp add: Ball_def) 

401 

402 
lemma bex_triv [simp]: "(EX x:A. P) = ((EX x. x:A) & P)" 

403 
 {* Dual form for existentials. *} 

404 
by (simp add: Bex_def) 

405 

406 
lemma bex_triv_one_point1 [simp]: "(EX x:A. x = a) = (a:A)" 

407 
by blast 

408 

409 
lemma bex_triv_one_point2 [simp]: "(EX x:A. a = x) = (a:A)" 

410 
by blast 

411 

412 
lemma bex_one_point1 [simp]: "(EX x:A. x = a & P x) = (a:A & P a)" 

413 
by blast 

414 

415 
lemma bex_one_point2 [simp]: "(EX x:A. a = x & P x) = (a:A & P a)" 

416 
by blast 

417 

418 
lemma ball_one_point1 [simp]: "(ALL x:A. x = a > P x) = (a:A > P a)" 

419 
by blast 

420 

421 
lemma ball_one_point2 [simp]: "(ALL x:A. a = x > P x) = (a:A > P a)" 

422 
by blast 

423 

424 

32081  425 
text {* Congruence rules *} 
11979  426 

16636
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

427 
lemma ball_cong: 
11979  428 
"A = B ==> (!!x. x:B ==> P x = Q x) ==> 
429 
(ALL x:A. P x) = (ALL x:B. Q x)" 

430 
by (simp add: Ball_def) 

431 

16636
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

432 
lemma strong_ball_cong [cong]: 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

433 
"A = B ==> (!!x. x:B =simp=> P x = Q x) ==> 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

434 
(ALL x:A. P x) = (ALL x:B. Q x)" 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

435 
by (simp add: simp_implies_def Ball_def) 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

436 

1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

437 
lemma bex_cong: 
11979  438 
"A = B ==> (!!x. x:B ==> P x = Q x) ==> 
439 
(EX x:A. P x) = (EX x:B. Q x)" 

440 
by (simp add: Bex_def cong: conj_cong) 

1273  441 

16636
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

442 
lemma strong_bex_cong [cong]: 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

443 
"A = B ==> (!!x. x:B =simp=> P x = Q x) ==> 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

444 
(EX x:A. P x) = (EX x:B. Q x)" 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

445 
by (simp add: simp_implies_def Bex_def cong: conj_cong) 
1ed737a98198
Added strong_ball_cong and strong_bex_cong (these are now the standard
berghofe
parents:
15950
diff
changeset

446 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

447 

32081  448 
subsection {* Basic operations *} 
449 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

450 
subsubsection {* Subsets *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

451 

33022
c95102496490
Removal of the unused atpset concept, the atp attribute and some related code.
paulson
parents:
32888
diff
changeset

452 
lemma subsetI [intro!]: "(\<And>x. x \<in> A \<Longrightarrow> x \<in> B) \<Longrightarrow> A \<subseteq> B" 
32888  453 
unfolding mem_def by (rule le_funI, rule le_boolI) 
30352  454 

11979  455 
text {* 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

456 
\medskip Map the type @{text "'a set => anything"} to just @{typ 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

457 
'a}; for overloading constants whose first argument has type @{typ 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

458 
"'a set"}. 
11979  459 
*} 
460 

30596  461 
lemma subsetD [elim, intro?]: "A \<subseteq> B ==> c \<in> A ==> c \<in> B" 
32888  462 
unfolding mem_def by (erule le_funE, erule le_boolE) 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

463 
 {* Rule in Modus Ponens style. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

464 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

465 
lemma rev_subsetD [no_atp,intro?]: "c \<in> A ==> A \<subseteq> B ==> c \<in> B" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

466 
 {* The same, with reversed premises for use with @{text erule}  
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

467 
cf @{text rev_mp}. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

468 
by (rule subsetD) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

469 

11979  470 
text {* 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

471 
\medskip Converts @{prop "A \<subseteq> B"} to @{prop "x \<in> A ==> x \<in> B"}. 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

472 
*} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

473 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

474 
lemma subsetCE [no_atp,elim]: "A \<subseteq> B ==> (c \<notin> A ==> P) ==> (c \<in> B ==> P) ==> P" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

475 
 {* Classical elimination rule. *} 
32888  476 
unfolding mem_def by (blast dest: le_funE le_boolE) 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

477 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

478 
lemma subset_eq [no_atp]: "A \<le> B = (\<forall>x\<in>A. x \<in> B)" by blast 
2388  479 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

480 
lemma contra_subsetD [no_atp]: "A \<subseteq> B ==> c \<notin> B ==> c \<notin> A" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

481 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

482 

33022
c95102496490
Removal of the unused atpset concept, the atp attribute and some related code.
paulson
parents:
32888
diff
changeset

483 
lemma subset_refl [simp]: "A \<subseteq> A" 
32081  484 
by (fact order_refl) 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

485 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

486 
lemma subset_trans: "A \<subseteq> B ==> B \<subseteq> C ==> A \<subseteq> C" 
32081  487 
by (fact order_trans) 
488 

489 
lemma set_rev_mp: "x:A ==> A \<subseteq> B ==> x:B" 

490 
by (rule subsetD) 

491 

492 
lemma set_mp: "A \<subseteq> B ==> x:A ==> x:B" 

493 
by (rule subsetD) 

494 

33044  495 
lemma eq_mem_trans: "a=b ==> b \<in> A ==> a \<in> A" 
496 
by simp 

497 

32081  498 
lemmas basic_trans_rules [trans] = 
33044  499 
order_trans_rules set_rev_mp set_mp eq_mem_trans 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

500 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

501 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

502 
subsubsection {* Equality *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

503 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

504 
lemma set_ext: assumes prem: "(!!x. (x:A) = (x:B))" shows "A = B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

505 
apply (rule prem [THEN ext, THEN arg_cong, THEN box_equals]) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

506 
apply (rule Collect_mem_eq) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

507 
apply (rule Collect_mem_eq) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

508 
done 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

509 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

510 
lemma expand_set_eq: "(A = B) = (ALL x. (x:A) = (x:B))" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

511 
by(auto intro:set_ext) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

512 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

513 
lemma subset_antisym [intro!]: "A \<subseteq> B ==> B \<subseteq> A ==> A = B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

514 
 {* Antisymmetry of the subset relation. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

515 
by (iprover intro: set_ext subsetD) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

516 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

517 
text {* 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

518 
\medskip Equality rules from ZF set theory  are they appropriate 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

519 
here? 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

520 
*} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

521 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

522 
lemma equalityD1: "A = B ==> A \<subseteq> B" 
34209  523 
by simp 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

524 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

525 
lemma equalityD2: "A = B ==> B \<subseteq> A" 
34209  526 
by simp 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

527 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

528 
text {* 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

529 
\medskip Be careful when adding this to the claset as @{text 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

530 
subset_empty} is in the simpset: @{prop "A = {}"} goes to @{prop "{} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

531 
\<subseteq> A"} and @{prop "A \<subseteq> {}"} and then back to @{prop "A = {}"}! 
30352  532 
*} 
533 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

534 
lemma equalityE: "A = B ==> (A \<subseteq> B ==> B \<subseteq> A ==> P) ==> P" 
34209  535 
by simp 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

536 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

537 
lemma equalityCE [elim]: 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

538 
"A = B ==> (c \<in> A ==> c \<in> B ==> P) ==> (c \<notin> A ==> c \<notin> B ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

539 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

540 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

541 
lemma eqset_imp_iff: "A = B ==> (x : A) = (x : B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

542 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

543 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

544 
lemma eqelem_imp_iff: "x = y ==> (x : A) = (y : A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

545 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

546 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

547 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

548 
subsubsection {* The universal set  UNIV *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

549 

32264
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

550 
abbreviation UNIV :: "'a set" where 
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

551 
"UNIV \<equiv> top" 
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

552 

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

553 
lemma UNIV_def: 
32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

554 
"UNIV = {x. True}" 
32264
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

555 
by (simp add: top_fun_eq top_bool_eq Collect_def) 
32081  556 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

557 
lemma UNIV_I [simp]: "x : UNIV" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

558 
by (simp add: UNIV_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

559 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

560 
declare UNIV_I [intro]  {* unsafe makes it less likely to cause problems *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

561 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

562 
lemma UNIV_witness [intro?]: "EX x. x : UNIV" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

563 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

564 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

565 
lemma subset_UNIV [simp]: "A \<subseteq> UNIV" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

566 
by (rule subsetI) (rule UNIV_I) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

567 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

568 
text {* 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

569 
\medskip Etacontracting these two rules (to remove @{text P}) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

570 
causes them to be ignored because of their interaction with 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

571 
congruence rules. 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

572 
*} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

573 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

574 
lemma ball_UNIV [simp]: "Ball UNIV P = All P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

575 
by (simp add: Ball_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

576 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

577 
lemma bex_UNIV [simp]: "Bex UNIV P = Ex P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

578 
by (simp add: Bex_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

579 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

580 
lemma UNIV_eq_I: "(\<And>x. x \<in> A) \<Longrightarrow> UNIV = A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

581 
by auto 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

582 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

583 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

584 
subsubsection {* The empty set *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

585 

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

586 
lemma empty_def: 
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

587 
"{} = {x. False}" 
32264
0be31453f698
Set.UNIV and Set.empty are mere abbreviations for top and bot
haftmann
parents:
32139
diff
changeset

588 
by (simp add: bot_fun_eq bot_bool_eq Collect_def) 
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

589 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

590 
lemma empty_iff [simp]: "(c : {}) = False" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

591 
by (simp add: empty_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

592 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

593 
lemma emptyE [elim!]: "a : {} ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

594 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

595 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

596 
lemma empty_subsetI [iff]: "{} \<subseteq> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

597 
 {* One effect is to delete the ASSUMPTION @{prop "{} <= A"} *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

598 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

599 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

600 
lemma equals0I: "(!!y. y \<in> A ==> False) ==> A = {}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

601 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

602 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

603 
lemma equals0D: "A = {} ==> a \<notin> A" 
32082  604 
 {* Use for reasoning about disjointness: @{text "A Int B = {}"} *} 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

605 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

606 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

607 
lemma ball_empty [simp]: "Ball {} P = True" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

608 
by (simp add: Ball_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

609 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

610 
lemma bex_empty [simp]: "Bex {} P = False" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

611 
by (simp add: Bex_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

612 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

613 
lemma UNIV_not_empty [iff]: "UNIV ~= {}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

614 
by (blast elim: equalityE) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

615 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

616 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

617 
subsubsection {* The Powerset operator  Pow *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

618 

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

619 
definition Pow :: "'a set => 'a set set" where 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

620 
Pow_def: "Pow A = {B. B \<le> 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

621 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

622 
lemma Pow_iff [iff]: "(A \<in> Pow B) = (A \<subseteq> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

623 
by (simp add: Pow_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

624 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

625 
lemma PowI: "A \<subseteq> B ==> A \<in> Pow B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

626 
by (simp add: Pow_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

627 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

628 
lemma PowD: "A \<in> Pow B ==> A \<subseteq> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

629 
by (simp add: Pow_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

630 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

631 
lemma Pow_bottom: "{} \<in> Pow B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

632 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

633 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

634 
lemma Pow_top: "A \<in> Pow A" 
34209  635 
by simp 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

636 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

637 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

638 
subsubsection {* Set complement *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

639 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

640 
lemma Compl_iff [simp]: "(c \<in> A) = (c \<notin> A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

641 
by (simp add: mem_def fun_Compl_def bool_Compl_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

642 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

643 
lemma ComplI [intro!]: "(c \<in> A ==> False) ==> c \<in> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

644 
by (unfold mem_def fun_Compl_def bool_Compl_def) blast 
923  645 

11979  646 
text {* 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

647 
\medskip This form, with negated conclusion, works well with the 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

648 
Classical prover. Negated assumptions behave like formulae on the 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

649 
right side of the notional turnstile ... *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

650 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

651 
lemma ComplD [dest!]: "c : A ==> c~:A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

652 
by (simp add: mem_def fun_Compl_def bool_Compl_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

653 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

654 
lemmas ComplE = ComplD [elim_format] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

655 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

656 
lemma Compl_eq: " A = {x. ~ x : A}" by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

657 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

658 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

659 
subsubsection {* Binary union  Un *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

660 

32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

661 
abbreviation union :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Un" 65) where 
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

662 
"op Un \<equiv> sup" 
32081  663 

664 
notation (xsymbols) 

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

665 
union (infixl "\<union>" 65) 
32081  666 

667 
notation (HTML output) 

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

668 
union (infixl "\<union>" 65) 
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

669 

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

670 
lemma Un_def: 
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

671 
"A \<union> B = {x. x \<in> A \<or> x \<in> B}" 
32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

672 
by (simp add: sup_fun_eq sup_bool_eq Collect_def mem_def) 
32081  673 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

674 
lemma Un_iff [simp]: "(c : A Un B) = (c:A  c:B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

675 
by (unfold Un_def) blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

676 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

677 
lemma UnI1 [elim?]: "c:A ==> c : A Un B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

678 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

679 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

680 
lemma UnI2 [elim?]: "c:B ==> c : A Un B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

681 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

682 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

683 
text {* 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

684 
\medskip Classical introduction rule: no commitment to @{prop A} vs 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

685 
@{prop B}. 
11979  686 
*} 
687 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

688 
lemma UnCI [intro!]: "(c~:B ==> c:A) ==> c : A Un B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

689 
by auto 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

690 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

691 
lemma UnE [elim!]: "c : A Un B ==> (c:A ==> P) ==> (c:B ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

692 
by (unfold Un_def) blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

693 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

694 
lemma insert_def: "insert a B = {x. x = a} \<union> B" 
32081  695 
by (simp add: Collect_def mem_def insert_compr Un_def) 
696 

697 
lemma mono_Un: "mono f \<Longrightarrow> f A \<union> f B \<subseteq> f (A \<union> B)" 

32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

698 
by (fact mono_sup) 
32081  699 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

700 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

701 
subsubsection {* Binary intersection  Int *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

702 

32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

703 
abbreviation inter :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Int" 70) where 
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

704 
"op Int \<equiv> inf" 
32081  705 

706 
notation (xsymbols) 

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

707 
inter (infixl "\<inter>" 70) 
32081  708 

709 
notation (HTML output) 

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

710 
inter (infixl "\<inter>" 70) 
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

711 

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

712 
lemma Int_def: 
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

713 
"A \<inter> B = {x. x \<in> A \<and> x \<in> B}" 
32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

714 
by (simp add: inf_fun_eq inf_bool_eq Collect_def mem_def) 
32081  715 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

716 
lemma Int_iff [simp]: "(c : A Int B) = (c:A & c:B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

717 
by (unfold Int_def) blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

718 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

719 
lemma IntI [intro!]: "c:A ==> c:B ==> c : A Int B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

720 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

721 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

722 
lemma IntD1: "c : A Int B ==> c:A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

723 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

724 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

725 
lemma IntD2: "c : A Int B ==> c:B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

726 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

727 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

728 
lemma IntE [elim!]: "c : A Int B ==> (c:A ==> c:B ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

729 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

730 

32081  731 
lemma mono_Int: "mono f \<Longrightarrow> f (A \<inter> B) \<subseteq> f A \<inter> f B" 
32683
7c1fe854ca6a
inter and union are mere abbreviations for inf and sup
haftmann
parents:
32456
diff
changeset

732 
by (fact mono_inf) 
32081  733 

30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

734 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

735 
subsubsection {* Set difference *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

736 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

737 
lemma Diff_iff [simp]: "(c : A  B) = (c:A & c~:B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

738 
by (simp add: mem_def fun_diff_def bool_diff_def) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

739 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

740 
lemma DiffI [intro!]: "c : A ==> c ~: B ==> c : A  B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

741 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

742 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

743 
lemma DiffD1: "c : A  B ==> c : A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

744 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

745 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

746 
lemma DiffD2: "c : A  B ==> c : B ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

747 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

748 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

749 
lemma DiffE [elim!]: "c : A  B ==> (c:A ==> c~:B ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

750 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

751 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

752 
lemma set_diff_eq: "A  B = {x. x : A & ~ x : B}" by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

753 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

754 
lemma Compl_eq_Diff_UNIV: "A = (UNIV  A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

755 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

756 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

757 

31456  758 
subsubsection {* Augmenting a set  @{const insert} *} 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

759 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

760 
lemma insert_iff [simp]: "(a : insert b A) = (a = b  a:A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

761 
by (unfold insert_def) blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

762 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

763 
lemma insertI1: "a : insert a B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

764 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

765 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

766 
lemma insertI2: "a : B ==> a : insert b B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

767 
by simp 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

768 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

769 
lemma insertE [elim!]: "a : insert b A ==> (a = b ==> P) ==> (a:A ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

770 
by (unfold insert_def) blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

771 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

772 
lemma insertCI [intro!]: "(a~:B ==> a = b) ==> a: insert b B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

773 
 {* Classical introduction rule. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

774 
by auto 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

775 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

776 
lemma subset_insert_iff: "(A \<subseteq> insert x B) = (if x:A then A  {x} \<subseteq> B else A \<subseteq> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

777 
by auto 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

778 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

779 
lemma set_insert: 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

780 
assumes "x \<in> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

781 
obtains B where "A = insert x B" and "x \<notin> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

782 
proof 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

783 
from assms show "A = insert x (A  {x})" by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

784 
next 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

785 
show "x \<notin> A  {x}" by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

786 
qed 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

787 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

788 
lemma insert_ident: "x ~: A ==> x ~: B ==> (insert x A = insert x B) = (A = B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

789 
by auto 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

790 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

791 
subsubsection {* Singletons, using insert *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

792 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

793 
lemma singletonI [intro!,no_atp]: "a : {a}" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

794 
 {* Redundant? But unlike @{text insertCI}, it proves the subgoal immediately! *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

795 
by (rule insertI1) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

796 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

797 
lemma singletonD [dest!,no_atp]: "b : {a} ==> b = a" 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

798 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

799 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

800 
lemmas singletonE = singletonD [elim_format] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

801 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

802 
lemma singleton_iff: "(b : {a}) = (b = a)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

803 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

804 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

805 
lemma singleton_inject [dest!]: "{a} = {b} ==> a = b" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

806 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

807 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

808 
lemma singleton_insert_inj_eq [iff,no_atp]: 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

809 
"({b} = insert a A) = (a = b & A \<subseteq> {b})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

810 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

811 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

812 
lemma singleton_insert_inj_eq' [iff,no_atp]: 
30531
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

813 
"(insert a A = {b}) = (a = b & A \<subseteq> {b})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

814 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

815 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

816 
lemma subset_singletonD: "A \<subseteq> {x} ==> A = {}  A = {x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

817 
by fast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

818 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

819 
lemma singleton_conv [simp]: "{x. x = a} = {a}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

820 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

821 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

822 
lemma singleton_conv2 [simp]: "{x. a = x} = {a}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

823 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

824 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

825 
lemma diff_single_insert: "A  {x} \<subseteq> B ==> x \<in> A ==> A \<subseteq> insert x B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

826 
by blast 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

827 

ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

828 
lemma doubleton_eq_iff: "({a,b} = {c,d}) = (a=c & b=d  a=d & b=c)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

829 
by (blast elim: equalityE) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

830 

11979  831 

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

832 
subsubsection {* Image of a set under a function *} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

833 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

834 
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

835 
Frequently @{term b} does not have the syntactic form of @{term "f 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

836 
*} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

837 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

838 
definition image :: "('a => 'b) => 'a set => 'b set" (infixr "`" 90) where 
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

839 
image_def [no_atp]: "f ` A = {y. EX x:A. y = 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

840 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

841 
abbreviation 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

842 
range :: "('a => 'b) => 'b set" where  "of function" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

843 
"range f == f ` UNIV" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

844 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

845 
lemma image_eqI [simp, intro]: "b = f x ==> x:A ==> b : f`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

846 
by (unfold image_def) 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

847 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

848 
lemma imageI: "x : A ==> f x : f ` 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

849 
by (rule image_eqI) (rule refl) 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

850 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

851 
lemma rev_image_eqI: "x:A ==> b = f x ==> b : f`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

852 
 {* This version's more effective when we already have 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

853 
required @{term 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

854 
by (unfold image_def) 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

855 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

856 
lemma imageE [elim!]: 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

857 
"b : (%x. f x)`A ==> (!!x. b = f x ==> x:A ==> P) ==> P" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

858 
 {* The etaexpansion gives variablename preservation. *} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

859 
by (unfold image_def) 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

860 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

861 
lemma image_Un: "f`(A Un B) = f`A Un f`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

862 
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

863 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

864 
lemma image_iff: "(z : f`A) = (EX x:A. z = f 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

865 
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

866 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

867 
lemma image_subset_iff: "(f`A \<subseteq> B) = (\<forall>x\<in>A. f x \<in> 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

868 
 {* This rewrite rule would confuse users if made default. *} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

869 
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

870 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

871 
lemma subset_image_iff: "(B \<subseteq> f`A) = (EX AA. AA \<subseteq> A & B = f`AA)" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

872 
apply safe 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

873 
prefer 2 apply fast 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

874 
apply (rule_tac x = "{a. a : A & f a : B}" in exI, fast) 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

875 
done 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

876 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

877 
lemma image_subsetI: "(!!x. x \<in> A ==> f x \<in> B) ==> f`A \<subseteq> 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

878 
 {* Replaces the three steps @{text subsetI}, @{text imageE}, 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

879 
@{text hypsubst}, but breaks too many existing proofs. *} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

880 
by blast 
11979  881 

882 
text {* 

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

883 
\medskip Range of a function  just a translation for image! 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

884 
*} 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

885 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

886 
lemma range_eqI: "b = f x ==> b \<in> range f" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

887 
by 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

888 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

889 
lemma rangeI: "f x \<in> range f" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

890 
by 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

891 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

892 
lemma rangeE [elim?]: "b \<in> range (\<lambda>x. f x) ==> (!!x. b = f x ==> P) ==> P" 
3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

893 
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

894 

3698947146b2
closer relation of sets and complete lattices; corresponding consts, defs and syntax at similar places in theory text
haftmann
parents:
32064
diff
changeset

895 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

896 
subsubsection {* Some rules with @{text "if"} *} 
32081  897 

898 
text{* Elimination of @{text"{x. \<dots> & x=t & \<dots>}"}. *} 

899 

900 
lemma Collect_conv_if: "{x. x=a & P x} = (if P a then {a} else {})" 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

901 
by auto 
32081  902 

903 
lemma Collect_conv_if2: "{x. a=x & P x} = (if P a then {a} else {})" 

32117
0762b9ad83df
Set.thy: prefer = over == where possible; tuned ML setup; dropped (moved) ML legacy
haftmann
parents:
32115
diff
changeset

904 
by auto 
32081  905 

906 
text {* 

907 
Rewrite rules for boolean casesplitting: faster than @{text 

908 
"split_if [split]"}. 

909 
*} 

910 

911 
lemma split_if_eq1: "((if Q then x else y) = b) = ((Q > x = b) & (~ Q > y = b))" 

912 
by (rule split_if) 

913 

914 
lemma split_if_eq2: "(a = (if Q then x else y)) = ((Q > a = x) & (~ Q > a = y))" 

915 
by (rule split_if) 

916 

917 
text {* 

918 
Split ifs on either side of the membership relation. Not for @{text 

919 
"[simp]"}  can cause goals to blow up! 

920 
*} 

921 

922 
lemma split_if_mem1: "((if Q then x else y) : b) = ((Q > x : b) & (~ Q > y : b))" 

923 
by (rule split_if) 

924 

925 
lemma split_if_mem2: "(a : (if Q then x else y)) = ((Q > a : x) & (~ Q > a : y))" 

926 
by (rule split_if [where P="%S. a : S"]) 

927 

928 
lemmas split_ifs = if_bool_eq_conj split_if_eq1 split_if_eq2 split_if_mem1 split_if_mem2 

929 

930 
(*Would like to add these, but the existing code only searches for the 

931 
outerlevel constant, which in this case is just "op :"; we instead need 

932 
to use termnets to associate patterns with rules. Also, if a rule fails to 

933 
apply, then the formula should be kept. 

34974
18b41bba42b5
new theory Algebras.thy for generic algebraic structures
haftmann
parents:
34209
diff
changeset

934 
[("uminus", Compl_iff RS iffD1), ("minus", [Diff_iff RS iffD1]), 
32081  935 
("Int", [IntD1,IntD2]), 
936 
("Collect", [CollectD]), ("Inter", [InterD]), ("INTER", [INT_D])] 

937 
*) 

938 

939 

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

940 
subsection {* Further operations and lemmas *} 
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

941 

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

942 
subsubsection {* The ``proper subset'' relation *} 
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

943 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

944 
lemma psubsetI [intro!,no_atp]: "A \<subseteq> B ==> A \<noteq> B ==> A \<subset> 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

945 
by (unfold less_le) 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

946 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

947 
lemma psubsetE [elim!,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

948 
"[A \<subset> B; [A \<subseteq> B; ~ (B\<subseteq>A)] ==> R] ==> R" 
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

949 
by (unfold less_le) 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

950 

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

951 
lemma psubset_insert_iff: 
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

952 
"(A \<subset> insert x B) = (if x \<in> B then A \<subset> B else if x \<in> A then A  {x} \<subset> B else A \<subseteq> 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

953 
by (auto simp add: less_le subset_insert_iff) 
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

954 

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

955 
lemma psubset_eq: "(A \<subset> B) = (A \<subseteq> B & A \<noteq> 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

956 
by (simp only: less_le) 
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

957 

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

958 
lemma psubset_imp_subset: "A \<subset> B ==> A \<subseteq> 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

959 
by (simp add: psubset_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

960 

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

961 
lemma psubset_trans: "[ A \<subset> B; B \<subset> C ] ==> A \<subset> 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

962 
apply (unfold less_le) 
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

963 
apply (auto dest: subset_antisym) 
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

964 
done 
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

965 

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

966 
lemma psubsetD: "[ A \<subset> B; c \<in> A ] ==> c \<in> 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

967 
apply (unfold less_le) 
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

968 
apply (auto 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

969 
done 
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 

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 
lemma psubset_subset_trans: "A \<subset> B ==> B \<subseteq> C ==> A \<subset> 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

972 
by (auto simp add: psubset_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

973 

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 
lemma subset_psubset_trans: "A \<subseteq> B ==> B \<subset> C ==> A \<subset> 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

975 
by (auto simp add: psubset_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

976 

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

977 
lemma psubset_imp_ex_mem: "A \<subset> B ==> \<exists>b. b \<in> (B  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

978 
by (unfold less_le) 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

979 

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

980 
lemma atomize_ball: 
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

981 
"(!!x. x \<in> A ==> P x) == Trueprop (\<forall>x\<in>A. P 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

982 
by (simp only: Ball_def atomize_all atomize_imp) 
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

983 

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

984 
lemmas [symmetric, rulify] = atomize_ball 
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

985 
and [symmetric, defn] = atomize_ball 
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

986 

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

987 
subsubsection {* Derived rules involving subsets. *} 
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

988 

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

989 
text {* @{text insert}. *} 
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

990 

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

991 
lemma subset_insertI: "B \<subseteq> insert 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

992 
by (rule subsetI) (erule insertI2) 
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

993 

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

994 
lemma subset_insertI2: "A \<subseteq> B \<Longrightarrow> A \<subseteq> insert b 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

995 
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

996 

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

997 
lemma subset_insert: "x \<notin> A ==> (A \<subseteq> insert x B) = (A \<subseteq> 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

998 
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

999 

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

1000 

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

1001 
text {* \medskip Finite Union  the least upper bound of two sets. *} 
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

1002 

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

1003 
lemma Un_upper1: "A \<subseteq> A \<union> B" 
36009  1004 
by (fact sup_ge1) 
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

1005 

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

1006 
lemma Un_upper2: "B \<subseteq> A \<union> B" 
36009  1007 
by (fact sup_ge2) 
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

1008 

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

1009 
lemma Un_least: "A \<subseteq> C ==> B \<subseteq> C ==> A \<union> B \<subseteq> C" 
36009  1010 
by (fact sup_least) 
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

1011 

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

1012 

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

1013 
text {* \medskip Finite Intersection  the greatest lower bound of two sets. *} 
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

1014 

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

1015 
lemma Int_lower1: "A \<inter> B \<subseteq> A" 
36009  1016 
by (fact inf_le1) 
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

1017 

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

1018 
lemma Int_lower2: "A \<inter> B \<subseteq> B" 
36009  1019 
by (fact inf_le2) 
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

1020 

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

1021 
lemma Int_greatest: "C \<subseteq> A ==> C \<subseteq> B ==> C \<subseteq> A \<inter> B" 
36009  1022 
by (fact inf_greatest) 
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

1023 

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

1024 

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

1025 
text {* \medskip Set difference. *} 
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

1026 

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

1027 
lemma Diff_subset: "A  B \<subseteq> 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

1028 
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

1029 

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

1030 
lemma Diff_subset_conv: "(A  B \<subseteq> C) = (A \<subseteq> B \<union> 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

1031 
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

1032 

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

1033 

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

1034 
subsubsection {* Equalities involving union, intersection, inclusion, etc. *} 
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

1035 

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

1036 
text {* @{text "{}"}. *} 
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

1037 

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

1038 
lemma Collect_const [simp]: "{s. P} = (if P then UNIV else {})" 
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

1039 
 {* supersedes @{text "Collect_False_empty"} *} 
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

1040 
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

1041 

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

1042 
lemma subset_empty [simp]: "(A \<subseteq> {}) = (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

1043 
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

1044 

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

1045 
lemma not_psubset_empty [iff]: "\<not> (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

1046 
by (unfold less_le) 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

1047 

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

1048 
lemma Collect_empty_eq [simp]: "(Collect P = {}) = (\<forall>x. \<not> P 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

1049 
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

1050 

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

1051 
lemma empty_Collect_eq [simp]: "({} = Collect P) = (\<forall>x. \<not> P 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

1052 
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

1053 

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

1054 
lemma Collect_neg_eq: "{x. \<not> P x} =  {x. P 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

1055 
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

1056 

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

1057 
lemma Collect_disj_eq: "{x. P x  Q x} = {x. P x} \<union> {x. Q 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

1058 
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

1059 

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

1060 
lemma Collect_imp_eq: "{x. P x > Q x} = {x. P x} \<union> {x. Q 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

1061 
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

1062 

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

1063 
lemma Collect_conj_eq: "{x. P x & Q x} = {x. P x} \<inter> {x. Q 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

1064 
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

1065 

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

1066 

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

1067 
text {* \medskip @{text insert}. *} 
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

1068 

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

1069 
lemma insert_is_Un: "insert a A = {a} Un 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

1070 
 {* NOT SUITABLE FOR REWRITING since @{text "{a} == insert 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

1071 
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

1072 

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

1073 
lemma insert_not_empty [simp]: "insert a A \<noteq> {}" 
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

1074 
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

1075 

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

1076 
lemmas empty_not_insert = insert_not_empty [symmetric, standard] 
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

1077 
declare empty_not_insert [simp] 
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

1078 

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

1079 
lemma insert_absorb: "a \<in> A ==> insert a 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

1080 
 {* @{text "[simp]"} causes recursive calls when there are nested inserts *} 
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

1081 
 {* with \emph{quadratic} running time *} 
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

1082 
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

1083 

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

1084 
lemma insert_absorb2 [simp]: "insert x (insert x A) = insert 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

1085 
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

1086 

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

1087 
lemma insert_commute: "insert x (insert y A) = insert y (insert 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

1088 
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

1089 

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

1090 
lemma insert_subset [simp]: "(insert x A \<subseteq> B) = (x \<in> B & A \<subseteq> 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

1091 
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

1092 

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

1093 
lemma mk_disjoint_insert: "a \<in> A ==> \<exists>B. A = insert a B & a \<notin> 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

1094 
 {* use new @{text B} rather than @{text "A  {a}"} to avoid infinite unfolding *} 
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

1095 
apply (rule_tac x = "A  {a}" in exI, 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

1096 
done 
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

1097 

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

1098 
lemma insert_Collect: "insert a (Collect P) = {u. u \<noteq> a > P u}" 
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

1099 
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

1100 

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

1101 
lemma insert_inter_insert[simp]: "insert a A \<inter> insert a B = insert a (A \<inter> 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

1102 
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

1103 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

1104 
lemma insert_disjoint [simp,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

1105 
"(insert a A \<inter> B = {}) = (a \<notin> B \<and> A \<inter> 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

1106 
"({} = insert a A \<inter> B) = (a \<notin> B \<and> {} = A \<inter> 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

1107 
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

1108 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

1109 
lemma disjoint_insert [simp,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

1110 
"(B \<inter> insert a A = {}) = (a \<notin> B \<and> B \<inter> 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

1111 
"({} = A \<inter> insert b B) = (b \<notin> A \<and> {} = A \<inter> 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

1112 
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

1113 

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

1114 
text {* \medskip @{text image}. *} 
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

1115 

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

1116 
lemma image_empty [simp]: "f`{} = {}" 
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

1117 
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

1118 

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

1119 
lemma image_insert [simp]: "f ` insert a B = insert (f a) (f`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

1120 
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

1121 

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

1122 
lemma image_constant: "x \<in> A ==> (\<lambda>x. c) ` A = {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

1123 
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

1124 

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

1125 
lemma image_constant_conv: "(%x. c) ` A = (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

1126 
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

1127 

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

1128 
lemma image_image: "f ` (g ` A) = (\<lambda>x. f (g 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

1129 
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

1130 

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

1131 
lemma insert_image [simp]: "x \<in> A ==> insert (f x) (f`A) = f`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

1132 
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

1133 

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

1134 
lemma image_is_empty [iff]: "(f`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

1135 
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

1136 

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

1137 
lemma empty_is_image[iff]: "({} = f ` 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

1138 
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

1139 

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

1140 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

1141 
lemma image_Collect [no_atp]: "f ` {x. P x} = {f x  x. P 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

1142 
 {* NOT suitable as a default simprule: the RHS isn't simpler than the LHS, 
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

1143 
with its implicit quantifier and conjunction. Also image enjoys better 
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

1144 
equational properties than does the RHS. *} 
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

1145 
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

1146 

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

1147 
lemma if_image_distrib [simp]: 
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

1148 
"(\<lambda>x. if P x then f x else g x) ` S 
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

1149 
= (f ` (S \<inter> {x. P x})) \<union> (g ` (S \<inter> {x. \<not> P 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

1150 
by (auto simp add: image_def) 
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

1151 

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

1152 
lemma image_cong: "M = N ==> (!!x. x \<in> N ==> f x = g x) ==> f`M = g`N" 
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

1153 
by (simp add: image_def) 
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

1154 

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

1155 

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

1156 
text {* \medskip @{text range}. *} 
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

1157 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

1158 
lemma full_SetCompr_eq [no_atp]: "{u. \<exists>x. u = f x} = range f" 
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

1159 
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

1160 

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

1161 
lemma range_composition: "range (\<lambda>x. f (g x)) = f`range g" 
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

1162 
by (subst image_image, simp) 
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

1163 

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

1164 

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

1165 
text {* \medskip @{text Int} *} 
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

1166 

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

1167 
lemma Int_absorb [simp]: "A \<inter> A = A" 
36009  1168 
by (fact inf_idem) 
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

1169 

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

1170 
lemma Int_left_absorb: "A \<inter> (A \<inter> B) = A \<inter> B" 
36009  1171 
by (fact inf_left_idem) 
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

1172 

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

1173 
lemma Int_commute: "A \<inter> B = B \<inter> A" 
36009  1174 
by (fact inf_commute) 
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

1175 

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

1176 
lemma Int_left_commute: "A \<inter> (B \<inter> C) = B \<inter> (A \<inter> C)" 
36009  1177 
by (fact inf_left_commute) 
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

1178 

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

1179 
lemma Int_assoc: "(A \<inter> B) \<inter> C = A \<inter> (B \<inter> C)" 
36009  1180 
by (fact inf_assoc) 
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

1181 

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

1182 
lemmas Int_ac = Int_assoc Int_left_absorb Int_commute Int_left_commute 
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

1183 
 {* Intersection is an ACoperator *} 
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

1184 

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

1185 
lemma Int_absorb1: "B \<subseteq> A ==> A \<inter> B = B" 
36009  1186 
by (fact inf_absorb2) 
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

1187 

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

1188 
lemma Int_absorb2: "A \<subseteq> B ==> A \<inter> B = A" 
36009  1189 
by (fact inf_absorb1) 
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

1190 

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

1191 
lemma Int_empty_left [simp]: "{} \<inter> B = {}" 
36009  1192 
by (fact inf_bot_left) 
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

1193 

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

1194 
lemma Int_empty_right [simp]: "A \<inter> {} = {}" 
36009  1195 
by (fact inf_bot_right) 
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

1196 

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

1197 
lemma disjoint_eq_subset_Compl: "(A \<inter> B = {}) = (A \<subseteq> 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

1198 
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

1199 

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

1200 
lemma disjoint_iff_not_equal: "(A \<inter> B = {}) = (\<forall>x\<in>A. \<forall>y\<in>B. x \<noteq> y)" 
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

1201 
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

1202 

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

1203 
lemma Int_UNIV_left [simp]: "UNIV \<inter> B = B" 
36009  1204 
by (fact inf_top_left) 
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

1205 

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

1206 
lemma Int_UNIV_right [simp]: "A \<inter> UNIV = A" 
36009  1207 
by (fact inf_top_right) 
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

1208 

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

1209 
lemma Int_Un_distrib: "A \<inter> (B \<union> C) = (A \<inter> B) \<union> (A \<inter> C)" 
36009  1210 
by (fact inf_sup_distrib1) 
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

1211 

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

1212 
lemma Int_Un_distrib2: "(B \<union> C) \<inter> A = (B \<inter> A) \<union> (C \<inter> A)" 
36009  1213 
by (fact inf_sup_distrib2) 
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

1214 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35576
diff
changeset

1215 
lemma Int_UNIV [simp,no_atp]: "(A \<inter> B = UNIV) = (A = UNIV & B = UNIV)" 
36009  1216 
by (fact inf_eq_top_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

1217 

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

1218 
lemma Int_subset_iff [simp]: "(C \<subseteq> A \<inter> B) = (C \<subseteq> A & C \<subseteq> B)" 
36009  1219 
by (fact le_inf_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

1220 

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

1221 
lemma Int_Collect: "(x \<in> A \<inter> {x. P x}) = (x \<in> A & P 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

1222 
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

1223 

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

1224 

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

1225 
text {* \medskip @{text Un}. *} 
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

1226 

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

1227 
lemma Un_absorb [simp]: "A \<union> A = A" 
36009  1228 
by (fact sup_idem) 
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

1229 

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

1230 
lemma Un_left_absorb: "A \<union> (A \<union> B) = A \<union> B" 
36009  1231 
by (fact sup_left_idem) 
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

1232 

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

1233 
lemma Un_commute: "A \<union> B = B \<union> A" 
36009  1234 
by (fact sup_commute) 
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

1235 

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

1236 
lemma Un_left_commute: "A \<union> (B \<union> C) = B \<union> (A \<union> C)" 
36009  1237 
by (fact sup_left_commute) 
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

1238 

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

1239 
lemma Un_assoc: "(A \<union> B) \<union> C = A \<union> (B \<union> C)" 
36009  1240 
by (fact sup_assoc) 
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

1241 

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

1242 
lemmas Un_ac = Un_assoc Un_left_absorb Un_commute Un_left_commute 
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

1243 
 {* Union is an ACoperator *} 
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

1244 

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

1245 
lemma Un_absorb1: "A \<subseteq> B ==> A \<union> B = B" 
36009  1246 
by (fact sup_absorb2) 
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

1247 

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

1248 
lemma Un_absorb2: "B \<subseteq> A ==> A \<union> B = A" 
36009  1249 
by (fact sup_absorb1) 
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

1250 

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

1251 
lemma Un_empty_left [simp]: "{} \<union> B = B" 
36009  1252 
by (fact sup_bot_left) 
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

1253 

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

1254 
lemma Un_empty_right [simp]: "A \<union> {} = A" 
36009  1255 
by (fact sup_bot_right) 
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

1256 

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

1257 
lemma Un_UNIV_left [simp]: "UNIV \<union> B = UNIV" 
36009  1258 
by (fact sup_top_left) 
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

1259 

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

1260 
lemma Un_UNIV_right [simp]: "A \<union> UNIV = UNIV" 
36009  1261 
by (fact sup_top_right) 
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

1262 

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

1263 
lemma Un_insert_left [simp]: "(insert a B) \<union> C = insert a (B \<union> 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

1264 
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

1265 

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

1266 
lemma Un_insert_right [simp]: "A \<union> (insert a B) = insert a (A \<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

1267 
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

1268 

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

1269 
lemma Int_insert_left: 
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

1270 
"(insert a B) Int C = (if a \<in> C then insert a (B \<inter> C) else B \<inter> 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

1271 
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

1272 

32456
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1273 
lemma Int_insert_left_if0[simp]: 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1274 
"a \<notin> C \<Longrightarrow> (insert a B) Int C = B \<inter> C" 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1275 
by auto 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1276 

341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1277 
lemma Int_insert_left_if1[simp]: 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1278 
"a \<in> C \<Longrightarrow> (insert a B) Int C = insert a (B Int C)" 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1279 
by auto 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1280 

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

1281 
lemma Int_insert_right: 
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

1282 
"A \<inter> (insert a B) = (if a \<in> A then insert a (A \<inter> B) else A \<inter> 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

1283 
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

1284 

32456
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1285 
lemma Int_insert_right_if0[simp]: 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1286 
"a \<notin> A \<Longrightarrow> A Int (insert a B) = A Int B" 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
changeset

1287 
by auto 
341c83339aeb
tuned the simp rules for Int involving insert and intervals.
nipkow
parents:
32264
diff
