Translate the following inference to logic notation: For all x, y_3 will climb a mountain if and only if y_3 is poor. For all x, if y_3 climbs a mountain, then y_3 is poor. For all x, y_3 is not poor. Therefore for all x, y_3 will not climb a mountain.
forall x: P(x) <-> Q(x). forall x: P(x) -> Q(x). forall x: ~Q(x). Therefore forall x: ~P(x).