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