Translate the following inference to logic notation: For all x, if x_5 drives a car, then x_5 is sleeping. For all x, if x_5 sleeps, then x_5 is driving a car. For all x, x_5 will not sleep. Therefore for all x, x_5 will not drive a car.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: ~Q(x). Therefore forall x: ~P(x).