Translate the following inference to logic notation: For all x, if x_2 drives a car, then x_2 is playing squash. For all x, if x_2 plays squash, then x_2 is a politician. For all x, if x_2 were a politician, then x_2 is driving a car. There is at least one x for which x_2 will not drive a car. Therefore there is at least one x for which x_2 is not a politician.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). exists x: ~P(x). Therefore exists x: ~R(x).