Translate the following inference to logic notation: For all x, if x_5 works, then x_5 is curious. For all x, if x_5 were a doctor, then x_5 is curious. For all x, if x_5 plays tennis, then x_5 is working. For all x, x_5 will play tennis or x_5 is a doctor. For all x, if x_5 were curious, then x_5 is a writer. Therefore for all x, x_5 is a writer.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) -> P(x). forall x: S(x) or R(x). forall x: Q(x) -> T(x). Therefore forall x: T(x).