Translate the following inference to logic notation: For all x, if x_7 were an office clerk, then x_7 is driving a car. For all x, x_7 will not drive a car. For all x, x_7 is an office clerk or x_7 is fast. There is at least one x for which x_7 is a janitor. Therefore there is at least one x for which x_7 is a janitor.
forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: P(x) or R(x). exists x: S(x). Therefore exists x: S(x).