proposition: Proposition le_largest_progressive_map {X : dcpo} (f : progressive_map X) (x : X) : f x ⊑ largest_progressive_map X x.
proof: Proof. exact (less_than_dcpo_lub (directed_set_progressive_maps X) (pr1 f) f (refl_dcpo _) x). Qed.
imports: UniMath.MoreFoundations.All UniMath.OrderTheory.Posets.Basics UniMath.OrderTheory.Posets.MonotoneFunctions UniMath.OrderTheory.DCPOs.Core.DirectedSets UniMath.OrderTheory.DCPOs.Core.Basics UniMath.OrderTheory.DCPOs.Examples.Products UniMath.OrderTheory.DCPOs.Examples.SubDCPO