Bourbaki

Example 2

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

Theory of Sets, chapter II, § 1. Collectivizing relations

The relation x≠xx \neq x is not collectivizing in xx; in other words, (not Coll⁡x(x≠x)\operatorname{Coll}_x(x \neq x)) is a theorem. Let us argue by contradiction and suppose that x≠xx \neq x is collectivizing. Let aa be an auxiliary constant, distinct from xx and the constants of the theory, with the introductory axiom

(∀x)((x≠x)⟺(x∈a)). (\forall x)((x \neq x) \Longleftrightarrow (x \in a)).

Then the relation

(a≠a)⟺(a∈a) (a \neq a) \Longleftrightarrow (a \in a)

is true by C30 (Chapter I, §4, no. 3). The method of disjunction of cases (Chapter I, §3, no. 3) shows first that the relation a≠aa \neq a is true, and then that the relation a∈aa \in a is true, which is absurd.

C49. Let RR be a relation and xx a letter. If RR is collectivizing in xx, the relation (∀x)((x∈y)⟺R)(\forall x)((x \in y) \Longleftrightarrow R), where yy is a letter distinct from xx which does not appear in RR, is functional in yy.

This follows immediately from C48.

Very often in what follows we shall have at our disposal a theorem of the form Coll⁡xR\operatorname{Coll}_xR. To represent the term

τy(∀x)((x∈y)⟺R), \tau_y(\forall x)((x \in y) \Longleftrightarrow R),

which does not depend on the choice of the letter yy (distinct from xx and not appearing in RR), we shall introduce a functional symbol Ex(R)\mathscr{E}_x(R); the corresponding term does not contain xx. This term is denoted by “the set of all xx such that RR”. By definition (Chapter I, §4, no. 1) the relation

(∀x)((x∈Ex(R))⟺R) (\forall x)((x \in \mathscr{E}_x(R)) \Longleftrightarrow R)

is identical with CollxR\mathrm{Coll}_x R; consequently the relation RR is equivalent to

x∈Ex(R).x \in \mathscr{E}_x(R).

C50. Let RR, SS be two relations and let xx be a letter. If RR and SS are collectivizing in xx, the relation (∀x)(R⇒S)(\forall x)(R \Rightarrow S) is equivalent to

Ex(R)⊂Ex(S),\mathscr{E}_x(R) \subset \mathscr{E}_x(S),

and the relation (∀x)(R⇔S)(\forall x)(R \Leftrightarrow S) is equivalent to Ex(R)=Ex(S)\mathscr{E}_x(R) = \mathscr{E}_x(S).

This follows immediately from the preceding remark and from Definition 1 and axiom A1.

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

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