Translate the following inference to logic notation: For all x, x will write a letter. There is at least one x for which x will drive a car. For all x, x is a carpenter. Therefore some carpenters will drive a car.
forall x: P(x). exists x: Q(x). forall x: R(x). Therefore exists x: R(x) and Q(x).