proposition: Lemma nf_Wf : well_founded_restriction _ nf lt.
proof: Proof. intros a Ha; unfold restrict. generalize (Acc_inverse_image _ _ rpo T1_2_term a (well_founded_rpo (T1_2_term a))) ; intro H. eapply Acc_incl with (fun x y : T1 => rpo (T1_2_term x) (T1_2_term y)). - red; apply R_inc_rpo. - apply H. 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)