Translate the following inference to logic notation: For all x, x_1 will read a book. For all x, if x_1 reads a book, then x_1 is sleeping. Therefore there is at least one x for which x_1 will sleep.
forall x: P(x). forall x: P(x) -> Q(x). Therefore exists x: Q(x).