Question

Prove that a countable union of a countable sets is
countable.​

Answer 1

Answer:

Theorem: Every countable union of countable sets is countable. ... A set X is countable if and only if there exists a surjection f : N → X. Proof. If such a surjection exists, then X is countable by 7.3