Consider the following premises. forall y_1: U(y_1) -> U_2(y_1). t <-> R_28(e_2). u -> U_2(h). forall x_28: ~R_28(x_28). U(h) or u. Can we infer U_2(h) and ~t from them? If possible, name the inference rules being used at each step.
 From forall x_28: ~R_28(x_28) we can infer ~R_28(e_2) via universal instantiation. From forall y_1: U(y_1) -> U_2(y_1) we can infer U(h) -> U_2(h) via universal instantiation. From U(h) -> U_2(h), u -> U_2(h), U(h) or u we can infer U_2(h) via disjunction elimination. From t <-> R_28(e_2), ~R_28(e_2) we can infer ~t via biconditional elimination. Finally, from U_2(h), ~t we can infer U_2(h) and ~t via conjunction. Therefore, the answer is yes.