proposition: Proposition dcpo_not_specialization_le {x y : X} (p : x ⊄ y) : ¬(x ⊑ y).
proof: Proof. intro q. revert p. use factor_through_squash. { apply isapropempty. } intros P. induction P as [ P [ HP [ Px Py ]]]. refine (Py _). exact (is_scott_open_upper_set HP Px q). Qed.
imports: UniMath.MoreFoundations.All UniMath.OrderTheory.DCPOs.Core.DirectedSets UniMath.OrderTheory.DCPOs.Core.Basics UniMath.OrderTheory.DCPOs.Core.WayBelow UniMath.OrderTheory.DCPOs.Core.ScottTopology UniMath.OrderTheory.DCPOs.Basis.Continuous