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