proposition: Proposition eq_strict_scott_continuous_map {X Y : dcppo} {f g : strict_scott_continuous_map X Y} (p : ∏ (x : X), f x = g x) : f = g.
proof: Proof. use subtypePath. { intro. apply isaprop_is_strict_scott_continuous. } use funextsec. exact p. 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