Translate the following inference to logic notation: For all x, if x plays tennis, then x is playing squash. For all x, x will play tennis or x is not a server. For all x, if x plays squash, then x is a server. Therefore for all x, if x were a server, then x is playing tennis.
forall x: P(x) -> Q(x). forall x: P(x) or ~R(x). forall x: Q(x) -> R(x). Therefore forall x: R(x) -> P(x).