Consider the following premises. forall x: Q_4(x) <-> T(x). forall x: T(x) or ~S(x). Can we infer forall x: S(x) -> Q_4(x) from them? If possible, name the inference rules being used at each step.
 From forall x: T(x) or ~S(x) we can infer forall x: S(x) -> T(x) via universal rewriting. From forall x: Q_4(x) <-> T(x) we can infer forall x: T(x) -> Q_4(x) via universal biconditional elimination. Finally, from forall x: S(x) -> T(x), forall x: T(x) -> Q_4(x) we can infer forall x: S(x) -> Q_4(x) via universal transitivity. Therefore, the answer is yes.