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