I want to show that:
$x\subset S(x)$ where $S$ is the Successor function
and
$\not\exists z:x\subset z\subset S(x)$
These are obvious results, but the relation of $m<n\iff m\in n$ is given as a definition, this definition could be directly applied but this question sort of proves it!
The $x\subset S(x)$ is easy enough! The other is more difficult.
By the way the definition of $S(x)=x\cup \{x\}$
My reason for not writing what I have so far is that it's tonnes of $\{$ and $\}$
$\def\s#1{\{#1\}}$ Lemma. If $x\subset z\subset x\cup \s y$, then either $z=x$ or $z=x\cup\s y$.
We want to show that if $x\subset z \subset S(x)$, then either $z=x$ or $z = S(x)$. Take $y=x$ in the lemma.