Definition 1.1.6.  Let S be a set. We define:
S is countable  :⇔  |S| is countable  ⇔  ∃ f : S → ℕ : f is injective
S is uncountable  :⇔  S is not countable
Equivalence.  No proof.
References.