proposition: Proposition comp_cat_functor_empty_context_arrow_eq {C₁ C₂ : comp_cat} (F : comp_cat_functor C₁ C₂) {Γ : C₂} (f g : Γ --> F []) : f = g.
proof: Proof. exact (TerminalArrowEq (T := comp_cat_functor_empty_context F) f g). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Isos UniMath.CategoryTheory.DisplayedCats.Univalence UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Fiber UniMath.CategoryTheory.DisplayedCats.Fibrations UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.Codomain UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.Preservation UniMath.CategoryTheory.Limits.Pullbacks UniMath.Bicategories.ComprehensionCat.BicatOfCompCat