Translate the following inference to logic notation: For all x, if x_7 works, then x_7 is a writer. For all x, if x_7 drives a car, then x_7 is working. There is at least one x for which if x_7 were a writer, then x_7 is working. Therefore there is at least one x for which if x_7 drives a car, then x_7 is a writer.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). exists x: Q(x) -> P(x). Therefore exists x: R(x) -> Q(x).