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