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