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