Translate the following inference to logic notation: If Thomas were a lawyer, then Thomas is running. For all x, if x_7 goes running, then x_7 is a lawyer. Thomas is not running. Therefore Thomas is not a lawyer.
P(a) -> Q(a). forall x: Q(x) -> P(x). ~Q(a). Therefore ~P(a).