proposition: Proposition is_hausdorff_separated_not_le {x y : X} (H : is_hausdorff_separated x y) : ¬(x ⊑ y).
proof: Proof. intro p. revert H. use factor_through_squash. { apply isapropempty. } intros H. induction H as [ P₁ [ P₂ [ Px [ Py H ]]]]. refine (H y (_ ,, _)). - refine (is_scott_open_upper_set P₁ Px p). - exact Py. 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.Core.IntrinsicApartness UniMath.OrderTheory.DCPOs.Basis.Continuous UniMath.OrderTheory.DCPOs.Basis.Basis UniMath.OrderTheory.DCPOs.Elements.Sharp