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