Translate the following inference to logic notation: For all x, x_9 will drive a car. For all x, if x_9 were a lawyer, then x_9 is writing a letter. For all x, x_9 will write a letter if and only if x_9 will work. For all x, if x_9 drives a car, then x_9 is a lawyer. Therefore for all x, x_9 will work.
forall x: P(x). forall x: Q(x) -> R(x). forall x: R(x) <-> S(x). forall x: P(x) -> Q(x). Therefore forall x: S(x).