ΘρϵηΠατπ

Same Cardinality
Two sets A and B have the same cardinality if there exists a bijection f:AB, 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.
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=1An. For each set An, define an injection fn:An. Now define a function f:A as follows: for each element xA, let i be the first index such that xAi. Define f(x)=2i3fi(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.