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