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