equal
deleted
inserted
replaced
208 assumes "bij_betw f A A'" "a' \<in> A'" |
208 assumes "bij_betw f A A'" "a' \<in> A'" |
209 shows "f(inv_into A f a') = a'" |
209 shows "f(inv_into A f a') = a'" |
210 using assms unfolding bij_betw_def using f_inv_into_f by force |
210 using assms unfolding bij_betw_def using f_inv_into_f by force |
211 |
211 |
212 |
212 |
213 (*1*)lemma bij_betw_inv_into_LEFT: |
|
214 assumes BIJ: "bij_betw f A A'" and SUB: "B \<le> A" |
|
215 shows "(inv_into A f)`(f ` B) = B" |
|
216 using assms unfolding bij_betw_def using inv_into_image_cancel by force |
|
217 |
|
218 |
|
219 (*1*)lemma bij_betw_inv_into_LEFT_RIGHT: |
|
220 assumes BIJ: "bij_betw f A A'" and SUB: "B \<le> A" and |
|
221 IM: "f ` B = B'" |
|
222 shows "(inv_into A f) ` B' = B" |
|
223 using assms bij_betw_inv_into_LEFT[of f A A' B] by fast |
|
224 |
|
225 |
|
226 (*1*)lemma bij_betw_inv_into_subset: |
213 (*1*)lemma bij_betw_inv_into_subset: |
227 assumes BIJ: "bij_betw f A A'" and |
214 assumes BIJ: "bij_betw f A A'" and |
228 SUB: "B \<le> A" and IM: "f ` B = B'" |
215 SUB: "B \<le> A" and IM: "f ` B = B'" |
229 shows "bij_betw (inv_into A f) B' B" |
216 shows "bij_betw (inv_into A f) B' B" |
230 using assms unfolding bij_betw_def |
217 using assms unfolding bij_betw_def |