Translate the following inference to logic notation: For all x, if z plays squash, then z is a lawyer. There is at least one x for which if z were a lawyer, then z is writing a letter. For all x, z will not play squash. For all x, if z writes a letter, then z is playing squash. Therefore there is at least one x for which z will not write a letter.
forall x: P(x) -> Q(x). exists x: Q(x) -> R(x). forall x: ~P(x). forall x: R(x) -> P(x). Therefore exists x: ~R(x).