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