Consider the following premises. forall y: W(y) -> U(y). forall y: W(y) <-> U(y). forall y: U(y) -> W(y). Can we infer forall y: W(y) <-> U(y) from them? If possible, name the inference rules being used at each step.
That is one of the premises. Therefore, the answer is yes.