Translate the following inference to logic notation: For all x, if x_5 plays a game, then x_5 is poor. For all x, x_5 will climb a mountain or x_5 is poor. For all x, if x_5 climbs a mountain, then x_5 is playing a game. For all x, if x_5 were poor, then x_5 is playing a game. Therefore for all x, x_5 will play a game.
forall x: P(x) -> Q(x). forall x: R(x) or Q(x). forall x: R(x) -> P(x). forall x: Q(x) -> P(x). Therefore forall x: P(x).