proposition: Lemma isStrongOrder_abmonoidfrac {X : abmonoid} (Y : @submonoid X) (gt : hrel X) (Hgt : ispartbinophrel Y gt) : isStrongOrder gt → isStrongOrder (abmonoidfracrel X Y Hgt).
proof: Proof. intros H. split ; [ | split]. - apply istransabmonoidfracrel, (istrans_isStrongOrder H). - apply iscotransabmonoidfracrel, (iscotrans_isStrongOrder H). - apply isirreflabmonoidfracrel, (isirrefl_isStrongOrder H). Defined.
imports: UniMath.Algebra.BinaryOperations UniMath.MoreFoundations.Subtypes UniMath.MoreFoundations.Sets UniMath.MoreFoundations.Orders