proposition: Lemma nat_functor_arr_true {X Y : UU} (f : X -> Y) g : (functor_on_morphisms nat_functor) f (true,, g) = (true,, fromempty).
proof: Proof. cbn; unfold polynomial_functor_arr; cbn. apply maponpaths, eqfromempty. Defined.
imports: UniMath.Foundations.Preamble UniMath.Foundations.PartA UniMath.Foundations.PartD UniMath.Foundations.UnivalenceAxiom UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Categories.Type.Core UniMath.Induction.FunctorAlgebras_legacy UniMath.Induction.PolynomialFunctors UniMath.Induction.W.Core UniMath.Induction.W.Fibered