Consider the following premises. forall y: S(y) -> T(y). forall y: T(y) <-> S(y). exists y: S(y) -> T(y). Can we infer forall y: ~(T(y) -> S(y)) from them? If possible, name the inference rules being used at each step.
That contradicts the premises. Therefore the answer is no.