Translate the following inference to logic notation: For all x, if y_2 were bored, then y_2 is playing a game. For all x, y_2 will play a game or y_2 is not bored. For all x, if y_2 plays a game, then y_2 is bored. Therefore for all x, if y_2 plays a game, then y_2 is bored.
forall x: P(x) -> Q(x). forall x: Q(x) or ~P(x). forall x: Q(x) -> P(x). Therefore forall x: Q(x) -> P(x).