proposition: Lemma iterop_seq_mon_step {n} (x:stn (S n) -> M) : iterop_seq_mon (S n,,x) = iterop_seq_mon (n,,x ∘ dni lastelement) * x lastelement.
proof: Proof. intros. induction n as [|n _]. - cbn. apply pathsinv0, lunax. - reflexivity. Defined.
imports: UniMath.Combinatorics.Lists UniMath.Combinatorics.FiniteSequences UniMath.Algebra.RigsAndRings UniMath.Foundations.UnivalenceAxiom UniMath.MoreFoundations.Tactics UniMath.Algebra.Groups UniMath.MoreFoundations.NegativePropositions