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