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