Prove that all subsets of countable sets are countable

proof-writing elementary-set-theory

Solution 1:

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.

Related

Quotient Ring with kernel?
Derivative of floor function using epsilon/delta
$X\sim N(\mu,\sigma^{2})$. It is also known that $P(X ≤ 160) = \frac{1}{2}$ and $P(X ≤ 140) = \frac{1}{4}.$ What are the values of $µ$ and $σ$?
What is $R = 2\sin\theta \sin\phi$ (spherical coordinates) in cartesian coordinates?
Binomials to polynomial
Are all universal formulas true and all existential formulas false in the empty model?
Surjection between two finite sets of different sizes
Does eigenvalues of matrix change after multiplication by unitary matrix?
Lambda Calculus syntax: multiplication is or isn't implied?
Compute Galois group of $\mathbb F_q/\mathbb F_p$
Why doesn't Halmos include the Axiom of Regularity?
Solving a linear Diophantine equation where c is a multiple of $7$ (or any other prime)