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