Unformatted text preview: is itself either ﬁnite or countable. (Hint: The proof is similar to the proof that the countable union of countable sets is countable, but you have to ﬁgure out how to deal with the ﬁnite sets. Don’t make things too complicated; there is a very simple solution.) 4. Prove that the set of all ﬁnite subsets of N is countable....
View
Full Document
 Spring '10
 Math, Set Theory, Empty set, Natural number, Finite set, countable sets

Click to edit the document details