TITLE: Questions on Fraenkel models
QUESTION [6 upvotes]: Halbeisen on page 172 contains a section entitled "The Second Fraenkel Model". The original paper by Fraenkel containing this model can be found here. I have several questions regarding this model and $\mathsf{FM}$-models in general. 

If this 1922 paper by Fraenkel is not the first describing $\mathsf{FM}$-models, can someone please point me to his very fist paper in which he invents the technique? (given that Halbeisen calls it the second model I suppose there must be an earlier paper containing his first model although looking at this list of publications it appears to be his first.)
In this 1922 paper he writes that for this model construction we can keep the axioms of Zermelo I,II,IV-VII as they are but in Halbeisen on page 168 it is stated that we need to use modified versions of Empty Set and Extensionality. Hence my question 2.a) is: Is this a mistake in Fraenkel's paper? (Unlikely, I would think) and my question 2.b) is: Empty Set is a consequence of all the other axioms hence wouldn't it be enough to just use a modified version of Extensionality?
Last but not least the question that is most important to me: What exactly did Fraenkel's 1922 paper prove? The aim of course was to show that $\mathsf{AC}$ is independent of $\mathsf{ZF}$ by constructing a model of $\mathsf{ZF}$ in which $\mathsf{AC}$ fails. But the model he constructed is a model of $\mathsf{ZFA}$ and not of $\mathsf{ZF}$ and it seems to be the case that those transfer methods used to embed these Fraenkel models into symmetric models weren't known for another 30 years or so. Hence: what is the relation of $\mathsf{ZFA}$ and $\mathsf{ZF}$? (without using transfer methods)

REPLY [3 votes]: This is just a footnote to the other responses. But it is interesting that there seems to be a bit of a resurgence of interest in Fraenkel-Mostowski permutation models going on (for a small local example, this year 'Permutation Models for Set Theory' is on the list of essay topics for Part III Maths Tripos).
One source of renewed interest is from computer scientists interested in "capture-avoiding substitution": for some general thoughts, see e.g. this paper.
Another recent source is that Randall Holmes's announced proof of the consistency of NF set theory uses FM techniques. Interesting times!