author  hoelzl 
Tue, 23 Nov 2010 14:14:17 +0100  
changeset 40703  d1fc454d6735 
parent 40702  cf26dd7395e4 
child 40719  acb830207103 
permissions  rwrr 
1475  1 
(* Title: HOL/Fun.thy 
2 
Author: Tobias Nipkow, Cambridge University Computer Laboratory 

923  3 
Copyright 1994 University of Cambridge 
18154  4 
*) 
923  5 

18154  6 
header {* Notions about functions *} 
923  7 

15510  8 
theory Fun 
32139  9 
imports Complete_Lattice 
15131  10 
begin 
2912  11 

26147  12 
text{*As a simplification rule, it replaces all function equalities by 
13 
firstorder equalities.*} 

39302
d7728f65b353
renamed lemmas: ext_iff > fun_eq_iff, set_ext_iff > set_eq_iff, set_ext > set_eqI
nipkow
parents:
39213
diff
changeset

14 
lemma fun_eq_iff: "f = g \<longleftrightarrow> (\<forall>x. f x = g x)" 
26147  15 
apply (rule iffI) 
16 
apply (simp (no_asm_simp)) 

17 
apply (rule ext) 

18 
apply (simp (no_asm_simp)) 

19 
done 

5305  20 

26147  21 
lemma apply_inverse: 
26357  22 
"f x = u \<Longrightarrow> (\<And>x. P x \<Longrightarrow> g (f x) = x) \<Longrightarrow> P x \<Longrightarrow> x = g u" 
26147  23 
by auto 
2912  24 

12258  25 

26147  26 
subsection {* The Identity Function @{text id} *} 
6171  27 

22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

28 
definition 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

29 
id :: "'a \<Rightarrow> 'a" 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

30 
where 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

31 
"id = (\<lambda>x. x)" 
13910  32 

26147  33 
lemma id_apply [simp]: "id x = x" 
34 
by (simp add: id_def) 

35 

36 
lemma image_ident [simp]: "(%x. x) ` Y = Y" 

37 
by blast 

38 

39 
lemma image_id [simp]: "id ` Y = Y" 

40 
by (simp add: id_def) 

41 

42 
lemma vimage_ident [simp]: "(%x. x) ` Y = Y" 

43 
by blast 

44 

45 
lemma vimage_id [simp]: "id ` A = A" 

46 
by (simp add: id_def) 

47 

48 

49 
subsection {* The Composition Operator @{text "f \<circ> g"} *} 

50 

22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

51 
definition 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

52 
comp :: "('b \<Rightarrow> 'c) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'c" (infixl "o" 55) 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

53 
where 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

54 
"f o g = (\<lambda>x. f (g x))" 
11123  55 

21210  56 
notation (xsymbols) 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19536
diff
changeset

57 
comp (infixl "\<circ>" 55) 
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19536
diff
changeset

58 

21210  59 
notation (HTML output) 
19656
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19536
diff
changeset

60 
comp (infixl "\<circ>" 55) 
09be06943252
tuned concrete syntax  abbreviation/const_syntax;
wenzelm
parents:
19536
diff
changeset

61 

13585  62 
text{*compatibility*} 
63 
lemmas o_def = comp_def 

2912  64 

13585  65 
lemma o_apply [simp]: "(f o g) x = f (g x)" 
66 
by (simp add: comp_def) 

67 

68 
lemma o_assoc: "f o (g o h) = f o g o h" 

69 
by (simp add: comp_def) 

70 

71 
lemma id_o [simp]: "id o g = g" 

72 
by (simp add: comp_def) 

73 

74 
lemma o_id [simp]: "f o id = f" 

75 
by (simp add: comp_def) 

76 

34150  77 
lemma o_eq_dest: 
78 
"a o b = c o d \<Longrightarrow> a (b v) = c (d v)" 

79 
by (simp only: o_def) (fact fun_cong) 

80 

81 
lemma o_eq_elim: 

82 
"a o b = c o d \<Longrightarrow> ((\<And>v. a (b v) = c (d v)) \<Longrightarrow> R) \<Longrightarrow> R" 

83 
by (erule meta_mp) (fact o_eq_dest) 

84 

13585  85 
lemma image_compose: "(f o g) ` r = f`(g`r)" 
86 
by (simp add: comp_def, blast) 

87 

33044  88 
lemma vimage_compose: "(g \<circ> f) ` x = f ` (g ` x)" 
89 
by auto 

90 

13585  91 
lemma UN_o: "UNION A (g o f) = UNION (f`A) g" 
92 
by (unfold comp_def, blast) 

93 

94 

26588
d83271bfaba5
removed syntax from monad combinators; renamed mbind to scomp
haftmann
parents:
26357
diff
changeset

95 
subsection {* The Forward Composition Operator @{text fcomp} *} 
26357  96 

97 
definition 

37751  98 
fcomp :: "('a \<Rightarrow> 'b) \<Rightarrow> ('b \<Rightarrow> 'c) \<Rightarrow> 'a \<Rightarrow> 'c" (infixl "\<circ>>" 60) 
26357  99 
where 
37751  100 
"f \<circ>> g = (\<lambda>x. g (f x))" 
26357  101 

37751  102 
lemma fcomp_apply [simp]: "(f \<circ>> g) x = g (f x)" 
26357  103 
by (simp add: fcomp_def) 
104 

37751  105 
lemma fcomp_assoc: "(f \<circ>> g) \<circ>> h = f \<circ>> (g \<circ>> h)" 
26357  106 
by (simp add: fcomp_def) 
107 

37751  108 
lemma id_fcomp [simp]: "id \<circ>> g = g" 
26357  109 
by (simp add: fcomp_def) 
110 

37751  111 
lemma fcomp_id [simp]: "f \<circ>> id = f" 
26357  112 
by (simp add: fcomp_def) 
113 

31202
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
31080
diff
changeset

114 
code_const fcomp 
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
31080
diff
changeset

115 
(Eval infixl 1 "#>") 
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
31080
diff
changeset

116 

37751  117 
no_notation fcomp (infixl "\<circ>>" 60) 
26588
d83271bfaba5
removed syntax from monad combinators; renamed mbind to scomp
haftmann
parents:
26357
diff
changeset

118 

26357  119 

40602  120 
subsection {* Mapping functions *} 
121 

122 
definition map_fun :: "('c \<Rightarrow> 'a) \<Rightarrow> ('b \<Rightarrow> 'd) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'c \<Rightarrow> 'd" where 

123 
"map_fun f g h = g \<circ> h \<circ> f" 

124 

125 
lemma map_fun_apply [simp]: 

126 
"map_fun f g h x = g (h (f x))" 

127 
by (simp add: map_fun_def) 

128 

129 
type_mapper map_fun 

130 
by (simp_all add: fun_eq_iff) 

131 

132 

40702  133 
subsection {* Injectivity and Bijectivity *} 
39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

134 

b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

135 
definition inj_on :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a set \<Rightarrow> bool" where  "injective" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

136 
"inj_on f A \<longleftrightarrow> (\<forall>x\<in>A. \<forall>y\<in>A. f x = f y \<longrightarrow> x = y)" 
26147  137 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

138 
definition bij_betw :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> bool" where  "bijective" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

139 
"bij_betw f A B \<longleftrightarrow> inj_on f A \<and> f ` A = B" 
26147  140 

40702  141 
text{*A common special case: functions injective, surjective or bijective over 
142 
the entire domain type.*} 

26147  143 

144 
abbreviation 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

145 
"inj f \<equiv> inj_on f UNIV" 
26147  146 

40702  147 
abbreviation surj :: "('a \<Rightarrow> 'b) \<Rightarrow> bool" where  "surjective" 
148 
"surj f \<equiv> (range f = UNIV)" 

13585  149 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

150 
abbreviation 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

151 
"bij f \<equiv> bij_betw f UNIV UNIV" 
26147  152 

153 
lemma injI: 

154 
assumes "\<And>x y. f x = f y \<Longrightarrow> x = y" 

155 
shows "inj f" 

156 
using assms unfolding inj_on_def by auto 

13585  157 

31775  158 
text{*For Proofs in @{text "Tools/Datatype/datatype_rep_proofs"}*} 
13585  159 
lemma datatype_injI: 
160 
"(!! x. ALL y. f(x) = f(y) > x=y) ==> inj(f)" 

161 
by (simp add: inj_on_def) 

162 

13637  163 
theorem range_ex1_eq: "inj f \<Longrightarrow> b : range f = (EX! x. b = f x)" 
164 
by (unfold inj_on_def, blast) 

165 

13585  166 
lemma injD: "[ inj(f); f(x) = f(y) ] ==> x=y" 
167 
by (simp add: inj_on_def) 

168 

32988  169 
lemma inj_on_eq_iff: "inj_on f A ==> x:A ==> y:A ==> (f(x) = f(y)) = (x=y)" 
13585  170 
by (force simp add: inj_on_def) 
171 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

172 
lemma inj_on_cong: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

173 
"(\<And> a. a : A \<Longrightarrow> f a = g a) \<Longrightarrow> inj_on f A = inj_on g A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

174 
unfolding inj_on_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

175 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

176 
lemma inj_on_strict_subset: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

177 
"\<lbrakk> inj_on f B; A < B \<rbrakk> \<Longrightarrow> f`A < f`B" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

178 
unfolding inj_on_def unfolding image_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

179 

38620  180 
lemma inj_comp: 
181 
"inj f \<Longrightarrow> inj g \<Longrightarrow> inj (f \<circ> g)" 

182 
by (simp add: inj_on_def) 

183 

184 
lemma inj_fun: "inj f \<Longrightarrow> inj (\<lambda>x y. f x)" 

39302
d7728f65b353
renamed lemmas: ext_iff > fun_eq_iff, set_ext_iff > set_eq_iff, set_ext > set_eqI
nipkow
parents:
39213
diff
changeset

185 
by (simp add: inj_on_def fun_eq_iff) 
38620  186 

32988  187 
lemma inj_eq: "inj f ==> (f(x) = f(y)) = (x=y)" 
188 
by (simp add: inj_on_eq_iff) 

189 

26147  190 
lemma inj_on_id[simp]: "inj_on id A" 
39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

191 
by (simp add: inj_on_def) 
13585  192 

26147  193 
lemma inj_on_id2[simp]: "inj_on (%x. x) A" 
39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

194 
by (simp add: inj_on_def) 
26147  195 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

196 
lemma inj_on_Int: "\<lbrakk>inj_on f A; inj_on f B\<rbrakk> \<Longrightarrow> inj_on f (A \<inter> B)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

197 
unfolding inj_on_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

198 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

199 
lemma inj_on_INTER: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

200 
"\<lbrakk>I \<noteq> {}; \<And> i. i \<in> I \<Longrightarrow> inj_on f (A i)\<rbrakk> \<Longrightarrow> inj_on f (\<Inter> i \<in> I. A i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

201 
unfolding inj_on_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

202 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

203 
lemma inj_on_Inter: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

204 
"\<lbrakk>S \<noteq> {}; \<And> A. A \<in> S \<Longrightarrow> inj_on f A\<rbrakk> \<Longrightarrow> inj_on f (Inter S)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

205 
unfolding inj_on_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

206 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

207 
lemma inj_on_UNION_chain: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

208 
assumes CH: "\<And> i j. \<lbrakk>i \<in> I; j \<in> I\<rbrakk> \<Longrightarrow> A i \<le> A j \<or> A j \<le> A i" and 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

209 
INJ: "\<And> i. i \<in> I \<Longrightarrow> inj_on f (A i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

210 
shows "inj_on f (\<Union> i \<in> I. A i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

211 
proof(unfold inj_on_def UNION_def, auto) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

212 
fix i j x y 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

213 
assume *: "i \<in> I" "j \<in> I" and **: "x \<in> A i" "y \<in> A j" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

214 
and ***: "f x = f y" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

215 
show "x = y" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

216 
proof 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

217 
{assume "A i \<le> A j" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

218 
with ** have "x \<in> A j" by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

219 
with INJ * ** *** have ?thesis 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

220 
by(auto simp add: inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

221 
} 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

222 
moreover 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

223 
{assume "A j \<le> A i" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

224 
with ** have "y \<in> A i" by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

225 
with INJ * ** *** have ?thesis 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

226 
by(auto simp add: inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

227 
} 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

228 
ultimately show ?thesis using CH * by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

229 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

230 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

231 

40702  232 
lemma surj_id: "surj id" 
233 
by simp 

26147  234 

39101
606432dd1896
Revert bij_betw changes to simp set (Problem in afp/Ordinals_and_Cardinals)
hoelzl
parents:
39076
diff
changeset

235 
lemma bij_id[simp]: "bij id" 
39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

236 
by (simp add: bij_betw_def) 
13585  237 

238 
lemma inj_onI: 

239 
"(!! x y. [ x:A; y:A; f(x) = f(y) ] ==> x=y) ==> inj_on f A" 

240 
by (simp add: inj_on_def) 

241 

242 
lemma inj_on_inverseI: "(!!x. x:A ==> g(f(x)) = x) ==> inj_on f A" 

243 
by (auto dest: arg_cong [of concl: g] simp add: inj_on_def) 

244 

245 
lemma inj_onD: "[ inj_on f A; f(x)=f(y); x:A; y:A ] ==> x=y" 

246 
by (unfold inj_on_def, blast) 

247 

248 
lemma inj_on_iff: "[ inj_on f A; x:A; y:A ] ==> (f(x)=f(y)) = (x=y)" 

249 
by (blast dest!: inj_onD) 

250 

251 
lemma comp_inj_on: 

252 
"[ inj_on f A; inj_on g (f`A) ] ==> inj_on (g o f) A" 

253 
by (simp add: comp_def inj_on_def) 

254 

15303  255 
lemma inj_on_imageI: "inj_on (g o f) A \<Longrightarrow> inj_on g (f ` A)" 
256 
apply(simp add:inj_on_def image_def) 

257 
apply blast 

258 
done 

259 

15439  260 
lemma inj_on_image_iff: "\<lbrakk> ALL x:A. ALL y:A. (g(f x) = g(f y)) = (g x = g y); 
261 
inj_on f A \<rbrakk> \<Longrightarrow> inj_on g (f ` A) = inj_on g A" 

262 
apply(unfold inj_on_def) 

263 
apply blast 

264 
done 

265 

13585  266 
lemma inj_on_contraD: "[ inj_on f A; ~x=y; x:A; y:A ] ==> ~ f(x)=f(y)" 
267 
by (unfold inj_on_def, blast) 

12258  268 

13585  269 
lemma inj_singleton: "inj (%s. {s})" 
270 
by (simp add: inj_on_def) 

271 

15111  272 
lemma inj_on_empty[iff]: "inj_on f {}" 
273 
by(simp add: inj_on_def) 

274 

15303  275 
lemma subset_inj_on: "[ inj_on f B; A <= B ] ==> inj_on f A" 
13585  276 
by (unfold inj_on_def, blast) 
277 

15111  278 
lemma inj_on_Un: 
279 
"inj_on f (A Un B) = 

280 
(inj_on f A & inj_on f B & f`(AB) Int f`(BA) = {})" 

281 
apply(unfold inj_on_def) 

282 
apply (blast intro:sym) 

283 
done 

284 

285 
lemma inj_on_insert[iff]: 

286 
"inj_on f (insert a A) = (inj_on f A & f a ~: f`(A{a}))" 

287 
apply(unfold inj_on_def) 

288 
apply (blast intro:sym) 

289 
done 

290 

291 
lemma inj_on_diff: "inj_on f A ==> inj_on f (AB)" 

292 
apply(unfold inj_on_def) 

293 
apply (blast) 

294 
done 

295 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

296 
lemma comp_inj_on_iff: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

297 
"inj_on f A \<Longrightarrow> inj_on f' (f ` A) \<longleftrightarrow> inj_on (f' o f) A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

298 
by(auto simp add: comp_inj_on inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

299 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

300 
lemma inj_on_imageI2: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

301 
"inj_on (f' o f) A \<Longrightarrow> inj_on f A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

302 
by(auto simp add: comp_inj_on inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

303 

40702  304 
lemma surj_def: "surj f \<longleftrightarrow> (\<forall>y. \<exists>x. y = f x)" 
305 
by auto 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

306 

40702  307 
lemma surjI: assumes *: "\<And> x. g (f x) = x" shows "surj g" 
308 
using *[symmetric] by auto 

13585  309 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

310 
lemma surjD: "surj f \<Longrightarrow> \<exists>x. y = f x" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

311 
by (simp add: surj_def) 
13585  312 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

313 
lemma surjE: "surj f \<Longrightarrow> (\<And>x. y = f x \<Longrightarrow> C) \<Longrightarrow> C" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

314 
by (simp add: surj_def, blast) 
13585  315 

316 
lemma comp_surj: "[ surj f; surj g ] ==> surj (g o f)" 

317 
apply (simp add: comp_def surj_def, clarify) 

318 
apply (drule_tac x = y in spec, clarify) 

319 
apply (drule_tac x = x in spec, blast) 

320 
done 

321 

39074  322 
lemma bij_betw_imp_surj: "bij_betw f A UNIV \<Longrightarrow> surj f" 
40702  323 
unfolding bij_betw_def by auto 
39074  324 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

325 
lemma bij_betw_empty1: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

326 
assumes "bij_betw f {} A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

327 
shows "A = {}" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

328 
using assms unfolding bij_betw_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

329 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

330 
lemma bij_betw_empty2: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

331 
assumes "bij_betw f A {}" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

332 
shows "A = {}" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

333 
using assms unfolding bij_betw_def by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

334 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

335 
lemma inj_on_imp_bij_betw: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

336 
"inj_on f A \<Longrightarrow> bij_betw f A (f ` A)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

337 
unfolding bij_betw_def by simp 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

338 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

339 
lemma bij_def: "bij f \<longleftrightarrow> inj f \<and> surj f" 
40702  340 
unfolding bij_betw_def .. 
39074  341 

13585  342 
lemma bijI: "[ inj f; surj f ] ==> bij f" 
343 
by (simp add: bij_def) 

344 

345 
lemma bij_is_inj: "bij f ==> inj f" 

346 
by (simp add: bij_def) 

347 

348 
lemma bij_is_surj: "bij f ==> surj f" 

349 
by (simp add: bij_def) 

350 

26105
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

351 
lemma bij_betw_imp_inj_on: "bij_betw f A B \<Longrightarrow> inj_on f A" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

352 
by (simp add: bij_betw_def) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

353 

31438  354 
lemma bij_betw_trans: 
355 
"bij_betw f A B \<Longrightarrow> bij_betw g B C \<Longrightarrow> bij_betw (g o f) A C" 

356 
by(auto simp add:bij_betw_def comp_inj_on) 

357 

40702  358 
lemma bij_comp: "bij f \<Longrightarrow> bij g \<Longrightarrow> bij (g o f)" 
359 
by (rule bij_betw_trans) 

360 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

361 
lemma bij_betw_comp_iff: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

362 
"bij_betw f A A' \<Longrightarrow> bij_betw f' A' A'' \<longleftrightarrow> bij_betw (f' o f) A A''" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

363 
by(auto simp add: bij_betw_def inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

364 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

365 
lemma bij_betw_comp_iff2: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

366 
assumes BIJ: "bij_betw f' A' A''" and IM: "f ` A \<le> A'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

367 
shows "bij_betw f A A' \<longleftrightarrow> bij_betw (f' o f) A A''" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

368 
using assms 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

369 
proof(auto simp add: bij_betw_comp_iff) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

370 
assume *: "bij_betw (f' \<circ> f) A A''" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

371 
thus "bij_betw f A A'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

372 
using IM 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

373 
proof(auto simp add: bij_betw_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

374 
assume "inj_on (f' \<circ> f) A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

375 
thus "inj_on f A" using inj_on_imageI2 by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

376 
next 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

377 
fix a' assume **: "a' \<in> A'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

378 
hence "f' a' \<in> A''" using BIJ unfolding bij_betw_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

379 
then obtain a where 1: "a \<in> A \<and> f'(f a) = f' a'" using * 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

380 
unfolding bij_betw_def by force 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

381 
hence "f a \<in> A'" using IM by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

382 
hence "f a = a'" using BIJ ** 1 unfolding bij_betw_def inj_on_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

383 
thus "a' \<in> f ` A" using 1 by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

384 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

385 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

386 

26105
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

387 
lemma bij_betw_inv: assumes "bij_betw f A B" shows "EX g. bij_betw g B A" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

388 
proof  
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

389 
have i: "inj_on f A" and s: "f ` A = B" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

390 
using assms by(auto simp:bij_betw_def) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

391 
let ?P = "%b a. a:A \<and> f a = b" let ?g = "%b. The (?P b)" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

392 
{ fix a b assume P: "?P b a" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

393 
hence ex1: "\<exists>a. ?P b a" using s unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

394 
hence uex1: "\<exists>!a. ?P b a" by(blast dest:inj_onD[OF i]) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

395 
hence " ?g b = a" using the1_equality[OF uex1, OF P] P by simp 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

396 
} note g = this 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

397 
have "inj_on ?g B" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

398 
proof(rule inj_onI) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

399 
fix x y assume "x:B" "y:B" "?g x = ?g y" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

400 
from s `x:B` obtain a1 where a1: "?P x a1" unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

401 
from s `y:B` obtain a2 where a2: "?P y a2" unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

402 
from g[OF a1] a1 g[OF a2] a2 `?g x = ?g y` show "x=y" by simp 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

403 
qed 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

404 
moreover have "?g ` B = A" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

405 
proof(auto simp:image_def) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

406 
fix b assume "b:B" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

407 
with s obtain a where P: "?P b a" unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

408 
thus "?g b \<in> A" using g[OF P] by auto 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

409 
next 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

410 
fix a assume "a:A" 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

411 
then obtain b where P: "?P b a" using s unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

412 
then have "b:B" using s unfolding image_def by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

413 
with g[OF P] show "\<exists>b\<in>B. a = ?g b" by blast 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

414 
qed 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

415 
ultimately show ?thesis by(auto simp:bij_betw_def) 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

416 
qed 
ae06618225ec
moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
nipkow
parents:
25886
diff
changeset

417 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

418 
lemma bij_betw_cong: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

419 
"(\<And> a. a \<in> A \<Longrightarrow> f a = g a) \<Longrightarrow> bij_betw f A A' = bij_betw g A A'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

420 
unfolding bij_betw_def inj_on_def by force 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

421 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

422 
lemma bij_betw_id[intro, simp]: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

423 
"bij_betw id A A" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

424 
unfolding bij_betw_def id_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

425 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

426 
lemma bij_betw_id_iff: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

427 
"bij_betw id A B \<longleftrightarrow> A = B" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

428 
by(auto simp add: bij_betw_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

429 

39075  430 
lemma bij_betw_combine: 
431 
assumes "bij_betw f A B" "bij_betw f C D" "B \<inter> D = {}" 

432 
shows "bij_betw f (A \<union> C) (B \<union> D)" 

433 
using assms unfolding bij_betw_def inj_on_Un image_Un by auto 

434 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

435 
lemma bij_betw_UNION_chain: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

436 
assumes CH: "\<And> i j. \<lbrakk>i \<in> I; j \<in> I\<rbrakk> \<Longrightarrow> A i \<le> A j \<or> A j \<le> A i" and 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

437 
BIJ: "\<And> i. i \<in> I \<Longrightarrow> bij_betw f (A i) (A' i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

438 
shows "bij_betw f (\<Union> i \<in> I. A i) (\<Union> i \<in> I. A' i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

439 
proof(unfold bij_betw_def, auto simp add: image_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

440 
have "\<And> i. i \<in> I \<Longrightarrow> inj_on f (A i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

441 
using BIJ bij_betw_def[of f] by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

442 
thus "inj_on f (\<Union> i \<in> I. A i)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

443 
using CH inj_on_UNION_chain[of I A f] by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

444 
next 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

445 
fix i x 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

446 
assume *: "i \<in> I" "x \<in> A i" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

447 
hence "f x \<in> A' i" using BIJ bij_betw_def[of f] by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

448 
thus "\<exists>j \<in> I. f x \<in> A' j" using * by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

449 
next 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

450 
fix i x' 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

451 
assume *: "i \<in> I" "x' \<in> A' i" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

452 
hence "\<exists>x \<in> A i. x' = f x" using BIJ bij_betw_def[of f] by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

453 
thus "\<exists>j \<in> I. \<exists>x \<in> A j. x' = f x" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

454 
using * by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

455 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

456 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

457 
lemma bij_betw_Disj_Un: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

458 
assumes DISJ: "A \<inter> B = {}" and DISJ': "A' \<inter> B' = {}" and 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

459 
B1: "bij_betw f A A'" and B2: "bij_betw f B B'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

460 
shows "bij_betw f (A \<union> B) (A' \<union> B')" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

461 
proof 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

462 
have 1: "inj_on f A \<and> inj_on f B" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

463 
using B1 B2 by (auto simp add: bij_betw_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

464 
have 2: "f`A = A' \<and> f`B = B'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

465 
using B1 B2 by (auto simp add: bij_betw_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

466 
hence "f`(A  B) \<inter> f`(B  A) = {}" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

467 
using DISJ DISJ' by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

468 
hence "inj_on f (A \<union> B)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

469 
using 1 by (auto simp add: inj_on_Un) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

470 
(* *) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

471 
moreover 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

472 
have "f`(A \<union> B) = A' \<union> B'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

473 
using 2 by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

474 
ultimately show ?thesis 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

475 
unfolding bij_betw_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

476 
qed 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

477 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

478 
lemma bij_betw_subset: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

479 
assumes BIJ: "bij_betw f A A'" and 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

480 
SUB: "B \<le> A" and IM: "f ` B = B'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

481 
shows "bij_betw f B B'" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

482 
using assms 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

483 
by(unfold bij_betw_def inj_on_def, auto simp add: inj_on_def) 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

484 

13585  485 
lemma surj_image_vimage_eq: "surj f ==> f ` (f ` A) = A" 
40702  486 
by simp 
13585  487 

488 
lemma inj_vimage_image_eq: "inj f ==> f ` (f ` A) = A" 

489 
by (simp add: inj_on_def, blast) 

490 

491 
lemma vimage_subsetD: "surj f ==> f ` B <= A ==> B <= f ` A" 

40702  492 
by (blast intro: sym) 
13585  493 

494 
lemma vimage_subsetI: "inj f ==> B <= f ` A ==> f ` B <= A" 

495 
by (unfold inj_on_def, blast) 

496 

497 
lemma vimage_subset_eq: "bij f ==> (f ` B <= A) = (B <= f ` A)" 

498 
apply (unfold bij_def) 

499 
apply (blast del: subsetI intro: vimage_subsetI vimage_subsetD) 

500 
done 

501 

31438  502 
lemma inj_on_Un_image_eq_iff: "inj_on f (A \<union> B) \<Longrightarrow> f ` A = f ` B \<longleftrightarrow> A = B" 
503 
by(blast dest: inj_onD) 

504 

13585  505 
lemma inj_on_image_Int: 
506 
"[ inj_on f C; A<=C; B<=C ] ==> f`(A Int B) = f`A Int f`B" 

507 
apply (simp add: inj_on_def, blast) 

508 
done 

509 

510 
lemma inj_on_image_set_diff: 

511 
"[ inj_on f C; A<=C; B<=C ] ==> f`(AB) = f`A  f`B" 

512 
apply (simp add: inj_on_def, blast) 

513 
done 

514 

515 
lemma image_Int: "inj f ==> f`(A Int B) = f`A Int f`B" 

516 
by (simp add: inj_on_def, blast) 

517 

518 
lemma image_set_diff: "inj f ==> f`(AB) = f`A  f`B" 

519 
by (simp add: inj_on_def, blast) 

520 

521 
lemma inj_image_mem_iff: "inj f ==> (f a : f`A) = (a : A)" 

522 
by (blast dest: injD) 

523 

524 
lemma inj_image_subset_iff: "inj f ==> (f`A <= f`B) = (A<=B)" 

525 
by (simp add: inj_on_def, blast) 

526 

527 
lemma inj_image_eq_iff: "inj f ==> (f`A = f`B) = (A = B)" 

528 
by (blast dest: injD) 

529 

530 
(*injectivity's required. Lefttoright inclusion holds even if A is empty*) 

531 
lemma image_INT: 

532 
"[ inj_on f C; ALL x:A. B x <= C; j:A ] 

533 
==> f ` (INTER A B) = (INT x:A. f ` B x)" 

534 
apply (simp add: inj_on_def, blast) 

535 
done 

536 

537 
(*Compare with image_INT: no use of inj_on, and if f is surjective then 

538 
it doesn't matter whether A is empty*) 

539 
lemma bij_image_INT: "bij f ==> f ` (INTER A B) = (INT x:A. f ` B x)" 

540 
apply (simp add: bij_def) 

541 
apply (simp add: inj_on_def surj_def, blast) 

542 
done 

543 

544 
lemma surj_Compl_image_subset: "surj f ==> (f`A) <= f`(A)" 

40702  545 
by auto 
13585  546 

547 
lemma inj_image_Compl_subset: "inj f ==> f`(A) <= (f`A)" 

548 
by (auto simp add: inj_on_def) 

5852  549 

13585  550 
lemma bij_image_Compl_eq: "bij f ==> f`(A) = (f`A)" 
551 
apply (simp add: bij_def) 

552 
apply (rule equalityI) 

553 
apply (simp_all (no_asm_simp) add: inj_image_Compl_subset surj_Compl_image_subset) 

554 
done 

555 

35584
768f8d92b767
generalized inj_uminus; added strict_mono_imp_inj_on
hoelzl
parents:
35580
diff
changeset

556 
lemma (in ordered_ab_group_add) inj_uminus[simp, intro]: "inj_on uminus A" 
35580  557 
by (auto intro!: inj_onI) 
13585  558 

35584
768f8d92b767
generalized inj_uminus; added strict_mono_imp_inj_on
hoelzl
parents:
35580
diff
changeset

559 
lemma (in linorder) strict_mono_imp_inj_on: "strict_mono f \<Longrightarrow> inj_on f A" 
768f8d92b767
generalized inj_uminus; added strict_mono_imp_inj_on
hoelzl
parents:
35580
diff
changeset

560 
by (auto intro!: inj_onI dest: strict_mono_eq) 
768f8d92b767
generalized inj_uminus; added strict_mono_imp_inj_on
hoelzl
parents:
35580
diff
changeset

561 

13585  562 
subsection{*Function Updating*} 
563 

35416
d8d7d1b785af
replaced a couple of constsdefs by definitions (also some old primrecs by modern ones)
haftmann
parents:
35115
diff
changeset

564 
definition 
d8d7d1b785af
replaced a couple of constsdefs by definitions (also some old primrecs by modern ones)
haftmann
parents:
35115
diff
changeset

565 
fun_upd :: "('a => 'b) => 'a => 'b => ('a => 'b)" where 
26147  566 
"fun_upd f a b == % x. if x=a then b else f x" 
567 

568 
nonterminals 

569 
updbinds updbind 

570 
syntax 

571 
"_updbind" :: "['a, 'a] => updbind" ("(2_ :=/ _)") 

572 
"" :: "updbind => updbinds" ("_") 

573 
"_updbinds":: "[updbind, updbinds] => updbinds" ("_,/ _") 

35115  574 
"_Update" :: "['a, updbinds] => 'a" ("_/'((_)')" [1000, 0] 900) 
26147  575 

576 
translations 

35115  577 
"_Update f (_updbinds b bs)" == "_Update (_Update f b) bs" 
578 
"f(x:=y)" == "CONST fun_upd f x y" 

26147  579 

580 
(* Hint: to define the sum of two functions (or maps), use sum_case. 

581 
A nice infix syntax could be defined (in Datatype.thy or below) by 

35115  582 
notation 
583 
sum_case (infixr "'(+')"80) 

26147  584 
*) 
585 

13585  586 
lemma fun_upd_idem_iff: "(f(x:=y) = f) = (f x = y)" 
587 
apply (simp add: fun_upd_def, safe) 

588 
apply (erule subst) 

589 
apply (rule_tac [2] ext, auto) 

590 
done 

591 

592 
(* f x = y ==> f(x:=y) = f *) 

593 
lemmas fun_upd_idem = fun_upd_idem_iff [THEN iffD2, standard] 

594 

595 
(* f(x := f x) = f *) 

17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
16973
diff
changeset

596 
lemmas fun_upd_triv = refl [THEN fun_upd_idem] 
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
16973
diff
changeset

597 
declare fun_upd_triv [iff] 
13585  598 

599 
lemma fun_upd_apply [simp]: "(f(x:=y))z = (if z=x then y else f z)" 

17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
16973
diff
changeset

600 
by (simp add: fun_upd_def) 
13585  601 

602 
(* fun_upd_apply supersedes these two, but they are useful 

603 
if fun_upd_apply is intentionally removed from the simpset *) 

604 
lemma fun_upd_same: "(f(x:=y)) x = y" 

605 
by simp 

606 

607 
lemma fun_upd_other: "z~=x ==> (f(x:=y)) z = f z" 

608 
by simp 

609 

610 
lemma fun_upd_upd [simp]: "f(x:=y,x:=z) = f(x:=z)" 

39302
d7728f65b353
renamed lemmas: ext_iff > fun_eq_iff, set_ext_iff > set_eq_iff, set_ext > set_eqI
nipkow
parents:
39213
diff
changeset

611 
by (simp add: fun_eq_iff) 
13585  612 

613 
lemma fun_upd_twist: "a ~= c ==> (m(a:=b))(c:=d) = (m(c:=d))(a:=b)" 

614 
by (rule ext, auto) 

615 

15303  616 
lemma inj_on_fun_updI: "\<lbrakk> inj_on f A; y \<notin> f`A \<rbrakk> \<Longrightarrow> inj_on (f(x:=y)) A" 
34209  617 
by (fastsimp simp:inj_on_def image_def) 
15303  618 

15510  619 
lemma fun_upd_image: 
620 
"f(x:=y) ` A = (if x \<in> A then insert y (f ` (A{x})) else f ` A)" 

621 
by auto 

622 

31080  623 
lemma fun_upd_comp: "f \<circ> (g(x := y)) = (f \<circ> g)(x := f y)" 
34209  624 
by (auto intro: ext) 
31080  625 

26147  626 

627 
subsection {* @{text override_on} *} 

628 

629 
definition 

630 
override_on :: "('a \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b" 

631 
where 

632 
"override_on f g A = (\<lambda>a. if a \<in> A then g a else f a)" 

13910  633 

15691  634 
lemma override_on_emptyset[simp]: "override_on f g {} = f" 
635 
by(simp add:override_on_def) 

13910  636 

15691  637 
lemma override_on_apply_notin[simp]: "a ~: A ==> (override_on f g A) a = f a" 
638 
by(simp add:override_on_def) 

13910  639 

15691  640 
lemma override_on_apply_in[simp]: "a : A ==> (override_on f g A) a = g a" 
641 
by(simp add:override_on_def) 

13910  642 

26147  643 

644 
subsection {* @{text swap} *} 

15510  645 

22744
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

646 
definition 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

647 
swap :: "'a \<Rightarrow> 'a \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b)" 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

648 
where 
5cbe966d67a2
Isar definitions are now added explicitly to code theorem table
haftmann
parents:
22577
diff
changeset

649 
"swap a b f = f (a := f b, b:= f a)" 
15510  650 

34101  651 
lemma swap_self [simp]: "swap a a f = f" 
15691  652 
by (simp add: swap_def) 
15510  653 

654 
lemma swap_commute: "swap a b f = swap b a f" 

655 
by (rule ext, simp add: fun_upd_def swap_def) 

656 

657 
lemma swap_nilpotent [simp]: "swap a b (swap a b f) = f" 

658 
by (rule ext, simp add: fun_upd_def swap_def) 

659 

34145  660 
lemma swap_triple: 
661 
assumes "a \<noteq> c" and "b \<noteq> c" 

662 
shows "swap a b (swap b c (swap a b f)) = swap a c f" 

39302
d7728f65b353
renamed lemmas: ext_iff > fun_eq_iff, set_ext_iff > set_eq_iff, set_ext > set_eqI
nipkow
parents:
39213
diff
changeset

663 
using assms by (simp add: fun_eq_iff swap_def) 
34145  664 

34101  665 
lemma comp_swap: "f \<circ> swap a b g = swap a b (f \<circ> g)" 
666 
by (rule ext, simp add: fun_upd_def swap_def) 

667 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

668 
lemma swap_image_eq [simp]: 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

669 
assumes "a \<in> A" "b \<in> A" shows "swap a b f ` A = f ` A" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

670 
proof  
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

671 
have subset: "\<And>f. swap a b f ` A \<subseteq> f ` A" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

672 
using assms by (auto simp: image_iff swap_def) 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

673 
then have "swap a b (swap a b f) ` A \<subseteq> (swap a b f) ` A" . 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

674 
with subset[of f] show ?thesis by auto 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

675 
qed 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

676 

15510  677 
lemma inj_on_imp_inj_on_swap: 
39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

678 
"\<lbrakk>inj_on f A; a \<in> A; b \<in> A\<rbrakk> \<Longrightarrow> inj_on (swap a b f) A" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

679 
by (simp add: inj_on_def swap_def, blast) 
15510  680 

681 
lemma inj_on_swap_iff [simp]: 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

682 
assumes A: "a \<in> A" "b \<in> A" shows "inj_on (swap a b f) A \<longleftrightarrow> inj_on f A" 
39075  683 
proof 
15510  684 
assume "inj_on (swap a b f) A" 
39075  685 
with A have "inj_on (swap a b (swap a b f)) A" 
686 
by (iprover intro: inj_on_imp_inj_on_swap) 

687 
thus "inj_on f A" by simp 

15510  688 
next 
689 
assume "inj_on f A" 

34209  690 
with A show "inj_on (swap a b f) A" by (iprover intro: inj_on_imp_inj_on_swap) 
15510  691 
qed 
692 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

693 
lemma surj_imp_surj_swap: "surj f \<Longrightarrow> surj (swap a b f)" 
40702  694 
by simp 
15510  695 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

696 
lemma surj_swap_iff [simp]: "surj (swap a b f) \<longleftrightarrow> surj f" 
40702  697 
by simp 
21547
9c9fdf4c2949
moved order arities for fun and bool to Fun/Orderings
haftmann
parents:
21327
diff
changeset

698 

39076
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

699 
lemma bij_betw_swap_iff [simp]: 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

700 
"\<lbrakk> x \<in> A; y \<in> A \<rbrakk> \<Longrightarrow> bij_betw (swap x y f) A B \<longleftrightarrow> bij_betw f A B" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

701 
by (auto simp: bij_betw_def) 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

702 

b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

703 
lemma bij_swap_iff [simp]: "bij (swap a b f) \<longleftrightarrow> bij f" 
b3a9b6734663
Introduce surj_on and replace surj and bij by abbreviations.
hoelzl
parents:
39075
diff
changeset

704 
by simp 
39075  705 

36176
3fe7e97ccca8
replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact'  frees some popular keywords;
wenzelm
parents:
35584
diff
changeset

706 
hide_const (open) swap 
21547
9c9fdf4c2949
moved order arities for fun and bool to Fun/Orderings
haftmann
parents:
21327
diff
changeset

707 

31949  708 
subsection {* Inversion of injective functions *} 
709 

33057  710 
definition the_inv_into :: "'a set => ('a => 'b) => ('b => 'a)" where 
711 
"the_inv_into A f == %x. THE y. y : A & f y = x" 

32961  712 

33057  713 
lemma the_inv_into_f_f: 
714 
"[ inj_on f A; x : A ] ==> the_inv_into A f (f x) = x" 

715 
apply (simp add: the_inv_into_def inj_on_def) 

34209  716 
apply blast 
32961  717 
done 
718 

33057  719 
lemma f_the_inv_into_f: 
720 
"inj_on f A ==> y : f`A ==> f (the_inv_into A f y) = y" 

721 
apply (simp add: the_inv_into_def) 

32961  722 
apply (rule the1I2) 
723 
apply(blast dest: inj_onD) 

724 
apply blast 

725 
done 

726 

33057  727 
lemma the_inv_into_into: 
728 
"[ inj_on f A; x : f ` A; A <= B ] ==> the_inv_into A f x : B" 

729 
apply (simp add: the_inv_into_def) 

32961  730 
apply (rule the1I2) 
731 
apply(blast dest: inj_onD) 

732 
apply blast 

733 
done 

734 

33057  735 
lemma the_inv_into_onto[simp]: 
736 
"inj_on f A ==> the_inv_into A f ` (f ` A) = A" 

737 
by (fast intro:the_inv_into_into the_inv_into_f_f[symmetric]) 

32961  738 

33057  739 
lemma the_inv_into_f_eq: 
740 
"[ inj_on f A; f x = y; x : A ] ==> the_inv_into A f y = x" 

32961  741 
apply (erule subst) 
33057  742 
apply (erule the_inv_into_f_f, assumption) 
32961  743 
done 
744 

33057  745 
lemma the_inv_into_comp: 
32961  746 
"[ inj_on f (g ` A); inj_on g A; x : f ` g ` A ] ==> 
33057  747 
the_inv_into A (f o g) x = (the_inv_into A g o the_inv_into (g ` A) f) x" 
748 
apply (rule the_inv_into_f_eq) 

32961  749 
apply (fast intro: comp_inj_on) 
33057  750 
apply (simp add: f_the_inv_into_f the_inv_into_into) 
751 
apply (simp add: the_inv_into_into) 

32961  752 
done 
753 

33057  754 
lemma inj_on_the_inv_into: 
755 
"inj_on f A \<Longrightarrow> inj_on (the_inv_into A f) (f ` A)" 

756 
by (auto intro: inj_onI simp: image_def the_inv_into_f_f) 

32961  757 

33057  758 
lemma bij_betw_the_inv_into: 
759 
"bij_betw f A B \<Longrightarrow> bij_betw (the_inv_into A f) B A" 

760 
by (auto simp add: bij_betw_def inj_on_the_inv_into the_inv_into_into) 

32961  761 

32998
31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

762 
abbreviation the_inv :: "('a \<Rightarrow> 'b) \<Rightarrow> ('b \<Rightarrow> 'a)" where 
33057  763 
"the_inv f \<equiv> the_inv_into UNIV f" 
32998
31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

764 

31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

765 
lemma the_inv_f_f: 
31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

766 
assumes "inj f" 
31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

767 
shows "the_inv f (f x) = x" using assms UNIV_I 
33057  768 
by (rule the_inv_into_f_f) 
32998
31b19fa0de0b
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
berghofe
parents:
32988
diff
changeset

769 

40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

770 
subsection {* Cantor's Paradox *} 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

771 

d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

772 
lemma Cantors_paradox: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

773 
"\<not>(\<exists>f. f ` A = Pow A)" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

774 
proof clarify 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

775 
fix f assume "f ` A = Pow A" hence *: "Pow A \<le> f ` A" by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

776 
let ?X = "{a \<in> A. a \<notin> f a}" 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

777 
have "?X \<in> Pow A" unfolding Pow_def by auto 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

778 
with * obtain x where "x \<in> A \<and> f x = ?X" by blast 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

779 
thus False by best 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

780 
qed 
31949  781 

22845  782 
subsection {* Proof tool setup *} 
783 

784 
text {* simplifies terms of the form 

785 
f(...,x:=y,...,x:=z,...) to f(...,x:=z,...) *} 

786 

24017  787 
simproc_setup fun_upd2 ("f(v := w, x := y)") = {* fn _ => 
22845  788 
let 
789 
fun gen_fun_upd NONE T _ _ = NONE 

24017  790 
 gen_fun_upd (SOME f) T x y = SOME (Const (@{const_name fun_upd}, T) $ f $ x $ y) 
22845  791 
fun dest_fun_T1 (Type (_, T :: Ts)) = T 
792 
fun find_double (t as Const (@{const_name fun_upd},T) $ f $ x $ y) = 

793 
let 

794 
fun find (Const (@{const_name fun_upd},T) $ g $ v $ w) = 

795 
if v aconv x then SOME g else gen_fun_upd (find g) T v w 

796 
 find t = NONE 

797 
in (dest_fun_T1 T, gen_fun_upd (find f) T x y) end 

24017  798 

799 
fun proc ss ct = 

800 
let 

801 
val ctxt = Simplifier.the_context ss 

802 
val t = Thm.term_of ct 

803 
in 

804 
case find_double t of 

805 
(T, NONE) => NONE 

806 
 (T, SOME rhs) => 

27330  807 
SOME (Goal.prove ctxt [] [] (Logic.mk_equals (t, rhs)) 
24017  808 
(fn _ => 
809 
rtac eq_reflection 1 THEN 

810 
rtac ext 1 THEN 

811 
simp_tac (Simplifier.inherit_context ss @{simpset}) 1)) 

812 
end 

813 
in proc end 

22845  814 
*} 
815 

816 

21870  817 
subsection {* Code generator setup *} 
818 

25886
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

819 
types_code 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

820 
"fun" ("(_ >/ _)") 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

821 
attach (term_of) {* 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

822 
fun term_of_fun_type _ aT _ bT _ = Free ("<function>", aT > bT); 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

823 
*} 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

824 
attach (test) {* 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

825 
fun gen_fun_type aF aT bG bT i = 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

826 
let 
32740  827 
val tab = Unsynchronized.ref []; 
25886
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

828 
fun mk_upd (x, (_, y)) t = Const ("Fun.fun_upd", 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

829 
(aT > bT) > aT > bT > aT > bT) $ t $ aF x $ y () 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

830 
in 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

831 
(fn x => 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

832 
case AList.lookup op = (!tab) x of 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

833 
NONE => 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

834 
let val p as (y, _) = bG i 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

835 
in (tab := (x, p) :: !tab; y) end 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

836 
 SOME (y, _) => y, 
28711  837 
fn () => Basics.fold mk_upd (!tab) (Const ("HOL.undefined", aT > bT))) 
25886
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

838 
end; 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

839 
*} 
7753e0d81b7a
Added test data generator for function type (from Pure/codegen.ML).
berghofe
parents:
24286
diff
changeset

840 

21870  841 
code_const "op \<circ>" 
842 
(SML infixl 5 "o") 

843 
(Haskell infixr 9 ".") 

844 

21906  845 
code_const "id" 
846 
(Haskell "id") 

847 

2912  848 
end 