Translate the following inference to logic notation: There is at least one x for which if x_1 plays tennis, then x_1 is making tea. For all x, x_1 will not make tea. For all x, if x_1 makes tea, then x_1 is playing tennis. Therefore there is at least one x for which x_1 will not play tennis.
exists x: P(x) -> Q(x). forall x: ~Q(x). forall x: Q(x) -> P(x). Therefore exists x: ~P(x).