proposition: Lemma isprogressive_compose {P : Poset} {f g : P -> P} (f_prog : isprogressive f) (g_prog : isprogressive g) : isprogressive (f ∘ g).
proof: Proof. intros x. eapply istrans_posetRelation. - use g_prog. - use f_prog. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo