Translate the following inference to logic notation: For all x, y will not drive a car. For all x, y will drive a car or y will not play squash. For all x, if y drives a car, then y is playing squash. Therefore for all x, y will not play squash.
forall x: ~P(x). forall x: P(x) or ~Q(x). forall x: P(x) -> Q(x). Therefore forall x: ~Q(x).