Translate the following inference to logic notation: For all x, if x_5 drives a car, then x_5 is a carpenter. For all x, x_5 will climb a mountain. There is at least one x for which x_5 will drive a car. Therefore there is at least one x for which x_5 will climb a mountain.
forall x: P(x) -> Q(x). forall x: R(x). exists x: P(x). Therefore exists x: R(x).