Translate the following inference to logic notation: There is at least one x for which if y plays tennis, then y is curious. For all x, y is not curious. For all x, y will play tennis if and only if y is curious. Therefore there is at least one x for which y will not play tennis.
exists x: P(x) -> Q(x). forall x: ~Q(x). forall x: P(x) <-> Q(x). Therefore exists x: ~P(x).