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