Consider the following premises. forall y: T(y) -> Q_2(y). forall y: P(y) <-> Q_2(y). forall y: ~P(y). forall y: Q_2(y) -> T(y). Can we infer forall y: T(y) -> Q_2(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.