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