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