Consider the following premises. forall x_14: ~R_14(x_14). p <-> R_14(a_14). ~p -> t. Can we infer t from them? If possible, name the inference rules being used at each step.
 From forall x_14: ~R_14(x_14) we can infer ~R_14(a_14) via universal instantiation. From p <-> R_14(a_14), ~R_14(a_14) we can infer ~p via biconditional elimination. Finally, from ~p -> t, ~p we can infer t via modus ponens. Therefore, the answer is yes.