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