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