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