proposition: Lemma ordCat_helper {A B} (f g : OrdCat⦅A;B⦆) : f ⪷ g -> forall (x y:dfst A), x ≤ y -> f∙1 x ≤ g∙1 y.
proof: Proof. move=> Hfg x y Hxy; etransitivity;[apply: (f∙2); exact: Hxy| apply: Hfg]. Qed.
imports: Coq(ssreflect ssrfun ssrbool) Coq(FunctionalExtensionality) Coq(Relation_Definitions Morphisms RelationPairs) Mon(SPropBase SPropMonadicStructures) Relational(OrderEnrichedCategory Rel)