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