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