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