proposition: Lemma comp_full_is_full (C D E : precategory) (F : functor C D) (fullF : full F) (G : functor D E) (fullG : full G) : full (functor_composite F G).
proof: Proof. unfold full in *. intros ? ?; apply (issurjcomp _ _ (fullF _ _) (fullG _ _)). Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Univalence UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Univalence