Bourbaki

Proposition 2

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

Theory of Sets, chapter III, § 5. Properties of integers

Let aa and bb be two integers. Then a<ba < b if and only if there exists an integer c>0c > 0 such that b=a+cb = a + c.

If a<ba < b, there exists a cardinal c⩽bc \leqslant b (so that cc is an integer (§ 4, no. 2, Proposition 2)) such that b=a+cb = a + c (§ 3, no. 6, Proposition 13); if a≠ba \neq b, we must have c≠0c \neq 0. Conversely, if b=a+cb = a + c and c≠0c \neq 0, then c⩾1c \geqslant 1 and hence a<a+1⩽a+c=ba < a + 1 \leqslant a + c = b.

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

Cites

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