Translate the following inference to logic notation: For all x, if x_10 were poor, then x_10 is a bartender. There is at least one x for which x_10 is poor if and only if x_10 will take a plane. For all x, if x_10 were a bartender, then x_10 is driving a car. Therefore there is at least one x for which if x_10 takes a plane, then x_10 is driving a car.
forall x: P(x) -> Q(x). exists x: P(x) <-> R(x). forall x: Q(x) -> S(x). Therefore exists x: R(x) -> S(x).