Consider the following premises. W_4(e) -> s. forall y: W_4(y). forall y: T_3(y). Can we infer ~s from them? If possible, name the inference rules being used at each step.
 From forall y: W_4(y), forall y: T_3(y) we can infer forall y: W_4(y) and T_3(y) via universal conjunction. From forall y: W_4(y) and T_3(y) we can infer W_4(e) and T_3(e) via universal instantiation. From W_4(e) and T_3(e) we can infer W_4(e) via simplification. Finally, from W_4(e) -> s, W_4(e) we can infer s via modus ponens, which contradicts ~s. Therefore, the answer is no.