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