Consider the following premises. ~T(i). T(i) -> W(i). forall z: W(z) <-> T(z). Can we infer ~W(i) from them? If possible, name the inference rules being used at each step.
 From forall z: W(z) <-> T(z) we can infer forall z: W(z) -> T(z) via universal biconditional elimination. From forall z: W(z) -> T(z) we can infer W(i) -> T(i) via universal instantiation. From W(i) -> T(i), T(i) -> W(i) we can infer W(i) <-> T(i) via biconditional introduction. Finally, from W(i) <-> T(i), ~T(i) we can infer ~W(i) via biconditional elimination. Therefore, the answer is yes.