Translate the following inference to logic notation: For all x, if x_3 plays a game, then x_3 is playing squash. For all x, if x_3 plays squash, then x_3 is a server. There is at least one x for which if x_3 were a server, then x_3 is playing a game. Therefore there is at least one x for which if x_3 plays a game, then x_3 is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: R(x) -> P(x). Therefore exists x: P(x) -> R(x).