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