proposition: Lemma Lt_wf : well_founded LT.
proof: Proof. unfold LT; generalize nf_Wf; split; split. intros y0 H1; generalize (nf_Wf); intro H2. apply H2; now destruct H1. Defined.
imports: Coq(Arith List Lia Compare_dec Relations Wellfounded RelationClasses) hydras(Epsilon0) hydras(More_Arith Restriction) hydras(ON_Generic) hydras(rpo.term rpo.rpo) hydras(T2) hydras(Compat815)