Translate the following inference to logic notation: For all x, if x_6 were a sailor, then x_6 is a poet. For all x, x_6 is a sailor or x_6 is not fast. There is at least one x for which if x_6 were a lawyer, then x_6 is fast. Therefore there is at least one x for which if x_6 were a lawyer, then x_6 is a poet.
forall x: P(x) -> Q(x). forall x: P(x) or ~R(x). exists x: S(x) -> R(x). Therefore exists x: S(x) -> Q(x).