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