Are there models of first order Zermelo set theory (axiomatized by: Extensionaity, Foundation, empty set, pairing, set union, power, Separation, infinity) in which $\in$-induction fail?


I asked this question on Mathematics Stack Exchange [here](https://math.stackexchange.com/questions/2977520/is-epsilon-induction-a-theorem-schema-of-zermelo-set-theory?noredirect=1#comment6145941_2977520) 4 days ago, to receive no answer yet, I thought this question already has a well known answer that is somehow evading me. Seeing that nobody answered thus far, makes me wonder if this is really an elementary issue? The whole issue is whether the proof that Foundation implies $\in$-induction necessitate existence of transitive closures for all sets, and since first order Zermelo doesn't prove the existence of transitive closures for all sets, then this raised this issue in my mind. 



Is $\in$-induction provable in first order Zermelo set theory?
The answer is no. Take the standard model of Z and add in a $\mathbb{Z}$-sequence of objects, each of whose only element is the previous one. I.e., define


$M=\bigcup\_{n<\omega} \bigcup\_{m<\omega}\mathcal{P}^n(V\_{\omega} \cup (\{\omega + \omega\}\times[-m, \infty))),$
where we adjust the $\mathcal{P}$ operator to replace each singleton of the form $\{(\omega+\omega,m)\}$ with $(\omega+\omega,m+1).$


We define the relation $E$ on
$V\_{\omega} \cup (\{\omega + \omega\}\times \mathbb{Z})$ by $E \restriction V\_{\omega}=\in \restriction V\_{\omega}$ and $E \restriction \mathbb{Z}=\{((\omega+\omega,n),(\omega+\omega,n+1)): n \in \mathbb{Z}\},$ with no relations between "integer objects" and "set objects." Extending $E$ to the iterated power sets is done in the natural way.


It's easy to see $(M,E)$ satisfies Z, and furthermore an object has a (set-sized) transitive closure iff its transitive closure class has no integer objects. In particular, every counterexample to "everything has a transitive closure" contains another counterexample, and such counterexamples exist, contradicting $E$-induction.


