Translate the following inference to logic notation: For all x, if x_5 makes tea, then x_5 is writing a letter. There is at least one x for which if x_5 plays a game, then x_5 is making tea. For all x, x_5 will read a book if and only if x_5 will play a game. Therefore there is at least one x for which if x_5 reads a book, then x_5 is writing a letter.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: S(x) <-> R(x). Therefore exists x: S(x) -> Q(x).