Translate the following inference to logic notation: There is at least one x for which if x_7 climbs a mountain, then x_7 is a nurse. For all x, if x_7 works, then x_7 is climbing a mountain. For all x, x_7 is curious or x_7 is not a nurse. Therefore there is at least one x for which if x_7 works, then x_7 is curious.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: S(x) or ~Q(x). Therefore exists x: R(x) -> S(x).