Translate the following inference to logic notation: For all x, if x_9 drives a car, then x_9 is a bartender. For all x, x_9 is poor or x_9 is not a bartender. For all x, if x_9 works, then x_9 is driving a car. For all x, if x_9 were poor, then x_9 is sad. Therefore for all x, if x_9 works, then x_9 is sad.
forall x: P(x) -> Q(x). forall x: R(x) or ~Q(x). forall x: S(x) -> P(x). forall x: R(x) -> T(x). Therefore forall x: S(x) -> T(x).