Translate the following inference to logic notation: For all x, x_10 is rich if and only if x_10 will drive a car. For all x, if x_10 drives a car, then x_10 is playing tennis. For all x, if x_10 plays tennis, then x_10 is driving a car. For all x, if x_10 were a nurse, then x_10 is rich. For all x, x_10 will not play tennis. For all x, if x_10 were rich, then x_10 is a nurse. Therefore for all x, x_10 is not a nurse.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). forall x: S(x) -> P(x). forall x: ~R(x). forall x: P(x) -> S(x). Therefore forall x: ~S(x).