Consider the following premises. forall y: T(y) -> W(y). exists y: T(y) <-> W(y). Can we infer exists y: W(y) -> T(y) from them? If possible, name the inference rules being used at each step.
We can infer exists y: W(y) -> T(y) via the existential biconditional elimination rule. Therefore, the answer is yes.