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