Translate the following inference to logic notation: There is at least one x for which x_2 will sleep or x_2 is a bartender. For all x, x_2 will not sleep. For all x, x_2 will play tennis or x_2 is not a bartender. Therefore there is at least one x for which x_2 will play tennis.
exists x: P(x) or Q(x). forall x: ~P(x). forall x: R(x) or ~Q(x). Therefore exists x: R(x).