Translate the following inference to logic notation: For all x, if x were rich, then x is drinking water. For all x, x will not drink water. For all x, if x writes a letter, then x is rich. There is at least one x for which if x were rich, then x is writing a letter. Therefore there is at least one x for which x will not write a letter.
forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: R(x) -> P(x). exists x: P(x) -> R(x). Therefore exists x: ~R(x).