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