Translate the following inference to logic notation: There is at least one x for which if x_6 were a mechanic, then x_6 is poor. For all x, if x_6 were a police officer, then x_6 is a mechanic. For all x, if x_6 were rich, then x_6 is sad. For all x, if x_6 were poor, then x_6 is rich. Therefore there is at least one x for which if x_6 were a police officer, then x_6 is sad.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: S(x) -> T(x). forall x: Q(x) -> S(x). Therefore exists x: R(x) -> T(x).