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