Translate the following inference to logic notation: There is at least one x for which if x_4 were excited, then x_4 is a server. For all x, x_4 will play tennis. For all x, x_4 is excited. Therefore there is at least one x for which x_4 will play tennis.
exists x: P(x) -> Q(x). forall x: R(x). forall x: P(x). Therefore exists x: R(x).