proposition: Proposition continuous_dcpo_struct_le_via_approximation (x y : X) : x ⊑ y ≃ ∀ (z : X), (z ≪ x ⇒ z ≪ y)%logic.
proof: Proof. use weqimplimpl. - intros p z q. exact (trans_way_below_le q p). - intros H. rewrite <- (approximating_family_lub CX x). use dcpo_lub_is_least. pose (D := approximating_family CX x). fold D. intro i. apply way_below_to_le. apply (H (D i)). apply approximating_family_way_below. - apply propproperty. - apply propproperty. Qed.
imports: UniMath.MoreFoundations.All UniMath.OrderTheory.DCPOs.Core.DirectedSets UniMath.OrderTheory.DCPOs.Core.Basics UniMath.OrderTheory.DCPOs.Core.WayBelow