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