Translate the following inference to logic notation: For all x, if x_5 climbs a mountain, then x_5 is fast. For all x, x_5 is fast or x_5 will drink water. There is at least one x for which if x_5 drinks water, then x_5 is climbing a mountain. For all x, if x_5 were fast, then x_5 is climbing a mountain. Therefore there is at least one x for which x_5 will climb a mountain.
forall x: P(x) -> Q(x). forall x: Q(x) or R(x). exists x: R(x) -> P(x). forall x: Q(x) -> P(x). Therefore exists x: P(x).