Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 5.2.5
Exercise 5.2.5
Show that, for , .
Answers
Proof. Suppose that for a set . We define by
for , noting that . Clearly by simple inspection this is bijective so that
as desired. □
Main Problem.
Proof. First we note that clearly since we have
by property (n) in section 5.1. So consider any cardinal where so that . We then have
We also have
Clearly these together with the Cantor-Bernstein Theorem shows the desired result. □