Translate the following inference to logic notation: For all x, y is fast if and only if y will play a game. For all x, y will play a game or y is not fast. Therefore for all x, if y were fast, then y is playing a game.
forall x: P(x) <-> Q(x). forall x: Q(x) or ~P(x). Therefore forall x: P(x) -> Q(x).