Translate the following inference to logic notation: There is at least one x for which if x were a poet, then x is working. For all x, x is a poet if and only if x will work. Therefore there is at least one x for which if x were a poet, then x is working.
exists x: P(x) -> Q(x). forall x: P(x) <-> Q(x). Therefore exists x: P(x) -> Q(x).