Consider the following premises. forall x_6: Q_6(x_6) -> T(x_6). U(h_1). forall x_6: U(x_6) -> Q_6(x_6). Can we infer T(h_1) from them? If possible, name the inference rules being used at each step.
 From forall x_6: U(x_6) -> Q_6(x_6), forall x_6: Q_6(x_6) -> T(x_6) we can infer forall x_6: U(x_6) -> T(x_6) via universal transitivity. From forall x_6: U(x_6) -> T(x_6) we can infer U(h_1) -> T(h_1) via universal instantiation. Finally, from U(h_1) -> T(h_1), U(h_1) we can infer T(h_1) via modus ponens. Therefore, the answer is yes.