Translate the following inference to logic notation: For all x, x_5 is a mechanic. There is at least one x for which if x_5 were an artist, then x_5 is a server. For all x, x_5 is a mechanic if and only if x_5 is a server. Therefore there is at least one x for which x_5 is a server.
forall x: P(x). exists x: Q(x) -> R(x). forall x: P(x) <-> R(x). Therefore exists x: R(x).