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