Translate the following inference to logic notation: For all x, x is not rich. For all x, x will read a book if and only if x will drink water. There is at least one x for which if x reads a book, then x is rich. Therefore there is at least one x for which x will not drink water.
forall x: ~P(x). forall x: Q(x) <-> R(x). exists x: Q(x) -> P(x). Therefore exists x: ~R(x).