fact: Definition preserves_reflexive_coequalizer {C₁ C₂ : category} (F : C₁ ⟶ C₂) : UU := ∏ (x y c : C₁) (f g : x --> y) (s : y --> x) (pf : s · f = identity _) (pg : s · g = identity _) (h : y --> c) (p : f · h = g · h) (Fp : #F f · #F h = #F g · #F h), isCoequalizer f g h p → isCoequalizer (#F f) (#F g) (#F h) Fp.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.Equalizers UniMath.CategoryTheory.Limits.Pullbacks UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.Products UniMath.CategoryTheory.Limits.Coequalizers UniMath.CategoryTheory.Limits.Coproducts UniMath.CategoryTheory.Limits.Pushouts UniMath.CategoryTheory.Adjunctions.Core