Translate the following inference to logic notation: For all x, x_10 is a cashier. There is at least one x for which x_10 is a bartender. For all x, if x_10 were a bartender, then x_10 is a taxi driver. For all x, if x_10 were a taxi driver, then x_10 is working. Therefore there is at least one x for which x_10 is a cashier and x_10 will work.
forall x: P(x). exists x: Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> S(x). Therefore exists x: P(x) and S(x).