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