I'm reading Axiomatic Set Theory by Suppes, and I'm having a bit of trouble understanding which rules of inference (logical system) he is using, here's an example (capital letters are used for sets):
Definition: $(y \text{ is a set})\leftrightarrow (\exists x) (x\in y)\vee x=0.$
Theorem 1. $x\notin0$.
Theorem 2. $(\forall x)(x\not\in A)\leftrightarrow A = 0$.
Proof. If $A=0$ then by theorem $1$ $x\notin A$. If $(\forall x)(x\notin A)$, then by definition $1$, $A=0$.
So my translation of this into a formal proof would be something like:
\begin{align} &\vdash \forall x\,(x\notin 0) &\text{Theorem 1.}\\ A=0&\vdash \forall x\, (x\notin A) &\text{Rule of replacement?}\\ \end{align}
Then by the deduction theorem (I'm guessing this is needed...), we get $\vdash A=0\rightarrow (\forall x)(x\notin A)$. Then a similar proof to get the converse, and lastly something like
\begin{align} 1.&\vdash A=0\rightarrow (\forall x)(x\notin A) &\text{Proof above}\\ 2.&\vdash (\forall x)(x\notin A) \rightarrow A=0 &\text{Proof above}\\ 3.&\vdash A=0\leftrightarrow (\forall x)(x\notin A) &\text{From 1,2.} \end{align}
But I'm not sure if this is what Suppes had in mind, and he doesn't seem to say so anywhere in the first chapters. Does anyone know the exact system he is using?