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