Translate the following inference to logic notation: For all x, if x_10 were a nurse, then x_10 is a server. There is at least one x for which if x_10 plays tennis, then x_10 is making tea. For all x, x_10 is a nurse or x_10 is not a mechanic. For all x, x_10 will play tennis or x_10 is a mechanic. For all x, if x_10 were a server, then x_10 is making tea. Therefore there is at least one x for which x_10 will make tea.
forall x: P(x) -> Q(x). exists x: R(x) -> S(x). forall x: P(x) or ~T(x). forall x: R(x) or T(x). forall x: Q(x) -> S(x). Therefore exists x: S(x).