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