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