Translate the following inference to logic notation: For all x, if x_10 were rich, then x_10 is taking a plane. There is at least one x for which if x_10 writes a letter, then x_10 is taking a plane. For all x, x_10 will write a letter or x_10 will go running. For all x, x_10 will work or x_10 will not go running. For all x, if x_10 works, then x_10 is rich. Therefore there is at least one x for which x_10 will take a plane.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: R(x) or S(x). forall x: T(x) or ~S(x). forall x: T(x) -> P(x). Therefore exists x: Q(x).