Translate the following inference to logic notation: There is at least one x for which x_5 will drink water. For all x, if x_5 drinks water, then x_5 is not poor. For all x, x_5 is poor. Therefore there is at least one x for which x_5 is rich.
exists x: P(x). forall x: P(x) -> ~Q(x). forall x: Q(x). Therefore exists x: R(x).