Consider the following premises. forall x_14: ~R_14(x_14). p_2. R_14(a_14) <-> s. Can we infer ~s and p_2 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 R_14(a_14) <-> s, ~R_14(a_14) we can infer ~s via biconditional elimination. Finally, from ~s, p_2 we can infer ~s and p_2 via conjunction. Therefore, the answer is yes.