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