Consider the following premises. forall y: T(y) -> P(y). forall y: P(y) -> U(y). exists y: T(y) <-> U(y). Can we infer exists y: T(y) <-> U(y) from them? If possible, name the inference rules being used at each step.
That is one of the premises. Therefore, the answer is yes.