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