proposition: Lemma L6 n c p d : c <> zero -> FS n * cons c p d = cons c p (FS n * d).
proof: Proof. cbn; destruct c; [now destruct 1 | trivial]. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)