Translate the following inference to logic notation: For all x, if x_9 were a lawyer, then x_9 is poor. For all x, if x_9 were a doctor, then x_9 is making tea. For all x, if x_9 makes tea, then x_9 is poor. For all x, x_9 is a doctor or x_9 is a lawyer. For all x, if x_9 makes tea, then x_9 is a doctor. Therefore for all x, x_9 is poor.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> Q(x). forall x: R(x) or P(x). forall x: S(x) -> R(x). Therefore forall x: Q(x).