proposition: Proposition quotient_poset_hrel_comp : iscomprelrel eqX quotient_poset_hrel_on_el.
proof: Proof. intros x₁ x₂ y₁ y₂ p q. assert (p' := pr1 (H x₁ x₂) p). revert p'. use factor_through_squash. { apply hPropset. } intros p'. assert (q' := pr1 (H y₁ y₂) q). revert q'. use factor_through_squash. { apply hPropset. } intros q'. induction p' as [ p' | p' ] ; induction q' as [ q' | q' ] ; use hPropUnivalence ; (use factor_through_squash ; [ apply propproperty | ]) ; cbn in * ; intro r ; apply hinhpr. - induction p', q'. exact r. - induction p', q'. exact r. - induction p'. induction r as [ r | r ]. + exact (inl r). + refine (inl _). exact (I_down x₁ y₁ r (pr1 q')). - induction p'. induction r as [ r | r ]. + exact (inl r). + refine (inl _). exact (I_down x₁ y₂ r (pr2 q')). - exact (inl (pr2 p')). - exact (inl (pr1 p')). - exact (inl (pr2 p')). - exact (inl (pr1 p')). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.OrderTheory.Posets.Basics UniMath.OrderTheory.Posets.MonotoneFunctions UniMath.OrderTheory.Posets.PointedPosets