Consider the following premises. forall y: S(y) -> W_4(y). forall y: T(y) -> S(y). forall y: T(y). Can we infer forall y: W_4(y) from them? If possible, name the inference rules being used at each step.
 From forall y: T(y) -> S(y), forall y: S(y) -> W_4(y) we can infer forall y: T(y) -> W_4(y) via universal transitivity. Finally, from forall y: T(y) -> W_4(y), forall y: T(y) we can infer forall y: W_4(y) via universal modus ponens. Therefore, the answer is yes.