Translate the following inference to logic notation: For all x, z will drive a car if and only if z will work. For all x, z will not drive a car. For all x, z will climb a mountain if and only if z will work. For all x, if z were a server, then z is climbing a mountain. For all x, if z were a writer, then z is a server. Therefore for all x, z is not a writer.
forall x: P(x) <-> Q(x). forall x: ~P(x). forall x: R(x) <-> Q(x). forall x: S(x) -> R(x). forall x: T(x) -> S(x). Therefore forall x: ~T(x).