Definition 1
Tag 03H5, permanent. Cite it as [Bourbaki, Tag 03H5].
Theory of Sets, chapter II, § 1. Collectivizing relations
The relation denoted by , in which only the letters and appear, is written in one of the following ways : , , " is contained in ", " contains ", " is a subset of ". The relation "not " is written or .
In accordance with the conventions mentioned in Chapter I, § 1, no. 1, this definition entails the following metamathematical convention. Let and be assemblies; if we substitute for and for in the assembly , we obtain an assembly which is denoted by ; if we denote by , letters which are distinct from , and distinct from each other, and which appear neither in nor in , the assembly is then identical with and hence by CS8, CS9 (Chapter I, § 4, no. 1), and CS5 (Chapter I, § 1, no. 2) with , provided that is a letter which appears neither in nor in .
From now on, whenever we state a mathematical definition, we shall not mention the metamathematical convention which it entails.
CS12. Let , , be assemblies and let be a letter. Then the assembly is identical with .
This follows immediately from CS9 (Chapter I, § 4, no. 1) and CS5 (Chapter I, § 1, no. 2).
CF13. If and are terms, is a relation.
This follows immediately from CF8 (Chapter I, § 1, no. 4).
¶ Every relation of the form (where and are terms) is called an inclusion relation.
From now on we shall no longer write down explicitly the criteria of substitution and the formative criteria which should follow the definitions. It should be noted, however, that these criteria will often be used implicitly in proofs.
To prove the relation in a theory , it is enough, by C27 (Chapter I, § 4, no. 1), to prove that in the theory obtained by adjoining to the axioms of , where is a letter distinct from , and the constants of the theory. In pratice we say "let be an element of ", and we attempt to prove .
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.