Translate the following inference to logic notation: For all x, if y makes tea, then y is poor. For all x, if y were poor, then y is making tea. There is at least one x for which if y writes a letter, then y is making tea. Therefore there is at least one x for which if y writes a letter, then y is poor.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). exists x: R(x) -> P(x). Therefore exists x: R(x) -> Q(x).