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