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