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