Share
Explore BrainMass

Real analysis - countable

Proof:
if A subset or equal of B and B is countable, then A is either countable, finite or empty.

Solution Preview

proof:

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| ...

Solution Summary

This is a proof regarding countable sets.

$2.19