ΘρϵηΠατπ

Same Cardinality
Two sets A and B have the same cardinality if there exists a bijection f:A→B, then we write: |A|=|B|
Aleph Null
Aleph Null, denoted as ℵ0 is a symbol that replaces the string: |ℕ| so that we can write things like |S|=ℵ0 and it make sense.
Countable Set
A set A is countable if there exists an injective function f:A→ℕ0, where ℕ0 is the set of natural numbers including 0.
The Countable Union of Countable Sets is Countable
As per title.
Let {An}n=1∞ be a countable collection of countable sets. Denote A=⋃n=1∞An. For each set An, define an injection fn:An→ℕ. Now define a function f:A→ℕ as follows: for each element x∈A, let i be the first index such that x∈Ai. Define f(x)=2i⋅3fi(x) This ensures that f is an injection from A to ℕ, as the use of distinct powers of 2 for each set guarantees that no two elements from different An's are mapped to the same value in ℕ, this follows from the uniqueness of the prime factorization. If A is finite, then it is trivially countable because finite sets are a special case of countable sets. If A is infinite, then the image of f, im(f), is an infinite subset of ℕ, and any infinite subset of ℕ is countable (since it has a bijection to ℕ). Therefore, A is bijective to im(f), and thus A is countable.