Translate the following inference to logic notation: For all x, if x_6 drives a car, then x_6 is a sailor. For all x, if x_6 were a sailor, then x_6 is playing tennis. For all x, x_6 is a soldier or x_6 will drive a car. For all x, if x_6 were a soldier, then x_6 is a nurse. There is at least one x for which if x_6 were a nurse, then x_6 is playing tennis. Therefore there is at least one x for which x_6 will play tennis.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) or P(x). forall x: S(x) -> T(x). exists x: T(x) -> R(x). Therefore exists x: R(x).