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