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