proposition: Lemma const_pathS_LT i alpha beta: nf alpha -> const_path (S i) alpha beta -> beta t1< alpha.
proof: Proof. intros H0 H1; apply acc_from_LT;auto. - destruct (const_pathS_repeat H1) as [x H2]. apply path_toS_path_to in H2. apply (path_acc_from H2); auto. Qed.
imports: hydras(DecPreOrder Canon MoreLists First_toggle OrdNotations) Coq(Lia)