Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 9.1.10
Exercise 9.1.10
Prove that .
Answers
Proof. First, we clearly have that
So let and be sets such that and . Then by definition we have and . We also have that there is a bijective since . We construct a bijection from to . So, for any let . Clearly, since and , it follows that and hence clearly (since for each ) so that is a function from to .
We also claim that is injective. So consider any and in where . It then follows that there must be a where . Then let , noting that is a bijective function from to since is bijective. We then have that
so that . Since and were arbitrary this shows that is indeed injective.
We also claim that is onto. So consider any so that is a function from to (since for each ). Then let so that clearly is a function from to since and . We then have that
where is the identity function from to . Since was arbitrary, this shows that is indeed onto.
Thus, since we have shown that is a bijection, it follows that
as desired. □