Make a case distinction. Show that for each of the four kinds of isometries, one of the described properties hold. For example, a rotation will always have the center of rotation as a fixed point. Similar arguments hold for the other three kinds, assigning one of the described properties to each kind of isometry.
For bonus points, you might discuss the identity transformation as a special fifth case, and argue whether or not any of the mentioned properties apply to that one.
If that kind of proof is too informal for your context, then you'll have to be more specific about what kind of formalisms you're using in this area, or find your own way to put this informal matching into semi-formal proofs.
Edit: As your comment states that you are supposed to formulate this using complex numbers, you can start by enumerating all the arithmetic operations you can perform on the complex plane without affecting relative distances, i.e. all the isometries. You will find the following result:
- Addition of a complex number (i.e. translation)
- Multiplication by a complex number of absolute value one (i.e. rotation around the origin)
- Conjugation of the complex plane (i.e. reflection along the real axis)
The rather hard part is showing that this list is enough, i.e. that any other isomentry can be composed from these. I'd consider that proof easier for matrices, but it is doable for complex numbers as well. I'd try something like this:
- If an isometry reverses orientation, then you can apply a conjugation and end up with an orientation-preserving operation.
- If the isometry maps the origin to some other point, you can subtract that difference to obtain an operation which fixes the origin.
- If the isometry preserves orientation and fixes the origin, it has to be a rotation, so you can apply the reverse rotation to end up with the identity.
- The above three steps combined form the reverse of the original isometry, so if you apply their inverse in reverse order, you obtain the original isometry.
For this reason, any isometry in $\mathbb C$ will be of the following form:
$$ f: a + bi \mapsto e^{i\varphi} (a \pm bi) + (x + yi)
\qquad a,b,x,y,\varphi\in\mathbb R $$
You may notice that my proof would have put the conjugation as the last step, whereas my $(a-bi)$ would be the first step. This is all right, because I can move an outer conjugation to that inner position if I reverse the sign of both $\varphi$ and $y$ in the process.
So now you can solve $f(a+bi) = a+bi$, performing case distinctions where necessary, in order to obtain the fixed points. Expressing fixed lines using complex numbers will be more difficult, but by then you might have gotten the hang of this.