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