Consider the following premises. p_3 <-> q. u_1 -> r_11. ~s. s <-> r_11. p_3 -> u_1. Can we infer ~q from them? If possible, name the inference rules being used at each step.
 From p_3 -> u_1, u_1 -> r_11 we can infer p_3 -> r_11 via transitivity. From s <-> r_11, ~s we can infer ~r_11 via biconditional elimination. From p_3 -> r_11, ~r_11 we can infer ~p_3 via modus tollens. Finally, from p_3 <-> q, ~p_3 we can infer ~q via biconditional elimination. Therefore, the answer is yes.