Proposition 8
Tag 03QI, permanent. Cite it as [Bourbaki, Tag 03QI].
Theory of Sets, chapter III, § 1. Order relations. Ordered sets
Let be a family of ordered sets. Let A be a subset of the product ordered set , and let for each . For A to have a least upper bound in E it is necessary and sufficient that, for each , should have a least upper bound in , and then we have
Suppose that, for each , has a least upper bound in . To say that is an upper bound of A then means that for each , hence is an upper bound of A. Conversely, suppose that A has a least upper bound ; for each , is an upper bound of , because if , there exists such that , by the definition of ; on the other hand, if is an upper bound of in , the element for which
is an upper bound of A; consequently and therefore ; hence is the least upper bound of in .
☡
¶ Let F be a subset of an ordered set E, and let A be a subset of F. It can happen that one of the two elements , exists but the other does not, or that both exist but are unequal.
Examples
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
Nothing.