Consider the following premises. forall z: T(z) or ~U(z). forall z: R(z) <-> U(z). Can we infer forall z: R(z) -> T(z) from them? If possible, name the inference rules being used at each step.
 From forall z: T(z) or ~U(z) we can infer forall z: U(z) -> T(z) via universal rewriting. From forall z: R(z) <-> U(z) we can infer forall z: R(z) -> U(z) via universal biconditional elimination. Finally, from forall z: R(z) -> U(z), forall z: U(z) -> T(z) we can infer forall z: R(z) -> T(z) via universal transitivity. Therefore, the answer is yes.