A correspondence Γ between E and E is an ordering on E if and only if its graph G satisfies the following conditions :
(a) G∘G=G.
(b) The set G∩G−1 is the diagonal Δ of E×E.
For the relation ((x, y)∈G and (y, z)∈G)⇒((x, z)∈G) can be written as G∘G⊂G, and the relation
((x, y)∈G and (y, x)∈G)⇔(x=y and x∈E and y∈E)
can be written as G∩G−1=Δ. From G∩G−1=Δ we then deduce Δ⊂G, whence G=Δ∘G⊂G∘G; since also G∘G⊂G, we have
G∘G=G.
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.
Nothing.
Nothing.