Translate the following inference to logic notation: There is at least one x for which if y drinks water, then y is making tea. For all x, if y plays squash, then y is drinking water. For all x, y will play squash if and only if y will make tea. Therefore there is at least one x for which if y makes tea, then y is playing squash.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: R(x) <-> Q(x). Therefore exists x: Q(x) -> R(x).