Translate the following inference to logic notation: For all x, if y_1 drives a car, then y_1 is playing a game. For all x, y_1 will play a game. For all x, if y_1 plays a game, then y_1 is driving a car. Therefore John is driving a car.
forall x: P(x) -> Q(x). forall x: Q(x). forall x: Q(x) -> P(x). Therefore P(a).