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