proposition: Proposition comp_is_strict_scott_continuous {X Y Z : hSet} {DX : dcppo_struct X} {DY : dcppo_struct Y} {DZ : dcppo_struct Z} {f : X → Y} {g : Y → Z} (Df : is_strict_scott_continuous DX DY f) (Dg : is_strict_scott_continuous DY DZ g) : is_strict_scott_continuous DX DZ (λ x, g(f x)).
proof: Proof. split. - exact (comp_is_scott_continuous Df Dg). - rewrite (is_strict_scott_continuous_on_bot Df). exact (is_strict_scott_continuous_on_bot Dg). 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.ScottTopology UniMath.OrderTheory.DCPOs.Core.IntrinsicApartness