Translate the following inference to logic notation: For all x, x_10 will not drive a car. For all x, if x_10 sleeps, then x_10 is driving a car. Linda is sleeping if and only if it is cloudy. For all x, if x_10 drives a car, then x_10 is sleeping. Therefore it is not cloudy.
forall x: ~P(x). forall x: Q(x) -> P(x). Q(a) <-> p. forall x: P(x) -> Q(x). Therefore ~p.