Consider the following premises. t <-> w. w <-> T(a_10). forall z_4: ~T(z_4). Can we infer t from them? If possible, name the inference rules being used at each step.
 From forall z_4: ~T(z_4) we can infer ~T(a_10) via universal instantiation. From w <-> T(a_10), ~T(a_10) we can infer ~w via biconditional elimination. Finally, from t <-> w, ~w we can infer ~t via biconditional elimination, which contradicts t. Therefore, the answer is no.