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