This comes up in the following context:
**Lemma:** If a set $X$ injects into $\mathbb{N}$, then it's countable.
*Proof.* If $X$ finite we are done, so let $X$ be infinite. Let $f : X \to \mathbb{N}$ be the relevant injection injection.
Being a subset of $\mathbb{N}$, the set $f(X) = \{ f(x)\,:\, x \in X \}$ is well-ordered, and in particular it has a least element, a 2nd-least element, a 3rd-least element, and so on. Define $g : f(X) \to \mathbb{N}$ by sending the $n^{\text{th}}$-least element of $f(X)$ to $n \in \mathbb{N}$. Then the composite $g \circ f : X \to f(X) \to \mathbb{N}$ is i…