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