proposition: Proposition is_directed_nat {X : hSet} (PX : PartialOrder X) (D : ℕ → X) (HD : ∏ (i j : ℕ), i ≤ j → PX (D i) (D j)) : is_directed PX D.
proof: Proof. split. - exact (hinhpr 0). - intros i₁ i₂. assert (p := istotalnatleh i₁ i₂). revert p. use factor_through_squash. { apply propproperty. } intro p. apply hinhpr. induction p as [ p | p ]. + refine (i₂ ,, HD _ _ _ ,, HD _ _ _). * exact p. * apply isreflnatleh. + refine (i₁ ,, HD _ _ _ ,, HD _ _ _). * apply isreflnatleh. * exact p. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.OrderTheory.Posets.Basics UniMath.OrderTheory.Posets.MonotoneFunctions