Consider the following premises. w_3 <-> t_4. q_10 -> t_4. t_4 <-> q_10. ~q_10. Can we infer w_3 from them? If possible, name the inference rules being used at each step.
 From t_4 <-> q_10 we can infer t_4 -> q_10 via biconditional elimination. From t_4 -> q_10, q_10 -> t_4 we can infer t_4 <-> q_10 via biconditional introduction. From t_4 <-> q_10, ~q_10 we can infer ~t_4 via biconditional elimination. Finally, from w_3 <-> t_4, ~t_4 we can infer ~w_3 via biconditional elimination, which contradicts w_3. Therefore, the answer is no.