Translate the following inference to logic notation: For all x, x_7 will take a plane or x_7 will play tennis. For all x, x_7 will not take a plane or x_7 is a doctor. For all x, if x_7 were a mechanic, then x_7 is an office clerk. There is at least one x for which if x_7 were a doctor, then x_7 is a mechanic. For all x, if x_7 plays tennis, then x_7 is an office clerk. Therefore there is at least one x for which x_7 is an office clerk.
forall x: P(x) or Q(x). forall x: ~P(x) or R(x). forall x: S(x) -> T(x). exists x: R(x) -> S(x). forall x: Q(x) -> T(x). Therefore exists x: T(x).