Translate the following inference to logic notation: For all x, y will climb a mountain if and only if y will play tennis. For all x, y will not play tennis. For all x, if y plays tennis, then y is climbing a mountain. Therefore for all x, y will not climb a mountain.
forall x: P(x) <-> Q(x). forall x: ~Q(x). forall x: Q(x) -> P(x). Therefore forall x: ~P(x).