Consider the following premises. forall x: Q(x) -> W(x). forall x: R(x) or ~W(x). forall x: R(x) -> Q(x). Can we infer forall x: W(x) -> R(x) from them? If possible, name the inference rules being used at each step.
 From forall x: R(x) -> Q(x), forall x: Q(x) -> W(x) we can infer forall x: R(x) -> W(x) via universal transitivity. Finally, from forall x: R(x) or ~W(x) we can infer forall x: W(x) -> R(x) via universal rewriting. Therefore, the answer is yes.