Consider the following premises. forall x: ~T(x). forall x: R(x) <-> T(x). forall x: R(x) <-> S(x). exists x: S(x) <-> W(x). Can we infer forall x: W(x) from them?
 From forall x: R(x) <-> T(x), forall x: ~T(x) we can infer forall x: ~R(x). From forall x: R(x) <-> S(x), forall x: ~R(x) we can infer forall x: ~S(x). Finally, from exists x: S(x) <-> W(x), forall x: ~S(x) we can infer exists x: ~W(x), which contradicts forall x: W(x). Therefore, the answer is no.