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