Translate the following inference to logic notation: For all x, x_7 will go running if and only if x_7 will make tea. For all x, x_7 is a lawyer if and only if x_7 will go running. For all x, x_7 will not make tea. Therefore for all x, x_7 is not a lawyer.
forall x: P(x) <-> Q(x). forall x: R(x) <-> P(x). forall x: ~Q(x). Therefore forall x: ~R(x).