Translate the following inference to logic notation: John is not playing a game. If John plays a game, then John is playing tennis. For all x, if x_3 plays tennis, then x_3 is playing a game. Therefore John is not playing tennis.
~P(a). P(a) -> Q(a). forall x: Q(x) -> P(x). Therefore ~Q(a).