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