Translate the following inference to logic notation: For all x, if x_10 works, then x_10 is a poet. For all x, if x_10 were an electrician, then x_10 is a poet. For all x, x_10 is an electrician or x_10 is not a poet. For all x, if x_10 were a poet, then x_10 is working. For all x, x_10 will not work. Therefore for all x, x_10 is not an electrician.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: R(x) or ~Q(x). forall x: Q(x) -> P(x). forall x: ~P(x). Therefore forall x: ~R(x).