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