Consider the following premises. p_3 <-> T(i_3). forall y_3: P(y_3) <-> T(y_3). ~p_3. Can we infer ~P(i_3) from them? If possible, name the inference rules being used at each step.
 From forall y_3: P(y_3) <-> T(y_3) we can infer P(i_3) <-> T(i_3) via universal instantiation. From p_3 <-> T(i_3), ~p_3 we can infer ~T(i_3) via biconditional elimination. Finally, from P(i_3) <-> T(i_3), ~T(i_3) we can infer ~P(i_3) via biconditional elimination. Therefore, the answer is yes.