Translate the following inference to logic notation: For all x, if y_4 were poor, then y_4 is playing a game. For all x, y_4 will go running if and only if y_4 is poor. For all x, if y_4 plays a game, then y_4 is running. For all x, y_4 will not play a game. Therefore for all x, y_4 is not poor.
forall x: P(x) -> Q(x). forall x: R(x) <-> P(x). forall x: Q(x) -> R(x). forall x: ~Q(x). Therefore forall x: ~P(x).