TheoremBase

Basic Properties of Countable Sets

Statement

Let N\mathbb{N} be the set of natural numbers, and let countable be understood as in the definition of a countable set. Then the following hold.

1. N\mathbb{N} is countable.

2. Every finite set is countable.

3. (Subsets.) If XX is countable and Y⊆XY\subseteq X, then YY is countable.

4. (Images.) If XX is countable, YY is a set and g:X→Yg:X\to Y is a map with Y={g(x):x∈X}Y=\{g(x):x\in X\}, then YY is countable.

5. (Injections.) If YY is countable and h:X→Yh:X\to Y is a map such that h(x)=h(x′)h(x)=h(x') implies x=x′x=x' for all x,x′∈Xx,x'\in X, then XX is countable.

6. (Adjoining a point.) If SS is a set, X⊆SX\subseteq S is countable and z∈Sz\in S, then X∪{z}X\cup\{z\} is countable.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…