Translate the following inference to logic notation: For all x, if x_8 were bored, then x_8 is working. For all x, if x_8 were bored, then x_8 is working. For all x, if x_8 works, then x_8 is bored. John is not working. Therefore John is not bored.
forall x: P(x) -> Q(x). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). ~Q(a). Therefore ~P(a).