Translate the following inference to logic notation: For all x, if y were excited, then y is playing tennis. For all x, if y plays tennis, then y is a server. For all x, if y were a server, then y is excited. Therefore if John were a server, then John is excited.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore R(a) -> P(a).