Translate the following inference to logic notation: For all x, z will not play tennis. For all x, z will play tennis if and only if z is poor. Therefore for all x, z is not poor.
forall x: ~P(x). forall x: P(x) <-> Q(x). Therefore forall x: ~Q(x).