Consider the following premises. forall y: Q_2(y) or ~T(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.
 From forall y: Q_2(y) <-> T(y) we can infer forall y: Q_2(y) -> T(y) via universal biconditional elimination. Finally, from forall y: Q_2(y) or ~T(y) we can infer forall y: T(y) -> Q_2(y) via universal rewriting. Therefore, the answer is yes.