Translate the following inference to logic notation: For all x, y will work if and only if y will play a game. For all x, if y works, then y is playing a game. Therefore if Susan works, then Susan is playing a game.
forall x: P(x) <-> Q(x). forall x: P(x) -> Q(x). Therefore P(a) -> Q(a).