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