proposition: Lemma coprod_antidistributor_nat (cs1 cs2 : power_category I C) (g : power_category I C ⟦ cs1, cs2 ⟧) : coprod_antidistributor cs1 · #F (#(coproduct_functor I CPC) g) = #(coproduct_functor I CPD) (#(family_functor I (fun _ => F)) g) · coprod_antidistributor cs2.
proof: Proof. etrans. { apply postcompWithCoproductArrow. } etrans. 2: { apply pathsinv0, precompWithCoproductArrow. } apply maponpaths. apply funextsec; intro i. etrans. { apply pathsinv0, functor_comp. } etrans. 2: { cbn. apply functor_comp. } apply maponpaths. apply CoproductInCommutes. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.ProductCategory UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.whiskering