proposition: Proposition lower_set_is_scott_closed (x : X) : is_scott_closed (λ y, y ⊑ x).
proof: Proof. split. - intros y₁ y₂ p q. exact (trans_dcpo q p). - intros D H. use dcpo_lub_is_least. exact H. Qed.
imports: UniMath.MoreFoundations.All UniMath.OrderTheory.DCPOs.Core.DirectedSets UniMath.OrderTheory.DCPOs.Core.Basics UniMath.OrderTheory.DCPOs.Core.WayBelow UniMath.OrderTheory.DCPOs.Basis.Continuous