Translate the following inference to logic notation: Michael is sleeping. For all x, if x_8 drives a car, then x_8 is sleeping. For all x, if x_8 sleeps, then x_8 is driving a car. Therefore Michael is driving a car.
P(a). forall x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore Q(a).