Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 8.1.8
Exercise 8.1.8
Prove that every uncountable set has a subset of cardinality .
Answers
This proof is similar to that of Theorem 8.1.4.
Proof. Let be an uncountable set. By the Well-Ordering Principle (which is equivalent to the Axiom of Choice by Theorem 8.1.13) can be well ordered, and so can be arranged in a bijective transfinite sequence for some ordinal . Since is then equipotent to it has to be that since otherwise (and therefore ) would be countable or finite. So then clearly the range of the transfinite sequence is a subset of with cardinality . □