Consider the following premises. forall x_9: Q_9(x_9) -> T(x_9). forall x_9: P_6(x_9) or P_9(x_9). forall x_9: ~P_6(x_9). forall x_9: P_9(x_9) -> Q_9(x_9). forall x_9: T(x_9) -> Q(x_9). Can we infer forall x_9: Q(x_9) from them? If possible, name the inference rules being used at each step.
 From forall x_9: P_9(x_9) -> Q_9(x_9), forall x_9: Q_9(x_9) -> T(x_9) we can infer forall x_9: P_9(x_9) -> T(x_9) via universal transitivity. From forall x_9: P_6(x_9) or P_9(x_9), forall x_9: ~P_6(x_9) we can infer forall x_9: P_9(x_9) via universal disjunctive syllogism. From forall x_9: P_9(x_9) -> T(x_9), forall x_9: P_9(x_9) we can infer forall x_9: T(x_9) via universal modus ponens. Finally, from forall x_9: T(x_9) -> Q(x_9), forall x_9: T(x_9) we can infer forall x_9: Q(x_9) via universal modus ponens. Therefore, the answer is yes.