Translate the following inference to logic notation: For all x, if z were poor, then z is a server. For all x, z is a server if and only if z is poor. Therefore if Susan were a server, then Susan is poor.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). Therefore Q(a) -> P(a).