Translate the following inference to logic notation: For all x, if x_4 were an electrician, then x_4 is bored. For all x, if x_4 were bored, then x_4 is a writer. There is at least one x for which if x_4 were a writer, then x_4 is an electrician. Therefore there is at least one x for which if x_4 were an electrician, then x_4 is bored.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: R(x) -> P(x). Therefore exists x: P(x) -> Q(x).