proposition: Lemma is_monotone_bot_iteration_map_S (n : ℕ) : bot_iteration_map n ⊑ f (bot_iteration_map n).
proof: Proof. induction n as [ | n IHn ]. - apply is_min_bottom_dcppo. - exact (is_monotone_scott_continuous_map f IHn). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.OrderTheory.Posets.Basics UniMath.OrderTheory.Posets.MonotoneFunctions UniMath.OrderTheory.Posets.PointedPosets UniMath.OrderTheory.DCPOs.Core.DirectedSets UniMath.OrderTheory.DCPOs.Core.Basics UniMath.OrderTheory.DCPOs.Core.ScottContinuous UniMath.OrderTheory.DCPOs.Examples.Fixpoints UniMath.OrderTheory.DCPOs.Examples.Exponentials UniMath.OrderTheory.DCPOs.Examples.BinaryProducts