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