Consider the following premises. R(a_10). P(a_10) -> r_1. forall y: R(y) -> P(y). Can we infer r_1 from them? If possible, name the inference rules being used at each step.
 From forall y: R(y) -> P(y) we can infer R(a_10) -> P(a_10) via universal instantiation. From R(a_10) -> P(a_10), P(a_10) -> r_1 we can infer R(a_10) -> r_1 via transitivity. Finally, from R(a_10) -> r_1, R(a_10) we can infer r_1 via modus ponens. Therefore, the answer is yes.