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