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