proposition: Proposition symmetric_intrinsic_apartness {x y : X} (p : x # y) : y # x.
proof: Proof. revert p. use factor_through_squash. { apply propproperty. } intros p. induction p as [ p | p ]. - exact (hinhpr (inr p)). - exact (hinhpr (inl 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