Translate the following inference to logic notation: For all x, if x_7 plays tennis, then z is a mechanic. For all x, if x_7 were poor, then z is a mechanic. For all x, x_7 will not drive a car or x_7 will play tennis. For all x, x_7 will drive a car or x_7 is poor. Therefore there is at least one x for which z is a mechanic.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: ~S(x) or P(x). forall x: S(x) or R(x). Therefore exists x: Q(x).