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