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