Consider the following premises. forall x_10: P_10(x_10). forall x_10: P_10(x_10) -> Q_10(x_10). Q_10(a_9) -> p. Can we infer p from them? If possible, name the inference rules being used at each step.
 From forall x_10: P_10(x_10) -> Q_10(x_10), forall x_10: P_10(x_10) we can infer forall x_10: Q_10(x_10) via universal modus ponens. From forall x_10: Q_10(x_10) we can infer Q_10(a_9) via universal instantiation. Finally, from Q_10(a_9) -> p, Q_10(a_9) we can infer p via modus ponens. Therefore, the answer is yes.