Translate the following inference to logic notation: For all x, x_4 will not drive a car. For all x, if x_4 drives a car, then x_4 is a cashier. For all x, x_4 is a cashier if and only if x_4 will drive a car. Therefore for all x, x_4 is not a cashier.
forall x: ~P(x). forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). Therefore forall x: ~Q(x).