Is set equality a primitive notion or a relation whose definition is given by the axiom of extensionality

elementary-set-theoryset-theory

I saw some sources claiming that the equality of sets is a primitive notion (i.e. according to Wikipedia, a concept which is not defined in terms of previously defined concepts). However, the axiom of extensionality gives that two sets are said to be equal iff $\forall x(x \in A \iff x \in B)$ . Isn't set equality then a concept which can be defined in terms of the the primitive notion of set equality together with the concepts from first order logic? (i.e. isn't set equality not a primitive notion?)

Best Answer

This is a good question. Although there is something missing. When you state the Axiom of Extensionality, you are stating it as an “if and only if” condition. This axioms actually states that $$\forall x \forall y ((\forall z (z \in x \leftrightarrow z \in y)) \rightarrow x = y)\,.$$ The converse of this axiom, which is also true, is a particular instance of a standard theorem in any first order theory with equality (in this case, we consider the $\in$ as our relational symbol).

Putting both together we in fact obtain that $$\forall x \forall y ((\forall z (z \in x \leftrightarrow z \in y)) \leftrightarrow x = y)\,.$$

But this is not the definition of equality of sets. Rather, this is a characterization of the primitive notion of equality of sets.

Equality of sets is itself a primate notion (in this case a priority relation between sets), i.e. we don’t define it. Just in the same way that we don’t define the notion of set.