author  haftmann 
Thu, 04 Jun 2009 15:28:59 +0200  
changeset 31456  55edadbd43d5 
parent 31197  c1c163ec6c44 
child 31461  d54b743b52a3 
permissions  rwrr 
923  1 
(* Title: HOL/Set.thy 
12257  2 
Author: Tobias Nipkow, Lawrence C Paulson and Markus Wenzel 
923  3 
*) 
4 

11979  5 
header {* Set theory for higherorder logic *} 
6 

15131  7 
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

8 
imports Lattices 
15131  9 
begin 
11979  10 

11 
text {* A set in HOL is simply a predicate. *} 

923  12 

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

13 

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

14 
subsection {* Basic syntax *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

15 

3947  16 
global 
17 

26800  18 
types 'a set = "'a => bool" 
3820  19 

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

21 
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

22 
"op :" :: "'a => 'a set => bool"  "membership" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

23 
Ball :: "'a set => ('a => bool) => bool"  "bounded universal quantifiers" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

24 
Bex :: "'a set => ('a => bool) => bool"  "bounded existential quantifiers" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

25 
Bex1 :: "'a set => ('a => bool) => bool"  "bounded unique existential quantifiers" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

26 
Pow :: "'a set => 'a set set"  "powerset" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

27 
image :: "('a => 'b) => 'a set => 'b set" (infixr "`" 90) 
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

28 

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

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

30 

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

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

33 
"op :" ("(_/ : _)" [50, 51] 50) 
11979  34 

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

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

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

37 

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

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

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

41 

21210  42 
notation (xsymbols) 
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 
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

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

47 

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

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

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

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

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

53 

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

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

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

56 

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

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

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

59 

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

60 
definition Int :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Int" 70) where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

61 
"A Int B \<equiv> {x. x \<in> A \<and> x \<in> B}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

62 

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

63 
definition Un :: "'a set \<Rightarrow> 'a set \<Rightarrow> 'a set" (infixl "Un" 65) where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

64 
"A Un B \<equiv> {x. x \<in> A \<or> x \<in> B}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

65 

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

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

67 
"Int" (infixl "\<inter>" 70) and 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

68 
"Un" (infixl "\<union>" 65) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

69 

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

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

71 
"Int" (infixl "\<inter>" 70) and 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

72 
"Un" (infixl "\<union>" 65) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

73 

31456  74 
definition empty :: "'a set" ("{}") where 
75 
"empty \<equiv> {x. False}" 

76 

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

78 
"insert a B \<equiv> {x. x = a} \<union> B" 

79 

80 
definition UNIV :: "'a set" where 

81 
"UNIV \<equiv> {x. True}" 

82 

83 
syntax 

84 
"@Finset" :: "args => 'a set" ("{(_)}") 

85 

86 
translations 

87 
"{x, xs}" == "CONST insert x {xs}" 

88 
"{x}" == "CONST insert x {}" 

89 

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

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

91 
"_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

92 
"_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

93 
"_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

94 
"_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

95 

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

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

97 
"_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

98 
"_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

99 
"_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

100 

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

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

102 
"_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

103 
"_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

104 
"_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

105 
"_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

106 

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

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

108 
"_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

109 
"_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

110 
"_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

111 

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

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

113 
"ALL x:A. P" == "Ball A (%x. P)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

114 
"EX x:A. P" == "Bex A (%x. P)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

115 
"EX! x:A. P" == "Bex1 A (%x. P)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

116 
"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

117 

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

118 
definition INTER :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

119 
"INTER A B \<equiv> {y. \<forall>x\<in>A. y \<in> B x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

120 

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

121 
definition UNION :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> 'b set" where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

122 
"UNION A B \<equiv> {y. \<exists>x\<in>A. y \<in> B x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

123 

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

124 
definition Inter :: "'a set set \<Rightarrow> 'a set" where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

125 
"Inter S \<equiv> INTER S (\<lambda>x. x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

126 

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

127 
definition Union :: "'a set set \<Rightarrow> 'a set" where 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

128 
"Union S \<equiv> UNION S (\<lambda>x. x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

129 

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

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

131 
Inter ("\<Inter>_" [90] 90) and 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

132 
Union ("\<Union>_" [90] 90) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

133 

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

134 

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

135 
subsection {* Additional concrete syntax *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

136 

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

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

138 
"@SetCompr" :: "'a => idts => bool => 'a set" ("(1{_ /_./ _})") 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

139 
"@Collect" :: "idt => 'a set => bool => 'a set" ("(1{_ :/ _./ _})") 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

140 
"@INTER1" :: "pttrns => 'b set => 'b set" ("(3INT _./ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

141 
"@UNION1" :: "pttrns => 'b set => 'b set" ("(3UN _./ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

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

144 

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

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

146 
"@Collect" :: "idt => 'a set => bool => 'a set" ("(1{_ \<in>/ _./ _})") 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

147 
"@INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>_./ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

148 
"@UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>_./ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

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

151 

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

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

153 
"@INTER1" :: "pttrns => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

154 
"@UNION1" :: "pttrns => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<^esub>)/ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

155 
"@INTER" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Inter>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

156 
"@UNION" :: "pttrn => 'a set => 'b set => 'b set" ("(3\<Union>(00\<^bsub>_\<in>_\<^esub>)/ _)" [0, 10] 10) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

157 

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

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

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

160 
"INT x y. B" == "INT x. INT y. B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

161 
"INT x. B" == "CONST INTER CONST UNIV (%x. B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

162 
"INT x. B" == "INT x:CONST UNIV. B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

163 
"INT x:A. B" == "CONST INTER A (%x. B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

164 
"UN x y. B" == "UN x. UN y. B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

165 
"UN x. B" == "CONST UNION CONST UNIV (%x. B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

166 
"UN x. B" == "UN x:CONST UNIV. B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

167 
"UN x:A. B" == "CONST UNION A (%x. B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

168 

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

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

170 
Note the difference between ordinary xsymbol syntax of indexed 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

171 
unions and intersections (e.g.\ @{text"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

172 
and their \LaTeX\ rendition: @{term"\<Union>a\<^isub>1\<in>A\<^isub>1. B"}. The 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

173 
former does not make the index expression a subscript of the 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

174 
union/intersection symbol because this leads to problems with nested 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

176 
*} 
2261  177 

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

179 
subset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 
21819  180 
"subset \<equiv> less" 
21404
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

181 

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

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

183 
subset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 
21819  184 
"subset_eq \<equiv> less_eq" 
21333  185 

186 
notation (output) 

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

187 
subset ("op <") and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

188 
subset ("(_/ < _)" [50, 51] 50) and 
eb85850d3eb7
more robust syntax for definition/abbreviation/notation;
wenzelm
parents:
21384
diff
changeset

189 
subset_eq ("op <=") and 
21333  190 
subset_eq ("(_/ <= _)" [50, 51] 50) 
191 

192 
notation (xsymbols) 

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

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

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

195 
subset_eq ("op \<subseteq>") and 
21333  196 
subset_eq ("(_/ \<subseteq> _)" [50, 51] 50) 
197 

198 
notation (HTML output) 

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

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

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

201 
subset_eq ("op \<subseteq>") and 
21333  202 
subset_eq ("(_/ \<subseteq> _)" [50, 51] 50) 
203 

204 
abbreviation (input) 

21819  205 
supset :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 
206 
"supset \<equiv> greater" 

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

207 

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

208 
abbreviation (input) 
21819  209 
supset_eq :: "'a set \<Rightarrow> 'a set \<Rightarrow> bool" where 
210 
"supset_eq \<equiv> greater_eq" 

211 

212 
notation (xsymbols) 

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

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

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

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

21333  217 

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

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

219 
range :: "('a => 'b) => 'b set" where  "of function" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

220 
"range f == f ` UNIV" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

221 

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

222 

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

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

224 

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

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

226 
"_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

227 
"_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

228 
"_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

229 
"_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

230 
"_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

231 

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

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

233 
"_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

234 
"_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

235 
"_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

236 
"_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

237 
"_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

238 

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

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

240 
"_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

241 
"_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

242 
"_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

243 
"_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

244 
"_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

245 

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

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

247 
"_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

248 
"_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

249 
"_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

250 
"_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

251 
"_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

252 

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

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

254 
"\<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

255 
"\<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

256 
"\<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

257 
"\<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

258 
"\<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

259 

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

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

261 
let 
22377  262 
val Type (set_type, _) = @{typ "'a set"}; 
263 
val All_binder = Syntax.binder_name @{const_syntax "All"}; 

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

265 
val impl = @{const_syntax "op >"}; 

266 
val conj = @{const_syntax "op &"}; 

267 
val sbset = @{const_syntax "subset"}; 

268 
val sbset_eq = @{const_syntax "subset_eq"}; 

21819  269 

270 
val trans = 

271 
[((All_binder, impl, sbset), "_setlessAll"), 

272 
((All_binder, impl, sbset_eq), "_setleAll"), 

273 
((Ex_binder, conj, sbset), "_setlessEx"), 

274 
((Ex_binder, conj, sbset_eq), "_setleEx")]; 

275 

276 
fun mk v v' c n P = 

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

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

279 

280 
fun tr' q = (q, 

281 
fn [Const ("_bound", _) $ Free (v, Type (T, _)), Const (c, _) $ (Const (d, _) $ (Const ("_bound", _) $ Free (v', _)) $ n) $ P] => 

282 
if T = (set_type) then case AList.lookup (op =) trans (q, c, d) 

283 
of NONE => raise Match 

284 
 SOME l => mk v v' l n P 

285 
else raise Match 

286 
 _ => raise Match); 

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

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

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

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

291 

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

292 

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

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

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

297 
*} 

298 

299 
parse_translation {* 

300 
let 

301 
val ex_tr = snd (mk_binder_tr ("EX ", "Ex")); 

3947  302 

11979  303 
fun nvars (Const ("_idts", _) $ _ $ idts) = nvars idts + 1 
304 
 nvars _ = 1; 

305 

306 
fun setcompr_tr [e, idts, b] = 

307 
let 

308 
val eq = Syntax.const "op =" $ Bound (nvars idts) $ e; 

309 
val P = Syntax.const "op &" $ eq $ b; 

310 
val exP = ex_tr [idts, P]; 

17784  311 
in Syntax.const "Collect" $ Term.absdummy (dummyT, exP) end; 
11979  312 

313 
in [("@SetCompr", setcompr_tr)] end; 

314 
*} 

923  315 

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

316 
(* To avoid etacontraction of body: *) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

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

319 
fun btr' syn [A, Abs abs] = 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

320 
let val (x, t) = atomic_abs_tr' abs 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

321 
in Syntax.const syn $ x $ A $ t end 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

323 
[(@{const_syntax Ball}, btr' "_Ball"), (@{const_syntax Bex}, btr' "_Bex"), 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

324 
(@{const_syntax UNION}, btr' "@UNION"),(@{const_syntax INTER}, btr' "@INTER")] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

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

327 

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

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

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

330 
val ex_tr' = snd (mk_binder_tr' ("Ex", "DUMMY")); 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

331 

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

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

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

334 
fun check (Const ("Ex", _) $ Abs (_, _, P), n) = check (P, n + 1) 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

335 
 check (Const ("op &", _) $ (Const ("op =", _) $ Bound m $ e) $ P, n) = 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

336 
n > 0 andalso m = n andalso not (loose_bvar1 (P, n)) andalso 
f94b569cd610
added print translations tha avoid eta contraction for important binders.
nipkow
parents:
13653
diff
changeset

337 
((0 upto (n  1)) subset add_loose_bnos (e, 0, [])) 
13764  338 
 check _ = false 
923  339 

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

342 
in Syntax.const "@SetCompr" $ e $ idts $ Q end; 

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

343 
in if check (P, 0) then tr' P 
15535  344 
else let val (x as _ $ Free(xN,_), t) = atomic_abs_tr' abs 
345 
val M = Syntax.const "@Coll" $ x $ t 

346 
in case t of 

347 
Const("op &",_) 

348 
$ (Const("op :",_) $ (Const("_bound",_) $ Free(yN,_)) $ A) 

349 
$ P => 

350 
if xN=yN then Syntax.const "@Collect" $ x $ A $ P else M 

351 
 _ => M 

352 
end 

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

353 
end; 
11979  354 
in [("Collect", setcompr_tr')] end; 
355 
*} 

356 

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

357 

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

358 
subsection {* Rules and definitions *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

359 

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

360 
text {* Isomorphisms between predicates and sets. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

361 

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

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

363 
mem_def [code]: "x : S == S x" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

364 
Collect_def [code]: "Collect P == P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

365 

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

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

367 
Ball_def: "Ball A P == ALL x. x:A > P(x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

368 
Bex_def: "Bex A P == EX x. x:A & P(x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

369 
Bex1_def: "Bex1 A P == EX! x. x:A & P(x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

370 

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

371 
instantiation "fun" :: (type, minus) minus 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

373 

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

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

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

376 

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

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

378 

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

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

380 

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

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

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

383 

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

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

385 
bool_diff_def: "A  B = (A & ~ B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

386 

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

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

388 

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

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

390 

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

391 
instantiation "fun" :: (type, uminus) uminus 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

393 

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

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

395 
fun_Compl_def: " A = (%x.  A x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

396 

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

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

398 

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

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

400 

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

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

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

403 

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

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

405 
bool_Compl_def: " A = (~ A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

406 

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

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

408 

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

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

410 

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

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

412 
Pow_def: "Pow A == {B. B <= A}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

413 
image_def: "f`A == {y. EX x:A. y = f(x)}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

414 

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

415 

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

416 
subsection {* Lemmas and proof tool setup *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

417 

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

418 
subsubsection {* Relating predicates and sets *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

419 

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

420 
lemma mem_Collect_eq [iff]: "(a : {x. P(x)}) = P(a)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

422 

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

423 
lemma Collect_mem_eq [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

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

425 

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

426 
lemma CollectI: "P(a) ==> a : {x. P(x)}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

428 

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

429 
lemma CollectD: "a : {x. P(x)} ==> P(a)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

431 

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

432 
lemma Collect_cong: "(!!x. P x = Q x) ==> {x. P(x)} = {x. Q(x)}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

434 

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

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

436 

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

437 

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

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

439 

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

442 

443 
lemmas strip = impI allI ballI 

444 

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

446 
by (simp add: Ball_def) 

447 

448 
lemma ballE [elim]: "ALL x:A. P x ==> (P x ==> Q) ==> (x ~: A ==> Q) ==> Q" 

449 
by (unfold Ball_def) blast 

22139  450 

451 
ML {* bind_thm ("rev_ballE", permute_prems 1 1 @{thm ballE}) *} 

11979  452 

453 
text {* 

454 
\medskip This tactic takes assumptions @{prop "ALL x:A. P x"} and 

455 
@{prop "a:A"}; creates assumption @{prop "P a"}. 

456 
*} 

457 

458 
ML {* 

22139  459 
fun ball_tac i = etac @{thm ballE} i THEN contr_tac (i + 1) 
11979  460 
*} 
461 

462 
text {* 

463 
Gives better instantiation for bound: 

464 
*} 

465 

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

11979  468 
*} 
469 

470 
lemma bexI [intro]: "P x ==> x:A ==> EX x:A. P x" 

471 
 {* Normally the best argument order: @{prop "P x"} constrains the 

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

473 
by (unfold Bex_def) blast 

474 

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

478 

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

480 
by (unfold Bex_def) blast 

481 

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

483 
by (unfold Bex_def) blast 

484 

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

486 
 {* Trival rewrite rule. *} 

487 
by (simp add: Ball_def) 

488 

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

490 
 {* Dual form for existentials. *} 

491 
by (simp add: Bex_def) 

492 

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

494 
by blast 

495 

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

497 
by blast 

498 

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

500 
by blast 

501 

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

503 
by blast 

504 

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

506 
by blast 

507 

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

509 
by blast 

510 

26480  511 
ML {* 
13462  512 
local 
22139  513 
val unfold_bex_tac = unfold_tac @{thms "Bex_def"}; 
18328  514 
fun prove_bex_tac ss = unfold_bex_tac ss THEN Quantifier1.prove_one_point_ex_tac; 
11979  515 
val rearrange_bex = Quantifier1.rearrange_bex prove_bex_tac; 
516 

22139  517 
val unfold_ball_tac = unfold_tac @{thms "Ball_def"}; 
18328  518 
fun prove_ball_tac ss = unfold_ball_tac ss THEN Quantifier1.prove_one_point_all_tac; 
11979  519 
val rearrange_ball = Quantifier1.rearrange_ball prove_ball_tac; 
520 
in 

18328  521 
val defBEX_regroup = Simplifier.simproc (the_context ()) 
13462  522 
"defined BEX" ["EX x:A. P x & Q x"] rearrange_bex; 
18328  523 
val defBALL_regroup = Simplifier.simproc (the_context ()) 
13462  524 
"defined BALL" ["ALL x:A. P x > Q x"] rearrange_ball; 
11979  525 
end; 
13462  526 

527 
Addsimprocs [defBALL_regroup, defBEX_regroup]; 

11979  528 
*} 
529 

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

530 

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

531 
subsubsection {* Congruence rules *} 
11979  532 

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

533 
lemma ball_cong: 
11979  534 
"A = B ==> (!!x. x:B ==> P x = Q x) ==> 
535 
(ALL x:A. P x) = (ALL x:B. Q x)" 

536 
by (simp add: Ball_def) 

537 

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

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

539 
"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

540 
(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

541 
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

542 

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

543 
lemma bex_cong: 
11979  544 
"A = B ==> (!!x. x:B ==> P x = Q x) ==> 
545 
(EX x:A. P x) = (EX x:B. Q x)" 

546 
by (simp add: Bex_def cong: conj_cong) 

1273  547 

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

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

549 
"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

550 
(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

551 
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

552 

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

553 

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

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

555 

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

556 
lemma subsetI [atp,intro!]: "(!!x. x:A ==> x:B) ==> A \<subseteq> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

557 
by (auto simp add: mem_def intro: predicate1I) 
30352  558 

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

560 
\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

561 
'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

562 
"'a set"}. 
11979  563 
*} 
564 

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

566 
 {* 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

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

568 

30596  569 
lemma rev_subsetD [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

570 
 {* 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

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

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

573 

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

575 
\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

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

577 

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

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

579 
fun impOfSubs th = th RSN (2, @{thm rev_subsetD}) 
11979  580 
*} 
581 

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

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

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

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

585 

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

586 
lemma subset_eq: "A \<le> B = (\<forall>x\<in>A. x \<in> B)" by blast 
2388  587 

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

589 
\medskip Takes assumptions @{prop "A \<subseteq> B"}; @{prop "c \<in> A"} and 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

590 
creates the assumption @{prop "c \<in> B"}. 
30352  591 
*} 
592 

593 
ML {* 

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

594 
fun set_mp_tac i = etac @{thm subsetCE} i THEN mp_tac i 
11979  595 
*} 
596 

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

597 
lemma contra_subsetD: "A \<subseteq> B ==> c \<notin> B ==> c \<notin> 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 subset_refl [simp,atp]: "A \<subseteq> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

601 
by fast 
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 subset_trans: "A \<subseteq> B ==> B \<subseteq> C ==> A \<subseteq> C" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

605 

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 
subsubsection {* Equality *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

608 

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

609 
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

610 
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

611 
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

612 
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

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

614 

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

615 
(* Due to Brian Huffman *) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

616 
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

617 
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

618 

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

619 
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

620 
 {* 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

621 
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

622 

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

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

624 
\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

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

626 
*} 
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 equalityD1: "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

629 
by (simp add: subset_refl) 
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 equalityD2: "A = B ==> B \<subseteq> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

632 
by (simp add: subset_refl) 
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 
text {* 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

635 
\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

636 
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

637 
\<subseteq> A"} and @{prop "A \<subseteq> {}"} and then back to @{prop "A = {}"}! 
30352  638 
*} 
639 

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

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

641 
by (simp add: subset_refl) 
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 equalityCE [elim]: 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

644 
"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

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

646 

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

647 
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

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

649 

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

650 
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

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

652 

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

655 

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

656 
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

657 
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

658 

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

659 
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

660 

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

661 
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

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

663 

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

664 
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

665 
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

666 

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

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

668 
\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

669 
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

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

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

672 

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

673 
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

674 
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

675 

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

676 
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

677 
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

678 

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

679 
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

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

681 

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 
subsubsection {* The empty set *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

684 

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

685 
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

686 
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

687 

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

688 
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

689 
by simp 
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 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

692 
 {* 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

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

694 

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

695 
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

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

697 

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

698 
lemma equals0D: "A = {} ==> a \<notin> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

699 
 {* Use for reasoning about disjointness: @{prop "A Int B = {}"} *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

701 

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

702 
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

703 
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

704 

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

705 
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

706 
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

707 

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

708 
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

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

710 

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

711 

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

712 
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

713 

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

714 
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

715 
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

716 

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

717 
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

718 
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

719 

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

720 
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

721 
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

722 

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

723 
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

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

725 

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

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

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

728 

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

729 

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

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

731 

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

732 
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

733 
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

734 

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

735 
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

736 
by (unfold mem_def fun_Compl_def bool_Compl_def) blast 
923  737 

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

739 
\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

740 
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

741 
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

742 

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

743 
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

744 
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

745 

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

746 
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

747 

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

748 
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

749 

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

750 

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

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

752 

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

753 
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

754 
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

755 

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

756 
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

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

758 

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

759 
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

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

761 

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

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

763 
\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

764 
@{prop B}. 
11979  765 
*} 
766 

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

767 
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

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

769 

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

770 
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

771 
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

772 

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

773 

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

774 
subsubsection {* Binary intersection  Int *} 
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 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

777 
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

778 

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

779 
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

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

781 

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

782 
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

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

784 

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

785 
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

786 
by simp 
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 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

789 
by simp 
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 

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

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

793 

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

794 
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

795 
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

796 

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

797 
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

798 
by simp 
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 
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

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

802 

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

803 
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

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

805 

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

806 
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

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

808 

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

809 
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

810 

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

811 
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

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

813 

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

814 

31456  815 
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

816 

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

817 
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

818 
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

819 

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

820 
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

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

822 

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

823 
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

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

825 

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

826 
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

827 
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

828 

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

829 
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

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

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

832 

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

833 
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

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

835 

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

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

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

838 
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

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

840 
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

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

842 
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

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

844 

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

845 
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

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

847 

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

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

849 

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

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

851 
 {* 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

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

853 

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

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

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

856 

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

857 
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

858 

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

859 
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

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

861 

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

862 
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

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

864 

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

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

866 
"({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

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

868 

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

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

870 
"(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

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

872 

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

873 
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

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

875 

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

876 
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

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

878 

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

879 
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

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

881 

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

882 
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

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

884 

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

885 
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

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

887 

11979  888 

889 
subsubsection {* Unions of families *} 

890 

891 
text {* 

892 
@{term [source] "UN x:A. B x"} is @{term "Union (B`A)"}. 

893 
*} 

894 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

895 
declare UNION_def [noatp] 
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

896 

11979  897 
lemma UN_iff [simp]: "(b: (UN x:A. B x)) = (EX x:A. b: B x)" 
898 
by (unfold UNION_def) blast 

899 

900 
lemma UN_I [intro]: "a:A ==> b: B a ==> b: (UN x:A. B x)" 

901 
 {* The order of the premises presupposes that @{term A} is rigid; 

902 
@{term b} may be flexible. *} 

903 
by auto 

904 

905 
lemma UN_E [elim!]: "b : (UN x:A. B x) ==> (!!x. x:A ==> b: B x ==> R) ==> R" 

906 
by (unfold UNION_def) blast 

923  907 

11979  908 
lemma UN_cong [cong]: 
909 
"A = B ==> (!!x. x:B ==> C x = D x) ==> (UN x:A. C x) = (UN x:B. D x)" 

910 
by (simp add: UNION_def) 

911 

29691  912 
lemma strong_UN_cong: 
913 
"A = B ==> (!!x. x:B =simp=> C x = D x) ==> (UN x:A. C x) = (UN x:B. D x)" 

914 
by (simp add: UNION_def simp_implies_def) 

915 

11979  916 

917 
subsubsection {* Intersections of families *} 

918 

919 
text {* @{term [source] "INT x:A. B x"} is @{term "Inter (B`A)"}. *} 

920 

921 
lemma INT_iff [simp]: "(b: (INT x:A. B x)) = (ALL x:A. b: B x)" 

922 
by (unfold INTER_def) blast 

923  923 

11979  924 
lemma INT_I [intro!]: "(!!x. x:A ==> b: B x) ==> b : (INT x:A. B x)" 
925 
by (unfold INTER_def) blast 

926 

927 
lemma INT_D [elim]: "b : (INT x:A. B x) ==> a:A ==> b: B a" 

928 
by auto 

929 

930 
lemma INT_E [elim]: "b : (INT x:A. B x) ==> (b: B a ==> R) ==> (a~:A ==> R) ==> R" 

931 
 {* "Classical" elimination  by the Excluded Middle on @{prop "a:A"}. *} 

932 
by (unfold INTER_def) blast 

933 

934 
lemma INT_cong [cong]: 

935 
"A = B ==> (!!x. x:B ==> C x = D x) ==> (INT x:A. C x) = (INT x:B. D x)" 

936 
by (simp add: INTER_def) 

7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
5931
diff
changeset

937 

923  938 

11979  939 
subsubsection {* Union *} 
940 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

941 
lemma Union_iff [simp,noatp]: "(A : Union C) = (EX X:C. A:X)" 
11979  942 
by (unfold Union_def) blast 
943 

944 
lemma UnionI [intro]: "X:C ==> A:X ==> A : Union C" 

945 
 {* The order of the premises presupposes that @{term C} is rigid; 

946 
@{term A} may be flexible. *} 

947 
by auto 

948 

949 
lemma UnionE [elim!]: "A : Union C ==> (!!X. A:X ==> X:C ==> R) ==> R" 

950 
by (unfold Union_def) blast 

951 

952 

953 
subsubsection {* Inter *} 

954 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

955 
lemma Inter_iff [simp,noatp]: "(A : Inter C) = (ALL X:C. A:X)" 
11979  956 
by (unfold Inter_def) blast 
957 

958 
lemma InterI [intro!]: "(!!X. X:C ==> A:X) ==> A : Inter C" 

959 
by (simp add: Inter_def) 

960 

961 
text {* 

962 
\medskip A ``destruct'' rule  every @{term X} in @{term C} 

963 
contains @{term A} as an element, but @{prop "A:X"} can hold when 

964 
@{prop "X:C"} does not! This rule is analogous to @{text spec}. 

965 
*} 

966 

967 
lemma InterD [elim]: "A : Inter C ==> X:C ==> A:X" 

968 
by auto 

969 

970 
lemma InterE [elim]: "A : Inter C ==> (X~:C ==> R) ==> (A:X ==> R) ==> R" 

971 
 {* ``Classical'' elimination rule  does not require proving 

972 
@{prop "X:C"}. *} 

973 
by (unfold Inter_def) blast 

974 

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

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

976 
\medskip Image of a set under a function. Frequently @{term b} does 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

977 
not have the syntactic form of @{term "f x"}. 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

979 

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

980 
declare image_def [noatp] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

981 

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

982 
lemma image_eqI [simp, intro]: "b = f x ==> x:A ==> b : f`A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

984 

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

985 
lemma imageI: "x : A ==> f x : f ` A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

987 

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

988 
lemma rev_image_eqI: "x:A ==> b = f x ==> b : f`A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

989 
 {* This version's more effective when we already have the 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

990 
required @{term x}. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

992 

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

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

994 
"b : (%x. f x)`A ==> (!!x. b = f x ==> x:A ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

995 
 {* The etaexpansion gives variablename preservation. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

997 

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

998 
lemma image_Un: "f`(A Un B) = f`A Un f`B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1000 

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

1001 
lemma image_eq_UN: "f`A = (UN x:A. {f x})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1003 

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

1004 
lemma image_iff: "(z : f`A) = (EX x:A. z = f x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1006 

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

1007 
lemma image_subset_iff: "(f`A \<subseteq> B) = (\<forall>x\<in>A. f x \<in> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1008 
 {* This rewrite rule would confuse users if made default. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1010 

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

1011 
lemma subset_image_iff: "(B \<subseteq> f`A) = (EX AA. AA \<subseteq> A & B = f`AA)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

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

1014 
apply (rule_tac x = "{a. a : A & f a : B}" in exI, fast) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1016 

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

1017 
lemma image_subsetI: "(!!x. x \<in> A ==> f x \<in> B) ==> f`A \<subseteq> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1018 
 {* Replaces the three steps @{text subsetI}, @{text imageE}, 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1019 
@{text hypsubst}, but breaks too many existing proofs. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1021 

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

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

1023 
\medskip Range of a function  just a translation for image! 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1025 

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

1026 
lemma range_eqI: "b = f x ==> b \<in> range f" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1028 

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

1029 
lemma rangeI: "f x \<in> range f" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1031 

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

1032 
lemma rangeE [elim?]: "b \<in> range (\<lambda>x. f x) ==> (!!x. b = f x ==> P) ==> P" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1034 

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

1035 

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

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

1037 

31166
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1038 
text{* Elimination of @{text"{x. \<dots> & x=t & \<dots>}"}. *} 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1039 

31197
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1040 
lemma Collect_conv_if: "{x. x=a & P x} = (if P a then {a} else {})" 
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1041 
by auto 
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1042 

c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1043 
lemma Collect_conv_if2: "{x. a=x & P x} = (if P a then {a} else {})" 
31166
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1044 
by auto 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1045 

31197
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1046 
text {* 
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1047 
Simproc for pulling @{text "x=t"} in @{text "{x. \<dots> & x=t & \<dots>}"} 
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1048 
to the front (and similarly for @{text "t=x"}): 
c1c163ec6c44
finetuned elimination of comprehensions involving x=t.
nipkow
parents:
31166
diff
changeset

1049 
*} 
31166
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1050 

a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1051 
ML{* 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1052 
local 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1053 
val Coll_perm_tac = rtac @{thm Collect_cong} 1 THEN rtac @{thm iffI} 1 THEN 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1054 
ALLGOALS(EVERY'[REPEAT_DETERM o (etac @{thm conjE}), 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1055 
DEPTH_SOLVE_1 o (ares_tac [@{thm conjI}])]) 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1056 
in 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1057 
val defColl_regroup = Simplifier.simproc (the_context ()) 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1058 
"defined Collect" ["{x. P x & Q x}"] 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1059 
(Quantifier1.rearrange_Coll Coll_perm_tac) 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1060 
end; 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1061 

a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1062 
Addsimprocs [defColl_regroup]; 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1063 
*} 
a90fe83f58ea
"{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents:
30814
diff
changeset

1064 

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

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

1066 
Rewrite rules for boolean casesplitting: faster than @{text 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1067 
"split_if [split]"}. 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1069 

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

1070 
lemma split_if_eq1: "((if Q then x else y) = b) = ((Q > x = b) & (~ Q > y = b))" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1072 

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

1073 
lemma split_if_eq2: "(a = (if Q then x else y)) = ((Q > a = x) & (~ Q > a = y))" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1075 

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

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

1077 
Split ifs on either side of the membership relation. Not for @{text 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1078 
"[simp]"}  can cause goals to blow up! 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1080 

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

1081 
lemma split_if_mem1: "((if Q then x else y) : b) = ((Q > x : b) & (~ Q > y : b))" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1083 

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

1084 
lemma split_if_mem2: "(a : (if Q then x else y)) = ((Q > a : x) & (~ Q > a : y))" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1085 
by (rule split_if [where P="%S. a : S"]) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1086 

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

1087 
lemmas split_ifs = if_bool_eq_conj split_if_eq1 split_if_eq2 split_if_mem1 split_if_mem2 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1088 

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

1089 
(*Would like to add these, but the existing code only searches for the 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1090 
outerlevel constant, which in this case is just "op :"; we instead need 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1091 
to use termnets to associate patterns with rules. Also, if a rule fails to 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1092 
apply, then the formula should be kept. 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1093 
[("HOL.uminus", Compl_iff RS iffD1), ("HOL.minus", [Diff_iff RS iffD1]), 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1094 
("Int", [IntD1,IntD2]), 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1095 
("Collect", [CollectD]), ("Inter", [InterD]), ("INTER", [INT_D])] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1097 

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

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

1099 
val mksimps_pairs = [(@{const_name Ball}, @{thms bspec})] @ mksimps_pairs; 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1101 
declaration {* fn _ => 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1102 
Simplifier.map_ss (fn ss => ss setmksimps (mksimps mksimps_pairs)) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1104 

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

1105 

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

1106 
subsubsection {* The ``proper subset'' relation *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1107 

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

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

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

1110 

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

1111 
lemma psubsetE [elim!,noatp]: 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1112 
"[A \<subset> B; [A \<subseteq> B; ~ (B\<subseteq>A)] ==> R] ==> R" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1114 

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

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

1116 
"(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)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1118 

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

1119 
lemma psubset_eq: "(A \<subset> B) = (A \<subseteq> B & A \<noteq> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1121 

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

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

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

1124 

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

1125 
lemma psubset_trans: "[ A \<subset> B; B \<subset> C ] ==> A \<subset> C" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1127 
apply (auto dest: subset_antisym) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1129 

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

1130 
lemma psubsetD: "[ A \<subset> B; c \<in> A ] ==> c \<in> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1132 
apply (auto dest: subsetD) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1134 

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

1135 
lemma psubset_subset_trans: "A \<subset> B ==> B \<subseteq> C ==> A \<subset> C" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1137 

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

1138 
lemma subset_psubset_trans: "A \<subseteq> B ==> B \<subset> C ==> A \<subset> C" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1140 

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

1141 
lemma psubset_imp_ex_mem: "A \<subset> B ==> \<exists>b. b \<in> (B  A)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1143 

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

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

1145 
"(!!x. x \<in> A ==> P x) == Trueprop (\<forall>x\<in>A. P x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1147 

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

1148 
lemmas [symmetric, rulify] = atomize_ball 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1149 
and [symmetric, defn] = atomize_ball 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1150 

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

1151 

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

1152 
subsection {* Further settheory lemmas *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1153 

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

1154 
subsubsection {* Derived rules involving subsets. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1155 

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

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

1157 

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

1158 
lemma subset_insertI: "B \<subseteq> insert a B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1160 

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

1161 
lemma subset_insertI2: "A \<subseteq> B \<Longrightarrow> A \<subseteq> insert b B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1163 

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

1164 
lemma subset_insert: "x \<notin> A ==> (A \<subseteq> insert x B) = (A \<subseteq> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1165 
by blast 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1166 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1167 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1168 
text {* \medskip Big Union  least upper bound of a set. *} 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1169 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1170 
lemma Union_upper: "B \<in> A ==> B \<subseteq> Union A" 
17589  1171 
by (iprover intro: subsetI UnionI) 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1172 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1173 
lemma Union_least: "(!!X. X \<in> A ==> X \<subseteq> C) ==> Union A \<subseteq> C" 
17589  1174 
by (iprover intro: subsetI elim: UnionE dest: subsetD) 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1175 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1176 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1177 
text {* \medskip General union. *} 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1178 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1179 
lemma UN_upper: "a \<in> A ==> B a \<subseteq> (\<Union>x\<in>A. B x)" 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1180 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1181 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1182 
lemma UN_least: "(!!x. x \<in> A ==> B x \<subseteq> C) ==> (\<Union>x\<in>A. B x) \<subseteq> C" 
17589  1183 
by (iprover intro: subsetI elim: UN_E dest: subsetD) 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1184 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1185 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1186 
text {* \medskip Big Intersection  greatest lower bound of a set. *} 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1187 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1188 
lemma Inter_lower: "B \<in> A ==> Inter A \<subseteq> B" 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1189 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1190 

14551  1191 
lemma Inter_subset: 
1192 
"[ !!X. X \<in> A ==> X \<subseteq> B; A ~= {} ] ==> \<Inter>A \<subseteq> B" 

1193 
by blast 

1194 

12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1195 
lemma Inter_greatest: "(!!X. X \<in> A ==> C \<subseteq> X) ==> C \<subseteq> Inter A" 
17589  1196 
by (iprover intro: InterI subsetI dest: subsetD) 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1197 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1198 
lemma INT_lower: "a \<in> A ==> (\<Inter>x\<in>A. B x) \<subseteq> B a" 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1199 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1200 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1201 
lemma INT_greatest: "(!!x. x \<in> A ==> C \<subseteq> B x) ==> C \<subseteq> (\<Inter>x\<in>A. B x)" 
17589  1202 
by (iprover intro: INT_I subsetI dest: subsetD) 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1203 

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

1204 

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

1205 
text {* \medskip Finite Union  the least upper bound of two sets. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1206 

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

1207 
lemma Un_upper1: "A \<subseteq> A \<union> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1209 

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

1210 
lemma Un_upper2: "B \<subseteq> A \<union> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1212 

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

1213 
lemma Un_least: "A \<subseteq> C ==> B \<subseteq> C ==> A \<union> B \<subseteq> C" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1215 

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

1216 

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

1217 
text {* \medskip Finite Intersection  the greatest lower bound of two sets. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1218 

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

1219 
lemma Int_lower1: "A \<inter> B \<subseteq> A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1221 

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

1222 
lemma Int_lower2: "A \<inter> B \<subseteq> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1224 

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

1225 
lemma Int_greatest: "C \<subseteq> A ==> C \<subseteq> B ==> C \<subseteq> A \<inter> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1227 

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

1228 

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

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

1230 

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

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

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

1233 

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

1234 
lemma Diff_subset_conv: "(A  B \<subseteq> C) = (A \<subseteq> B \<union> C)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1236 

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

1237 

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

1238 
subsubsection {* Equalities involving union, intersection, inclusion, etc. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1239 

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

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

1241 

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

1242 
lemma Collect_const [simp]: "{s. P} = (if P then UNIV else {})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1243 
 {* supersedes @{text "Collect_False_empty"} *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1245 

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

1246 
lemma subset_empty [simp]: "(A \<subseteq> {}) = (A = {})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1248 

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

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

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

1251 

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

1252 
lemma Collect_empty_eq [simp]: "(Collect P = {}) = (\<forall>x. \<not> P x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1254 

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

1255 
lemma empty_Collect_eq [simp]: "({} = Collect P) = (\<forall>x. \<not> P x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1257 

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

1258 
lemma Collect_neg_eq: "{x. \<not> P x} =  {x. P x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1260 

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

1261 
lemma Collect_disj_eq: "{x. P x  Q x} = {x. P x} \<union> {x. Q x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1263 

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

1264 
lemma Collect_imp_eq: "{x. P x > Q x} = {x. P x} \<union> {x. Q x}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1266 

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

1267 
lemma Collect_conj_eq: "{x. P x & Q x} = {x. P x} \<inter> {x. Q x}" 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1268 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1269 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1270 
lemma Collect_all_eq: "{x. \<forall>y. P x y} = (\<Inter>y. {x. P x y})" 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1271 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1272 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1273 
lemma Collect_ball_eq: "{x. \<forall>y\<in>A. P x y} = (\<Inter>y\<in>A. {x. P x y})" 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1274 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1275 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

1276 
lemma Collect_ex_eq [noatp]: "{x. \<exists>y. P x y} = (\<Union>y. {x. P x y})" 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1277 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1278 

24286
7619080e49f0
ATP blacklisting is now in theory data, attribute noatp
paulson
parents:
24280
diff
changeset

1279 
lemma Collect_bex_eq [noatp]: "{x. \<exists>y\<in>A. P x y} = (\<Union>y\<in>A. {x. P x y})" 
12897
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1280 
by blast 
f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1281 

f4d10ad0ea7b
converted/deleted equalities.ML, mono.ML, subset.ML (see Set.thy);
wenzelm
parents:
12633
diff
changeset

1282 

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

1283 
text {* \medskip @{text insert}. *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1284 

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

1285 
lemma insert_is_Un: "insert a A = {a} Un A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1286 
 {* NOT SUITABLE FOR REWRITING since @{text "{a} == insert a {}"} *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1288 

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

1289 
lemma insert_not_empty [simp]: "insert a A \<noteq> {}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1291 

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

1292 
lemmas empty_not_insert = insert_not_empty [symmetric, standard] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1293 
declare empty_not_insert [simp] 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1294 

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

1295 
lemma insert_absorb: "a \<in> A ==> insert a A = A" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1296 
 {* @{text "[simp]"} causes recursive calls when there are nested inserts *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1297 
 {* with \emph{quadratic} running time *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1299 

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

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

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

1302 

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

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

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

1305 

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

1306 
lemma insert_subset [simp]: "(insert x A \<subseteq> B) = (x \<in> B & A \<subseteq> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1308 

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

1309 
lemma mk_disjoint_insert: "a \<in> A ==> \<exists>B. A = insert a B & a \<notin> B" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1310 
 {* use new @{text B} rather than @{text "A  {a}"} to avoid infinite unfolding *} 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1311 
apply (rule_tac x = "A  {a}" in exI, blast) 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1313 

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

1314 
lemma insert_Collect: "insert a (Collect P) = {u. u \<noteq> a > P u}" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1316 

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

1317 
lemma UN_insert_distrib: "u \<in> A ==> (\<Union>x\<in>A. insert a (B x)) = insert a (\<Union>x\<in>A. B x)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

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

1319 

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

1320 
lemma insert_inter_insert[simp]: "insert a A \<inter> insert a B = insert a (A \<inter> B)" 
14742  1321 
by blast 
14302  1322 

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

1323 
lemma insert_disjoint [simp,noatp]: 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1324 
"(insert a A \<inter> B = {}) = (a \<notin> B \<and> A \<inter> B = {})" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
diff
changeset

1325 
"({} = insert a A \<inter> B) = (a \<notin> B \<and> {} = A \<inter> B)" 
ab3d61baf66a
reverted to old version of Set.thy  strange effects have to be traced first
haftmann
parents:
30352
