Consider the following premises. q_9. p <-> p_9. p_9 -> p. p_9 -> ~q_9. Can we infer ~p from them? If possible, name the inference rules being used at each step.
 From p_9 -> ~q_9, q_9 we can infer ~p_9 via modus tollens. From p <-> p_9 we can infer p -> p_9 via biconditional elimination. From p -> p_9, p_9 -> p we can infer p <-> p_9 via biconditional introduction. Finally, from p <-> p_9, ~p_9 we can infer ~p via biconditional elimination. Therefore, the answer is yes.