proposition: Theorem rpo_trans (t t1 t2: term): rpo t t1 -> rpo t1 t2 -> rpo t t2.
proof: Proof. intros; case (rpo_closure t2 t1 t);eauto. Qed.
imports: Coq(Arith Lia Compare_dec Relations Wellfounded Wf_nat List Bool Eqdep_dec Ensembles ArithRing Logic) hydras(More_Arith Restriction DecPreOrder rpo.term rpo.rpo Epsilon0.T1)