Bourbaki

Proposition 5

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

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

If aa and bb are integers such that a⩽ba \leqslant b, then the interval [a,b][a, b] is a finite set whose number of elements is b−a+1b - a + 1.

By Proposition 4 we may restrict ouselves to the case where a=0a = 0. The proof is by induction on bb. If b=0b = 0, the result is clear. The relation 0⩽x⩽b+10 \leqslant x \leqslant b + 1 is equivalent to "0⩽x<b+10 \leqslant x < b + 1 or x=b+1x = b + 1", and the relation 0⩽x<b+10 \leqslant x < b + 1 is equivalent to 0⩽x⩽b0 \leqslant x \leqslant b (§ 4, no. 2, Proposition 2); in other words, the interval [0,b+1][0, b + 1] is the union of [0,b][0, b] and {b+1}\{b + 1\}, and these two sets are disjoint. By the inductive hypothesis the number of elements of [0,b+1][0, b + 1] is equal to (b+1)+1(b + 1) + 1, and the Proposition is proved.

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.