Consider the following premises. forall y: W(y) -> S(y). S(a_10) <-> p. Can we infer W(a_10) -> p from them? If possible, name the inference rules being used at each step.
 From forall y: W(y) -> S(y) we can infer W(a_10) -> S(a_10) via universal instantiation. From S(a_10) <-> p we can infer S(a_10) -> p via biconditional elimination. Finally, from W(a_10) -> S(a_10), S(a_10) -> p we can infer W(a_10) -> p via transitivity. Therefore, the answer is yes.