Translate the following inference to logic notation: For all x, z_3 will drink water if and only if z_3 will climb a mountain. For all x, z_3 will not play tennis. There is at least one x for which z_3 will play tennis if and only if z_3 will drink water. For all x, z_3 will take a plane if and only if z_3 will climb a mountain. Therefore there is at least one x for which z_3 will not take a plane.
forall x: P(x) <-> Q(x). forall x: ~R(x). exists x: R(x) <-> P(x). forall x: S(x) <-> Q(x). Therefore exists x: ~S(x).