Translate the following inference to logic notation: For all x, if y drives a car, then y is a lawyer. There is at least one x for which if y drives a car, then y is a lawyer. For all x, if y were a lawyer, then y is driving a car. Therefore there is at least one x for which if y drives a car, then y is a lawyer.
forall x: P(x) -> Q(x). exists x: P(x) -> Q(x). forall x: Q(x) -> P(x). Therefore exists x: P(x) -> Q(x).