Prove that all subsets of countable sets are countable

Question

This is basically a problem of my assignment, it says...

A set is said to be countable if it is either finite or there is an enumeration(list) of the set. Then prove that All subsets of countable sets are countable.

While proving the above, do I have to prove all these 3 cases separately?

• Finite subset of a finite set is countable.

• Finite subset of a countably infinite set is countable.

• Infinite subset of a countably infinite set is countable.

This is my confusion. And if we want to prove that a set $S$ is countable, we have to show that the function $f:\mathbb{N}\rightarrow S$ is a bijection. Using it, I can prove the 3rd part(infinite subset of countably infinite set); but how can I use this definition to prove the 1st two? Or, if I show that a finite set is countable, will that be enough to say that the 1st two are true?

Please anyone help me solve it. Thanks in advance.

Answer 1

For finite subsets, it would be sufficient (given your definition) to say that any finite subset is countable. However, a more rigorous proof will follow my answer to this question here.

Answer 2

Since finite subsets are countable by definition, you do not have to prove anything.

For infinite subsets, you consider the sub-sequence formed by terms of your subset and ignoring the terms which are not in your subset.