Is it always true that a family of countable sets is always countable?
If I prove that every $A\in B$ is countable is it enough to prove $B$ is countable?
Is it always true that a family of countable sets is always countable?
If I prove that every $A\in B$ is countable is it enough to prove $B$ is countable?
Copyright © 2021 JogjaFile Inc.
The set of natural numbers is countable. As such, the power set of $\mathbb{N}$, consisting of all subsets of $\mathbb{N}$, is a family of countable sets. However, the power set of a set must have a larger cardinality than that set, so the power set of the naturals is uncountable. In particular, it has cardinality $2^{\beth_0}=\beth_1$.