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