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