I am working through some basic set theory and I am wondering if the proof that a set is unique in ZF are all similar. For example, if I wanted to show that the empty set exists and is unique I would do the following: $$\text{let } \psi(x)=\lnot(x=x), \text{then using the comprehension axiom I would form the set } \phi=\{x:\psi(x)\}$$ I think this is enough to show that such a set exists. To show that it is unique I would then do the following: $$\text{ assume } A =\phi \text{ and } B=\phi \text{ with } A ≠ B, \text{ then given some } x\text{ }, x\in A \iff \lnot(x=x) \iff x\in B$$
By the extension axiom this would imply that A$=$B.
Is this the right technique for showing set uniqueness? They all seem to involve a similar type of proof where you show the set exists, assume two distinct sets have the same property as the set shown to exist, and then chain the two sets together using the formula that was used to define the set. I have done this with a number of sets, like union and intersection, and they seem to follow the same scheme. I appreciate any help.