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