Translate the following inference to logic notation: For all x, x_8 is a lawyer if and only if x_8 will drive a car. For all x, x_8 is not a lawyer. There is at least one x for which if x_8 makes tea, then x_8 is playing squash. For all x, if x_8 plays squash, then x_8 is driving a car. Therefore there is at least one x for which x_8 will not make tea.
forall x: P(x) <-> Q(x). forall x: ~P(x). exists x: R(x) -> S(x). forall x: S(x) -> Q(x). Therefore exists x: ~R(x).