Translate the following inference to logic notation: For all x, if z_1 plays tennis, then z_1 is a lawyer. For all x, z_1 will not go running. For all x, z_1 will play tennis if and only if z_1 will go running. There is at least one x for which if z_1 were a lawyer, then z_1 is playing tennis. Therefore there is at least one x for which z_1 is not a lawyer.
forall x: P(x) -> Q(x). forall x: ~R(x). forall x: P(x) <-> R(x). exists x: Q(x) -> P(x). Therefore exists x: ~Q(x).