Translate the following inference to logic notation: For all x, x_7 will cook or x_7 is not happy. For all x, if x_7 cooks, then x_7 is happy. For all x, 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 is happy. Therefore there is at least one x for which x_7 will not read a book.
forall x: P(x) or ~Q(x). forall x: P(x) -> Q(x). forall x: ~P(x). exists x: R(x) <-> Q(x). Therefore exists x: ~R(x).