Prove the intersection of every nonempty family of successor sets is a successor set itself
I thought that this would be a slightly interesting proof, since we can't really use induction to prove this (as the principle of mathematical induction comes from the Peano Axioms, which come only after we have a rigorous definition of Natural Numbers in set theory), neither can we use relations like ordering etc.
My Attempted Proof
Let $A$ be a nonempty family of successor sets. Pick $x^+ = x \cup \{x\} \in A$. If $x^+$ is the only element in $A$, then the proof follows trivially.
Suppose $A$ has two or more elements. Let $x^{++}$ denote the successor set of $x^{+}$, then $x^{++} = x^+ \cup \{x^+\}. $ If $A$ has two elements, $x^+$ and $x^{++}$, then we clearly have $x^+ \subset x^{++}$, and thus $\bigcap A$ is nonempty. If $A$ has more than two elements then for each set $x^{+} \in A$ having a successor set $x^{++} \in A$ we have $x^{+} \subset x^{++}$ so that $\bigcap A$ is again nonempty.
Hence the intersection of every non-empty family of successor sets is a successor set itself. $ \ \ \square$
Is my proof correct? If so how rigorous is it? Can it be improved in any way, also any comments on my proof writing style is greatly appreiated.