Theorem . Every subset of a countable set is countable.
Proof. Suppose a1,a2,a3,....... is an enumeration of the countable set A and B is any nonempty subset of A. If, for some n∈ N, the element 'an' (a subscript n) belongs to B, then we assign the natural number n to it. For each n∈ N let k(n) denote the number of elements among a1,a2,a3,a4,...an, which belong to the subset B. Then ,0≤ k(n) ≤n . Therefore, B is countable by the Countability Lemma.
Every subset of a countable set is countable. TRUE