Translate the following inference to logic notation: There is at least one x for which if x were fast, then x is a mechanic. For all x, if x were a doctor, then x is fast. For all x, if x plays squash, then x is a mechanic. For all x, if x were a mechanic, then x is working. For all x, x will play squash or x is a doctor. Therefore there is at least one x for which x will work.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: S(x) -> Q(x). forall x: Q(x) -> T(x). forall x: S(x) or R(x). Therefore exists x: T(x).