Translate the following inference to logic notation: There is at least one x for which x_9 will play tennis. For all x, if x_9 makes tea, then x_9 is driving a car. For all x, x_9 will drive a car. For all x, if x_9 drives a car, then x_9 is making tea. Therefore there is at least one x for which x_9 will play tennis and x_9 will make tea.
exists x: P(x). forall x: Q(x) -> R(x). forall x: R(x). forall x: R(x) -> Q(x). Therefore exists x: P(x) and Q(x).