Consider the following premises. T(b_4). forall x_6: Q_6(x_6) -> W(x_6). forall x_6: T(x_6) -> Q_6(x_6). Can we infer ~W(b_4) from them? If possible, name the inference rules being used at each step.
 From forall x_6: T(x_6) -> Q_6(x_6), forall x_6: Q_6(x_6) -> W(x_6) we can infer forall x_6: T(x_6) -> W(x_6) via universal transitivity. From forall x_6: T(x_6) -> W(x_6) we can infer T(b_4) -> W(b_4) via universal instantiation. Finally, from T(b_4) -> W(b_4), T(b_4) we can infer W(b_4) via modus ponens, which contradicts ~W(b_4). Therefore, the answer is no.