fact: Definition eq_diag {C : category} {g : graph} (d d' : diagram g C) := ∑ (eq_v : ∏ v: vertex g, dob d v = dob d' v), ∏ (v v':vertex g) (f:edge v v'), transportf (λ obj, C⟦obj, dob d v'⟧) (eq_v v) (dmor d f) = transportb (λ obj, C⟦_, obj⟧) (eq_v v') (dmor d' f).
imports: UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Limits