Translate the following inference to logic notation: For all x, x_10 will play a game if and only if x_10 is an office clerk. For all x, if x_10 were an office clerk, then x_10 is sleeping. For all x, x_10 will not sleep. For all x, if x_10 plays a game, then x_10 is an office clerk. Therefore for all x, x_10 will not play a game.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: ~R(x). forall x: P(x) -> Q(x). Therefore forall x: ~P(x).