Translate the following inference to logic notation: For all x, if y were a taxi driver, then y is happy. For all x, if y were a taxi driver, then y is a soldier. There is at least one x for which y is a taxi driver or y is not happy. Therefore there is at least one x for which if y were happy, then y is a soldier.
forall x: P(x) -> Q(x). forall x: P(x) -> R(x). exists x: P(x) or ~Q(x). Therefore exists x: Q(x) -> R(x).