Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 5.1.2
Exercise 5.1.2
Show that and for all .
Answers
Proof. Suppose that for a set .
We claim that so that clearly
First consider any . Suppose that so that there is a . But then , which is a contradiction. Hence . So if there are any then but are there any ? Clearly the empty set is a function from to since it is vacuously true that for every there is a unique such that . Hence so that .
We also claim that so that
To this end for any define , noting that , so that clearly . Now consider any where . Then it has to be that
so that is injective. Now consider any and define by . Then clearly
so that is surjective. Hence we’ve shown that is bijective. □