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