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