Now we can define cardinality:
Let be a set. If is finite then is just the number of elements in . Then:
- (here is called aleph, so this is aleph-null)
- We know that since is uncountable then where is the continuum.
- .
- The set has the same cardinality as if exists that is one-to-one and onto.
For same cardinality sets we write .
An example is as follows. The function takes the interval in a one-to-one correspondence, so :
Proof
(injective) Instead suppose . We'll show . Then:
Two cases since :
- ():
- ():
So just choose the () case! We are done.
(surjective): For scratch we are essentially trying to find . So try to swap the 's with 's and solve for :

Which
do we use? We want all
to have
and all
to be
. The only choice we could do that is with
.
Thus let . Choose where:
We claim that this is a good choice. Notice:
Notice too that the non-trivial part of our cases for never has the numerator equal 0, so then we are covered here.
☐