Translate the following inference to logic notation: For all x, if y makes tea, then y is poor. For all x, y will cook or y will make tea. There is at least one x for which y is a lawyer. For all x, if y cooks, then y is poor. Therefore there is at least one x for which y is poor and y is a lawyer.
forall x: P(x) -> Q(x). forall x: R(x) or P(x). exists x: S(x). forall x: R(x) -> Q(x). Therefore exists x: Q(x) and S(x).