Bourbaki

Proposition 1

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

Theory of Sets, chapter II, § 2. Ordered pairs

If A′', B′' are non-empty sets, the relation A′×' \times B′⊂' \subset A ×\times B is equivalent to "A′⊂' \subset A and B′⊂' \subset B".

In the first place, the relation z∈A′×B′z \in A' \times B' is equivalent to "zz is an ordered pair and pr1z∈A′\mathrm{pr}_1 z \in A' and pr2z∈B′\mathrm{pr}_2 z \in B'"; therefore, without any restriction on A′' and B′', the relation "A′⊂' \subset A and B′⊂' \subset B" implies

A′×B′⊂A×B.A' \times B' \subset A \times B.

Conversely, let us first show that if B′≠∅B' \neq \emptyset (without restriction on A′A'), the relation A′×B′⊂A×BA' \times B' \subset A \times B implies A′⊂AA' \subset A. Let xx be an element of A′A'; since B′≠∅B' \neq \emptyset, there is an object yy which is an element of B′B'; we have (x,y)∈A′×B′(x, y) \in A' \times B', hence (x,y)∈A×B(x, y) \in A \times B, and consequently x∈Ax \in A; thus A′⊂AA' \subset A. Similarly, if A′≠∅A' \neq \emptyset, the relation A′×B′⊂A×BA' \times B' \subset A \times B implies B′⊂BB' \subset B. Hence the result.

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

Nothing.

Cites

Nothing.

Transcribed from the printed edition, 2004, Springer. Not translated.