Translate the following inference to logic notation: For all x, if x_14 were a janitor, then x_14 is driving a car. For all x, x_14 is a janitor. For all x, if x_14 were a politician, then x_14 is driving a car. There is at least one x for which x_14 is a janitor if and only if x_14 will drive a car. Therefore there is at least one x for which x_14 will drive a car.
forall x: P(x) -> Q(x). forall x: P(x). forall x: R(x) -> Q(x). exists x: P(x) <-> Q(x). Therefore exists x: Q(x).