Translate the following inference to logic notation: For all x, if x_2 reads a book, then x_2 is writing a letter. For all x, if x_2 plays squash, then x_2 is reading a book. For all x, if x_2 writes a letter, then x_2 is playing squash. There is at least one x for which x_2 will not play squash. Therefore there is at least one x for which x_2 will not read a book.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: Q(x) -> R(x). exists x: ~R(x). Therefore exists x: ~P(x).