Question

Countable union of countable sets is countable proof

Answer 1

The union of two countable sets is countable. for every k∈N. Now A∪B={cn:n∈N} and since it is a infinite set then it is countable. ... The union of a finite family of countable sets is a countable set. To prove for a infinite family you need the Axiom of choice.