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