Translate the following inference to logic notation: For all x, if x_8 were poor, then x_8 is playing tennis. For all x, if x_8 makes tea, then x_8 is playing tennis. For all x, if x_8 plays tennis, then x_8 is reading a book. There is at least one x for which x_8 will take a plane. For all x, x_8 is poor or x_8 will make tea. Therefore there is at least one x for which x_8 will take a plane and x_8 will read a book.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: Q(x) -> S(x). exists x: T(x). forall x: P(x) or R(x). Therefore exists x: T(x) and S(x).