proposition: Lemma const_pathS_eps_LE_2 : forall n alpha beta, nf alpha -> nf beta -> const_pathS_eps n alpha beta -> beta t1<= alpha.
proof: Proof. destruct 3. - eapply const_pathS_LE; eauto. - subst; apply LE_refl; auto. Qed.
imports: hydras(DecPreOrder Canon MoreLists First_toggle OrdNotations) Coq(Lia)