Consider the following premises. forall x_8: Q_8(x_8) -> U_2(x_8). U_2(f) -> T_4(f). forall x_8: T_4(x_8) -> Q_8(x_8). Can we infer T_4(f) -> U_2(f) from them? If possible, name the inference rules being used at each step.
 From forall x_8: T_4(x_8) -> Q_8(x_8), forall x_8: Q_8(x_8) -> U_2(x_8) we can infer forall x_8: T_4(x_8) -> U_2(x_8) via universal transitivity. Finally, from forall x_8: T_4(x_8) -> U_2(x_8) we can infer T_4(f) -> U_2(f) via universal instantiation. Therefore, the answer is yes.