Translate the following inference to logic notation: For all x, if x_9 drives a car, then x_9 is an office clerk. There is at least one x for which if x_9 plays tennis, then x_9 is driving a car. For all x, x_9 will play tennis if and only if x_9 is an office clerk. Therefore there is at least one x for which x_9 will play tennis if and only if x_9 is an office clerk.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: R(x) <-> Q(x). Therefore exists x: R(x) <-> Q(x).