Go backward to Number of Set Elements
Go up to Top
Go forward to Example
Proposition: If S is not empty and both f: Nn -> S and g: Nm -> S are bijections, then n = m:
(forall S != 0, n in N, m in N, f: Nn ->bijective S, g: Nm ->bijective S: m = n).
Proof: see lecture notes.
The size of a set is uniquely defined.