Translate the following inference to logic notation: For all x, y_1 is a lawyer or y_1 will not play a game. There is at least one x for which if y_1 were a lawyer, then y_1 is playing a game. For all x, y_1 is not a lawyer. Therefore there is at least one x for which y_1 will not play a game.
forall x: P(x) or ~Q(x). exists x: P(x) -> Q(x). forall x: ~P(x). Therefore exists x: ~Q(x).