Translate the following inference to logic notation: For all x, x_7 is a server or x_7 will not cook. There is at least one x for which x_7 will read a book if and only if x_7 will cook. Therefore there is at least one x for which if x_7 reads a book, then x_7 is a server.
forall x: P(x) or ~Q(x). exists x: R(x) <-> Q(x). Therefore exists x: R(x) -> P(x).