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