Consider the following premises. forall y: W(y) <-> T(y). exists y: T(y) -> P(y). Can we infer exists y: W(y) -> P(y) from them?
 From forall y: W(y) <-> T(y) we can infer forall y: W(y) -> T(y). Finally, from forall y: W(y) -> T(y), exists y: T(y) -> P(y) we can infer exists y: W(y) -> P(y). Therefore, the answer is yes.