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