Consider the following premises. q -> ~u_2. forall x_9: P_9(x_9). u_2. Can we infer P_9(a_9) and ~q from them? If possible, name the inference rules being used at each step.
 From q -> ~u_2, u_2 we can infer ~q via modus tollens. From forall x_9: P_9(x_9) we can infer P_9(a_9) via universal instantiation. Finally, from P_9(a_9), ~q we can infer P_9(a_9) and ~q via conjunction. Therefore, the answer is yes.