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