Consider the following premises. forall x_3: W_4(x_3) <-> T_4(x_3). q -> T_4(f). q or W_4(f). Can we infer ~T_4(f) from them? If possible, name the inference rules being used at each step.
 From forall x_3: W_4(x_3) <-> T_4(x_3) we can infer W_4(f) <-> T_4(f) via universal instantiation. From W_4(f) <-> T_4(f) we can infer W_4(f) -> T_4(f) via biconditional elimination. Finally, from q -> T_4(f), W_4(f) -> T_4(f), q or W_4(f) we can infer T_4(f) via disjunction elimination, which contradicts ~T_4(f). Therefore, the answer is no.