Lemma isprogressive_compose {P : Poset} {f g : P -> P} (f_prog : isprogressive f) (g_prog : isprogressive g) : isprogressive (f ∘ g). Proof. intros x. eapply istrans_posetRelation. - use g_prog. - use f_prog. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.OrderTheory.OrderedSets.WellOrderedSets. Require Import UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo. Require Import UniMath.OrderTheory.Posets.Subposets.