Translate the following inference to logic notation: For all x, if x_6 drives a car, then x_6 is playing tennis. For all x, x_6 will drive a car or x_6 will not play a game. For all x, x_6 will play a game. Therefore for all x, x_6 will play tennis.
forall x: P(x) -> Q(x). forall x: P(x) or ~R(x). forall x: R(x). Therefore forall x: Q(x).