proposition: Proposition irrefl_dcpo_not_specialization (x : X) : ¬(x ⊄ x).
proof: Proof. use factor_through_squash. { apply isapropempty. } intro P. induction P as [ P [ HP [ p n ]]]. exact (n p). 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