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