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