Translate the following inference to logic notation: For all x, if x_6 plays tennis, then x_6 is sleeping. For all x, x_6 will not sleep. There is at least one x for which x_6 will play tennis. Therefore there is at least one x for which x_6 is a lawyer.
forall x: P(x) -> Q(x). forall x: ~Q(x). exists x: P(x). Therefore exists x: R(x).