Kerodon

$\Newextarrow{\xRightarrow}{5,5}{0x21D2}$ $\newcommand\empty{}$
$\Newextarrow{\xhookrightarrow}{10,10}{0x21AA}$

Example 4.7.1.4. Let $S$ be any set, and let $\leq $ be the discrete partial ordering of $S$: that is, we have $s \leq t$ if and only if $s = t$. Then $(S, \leq )$ is well-founded.