Translate the following inference to logic notation: There is at least one x for which if x_12 makes tea, then x_12 is a writer. For all x, x_12 will write a letter or x_12 will make tea. For all x, if x_12 were rich, then x_12 is playing tennis. For all x, x_12 is rich. For all x, if x_12 writes a letter, then x_12 is a writer. Therefore there is at least one x for which x_12 will play tennis and x_12 is a writer.
exists x: P(x) -> Q(x). forall x: R(x) or P(x). forall x: S(x) -> T(x). forall x: S(x). forall x: R(x) -> Q(x). Therefore exists x: T(x) and Q(x).