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