Consider the following premises. forall x_10: R_10(x_10) -> S_10(x_10). q_4 -> R_10(a_10). s -> q_4. Can we infer s -> S_10(a_10) from them? If possible, name the inference rules being used at each step.
 From forall x_10: R_10(x_10) -> S_10(x_10) we can infer R_10(a_10) -> S_10(a_10) via universal instantiation. From q_4 -> R_10(a_10), R_10(a_10) -> S_10(a_10) we can infer q_4 -> S_10(a_10) via transitivity. Finally, from s -> q_4, q_4 -> S_10(a_10) we can infer s -> S_10(a_10) via transitivity. Therefore, the answer is yes.