Consider the following premises. t_1 -> p_11. p_11 -> t_1. t or ~t_1. Can we infer p_11 -> t from them? If possible, name the inference rules being used at each step.
 From p_11 -> t_1, t_1 -> p_11 we can infer p_11 <-> t_1 via biconditional introduction. From t or ~t_1 we can infer t_1 -> t via rewriting. From p_11 <-> t_1 we can infer p_11 -> t_1 via biconditional elimination. Finally, from p_11 -> t_1, t_1 -> t we can infer p_11 -> t via transitivity. Therefore, the answer is yes.