Translate the following inference to logic notation: For all x, if y were a police officer, then y is playing tennis. There is at least one x for which if y plays tennis, then y is an electrician. For all x, if y were an electrician, then y is taking a plane. For all x, if y were rich, then y is a police officer. Therefore there is at least one x for which if y were rich, then y is taking a plane.
forall x: P(x) -> Q(x). exists x: Q(x) -> R(x). forall x: R(x) -> S(x). forall x: T(x) -> P(x). Therefore exists x: T(x) -> S(x).