Translate the following inference to logic notation: For all x, x_2 will take a plane or x_2 is a sailor. For all x, if x_2 climbs a mountain, then x_2 is a janitor. There is at least one x for which if x_2 were a sailor, then x_2 is climbing a mountain. For all x, if x_2 takes a plane, then x_2 is a janitor. Therefore there is at least one x for which x_2 is a janitor.
forall x: P(x) or Q(x). forall x: R(x) -> S(x). exists x: Q(x) -> R(x). forall x: P(x) -> S(x). Therefore exists x: S(x).