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