Translate the following inference to logic notation: For all x, y_1 will drive a car or y_1 will not sleep. For all x, y_1 will sleep if and only if y_1 will drive a car. There is at least one x for which y_1 will not drive a car. Therefore there is at least one x for which y_1 will not sleep.
forall x: P(x) or ~Q(x). forall x: Q(x) <-> P(x). exists x: ~P(x). Therefore exists x: ~Q(x).