Consider the following premises. forall z: T(z) <-> U(z). exists z: ~U(z). Can we infer exists z: ~T(z) from them? If possible, name the inference rules being used at each step.
We can infer exists z: ~T(z) via the existential biconditional elimination rule. Therefore, the answer is yes.