Real analysis - countable
Not what you're looking for? Search our solutions OR ask your own Custom question.
This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!
if A subset or equal of B and B is countable, then A is either countable, finite or empty.
Since A is a subset of B or equal to B, then |A|<=|B|, where |.| means the number of elements in a set. Since B is countable, then |B| ...
This is a proof regarding countable sets.