Translate the following inference to logic notation: For all x, x_7 will not read a book. For all x, if x_7 were fast, then x_7 is reading a book. There is at least one x for which if x_7 reads a book, then x_7 is fast. Therefore there is at least one x for which x_7 is not fast.
forall x: ~P(x). forall x: Q(x) -> P(x). exists x: P(x) -> Q(x). Therefore exists x: ~Q(x).