Translate the following inference to logic notation: For all x, x_9 is a server if and only if x_9 will climb a mountain. For all x, x_9 is not a lawyer. For all x, if x_9 were a lawyer, then x_9 is climbing a mountain. For all x, if x_9 climbs a mountain, then x_9 is a lawyer. Therefore for all x, x_9 is not a server.
forall x: P(x) <-> Q(x). forall x: ~R(x). forall x: R(x) -> Q(x). forall x: Q(x) -> R(x). Therefore forall x: ~P(x).