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