0

I know that in a set theory like Z or ZF we can prove the existence of the empty set starting from the existence of any set (guaranteed for example from infinity axiom) using the separation axiom on the first order formula $x\neq x$. However, it seems to me that it is not really necessary to have an axiom that guarantees the existence of a set. More explicity:

Let $\mathcal{L}=\{=, \neq, \in, \notin\}$ be a language (I am assuming the notation that only symbols that are not common to all languages ​​are displayed), we can define the following axioms (closed first order formulas):

A$1$[Extentionality]: $\forall x \forall y\forall z\Big((z\in x \iff z\in y) \Rightarrow x=y\Big)$
A$2$[Separation(schema)]: Let $n\geq1$, let $A(x, x_1, .., x_n)$ be a first order formula in $\mathcal{L}$ with $n+1$ free variable, then $\forall x \exists y\forall z\Big(z\in y \iff (z\in x \land A(z, x_1, .., x_n))\Big)$

Let $T=\{A1, A2\}$ be a theory on $\mathcal{L}$, let $\mathcal{U}$ any $\mathcal{L}$-structure such that $\mathcal{U} \models T$;
Since the extentionality we can define the empty set, $\emptyset$, (if exists) as the (unique) set which has not elements, i.e. such that $\mathcal{U} \models \forall x(x\notin y)$. So my attempt:

Prop: $\exists \emptyset, $ i.e is deducible from T the formula $\exists y\forall x(x\notin y)$ .
Proof: Let $A(x)= (x \neq x)$ be a first order formula in $\mathcal{L}$ with one free variable, by $A2$ we have $\forall x \exists y\forall z\Big(z\in y \iff (z\in x \land z\neq z)\Big)$ $\iff$ $\forall x \exists y\forall z\Big(z\in y \iff F\Big)$ $\iff$ $\exists y\forall z\Big(z\in y \iff F\Big)$ $\iff$ $\exists y\forall z(z \notin y)$.


ADDENDUM: A related question is here. I think my doubts arose from the fact that the text I am following chooses not to consider it possible to have an empty structure for languange. So my questions are:

  1. Why are we interested to have non empty structures for language?

  2. Assuming that we can have empty structure, what formal error i made in my attempt?

  • 1
    $\forall x. A$ does not imply $A$ if the domain of quantification is empty (as would be the case if there weren't any sets). – Naïm Camille Favier May 06 '25 at 20:19
  • Yes, if your logic system assumes the domain is not empty, then with the intended domain being sets, there must be at least one set, and so with Separation you can then get the empty set. Seems a little 'weak' to rely on the nature of a proof system though. Also, unrelatedly, in your proof you are overloading the use of $\iff$: as part of (i.e. within) the FOL statements, the $\iff$ is used as a material biconditional logical operator, but when you put put the $\iff$ between the statements, you are using it to express a logical equivalence meta-logical relation. Better to separate those – Bram28 May 09 '25 at 12:42

0 Answers0