Consider the following premises. forall y: P(y) or ~U(y). forall y: U(y) <-> P(y). Can we infer forall y: U(y) -> P(y) from them? If possible, name the inference rules being used at each step.
We can infer forall y: U(y) -> P(y) via the universal rewriting rule. Therefore, the answer is yes.