Translate the following inference to logic notation: For all x, z is a lawyer or z will not play squash. For all x, z will play squash or z is not a lawyer. There is at least one x for which z is not a lawyer. Therefore there is at least one x for which z will not play squash.
forall x: P(x) or ~Q(x). forall x: Q(x) or ~P(x). exists x: ~P(x). Therefore exists x: ~Q(x).