Translate the following inference to logic notation: For all x, if x_4 were a carpenter, then x_4 is driving a car. There is at least one x for which x_4 is poor or x_4 is a carpenter. For all x, x_4 is not poor. Therefore there is at least one x for which x_4 will drive a car.
forall x: P(x) -> Q(x). exists x: R(x) or P(x). forall x: ~R(x). Therefore exists x: Q(x).