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