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