author  nipkow 
Tue, 06 Sep 2011 14:25:16 +0200  
changeset 44744  bdf8eb8f126b 
parent 44277  bcb696533579 
child 44860  56101fa00193 
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 
41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41229
diff
changeset

10 
uses ("Tools/enriched_type.ML") 
15131  11 
begin 
2912  12 

26147  13 
lemma apply_inverse: 
26357  14 
"f x = u \<Longrightarrow> (\<And>x. P x \<Longrightarrow> g (f x) = x) \<Longrightarrow> P x \<Longrightarrow> x = g u" 
26147  15 
by auto 
2912  16 

12258  17 

26147  18 
subsection {* The Identity Function @{text id} *} 
6171  19 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

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

21 
"id = (\<lambda>x. x)" 
13910  22 

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

25 

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

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

27 
by (simp add: id_def) 
26147  28 

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

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

30 
by (simp add: id_def) 
26147  31 

32 

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

34 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

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

36 
"f o g = (\<lambda>x. f (g x))" 
11123  37 

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

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

40 

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

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

43 

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

46 

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

48 
by (simp add: comp_def) 

49 

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

51 
by (simp add: comp_def) 

52 

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

54 
by (simp add: comp_def) 

55 

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

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

58 
by (simp only: comp_def) (fact fun_cong) 
34150  59 

60 
lemma o_eq_elim: 

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

62 
by (erule meta_mp) (fact o_eq_dest) 

63 

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

66 

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

69 

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

72 

73 

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

74 
subsection {* The Forward Composition Operator @{text fcomp} *} 
26357  75 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

76 
definition fcomp :: "('a \<Rightarrow> 'b) \<Rightarrow> ('b \<Rightarrow> 'c) \<Rightarrow> 'a \<Rightarrow> 'c" (infixl "\<circ>>" 60) where 
37751  77 
"f \<circ>> g = (\<lambda>x. g (f x))" 
26357  78 

37751  79 
lemma fcomp_apply [simp]: "(f \<circ>> g) x = g (f x)" 
26357  80 
by (simp add: fcomp_def) 
81 

37751  82 
lemma fcomp_assoc: "(f \<circ>> g) \<circ>> h = f \<circ>> (g \<circ>> h)" 
26357  83 
by (simp add: fcomp_def) 
84 

37751  85 
lemma id_fcomp [simp]: "id \<circ>> g = g" 
26357  86 
by (simp add: fcomp_def) 
87 

37751  88 
lemma fcomp_id [simp]: "f \<circ>> id = f" 
26357  89 
by (simp add: fcomp_def) 
90 

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

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

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

93 

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

95 

26357  96 

40602  97 
subsection {* Mapping functions *} 
98 

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

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

101 

102 
lemma map_fun_apply [simp]: 

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

104 
by (simp add: map_fun_def) 

105 

106 

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

108 

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

109 
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

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

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

112 
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

113 
"bij_betw f A B \<longleftrightarrow> inj_on f A \<and> f ` A = B" 
26147  114 

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

26147  117 

118 
abbreviation 

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

119 
"inj f \<equiv> inj_on f UNIV" 
26147  120 

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

13585  123 

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

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

125 
"bij f \<equiv> bij_betw f UNIV UNIV" 
26147  126 

43705
8e421a529a48
added translation to fix critical pair between abbreviations for surj and ~=
nipkow
parents:
42903
diff
changeset

127 
text{* The negated case: *} 
8e421a529a48
added translation to fix critical pair between abbreviations for surj and ~=
nipkow
parents:
42903
diff
changeset

128 
translations 
8e421a529a48
added translation to fix critical pair between abbreviations for surj and ~=
nipkow
parents:
42903
diff
changeset

129 
"\<not> CONST surj f" <= "CONST range f \<noteq> CONST UNIV" 
8e421a529a48
added translation to fix critical pair between abbreviations for surj and ~=
nipkow
parents:
42903
diff
changeset

130 

26147  131 
lemma injI: 
132 
assumes "\<And>x y. f x = f y \<Longrightarrow> x = y" 

133 
shows "inj f" 

134 
using assms unfolding inj_on_def by auto 

13585  135 

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

138 

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

141 

32988  142 
lemma inj_on_eq_iff: "inj_on f A ==> x:A ==> y:A ==> (f(x) = f(y)) = (x=y)" 
13585  143 
by (force simp add: inj_on_def) 
144 

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

145 
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

146 
"(\<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

147 
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

148 

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

149 
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

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

151 
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

152 

38620  153 
lemma inj_comp: 
154 
"inj f \<Longrightarrow> inj g \<Longrightarrow> inj (f \<circ> g)" 

155 
by (simp add: inj_on_def) 

156 

157 
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

158 
by (simp add: inj_on_def fun_eq_iff) 
38620  159 

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

162 

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

164 
by (simp add: inj_on_def) 
13585  165 

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

167 
by (simp add: inj_on_def) 
26147  168 

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

169 
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

170 
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

171 

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_INTER: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

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

174 
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

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_Inter: 
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

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

178 
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

179 

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

180 
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

181 
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

182 
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

183 
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

184 
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

185 
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

186 
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

187 
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

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

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

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

191 
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

192 
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

193 
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

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

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

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

197 
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

198 
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

199 
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

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

201 
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

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

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

204 

40702  205 
lemma surj_id: "surj id" 
206 
by simp 

26147  207 

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

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

209 
by (simp add: bij_betw_def) 
13585  210 

211 
lemma inj_onI: 

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

213 
by (simp add: inj_on_def) 

214 

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

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

217 

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

219 
by (unfold inj_on_def, blast) 

220 

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

222 
by (blast dest!: inj_onD) 

223 

224 
lemma comp_inj_on: 

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

226 
by (simp add: comp_def inj_on_def) 

227 

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

230 
apply blast 

231 
done 

232 

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

235 
apply(unfold inj_on_def) 

236 
apply blast 

237 
done 

238 

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

12258  241 

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

244 

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

247 

15303  248 
lemma subset_inj_on: "[ inj_on f B; A <= B ] ==> inj_on f A" 
13585  249 
by (unfold inj_on_def, blast) 
250 

15111  251 
lemma inj_on_Un: 
252 
"inj_on f (A Un B) = 

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

254 
apply(unfold inj_on_def) 

255 
apply (blast intro:sym) 

256 
done 

257 

258 
lemma inj_on_insert[iff]: 

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

260 
apply(unfold inj_on_def) 

261 
apply (blast intro:sym) 

262 
done 

263 

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

265 
apply(unfold inj_on_def) 

266 
apply (blast) 

267 
done 

268 

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

269 
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

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

271 
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

272 

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

273 
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

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

275 
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

276 

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

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

279 

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

13585  282 

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

283 
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

284 
by (simp add: surj_def) 
13585  285 

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

286 
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

287 
by (simp add: surj_def, blast) 
13585  288 

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

290 
apply (simp add: comp_def surj_def, clarify) 

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

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

293 
done 

294 

39074  295 
lemma bij_betw_imp_surj: "bij_betw f A UNIV \<Longrightarrow> surj f" 
40702  296 
unfolding bij_betw_def by auto 
39074  297 

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

298 
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

299 
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

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

301 
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

302 

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

303 
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

304 
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

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

306 
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

307 

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

308 
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

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

310 
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

311 

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

312 
lemma bij_def: "bij f \<longleftrightarrow> inj f \<and> surj f" 
40702  313 
unfolding bij_betw_def .. 
39074  314 

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

317 

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

319 
by (simp add: bij_def) 

320 

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

322 
by (simp add: bij_def) 

323 

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

324 
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

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

326 

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

329 
by(auto simp add:bij_betw_def comp_inj_on) 

330 

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

333 

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

334 
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

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

336 
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

337 

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

338 
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

339 
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

340 
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

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

342 
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

343 
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

344 
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

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

346 
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

347 
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

348 
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

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

350 
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

351 
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

352 
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

353 
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

354 
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

355 
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

356 
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

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

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

359 

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

360 
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

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

362 
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

363 
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

364 
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

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

366 
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

367 
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

368 
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

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

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

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

372 
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

373 
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

374 
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

375 
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

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

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

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

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

380 
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

381 
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

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

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

384 
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

385 
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

386 
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

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

388 
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

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

390 

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

391 
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

392 
"(\<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

393 
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

394 

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

395 
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

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

397 
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

398 

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

399 
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

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

401 
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

402 

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

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

406 
using assms unfolding bij_betw_def inj_on_Un image_Un by auto 

407 

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

408 
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

409 
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

410 
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

411 
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

412 
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

413 
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

414 
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

415 
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

416 
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

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

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

419 
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

420 
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

421 
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

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

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

424 
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

425 
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

426 
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

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

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

429 

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

430 
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

431 
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

432 
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

433 
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

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

435 
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

436 
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

437 
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

438 
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

439 
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

440 
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

441 
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

442 
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

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

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

445 
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

446 
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

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

448 
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

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

450 

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

451 
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

452 
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

453 
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

454 
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

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

456 
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

457 

13585  458 
lemma surj_image_vimage_eq: "surj f ==> f ` (f ` A) = A" 
40702  459 
by simp 
13585  460 

42903  461 
lemma surj_vimage_empty: 
462 
assumes "surj f" shows "f ` A = {} \<longleftrightarrow> A = {}" 

463 
using surj_image_vimage_eq[OF `surj f`, of A] 

464 
by (intro iffI) fastsimp+ 

465 

13585  466 
lemma inj_vimage_image_eq: "inj f ==> f ` (f ` A) = A" 
467 
by (simp add: inj_on_def, blast) 

468 

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

40702  470 
by (blast intro: sym) 
13585  471 

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

473 
by (unfold inj_on_def, blast) 

474 

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

476 
apply (unfold bij_def) 

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

478 
done 

479 

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

482 

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

485 
apply (simp add: inj_on_def, blast) 

486 
done 

487 

488 
lemma inj_on_image_set_diff: 

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

490 
apply (simp add: inj_on_def, blast) 

491 
done 

492 

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

494 
by (simp add: inj_on_def, blast) 

495 

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

497 
by (simp add: inj_on_def, blast) 

498 

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

500 
by (blast dest: injD) 

501 

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

503 
by (simp add: inj_on_def, blast) 

504 

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

506 
by (blast dest: injD) 

507 

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

509 
lemma image_INT: 

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

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

512 
apply (simp add: inj_on_def, blast) 

513 
done 

514 

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

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

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

518 
apply (simp add: bij_def) 

519 
apply (simp add: inj_on_def surj_def, blast) 

520 
done 

521 

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

40702  523 
by auto 
13585  524 

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

526 
by (auto simp add: inj_on_def) 

5852  527 

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

530 
apply (rule equalityI) 

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

532 
done 

533 

41657  534 
lemma inj_vimage_singleton: "inj f \<Longrightarrow> f ` {a} \<subseteq> {THE x. f x = a}" 
535 
 {* The inverse image of a singleton under an injective function 

536 
is included in a singleton. *} 

537 
apply (auto simp add: inj_on_def) 

538 
apply (blast intro: the_equality [symmetric]) 

539 
done 

540 

43991  541 
lemma inj_on_vimage_singleton: 
542 
"inj_on f A \<Longrightarrow> f ` {a} \<inter> A \<subseteq> {THE x. x \<in> A \<and> f x = a}" 

543 
by (auto simp add: inj_on_def intro: the_equality [symmetric]) 

544 

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

545 
lemma (in ordered_ab_group_add) inj_uminus[simp, intro]: "inj_on uminus A" 
35580  546 
by (auto intro!: inj_onI) 
13585  547 

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

548 
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

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

550 

41657  551 

13585  552 
subsection{*Function Updating*} 
553 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

554 
definition fun_upd :: "('a => 'b) => 'a => 'b => ('a => 'b)" where 
26147  555 
"fun_upd f a b == % x. if x=a then b else f x" 
556 

41229
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
40969
diff
changeset

557 
nonterminal updbinds and updbind 
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
40969
diff
changeset

558 

26147  559 
syntax 
560 
"_updbind" :: "['a, 'a] => updbind" ("(2_ :=/ _)") 

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

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

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

565 
translations 

35115  566 
"_Update f (_updbinds b bs)" == "_Update (_Update f b) bs" 
567 
"f(x:=y)" == "CONST fun_upd f x y" 

26147  568 

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

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

35115  571 
notation 
572 
sum_case (infixr "'(+')"80) 

26147  573 
*) 
574 

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

577 
apply (erule subst) 

578 
apply (rule_tac [2] ext, auto) 

579 
done 

580 

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

582 
lemmas fun_upd_idem = fun_upd_idem_iff [THEN iffD2, standard] 

583 

584 
(* f(x := f x) = f *) 

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

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

586 
declare fun_upd_triv [iff] 
13585  587 

588 
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

589 
by (simp add: fun_upd_def) 
13585  590 

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

592 
if fun_upd_apply is intentionally removed from the simpset *) 

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

594 
by simp 

595 

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

597 
by simp 

598 

599 
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

600 
by (simp add: fun_eq_iff) 
13585  601 

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

603 
by (rule ext, auto) 

604 

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

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

610 
by auto 

611 

31080  612 
lemma fun_upd_comp: "f \<circ> (g(x := y)) = (f \<circ> g)(x := f y)" 
34209  613 
by (auto intro: ext) 
31080  614 

44744  615 
lemma UNION_fun_upd: 
616 
"UNION J (A(i:=B)) = (UNION (J{i}) A \<union> (if i\<in>J then B else {}))" 

617 
by (auto split: if_splits) 

618 

26147  619 

620 
subsection {* @{text override_on} *} 

621 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

622 
definition override_on :: "('a \<Rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b" where 
26147  623 
"override_on f g A = (\<lambda>a. if a \<in> A then g a else f a)" 
13910  624 

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

13910  627 

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

13910  630 

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

13910  633 

26147  634 

635 
subsection {* @{text swap} *} 

15510  636 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

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

638 
"swap a b f = f (a := f b, b:= f a)" 
15510  639 

34101  640 
lemma swap_self [simp]: "swap a a f = f" 
15691  641 
by (simp add: swap_def) 
15510  642 

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

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

645 

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

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

648 

34145  649 
lemma swap_triple: 
650 
assumes "a \<noteq> c" and "b \<noteq> c" 

651 
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

652 
using assms by (simp add: fun_eq_iff swap_def) 
34145  653 

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

656 

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

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

658 
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

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

660 
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

661 
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

662 
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

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

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

665 

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

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

668 
by (simp add: inj_on_def swap_def, blast) 
15510  669 

670 
lemma inj_on_swap_iff [simp]: 

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

671 
assumes A: "a \<in> A" "b \<in> A" shows "inj_on (swap a b f) A \<longleftrightarrow> inj_on f A" 
39075  672 
proof 
15510  673 
assume "inj_on (swap a b f) A" 
39075  674 
with A have "inj_on (swap a b (swap a b f)) A" 
675 
by (iprover intro: inj_on_imp_inj_on_swap) 

676 
thus "inj_on f A" by simp 

15510  677 
next 
678 
assume "inj_on f A" 

34209  679 
with A show "inj_on (swap a b f) A" by (iprover intro: inj_on_imp_inj_on_swap) 
15510  680 
qed 
681 

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

682 
lemma surj_imp_surj_swap: "surj f \<Longrightarrow> surj (swap a b f)" 
40702  683 
by simp 
15510  684 

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

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

687 

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

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

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

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

691 

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

692 
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

693 
by simp 
39075  694 

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

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

696 

31949  697 
subsection {* Inversion of injective functions *} 
698 

33057  699 
definition the_inv_into :: "'a set => ('a => 'b) => ('b => 'a)" where 
44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

700 
"the_inv_into A f == %x. THE y. y : A & f y = x" 
32961  701 

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

704 
apply (simp add: the_inv_into_def inj_on_def) 

34209  705 
apply blast 
32961  706 
done 
707 

33057  708 
lemma f_the_inv_into_f: 
709 
"inj_on f A ==> y : f`A ==> f (the_inv_into A f y) = y" 

710 
apply (simp add: the_inv_into_def) 

32961  711 
apply (rule the1I2) 
712 
apply(blast dest: inj_onD) 

713 
apply blast 

714 
done 

715 

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

718 
apply (simp add: the_inv_into_def) 

32961  719 
apply (rule the1I2) 
720 
apply(blast dest: inj_onD) 

721 
apply blast 

722 
done 

723 

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

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

32961  727 

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

32961  730 
apply (erule subst) 
33057  731 
apply (erule the_inv_into_f_f, assumption) 
32961  732 
done 
733 

33057  734 
lemma the_inv_into_comp: 
32961  735 
"[ inj_on f (g ` A); inj_on g A; x : f ` g ` A ] ==> 
33057  736 
the_inv_into A (f o g) x = (the_inv_into A g o the_inv_into (g ` A) f) x" 
737 
apply (rule the_inv_into_f_eq) 

32961  738 
apply (fast intro: comp_inj_on) 
33057  739 
apply (simp add: f_the_inv_into_f the_inv_into_into) 
740 
apply (simp add: the_inv_into_into) 

32961  741 
done 
742 

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

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

32961  746 

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

749 
by (auto simp add: bij_betw_def inj_on_the_inv_into the_inv_into_into) 

32961  750 

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

751 
abbreviation the_inv :: "('a \<Rightarrow> 'b) \<Rightarrow> ('b \<Rightarrow> 'a)" where 
33057  752 
"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

753 

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

754 
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

755 
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

756 
shows "the_inv f (f x) = x" using assms UNIV_I 
33057  757 
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

758 

44277
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

759 

bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

760 
text{*compatibility*} 
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

761 
lemmas o_def = comp_def 
bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

762 

bcb696533579
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann
parents:
43991
diff
changeset

763 

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

764 
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

765 

42238  766 
lemma Cantors_paradox [no_atp]: 
40703
d1fc454d6735
Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOLimage.
hoelzl
parents:
40702
diff
changeset

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

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

769 
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

770 
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

771 
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

772 
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

773 
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

774 
qed 
31949  775 

40969  776 
subsection {* Setup *} 
777 

778 
subsubsection {* Proof tools *} 

22845  779 

780 
text {* simplifies terms of the form 

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

782 

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

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

789 
let 

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

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

792 
 find t = NONE 

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

24017  794 

795 
fun proc ss ct = 

796 
let 

797 
val ctxt = Simplifier.the_context ss 

798 
val t = Thm.term_of ct 

799 
in 

800 
case find_double t of 

801 
(T, NONE) => NONE 

802 
 (T, SOME rhs) => 

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

806 
rtac ext 1 THEN 

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

808 
end 

809 
in proc end 

22845  810 
*} 
811 

812 

40969  813 
subsubsection {* Code generator *} 
21870  814 

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

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

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

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

818 
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

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

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

821 
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

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

824 
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

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

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

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

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

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

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

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

832 
 SOME (y, _) => y, 
28711  833 
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

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

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

836 

21870  837 
code_const "op \<circ>" 
838 
(SML infixl 5 "o") 

839 
(Haskell infixr 9 ".") 

840 

21906  841 
code_const "id" 
842 
(Haskell "id") 

843 

40969  844 

845 
subsubsection {* Functorial structure of types *} 

846 

41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41229
diff
changeset

847 
use "Tools/enriched_type.ML" 
40969  848 

2912  849 
end 