Translate the following inference to logic notation: For all x, if x_17 climbs a mountain, then x_17 is taking a plane. For all x, x_17 will climb a mountain. For all x, x_17 is a politician if and only if x_17 will play squash. There is at least one x for which x_17 will drive a car or x_17 will play squash. For all x, if x_17 drives a car, then x_17 is a politician. Therefore there is at least one x for which x_17 will take a plane and x_17 is a politician.
forall x: P(x) -> Q(x). forall x: P(x). forall x: R(x) <-> S(x). exists x: T(x) or S(x). forall x: T(x) -> R(x). Therefore exists x: Q(x) and R(x).