Let (xι)ι∈I be a family of elements of an ordered set E, and let (Jλ)λ∈L be a covering of the index set I. Suppose that each of the subfamilies (xι)ι∈Jλ has a least upper bound in E. For the family (xι)ι∈I to have a least upper bound in E, it is necessary and sufficient that the family (ι∈Jλsupxι)λ∈L should have a least upper bound in E, and then we have
(1)ι∈Isupxι=λ∈Lsup(ι∈Jλsupxι).
Let bλ=ι∈Jλsupxι. Suppose that (xι)ι∈I has a least upper bound a. Then a⩾bλ for each λ∈L (Corollary to Proposition 5). On the other hand, if c⩾bλ for each λ∈L, then we have c⩾xι for each ι∈I, because (Jλ)λ∈L is a covering of I; hence c⩾a, which proves that
a=λ∈Lsupbλ.
Conversely, suppose that the family (bλ)λ∈L has a least upper bound a′. Then a′⩾xι for all ι∈I. On the other hand, if c′⩾xι for all ι∈I, then we have in particular
c′⩾ι∈Jλsupxι=bλ
for each λ∈L, so that c′⩾a′ and therefore
a′=ι∈Isupxι.
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.