Translate the following inference to logic notation: For all x, if z plays tennis, then z is driving a car. Robert is playing tennis. For all x, z will play tennis or z will not drive a car. Therefore there is at least one x for which z will drive a car.
forall x: P(x) -> Q(x). P(a). forall x: P(x) or ~Q(x). Therefore exists x: Q(x).