Translate the following inference to logic notation: For all x, y is a poet if and only if y is an office clerk. For all x, y will make tea or y is an office clerk. For all x, if y were a poet, then y is a police officer. There is at least one x for which if y makes tea, then y is a police officer. Therefore there is at least one x for which y is a police officer.
forall x: P(x) <-> Q(x). forall x: R(x) or Q(x). forall x: P(x) -> S(x). exists x: R(x) -> S(x). Therefore exists x: S(x).