Consider the following premises. forall x_17: ~P_17(x_17). p_2 -> Q_17(h). forall x_17: P_17(x_17) <-> Q_17(x_17). Can we infer p_2 from them? If possible, name the inference rules being used at each step.
 From forall x_17: P_17(x_17) <-> Q_17(x_17), forall x_17: ~P_17(x_17) we can infer forall x_17: ~Q_17(x_17) via universal biconditional elimination. From forall x_17: ~Q_17(x_17) we can infer ~Q_17(h) via universal instantiation. Finally, from p_2 -> Q_17(h), ~Q_17(h) we can infer ~p_2 via modus tollens, which contradicts p_2. Therefore, the answer is no.