Translate the following inference to logic notation: For all x, if z were a server, then z is a mechanic. For all x, if z were a mechanic, then z is a server. For all x, if z were a mechanic, then z is a server. Therefore for all x, if z were a mechanic, then z is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: Q(x) -> P(x). Therefore forall x: Q(x) -> P(x).