Translate the following inference to logic notation: For all x, x_4 will work if and only if x_4 is bored. For all x, x_4 is not bored. For all x, if x_4 were a writer, then x_4 is working. Therefore for all x, x_4 is not a writer.
forall x: P(x) <-> Q(x). forall x: ~Q(x). forall x: R(x) -> P(x). Therefore forall x: ~R(x).