Bourbaki

Example 1

Tag 03SX, permanent. Cite it as [Bourbaki, Tag 03SX].

Theory of Sets, chapter III, § 2. Well-ordered sets

Let E={α,β}\mathrm{E} = \{\alpha, \beta\} be a set whose elements are distinct. It is easily verified that the subset {(α,α),(β,β),(α,β)}\{(\alpha, \alpha), (\beta, \beta), (\alpha, \beta)\} of E×E\mathrm{E} \times \mathrm{E} is the graph of a well-ordering on E.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed edition, 2004, Springer. Not translated.