The relation y−x∈Q+ is an ordering on R which makes R into a linearly ordered set; is compatible with the additive group structure on R, and induces the ordering x≤y on Q.
We begin by showing that the relations y−x∈Q+ and z−y∈Q+ imply z−x∈Q+. Indeed, the function x+y is continuous on R×R, and therefore by (8) we have Q++Q+⊂Q+ (Chapter I, § 2, no. 1, Theorem 1). Next, we shall show that the relations y−x∈Q+ and x−y∈Q+ imply x=y; this will establish that y−x∈Q+ is an ordering on R. It is enough to show that Q+∩(−Q+)={0}. Now the functions x→x+ and x→x− are uniformly continuous on Q and can therefore be extended by continuity to R (Chapter II, , no. 6, Theorem 2); let f and g be their respective extensions. By extension we have x=f(x)−g(x) for all x∈R; if x∈Q+ then g(x)=0, and since −Q+ is the closure of −Q+ by the continuity of −x, it follows that if x∈−Q+ then f(x)=0. Hence if x∈Q+∩(−Q+) we have f(x)=g(x)=0 and therefore x=0
By (10), we have Q+∪(−Q+)=R, and hence R is linearly ordered by the ordering y−x∈Q+.
Furthermore, since the relations y−x∈Q+ and (y+z)−(x+z)∈Q+ are equivalent, the ordering y−x∈Q+ is compatible with the additive group structure of R.
Finally, if x and y belong to Q the relations y−x∈Q+ and y−x∈Q+ are equivalent, and therefore the relation y−x∈Q+ induces the relation x≤y on Q. This completes the proof.
The relation y−x∈Q+ is again denoted by x≤y. The set Q+ is the set of all x≥0 in R and is denoted by R+; it is a closed set. The set of all x>0 is denoted by R+∗; it is the complement of −R+ and is therefore open in R.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Nothing.