Consider the following premises. ~p_8 -> q. forall x_2: ~U_4(x_2). p_8 <-> U_4(a_14). Can we infer q from them? If possible, name the inference rules being used at each step.
 From forall x_2: ~U_4(x_2) we can infer ~U_4(a_14) via universal instantiation. From p_8 <-> U_4(a_14), ~U_4(a_14) we can infer ~p_8 via biconditional elimination. Finally, from ~p_8 -> q, ~p_8 we can infer q via modus ponens. Therefore, the answer is yes.