Question:
Let $ A_{1}, A_{2}, ...$ be a sequence of sets, each of which is countable. Prove that the union of all the sets in the sequence is countable.
My attempt:
We know that for each set in the sequence, $ \exists \ f: \mathbb{N} \to A_{k}$ a bijection. Now I'm not sure how to prove that the union of all these sets is countable.
Have you seen the proof that the rational numbers are countable, where you arrange them in a grid?
List the elements in each set in a similar grid, with $A_1$ in the first row, $A_2$ in the second row, etc. Then define a similar function in a zig-zag manner through the grid. This should be a bijection between $\mathbb{N}$ and your union.