Translate the following inference to logic notation: For all x, x_6 will make tea. For all x, x_6 will read a book or x_6 will not make tea. For all x, if x_6 reads a book, then x_6 is working. Therefore for all x, x_6 will work.
forall x: P(x). forall x: Q(x) or ~P(x). forall x: Q(x) -> R(x). Therefore forall x: R(x).