proposition: Lemma const_pathS_zero n alpha : ~ const_path (S n) zero alpha.
proof: Proof. intros H; repeat red in H. rewrite <- clos_trans_t1n_iff in H; rewrite clos_trans_tn1_iff in H; induction H; now subst. Qed.
imports: hydras(DecPreOrder Canon MoreLists First_toggle OrdNotations) Coq(Lia)