Translate the following inference to logic notation: For all x, x_12 will make tea if and only if x_12 will drink water. There is at least one x for which x_12 will play tennis. For all x, x_12 will make tea. For all x, if x_12 drinks water, then x_12 is making tea. Therefore there is at least one x for which x_12 will play tennis and x_12 will drink water.
forall x: P(x) <-> Q(x). exists x: R(x). forall x: P(x). forall x: Q(x) -> P(x). Therefore exists x: R(x) and Q(x).