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