Consider the following premises. t <-> u. ~t. w <-> u. Can we infer w from them? If possible, name the inference rules being used at each step.
 From t <-> u, ~t we can infer ~u via biconditional elimination. Finally, from w <-> u, ~u we can infer ~w via biconditional elimination, which contradicts w. Therefore, the answer is no.