Loogle!
Result
Found 188 declarations mentioning CategoryTheory.Over.forget.
- CategoryTheory.Over.forget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) : CategoryTheory.Functor (CategoryTheory.Over X) T - CategoryTheory.Over.forgetCocone 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) : CategoryTheory.Limits.Cocone (CategoryTheory.Over.forget X) - CategoryTheory.Over.forget_faithful 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} : (CategoryTheory.Over.forget X).Faithful - CategoryTheory.Over.forget_reflects_iso 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} : (CategoryTheory.Over.forget X).ReflectsIsomorphisms - CategoryTheory.Over.forgetCocone_pt 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) : (CategoryTheory.Over.forgetCocone X).pt = X - CategoryTheory.Over.forget_obj 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} {U : CategoryTheory.Over X} : (CategoryTheory.Over.forget X).obj U = U.left - CategoryTheory.Over.equivalenceOfIsTerminal_functor 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (hX : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.Over.equivalenceOfIsTerminal hX).functor = CategoryTheory.Over.forget X - CategoryTheory.Over.mapForget_eq 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X Y : T} (f : X ⟶ Y) : (CategoryTheory.Over.map f).comp (CategoryTheory.Over.forget Y) = CategoryTheory.Over.forget X - CategoryTheory.Over.mapForget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X Y : T} (f : X ⟶ Y) : (CategoryTheory.Over.map f).comp (CategoryTheory.Over.forget Y) ≅ CategoryTheory.Over.forget X - CategoryTheory.Over.post_forget_eq_forget_comp 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (X : T) : (CategoryTheory.Over.post F).comp (CategoryTheory.Over.forget (F.obj X)) = (CategoryTheory.Over.forget X).comp F - CategoryTheory.CostructuredArrow.ofDiagEquivalence 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X ≌ CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2 - CategoryTheory.CostructuredArrow.ofDiagEquivalence' 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X ≌ CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.2) X.1 - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) (CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2) - CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2) (CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) - CategoryTheory.Over.forget_map 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} {U V : CategoryTheory.Over X} {f : U ⟶ V} : (CategoryTheory.Over.forget X).map f = CategoryTheory.Over.Hom.left f - CategoryTheory.Over.iteratedSliceBackward_forget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (f : CategoryTheory.Over X) : f.iteratedSliceBackward.comp (CategoryTheory.Over.forget f) = CategoryTheory.Over.map f.hom - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X ≌ CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) (CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) (CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) - CategoryTheory.Functor.toOver_comp_forget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {S : Type u₂} [CategoryTheory.Category.{v₂, u₂} S] (F : CategoryTheory.Functor S T) (X : T) (f : (Y : S) → F.obj Y ⟶ X) (h : ∀ {Y Z : S} (g : Y ⟶ Z), CategoryTheory.CategoryStruct.comp (F.map g) (f Z) = f Y) : (F.toOver X f ⋯).comp (CategoryTheory.Over.forget X) = F - CategoryTheory.Over.iteratedSliceBackward_forget_forget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (f : CategoryTheory.Over X) : f.iteratedSliceBackward.comp ((CategoryTheory.Over.forget f).comp (CategoryTheory.Over.forget X)) = CategoryTheory.Over.forget f.left - CategoryTheory.Over.iteratedSliceForward_forget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (f : CategoryTheory.Over X) : f.iteratedSliceForward.comp (CategoryTheory.Over.forget f.left) = (CategoryTheory.Over.forget f).comp (CategoryTheory.Over.forget X) - CategoryTheory.Functor.toOverCompForget 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {S : Type u₂} [CategoryTheory.Category.{v₂, u₂} S] (F : CategoryTheory.Functor S T) (X : T) (f : (Y : S) → F.obj Y ⟶ X) (h : ∀ {Y Z : S} (g : Y ⟶ Z), CategoryTheory.CategoryStruct.comp (F.map g) (f Z) = f Y) : (F.toOver X f ⋯).comp (CategoryTheory.Over.forget X) ≅ F - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c ≌ CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c) (CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : CategoryTheory.Functor (CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) (CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c) - CategoryTheory.Over.iteratedSliceForwardIsoPost 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) (f : CategoryTheory.Over X) : CategoryTheory.Over.post (CategoryTheory.Over.forget X) ≅ f.iteratedSliceForward - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_obj_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).obj Y).right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse_obj_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse X).obj Y).right.as = PUnit.unit - CategoryTheory.Over.forgetCocone_ι_app 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) (self : CategoryTheory.Comma (CategoryTheory.Functor.id T) (CategoryTheory.Functor.fromPUnit X)) : (CategoryTheory.Over.forgetCocone X).ι.app self = self.hom - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_obj_left_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).obj Y).left.right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_obj_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).obj Y).left.left = Y.left - CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse_obj_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse X).obj Y).left = Y.left.left - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_obj_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).obj Y✝).right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_obj_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).obj Y✝).right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_obj_left_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).obj Y✝).left.right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_obj_left_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).obj Y✝).left.right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_obj_right_as 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (Y : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).obj Y).right.as = PUnit.unit - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_obj_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).obj Y✝).left.left = Y✝.left.left - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_obj_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).obj Y✝).left.left = Y✝.left.left - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor_obj_right 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (X : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c).obj X).right = X.left.right - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).obj Y).hom = Y.hom.2 - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_obj_left_right 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (Y : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).obj Y).left.right = Y.right - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).obj Y✝).hom = Y✝.left.hom - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_obj_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (Y : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).obj Y).left.left = Y.left.left - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).obj Y✝).hom = Y✝.left.hom - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_obj_left_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).obj Y).left.hom = Y.hom.1 - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_functor 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).functor = CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_inverse 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).inverse = CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_obj_left_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).obj Y✝).left.hom = Y✝.hom - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_obj_left_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) (Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).obj Y✝).left.hom = Y✝.hom - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (Y : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).obj Y).hom = Y.left.hom - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor_obj_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (X : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c).obj X).left = CategoryTheory.Over.mk X.hom - CategoryTheory.Over.equivalenceOfIsTerminal_counitIso 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (hX : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.Over.equivalenceOfIsTerminal hX).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (({ obj := fun Y => CategoryTheory.Over.mk (hX.from Y), map := fun {X_1 Y} f => CategoryTheory.Over.homMk f ⋯, map_id := ⋯, map_comp := ⋯ }.comp (CategoryTheory.Over.forget X)).obj x)) ⋯ - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (X : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c).obj X).hom = X.left.hom - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_obj_left_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) (Y : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).obj Y).left.hom = Y.hom - CategoryTheory.Over.equivalenceOfIsTerminal_unitIso 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {X : T} (hX : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.Over.equivalenceOfIsTerminal hX).unitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Over X)).obj Y).left) ⋯) ⋯ - CategoryTheory.Over.iteratedSliceForwardIsoPost_hom_app 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) (f : CategoryTheory.Over X) (X✝ : CategoryTheory.Over f) : (CategoryTheory.Over.iteratedSliceForwardIsoPost X f).hom.app X✝ = CategoryTheory.CategoryStruct.id (CategoryTheory.Over.mk (CategoryTheory.Over.Hom.left X✝.hom)) - CategoryTheory.Over.iteratedSliceForwardIsoPost_inv_app 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T) (f : CategoryTheory.Over X) (X✝ : CategoryTheory.Over f) : (CategoryTheory.Over.iteratedSliceForwardIsoPost X f).inv.app X✝ = CategoryTheory.CategoryStruct.id (CategoryTheory.Over.mk (CategoryTheory.Over.Hom.left X✝.hom)) - CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse_obj_hom 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) (Y : CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse X).obj Y).hom = (Y.left.hom, Y.hom) - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor_map_right 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) {X✝ Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c} (f : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c).map f).right = f.left.right - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_map_left_right 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) {X✝ Y✝ : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).map g).left.right = g.right - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse_map_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) {X✝ Y✝ : CategoryTheory.Comma ((CategoryTheory.Over.forget c).comp F) G} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).map g).left.left = CategoryTheory.Over.Hom.left g.left - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_unitIso 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c)).obj x)) ⋯ - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_counitIso 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).comp (CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c)).obj x)) ⋯ - CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor_map_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) {X✝ Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c} (f : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c).map f).left = CategoryTheory.Over.homMk f.left.left ⋯ - CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor_map_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) {X✝ Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.Functor.diag T) X} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.functor X).map g).left.left = g.left - CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse_map_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] (X : T × T) {X✝ Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.Over.forget X.1) X.2} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofDiagEquivalence.inverse X).map g).left = CategoryTheory.Over.Hom.left g.left - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor_map_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) {X✝ Y✝ : CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.proj F Y) X} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.functor F Y X).map g).left.left = g.left.left - CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse_map_left_left 📋 Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type u₁} [CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor T D) (Y : D) (X : T) {X✝ Y✝ : CategoryTheory.CostructuredArrow ((CategoryTheory.Over.forget X).comp F) Y} (g : X✝ ⟶ Y✝) : ((CategoryTheory.CostructuredArrow.ofCostructuredArrowProjEquivalence.inverse F Y X).map g).left.left = CategoryTheory.Over.Hom.left g.left - CategoryTheory.Over.instIsLeftAdjointForget 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryProducts C] : (CategoryTheory.Over.forget X).IsLeftAdjoint - CategoryTheory.Over.forgetAdjStar 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryProducts C] : CategoryTheory.Over.forget X ⊣ CategoryTheory.Over.star X - CategoryTheory.Over.forgetMapTerminal 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) {T : C} (hT : CategoryTheory.Limits.IsTerminal T) : CategoryTheory.Over.forget X ≅ (CategoryTheory.Over.map (hT.from X)).comp (CategoryTheory.Over.equivalenceOfIsTerminal hT).functor - CategoryTheory.Over.forgetAdjStar_counit_app 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasBinaryProducts C] (X Y : C) : (CategoryTheory.Over.forgetAdjStar X).counit.app Y = CategoryTheory.Limits.prod.snd - CategoryTheory.Over.forgetMapTerminal_hom_app 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) {T : C} (hT : CategoryTheory.Limits.IsTerminal T) (X✝ : CategoryTheory.Over X) : (CategoryTheory.Over.forgetMapTerminal X hT).hom.app X✝ = CategoryTheory.CategoryStruct.id X✝.left - CategoryTheory.Over.forgetMapTerminal_inv_app 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) {T : C} (hT : CategoryTheory.Limits.IsTerminal T) (X✝ : CategoryTheory.Over X) : (CategoryTheory.Over.forgetMapTerminal X hT).inv.app X✝ = CategoryTheory.CategoryStruct.id X✝.left - CategoryTheory.Over.forgetAdjStar_unit_app_left 📋 Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasBinaryProducts C] (X : C) (Y : CategoryTheory.Over X) : CategoryTheory.Over.Hom.left ((CategoryTheory.Over.forgetAdjStar X).unit.app Y) = CategoryTheory.Limits.prod.lift Y.hom (CategoryTheory.CategoryStruct.id Y.left) - CategoryTheory.Limits.Cocone.toCostructuredArrow_comp_toOver_comp_forget 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : c.toCostructuredArrow.comp ((CategoryTheory.CostructuredArrow.toOver F c.pt).comp (CategoryTheory.Over.forget c.pt)) = F - CategoryTheory.Limits.Cocone.toCostructuredArrowCompToOverCompForget 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : c.toCostructuredArrow.comp ((CategoryTheory.CostructuredArrow.toOver F c.pt).comp (CategoryTheory.Over.forget c.pt)) ≅ F - CategoryTheory.Limits.Cocone.mapCoconeToOver 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Over.forget c.pt).mapCocone c.toOver ≅ c - CategoryTheory.Limits.Cocone.toCostructuredArrowCompToOverCompForget_hom_app 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) (X : J) : c.toCostructuredArrowCompToOverCompForget.hom.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.Limits.Cocone.toCostructuredArrowCompToOverCompForget_inv_app 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) (X : J) : c.toCostructuredArrowCompToOverCompForget.inv.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.Limits.Cocone.mapCoconeToOver_hom_hom 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : c.mapCoconeToOver.hom.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.Limits.Cocone.mapCoconeToOver_inv_hom 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : c.mapCoconeToOver.inv.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.Over.createsColimitsOfSize 📋 Mathlib.CategoryTheory.Limits.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} : CategoryTheory.CreatesColimitsOfSize.{w, w', v, v, max u v, u} (CategoryTheory.Over.forget X) - CategoryTheory.Over.hasColimit_of_hasColimit_comp_forget 📋 Mathlib.CategoryTheory.Limits.Over
{J : Type w} [CategoryTheory.Category.{w', w} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (F : CategoryTheory.Functor J (CategoryTheory.Over X)) [i : CategoryTheory.Limits.HasColimit (F.comp (CategoryTheory.Over.forget X))] : CategoryTheory.Limits.HasColimit F - CategoryTheory.Over.createsColimitsOfSizeMapCompForget 📋 Mathlib.CategoryTheory.Limits.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.CreatesColimitsOfSize.{w, w', v, v, max u v, u} ((CategoryTheory.Over.map f).comp (CategoryTheory.Over.forget Y)) - CategoryTheory.WithTerminal.commaFromOver_obj_left 📋 Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} (K : CategoryTheory.Functor J (CategoryTheory.Over X)) : (CategoryTheory.WithTerminal.commaFromOver.obj K).left = K.comp (CategoryTheory.Over.forget X) - CategoryTheory.WithTerminal.commaFromOver_obj_hom_app 📋 Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} (K : CategoryTheory.Functor J (CategoryTheory.Over X)) (a : J) : (CategoryTheory.WithTerminal.commaFromOver.obj K).hom.app a = (K.obj a).hom - CategoryTheory.WithTerminal.commaFromOver_map_right 📋 Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} {X✝ Y✝ : CategoryTheory.Functor J (CategoryTheory.Over X)} (f : X✝ ⟶ Y✝) : (CategoryTheory.WithTerminal.commaFromOver.map f).right = CategoryTheory.CategoryStruct.id X - CategoryTheory.WithTerminal.commaFromOver_map_left 📋 Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} {X✝ Y✝ : CategoryTheory.Functor J (CategoryTheory.Over X)} (f : X✝ ⟶ Y✝) : (CategoryTheory.WithTerminal.commaFromOver.map f).left = CategoryTheory.Functor.whiskerRight f (CategoryTheory.Over.forget X) - CategoryTheory.MorphismProperty.over_eq_inverseImage 📋 Mathlib.CategoryTheory.MorphismProperty.Comma
{T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] (W : CategoryTheory.MorphismProperty T) (X : T) : W.over = W.inverseImage (CategoryTheory.Over.forget X) - CategoryTheory.MorphismProperty.Over.forget_comp_forget_map 📋 Mathlib.CategoryTheory.MorphismProperty.Comma
{T : Type u_1} [CategoryTheory.Category.{v_1, u_1} T] (P Q : CategoryTheory.MorphismProperty T) (X : T) [Q.IsMultiplicative] {A B : P.Over Q X} (f : A ⟶ B) : ((CategoryTheory.MorphismProperty.Over.forget P Q X).comp (CategoryTheory.Over.forget X)).map f = f.left - CategoryTheory.Limits.IsLimit.overPost 📋 Mathlib.CategoryTheory.Limits.Final
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] {D : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cone D} (hc : CategoryTheory.Limits.IsLimit c) (j : J) [(CategoryTheory.Over.forget j).Initial] : CategoryTheory.Limits.IsLimit (c.overPost j) - CategoryTheory.Over.initial_forget 📋 Mathlib.CategoryTheory.Filtered.Final
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.IsCofilteredOrEmpty C] (c : C) : (CategoryTheory.Over.forget c).Initial - CategoryTheory.Presieve.functorPushforward_overForget 📋 Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {S : C} {X : CategoryTheory.Over S} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.functorPushforward (CategoryTheory.Over.forget S) R = (CategoryTheory.Sieve.generate (CategoryTheory.Presieve.map (CategoryTheory.Over.forget S) R)).arrows - CategoryTheory.Functor.over_forget_locallyCoverDense 📋 Mathlib.CategoryTheory.Sites.DenseSubsite.InducedTopology
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (J : CategoryTheory.GrothendieckTopology C) (X : C) : (CategoryTheory.Over.forget X).LocallyCoverDense J - CategoryTheory.GrothendieckTopology.over_forget_compatiblePreserving 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (X : C) : CategoryTheory.CompatiblePreserving J (CategoryTheory.Over.forget X) - CategoryTheory.GrothendieckTopology.instIsCocontinuousOverForgetOver 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (X : C) : (CategoryTheory.Over.forget X).IsCocontinuous (J.over X) J - CategoryTheory.GrothendieckTopology.instIsContinuousOverForgetOver 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (X : C) : (CategoryTheory.Over.forget X).IsContinuous (J.over X) J - CategoryTheory.GrothendieckTopology.instPreservesOneHypercoversOverForgetOver 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (X : C) : (CategoryTheory.Over.forget X).PreservesOneHypercovers (J.over X) J - CategoryTheory.GrothendieckTopology.over_forget_coverPreserving 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (X : C) : CategoryTheory.CoverPreserving (J.over X) J (CategoryTheory.Over.forget X) - CategoryTheory.over_toGrothendieck_eq_toGrothendieck_comap_forget 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) [K.HasPullbacks] [K.IsStableUnderBaseChange] (X : C) : K.toGrothendieck.over X = (CategoryTheory.Precoverage.comap (CategoryTheory.Over.forget X) K).toGrothendieck - CategoryTheory.Presieve.functorPullback_map_overForget 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (S : CategoryTheory.Presieve Y) : CategoryTheory.Presieve.functorPullback (CategoryTheory.Over.forget X) (CategoryTheory.Presieve.map (CategoryTheory.Over.forget X) S) = S - CategoryTheory.Sieve.functorPullback_functorPushforward_overForget 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (S : CategoryTheory.Sieve Y) : CategoryTheory.Sieve.functorPullback (CategoryTheory.Over.forget X) (CategoryTheory.Sieve.functorPushforward (CategoryTheory.Over.forget X) S) = S - CategoryTheory.Presieve.map_functorPullback_overForget 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (R : CategoryTheory.Presieve Y.left) : CategoryTheory.Presieve.map (CategoryTheory.Over.forget X) (CategoryTheory.Presieve.functorPullback (CategoryTheory.Over.forget X) R) = R - CategoryTheory.Sieve.functorPushforward_functorPullback_overForget 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (S : CategoryTheory.Sieve Y.left) : CategoryTheory.Sieve.functorPushforward (CategoryTheory.Over.forget X) (CategoryTheory.Sieve.functorPullback (CategoryTheory.Over.forget X) S) = S - CategoryTheory.Sieve.functorPushforward_overForget_arrows 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (S : CategoryTheory.Sieve Y) : CategoryTheory.Presieve.functorPushforward (CategoryTheory.Over.forget X) S.arrows = CategoryTheory.Presieve.map (CategoryTheory.Over.forget X) S.arrows - CategoryTheory.Sieve.overEquiv_generate 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (R : CategoryTheory.Presieve Y) : (CategoryTheory.Sieve.overEquiv Y) (CategoryTheory.Sieve.generate R) = CategoryTheory.Sieve.generate (CategoryTheory.Presieve.functorPushforward (CategoryTheory.Over.forget X) R) - CategoryTheory.Presieve.overEquiv_apply 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (Y : CategoryTheory.Over X) (S : CategoryTheory.Presieve Y) : (CategoryTheory.Presieve.overEquiv Y) S = CategoryTheory.Presieve.map (CategoryTheory.Over.forget X) S - CategoryTheory.Sieve.overEquiv_apply 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (Y : CategoryTheory.Over X) (R : CategoryTheory.Sieve Y) : (CategoryTheory.Sieve.overEquiv Y) R = CategoryTheory.Sieve.functorPushforward (CategoryTheory.Over.forget X) R - CategoryTheory.Sieve.overEquiv_symm_generate 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (R : CategoryTheory.Presieve Y.left) : (CategoryTheory.Sieve.overEquiv Y).symm (CategoryTheory.Sieve.generate R) = CategoryTheory.Sieve.generate (CategoryTheory.Presieve.functorPullback (CategoryTheory.Over.forget X) R) - CategoryTheory.Sieve.overEquiv_preOneHypercover_sieve₁ 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (E : CategoryTheory.PreOneHypercover Y) {i₁ i₂ : E.I₀} {W : CategoryTheory.Over X} (p₁ : W ⟶ E.X i₁) (p₂ : W ⟶ E.X i₂) : (CategoryTheory.Sieve.overEquiv W) (E.sieve₁ p₁ p₂) = (E.map (CategoryTheory.Over.forget X)).sieve₁ (CategoryTheory.Over.Hom.left p₁) (CategoryTheory.Over.Hom.left p₂) - CategoryTheory.Presieve.overEquiv_symm_apply 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (Y : CategoryTheory.Over X) (S' : CategoryTheory.Presieve Y.left) : (RelIso.symm (CategoryTheory.Presieve.overEquiv Y)) S' = CategoryTheory.Presieve.functorPullback (CategoryTheory.Over.forget X) S' - CategoryTheory.Sieve.overEquiv_symm_apply 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (Y : CategoryTheory.Over X) (R : CategoryTheory.Sieve ((CategoryTheory.Over.forget X).obj Y)) : (RelIso.symm (CategoryTheory.Sieve.overEquiv Y)) R = CategoryTheory.Sieve.functorPullback (CategoryTheory.Over.forget X) R - CategoryTheory.Sheaf.toPushforwardOverPullback_hom_app 📋 Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasPullbacks C] (F : CategoryTheory.Sheaf J A) {X Y : C} (f : X ⟶ Y) (U : (CategoryTheory.Over Y)ᵒᵖ) : (F.toPushforwardOverPullback f).hom.app U = F.obj.map (CategoryTheory.Limits.pullback.fst (Opposite.unop U).hom f).op - SheafOfModules.instIsLeftAdjointOverOverRingCatPushforwardIdSheafOver 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.PushforwardContinuous
{C : Type u'} [CategoryTheory.Category.{v', u'} C] [CategoryTheory.Limits.HasBinaryProducts C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} (x : C) : (SheafOfModules.pushforward (CategoryTheory.CategoryStruct.id (R.over x))).IsLeftAdjoint - SheafOfModules.overPushforwardOverAdj 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.PushforwardContinuous
{C : Type u'} [CategoryTheory.Category.{v', u'} C] [CategoryTheory.Limits.HasBinaryProducts C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} (x : C) : SheafOfModules.pushforward (CategoryTheory.CategoryStruct.id (R.over x)) ⊣ SheafOfModules.pushforward (SheafOfModules.pushforwardOver x) - SheafOfModules.GeneratingSections.localGeneratorsData_generators 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Generators
{C : Type u'} [CategoryTheory.Category.{v', u'} C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [CategoryTheory.HasWeakSheafify J AddCommGrpCat] [J.WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [CategoryTheory.Limits.HasBinaryProducts C] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {M : SheafOfModules R} (G : M.GeneratingSections) (x : C) : G.localGeneratorsData.generators x = G.map (SheafOfModules.pushforward (CategoryTheory.CategoryStruct.id (R.over x))) (CategoryTheory.Iso.refl (SheafOfModules.unit (R.over x))) - CategoryTheory.Over.createsLimitsOfShapeForgetOfIsConnected 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsConnected J] {B : C} : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.Over.forget B) - CategoryTheory.Over.preservesLimitsOfShape_forget_of_isConnected 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsConnected J] {B : C} : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.Over.forget B) - CategoryTheory.Over.conePostIso 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (i : J) : (CategoryTheory.Over.conePost F i).comp (CategoryTheory.Limits.Cone.functoriality (CategoryTheory.Over.post F) (CategoryTheory.Over.forget (F.obj i))) ≅ CategoryTheory.Limits.Cone.whiskering (CategoryTheory.Over.forget i) - CategoryTheory.Over.conePostIso_hom_app_hom 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (i : J) (X : CategoryTheory.Limits.Cone F) : ((CategoryTheory.Over.conePostIso F i).hom.app X).hom = CategoryTheory.CategoryStruct.id X.pt - CategoryTheory.Over.conePostIso_inv_app_hom 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (i : J) (X : CategoryTheory.Limits.Cone F) : ((CategoryTheory.Over.conePostIso F i).inv.app X).hom = CategoryTheory.CategoryStruct.id X.pt - SheafOfModules.Presentation.quasicoherentData_presentation 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Quasicoherent
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasBinaryProducts C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [CategoryTheory.HasSheafify J AddCommGrpCat] [J.WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {M : SheafOfModules R} (P : M.Presentation) (x : C) : P.quasicoherentData.presentation x = P.map (SheafOfModules.pushforward (CategoryTheory.CategoryStruct.id (R.over x))) (CategoryTheory.Iso.refl (SheafOfModules.unit (R.over x))) - SheafOfModules.isQuasicoherent_pushforward 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Quasicoherent
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [∀ (X : C), CategoryTheory.HasWeakSheafify (J.over X) AddCommGrpCat] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {K : CategoryTheory.GrothendieckTopology D} {S : CategoryTheory.Sheaf K RingCat} [∀ (X : D), (K.over X).WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [∀ (X : D), CategoryTheory.HasSheafify (K.over X) AddCommGrpCat] (G : CategoryTheory.Functor D C) [G.IsContinuous K J] [G.IsCocontinuous K J] (φ : S ⟶ (G.sheafPushforwardContinuous RingCat K J).obj R) (η : (SheafOfModules.pushforward φ).obj (SheafOfModules.unit R) ≅ SheafOfModules.unit S) [∀ (X : D), (CategoryTheory.Over.post G).IsContinuous (K.over X) (J.over (G.obj X))] (h : ∀ (X : D) (Y : C) (f : G.obj X ⟶ Y), CategoryTheory.Limits.PreservesColimitsOfSize.{u, u, max (max u u₁) v₁, max (max u u₂) v₂, max (max (u + 1) u₁) v₁, max (max (u + 1) u₂) v₂} (SheafOfModules.pushforward (((CategoryTheory.Over.forget X).sheafPushforwardContinuous RingCat (K.over X) K).map φ))) {M : SheafOfModules R} [M.IsQuasicoherent] : ((SheafOfModules.pushforward φ).obj M).IsQuasicoherent - SheafOfModules.QuasicoherentData.pushforward 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Quasicoherent
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [∀ (X : C), CategoryTheory.HasWeakSheafify (J.over X) AddCommGrpCat] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {K : CategoryTheory.GrothendieckTopology D} {S : CategoryTheory.Sheaf K RingCat} [∀ (X : D), (K.over X).WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [∀ (X : D), CategoryTheory.HasSheafify (K.over X) AddCommGrpCat] (G : CategoryTheory.Functor D C) [G.IsContinuous K J] [G.IsCocontinuous K J] (φ : S ⟶ (G.sheafPushforwardContinuous RingCat K J).obj R) (η : (SheafOfModules.pushforward φ).obj (SheafOfModules.unit R) ≅ SheafOfModules.unit S) [∀ (X : D), (CategoryTheory.Over.post G).IsContinuous (K.over X) (J.over (G.obj X))] (h : ∀ (X : D) (Y : C) (f : G.obj X ⟶ Y), CategoryTheory.Limits.PreservesColimitsOfSize.{u, u, max (max u u₁) v₁, max (max u u₂) v₂, max (max (u + 1) u₁) v₁, max (max (u + 1) u₂) v₂} (SheafOfModules.pushforward (((CategoryTheory.Over.forget X).sheafPushforwardContinuous RingCat (K.over X) K).map φ))) {M : SheafOfModules R} (P : M.QuasicoherentData) : ((SheafOfModules.pushforward φ).obj M).QuasicoherentData - SheafOfModules.QuasicoherentData.pushforward_I 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Quasicoherent
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [∀ (X : C), CategoryTheory.HasWeakSheafify (J.over X) AddCommGrpCat] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {K : CategoryTheory.GrothendieckTopology D} {S : CategoryTheory.Sheaf K RingCat} [∀ (X : D), (K.over X).WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [∀ (X : D), CategoryTheory.HasSheafify (K.over X) AddCommGrpCat] (G : CategoryTheory.Functor D C) [G.IsContinuous K J] [G.IsCocontinuous K J] (φ : S ⟶ (G.sheafPushforwardContinuous RingCat K J).obj R) (η : (SheafOfModules.pushforward φ).obj (SheafOfModules.unit R) ≅ SheafOfModules.unit S) [∀ (X : D), (CategoryTheory.Over.post G).IsContinuous (K.over X) (J.over (G.obj X))] (h : ∀ (X : D) (Y : C) (f : G.obj X ⟶ Y), CategoryTheory.Limits.PreservesColimitsOfSize.{u, u, max (max u u₁) v₁, max (max u u₂) v₂, max (max (u + 1) u₁) v₁, max (max (u + 1) u₂) v₂} (SheafOfModules.pushforward (((CategoryTheory.Over.forget X).sheafPushforwardContinuous RingCat (K.over X) K).map φ))) {M : SheafOfModules R} (P : M.QuasicoherentData) : (SheafOfModules.QuasicoherentData.pushforward G φ η h P).I = ((X : D) × (i : P.I) × (G.obj X ⟶ P.X i)) - SheafOfModules.QuasicoherentData.pushforward_X 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.Quasicoherent
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : CategoryTheory.GrothendieckTopology C} {R : CategoryTheory.Sheaf J RingCat} [∀ (X : C), CategoryTheory.HasWeakSheafify (J.over X) AddCommGrpCat] [∀ (X : C), (J.over X).WEqualsLocallyBijective AddCommGrpCat] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {K : CategoryTheory.GrothendieckTopology D} {S : CategoryTheory.Sheaf K RingCat} [∀ (X : D), (K.over X).WEqualsLocallyBijective AddCommGrpCat] [∀ (X : C), CategoryTheory.HasSheafify (J.over X) AddCommGrpCat] [∀ (X : D), CategoryTheory.HasSheafify (K.over X) AddCommGrpCat] (G : CategoryTheory.Functor D C) [G.IsContinuous K J] [G.IsCocontinuous K J] (φ : S ⟶ (G.sheafPushforwardContinuous RingCat K J).obj R) (η : (SheafOfModules.pushforward φ).obj (SheafOfModules.unit R) ≅ SheafOfModules.unit S) [∀ (X : D), (CategoryTheory.Over.post G).IsContinuous (K.over X) (J.over (G.obj X))] (h : ∀ (X : D) (Y : C) (f : G.obj X ⟶ Y), CategoryTheory.Limits.PreservesColimitsOfSize.{u, u, max (max u u₁) v₁, max (max u u₂) v₂, max (max (u + 1) u₁) v₁, max (max (u + 1) u₂) v₂} (SheafOfModules.pushforward (((CategoryTheory.Over.forget X).sheafPushforwardContinuous RingCat (K.over X) K).map φ))) {M : SheafOfModules R} (P : M.QuasicoherentData) (i : (X : D) × (i : P.I) × (G.obj X ⟶ P.X i)) : (SheafOfModules.QuasicoherentData.pushforward G φ η h P).X i = i.fst - CategoryTheory.Limits.instPreservesCofilteredLimitsOfSizeOverForget 📋 Mathlib.CategoryTheory.Limits.Preserves.Over
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} : CategoryTheory.Limits.PreservesCofilteredLimitsOfSize.{u_2, u_3, v_1, v_1, max u_1 v_1, u_1} (CategoryTheory.Over.forget X) - AlgebraicGeometry.Scheme.restrictFunctorΓ 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} : X.restrictFunctor.op.comp ((CategoryTheory.Over.forget X).op.comp AlgebraicGeometry.Scheme.Γ) ≅ X.presheaf - AlgebraicGeometry.Scheme.restrictFunctorΓ_inv_app 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} (X✝ : X.Opensᵒᵖ) : AlgebraicGeometry.Scheme.restrictFunctorΓ.inv.app X✝ = X.presheaf.map (CategoryTheory.eqToHom ⋯) - AlgebraicGeometry.Scheme.restrictFunctorΓ_hom_app 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} (X✝ : X.Opensᵒᵖ) : AlgebraicGeometry.Scheme.restrictFunctorΓ.hom.app X✝ = X.presheaf.map (CategoryTheory.eqToHom ⋯) - AlgebraicGeometry.opensDiagramι 📋 Mathlib.AlgebraicGeometry.AffineTransitionLimit
{I : Type u} [CategoryTheory.Category.{u, u} I] (D : CategoryTheory.Functor I AlgebraicGeometry.Scheme) (i : I) (U : (D.obj i).Opens) : AlgebraicGeometry.opensDiagram D i U ⟶ (CategoryTheory.Over.forget i).comp D - AlgebraicGeometry.instIsOpenImmersionAppOverSchemeOpensDiagramι 📋 Mathlib.AlgebraicGeometry.AffineTransitionLimit
{I : Type u} [CategoryTheory.Category.{u, u} I] (D : CategoryTheory.Functor I AlgebraicGeometry.Scheme) (i : I) (U : (D.obj i).Opens) (j : CategoryTheory.Over i) : AlgebraicGeometry.IsOpenImmersion ((AlgebraicGeometry.opensDiagramι D i U).app j) - AlgebraicGeometry.opensDiagramι_app 📋 Mathlib.AlgebraicGeometry.AffineTransitionLimit
{I : Type u} [CategoryTheory.Category.{u, u} I] (D : CategoryTheory.Functor I AlgebraicGeometry.Scheme) (i : I) (U : (D.obj i).Opens) (j : CategoryTheory.Over i) : (AlgebraicGeometry.opensDiagramι D i U).app j = ((TopologicalSpace.Opens.map (D.map j.hom).base).obj U).ι - AlgebraicGeometry.Scheme.AffineZariskiSite.restrictIsoSpec 📋 Mathlib.AlgebraicGeometry.Sites.SmallAffineZariski
(X : AlgebraicGeometry.Scheme) : (AlgebraicGeometry.Scheme.AffineZariskiSite.toOpensFunctor X).comp (X.restrictFunctor.comp (CategoryTheory.Over.forget X)) ≅ (AlgebraicGeometry.Scheme.AffineZariskiSite.toOpensFunctor X).comp ((CategoryTheory.Functor.rightOp X.presheaf).comp AlgebraicGeometry.Scheme.Spec) - AlgebraicGeometry.Scheme.AffineZariskiSite.restrictIsoSpec_hom_app 📋 Mathlib.AlgebraicGeometry.Sites.SmallAffineZariski
(X : AlgebraicGeometry.Scheme) (X✝ : X.AffineZariskiSite) : (AlgebraicGeometry.Scheme.AffineZariskiSite.restrictIsoSpec X).hom.app X✝ = ⋯.isoSpec.hom - AlgebraicGeometry.Scheme.AffineZariskiSite.restrictIsoSpec_inv_app 📋 Mathlib.AlgebraicGeometry.Sites.SmallAffineZariski
(X : AlgebraicGeometry.Scheme) (X✝ : X.AffineZariskiSite) : (AlgebraicGeometry.Scheme.AffineZariskiSite.restrictIsoSpec X).inv.app X✝ = ⋯.isoSpec.inv - AlgebraicGeometry.instHasColimitOverScheme 📋 Mathlib.AlgebraicGeometry.LimitsOver
{S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (CategoryTheory.Over S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (CategoryTheory.Over.Hom.left (F.map f))] [(F.comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget)).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, u_1} J] : CategoryTheory.Limits.HasColimit F - AlgebraicGeometry.instIsLocallyDirectedCompSchemeOverOverTopMorphismPropertyForgetForgetForget 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [(F.comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).IsLocallyDirected] : (((F.comp (CategoryTheory.MorphismProperty.Over.forget P ⊤ S)).comp (CategoryTheory.Over.forget S)).comp AlgebraicGeometry.Scheme.forget).IsLocallyDirected - AlgebraicGeometry.instHasColimitOverSchemeTopMorphismProperty 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [AlgebraicGeometry.IsZariskiLocalAtSource P] {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f).left] [(F.comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, u_1} J] : CategoryTheory.Limits.HasColimit F - AlgebraicGeometry.instCreatesColimitOverSchemeTopMorphismPropertyOverForget 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [AlgebraicGeometry.IsZariskiLocalAtSource P] {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f).left] [(F.comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, u_1} J] : CategoryTheory.CreatesColimit F (CategoryTheory.MorphismProperty.Over.forget P ⊤ S) - AlgebraicGeometry.instPreservesColimitOverSchemeTopMorphismPropertyOverForget 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [AlgebraicGeometry.IsZariskiLocalAtSource P] {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f).left] [(F.comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, u_1} J] : CategoryTheory.Limits.PreservesColimit F (CategoryTheory.MorphismProperty.Over.forget P ⊤ S) - AlgebraicGeometry.instIsOpenImmersionMapSchemeCompOverOverTopMorphismPropertyForgetForget 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f).left] {i j : J} (f : i ⟶ j) : AlgebraicGeometry.IsOpenImmersion (((F.comp (CategoryTheory.MorphismProperty.Over.forget P ⊤ S)).comp (CategoryTheory.Over.forget S)).map f) - AlgebraicGeometry.instMonoObjWalkingSpanCompOverSchemeTopMorphismPropertySpanOverForgetForgetForgetNoneWalkingPairSomeMapInitOfIsOpenImmersionLeftDiscretePUnit 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) {S : AlgebraicGeometry.Scheme} {U X Y : P.Over ⊤ S} (f : U ⟶ X) (g : U ⟶ Y) [AlgebraicGeometry.IsOpenImmersion f.left] [AlgebraicGeometry.IsOpenImmersion g.left] (i : CategoryTheory.Limits.WalkingPair) : CategoryTheory.Mono (((CategoryTheory.Limits.span f g).comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).map (CategoryTheory.Limits.WidePushoutShape.Hom.init i)) - AlgebraicGeometry.instIsOpenImmersionLeftSchemeDiscretePUnitιOverTopMorphismProperty 📋 Mathlib.AlgebraicGeometry.LimitsOver
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) [AlgebraicGeometry.IsZariskiLocalAtSource P] {S : AlgebraicGeometry.Scheme} {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] (F : CategoryTheory.Functor J (P.Over ⊤ S)) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f).left] [(F.comp ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp ((CategoryTheory.Over.forget S).comp AlgebraicGeometry.Scheme.forget))).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, u_1} J] (j : J) : AlgebraicGeometry.IsOpenImmersion (CategoryTheory.Limits.colimit.ι F j).left - CategoryTheory.MorphismProperty.coverPreserving_comap_forget 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] (H : K ≤ P.precoverage) : CategoryTheory.CoverPreserving (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck (K.toGrothendieck.over S) (CategoryTheory.MorphismProperty.Over.forget P ⊤ S) - CategoryTheory.MorphismProperty.isContinuous_comap_forget 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [CategoryTheory.Limits.HasFiniteWidePullbacks C] [P.HasOfPostcompProperty P] [P.IsStableUnderBaseChange] [P.ContainsIdentities] (H : K ≤ P.precoverage) : (CategoryTheory.MorphismProperty.Over.forget P ⊤ S).IsContinuous (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck (K.toGrothendieck.over S) - CategoryTheory.MorphismProperty.toGrothendieck_comap_forget_eq_restrictedTopology 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] (H : K ≤ P.precoverage) : (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck = (CategoryTheory.MorphismProperty.Over.forget P ⊤ S).restrictedTopology (K.toGrothendieck.over S) - CategoryTheory.MorphismProperty.toGrothendieck_comap_forget_eq_inducedTopology 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [CategoryTheory.Limits.HasFiniteWidePullbacks C] [P.HasOfPostcompProperty P] [P.IsStableUnderBaseChange] [P.ContainsIdentities] (H : K ≤ P.precoverage) : (CategoryTheory.Precoverage.comap ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).comp (CategoryTheory.Over.forget S)) K).toGrothendieck = (CategoryTheory.MorphismProperty.Over.forget P ⊤ S).inducedTopology (K.toGrothendieck.over S) - CategoryTheory.MorphismProperty.exists_map_eq_of_presieve 📋 Mathlib.CategoryTheory.MorphismProperty.CommaSites
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P : CategoryTheory.MorphismProperty C} {S : C} [P.IsStableUnderComposition] (K : CategoryTheory.Precoverage C) (H : K ≤ P.precoverage) {X : P.Over ⊤ S} {R : CategoryTheory.Presieve ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).obj X)} (hR : R ∈ (CategoryTheory.Precoverage.comap (CategoryTheory.Over.forget S) K).coverings ((CategoryTheory.MorphismProperty.Over.forget P ⊤ S).obj X)) : ∃ T, CategoryTheory.Presieve.map (CategoryTheory.MorphismProperty.Over.forget P ⊤ S) T = R - AlgebraicGeometry.Scheme.ProEt.instIsContinuousCompOverForgetForgetTopologyProetaleTopology 📋 Mathlib.AlgebraicGeometry.Sites.Proetale
(S : AlgebraicGeometry.Scheme) : ((AlgebraicGeometry.Scheme.ProEt.forget S).comp (CategoryTheory.Over.forget S)).IsContinuous (AlgebraicGeometry.Scheme.ProEt.topology S) AlgebraicGeometry.Scheme.proetaleTopology - CategoryTheory.IsGrothendieckAbelian.isColimitMapCoconeOfSubobjectMkEqISup 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] (c : CategoryTheory.Limits.Cocone (F.comp (CategoryTheory.MonoOver.forget X))) [CategoryTheory.Mono c.pt.hom] (h : CategoryTheory.Subobject.mk c.pt.hom = ⨆ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom) : CategoryTheory.Limits.IsColimit ((CategoryTheory.Over.forget X).mapCocone c) - CategoryTheory.IsGrothendieckAbelian.mono_of_isColimit_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) : CategoryTheory.Mono f - CategoryTheory.IsGrothendieckAbelian.exists_isIso_of_functor_from_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))) (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) (h : CategoryTheory.Epi f) : ∃ j, CategoryTheory.IsIso (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.subobjectMk_of_isColimit_eq_iSup 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) : CategoryTheory.Subobject.mk f = ⨆ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom - CategoryTheory.FunctorToTypes.fromOverSubfunctor 📋 Mathlib.CategoryTheory.Functor.TypeValuedFlat
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X : C} (x : F.obj X) : CategoryTheory.Subfunctor ((CategoryTheory.Over.forget X).comp F) - CategoryTheory.FunctorToTypes.mem_fromOverSubfunctor_iff 📋 Mathlib.CategoryTheory.Functor.TypeValuedFlat
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X : C} (x : F.obj X) {U : CategoryTheory.Over X} (u : F.obj U.left) : u ∈ (CategoryTheory.FunctorToTypes.fromOverSubfunctor F x).obj U ↔ (CategoryTheory.ConcreteCategory.hom (F.map U.hom)) u = x - CategoryTheory.CommSq.HasLift.over 📋 Mathlib.CategoryTheory.LiftingProperties.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {X₁ X₂ X₃ X₄ : CategoryTheory.Over S} {t : X₁ ⟶ X₂} {l : X₁ ⟶ X₃} {r : X₂ ⟶ X₄} {b : X₃ ⟶ X₄} {sq : CategoryTheory.CommSq t l r b} [⋯.HasLift] : sq.HasLift - CategoryTheory.CostructuredArrow.toOverCompYonedaColimit 📋 Mathlib.CategoryTheory.Comma.Presheaf.Colimit
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type v} [CategoryTheory.SmallCategory J] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor J (CategoryTheory.Over A)) : (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda A).op.comp (CategoryTheory.yoneda.obj (CategoryTheory.Limits.colimit F)) ≅ (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda A).op.comp (CategoryTheory.Limits.colimit (F.comp CategoryTheory.yoneda)) - CategoryTheory.Limits.IndizationClosedUnderFilteredColimitsAux.exists_nonempty_limit_obj_of_colimit 📋 Mathlib.CategoryTheory.Limits.Indization.FilteredColimits
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : Type v} [CategoryTheory.SmallCategory I] (F : CategoryTheory.Functor I (CategoryTheory.Functor Cᵒᵖ (Type v))) {J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] (G : CategoryTheory.Functor J (CategoryTheory.CostructuredArrow CategoryTheory.yoneda (CategoryTheory.Limits.colimit F))) {K : Type v} [CategoryTheory.SmallCategory K] (H : CategoryTheory.Functor K (CategoryTheory.Over (CategoryTheory.Limits.colimit F))) [CategoryTheory.IsFiltered K] (h : Nonempty (CategoryTheory.Limits.limit ((G.op.comp (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda (CategoryTheory.Limits.colimit F)).op).comp (CategoryTheory.yoneda.obj (CategoryTheory.Limits.colimit H))))) : ∃ k, Nonempty (CategoryTheory.Limits.limit ((G.op.comp (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda (CategoryTheory.Limits.colimit F)).op).comp (CategoryTheory.yoneda.obj (H.obj k)))) - CategoryTheory.Limits.IndizationClosedUnderFilteredColimitsAux.compYonedaColimitIsoColimitCompYoneda 📋 Mathlib.CategoryTheory.Limits.Indization.FilteredColimits
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : Type v} [CategoryTheory.SmallCategory I] (F : CategoryTheory.Functor I (CategoryTheory.Functor Cᵒᵖ (Type v))) {J : Type v} [CategoryTheory.SmallCategory J] (G : CategoryTheory.Functor J (CategoryTheory.CostructuredArrow CategoryTheory.yoneda (CategoryTheory.Limits.colimit F))) {K : Type v} [CategoryTheory.SmallCategory K] (H : CategoryTheory.Functor K (CategoryTheory.Over (CategoryTheory.Limits.colimit F))) : (G.op.comp (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda (CategoryTheory.Limits.colimit F)).op).comp (CategoryTheory.yoneda.obj (CategoryTheory.Limits.colimit H)) ≅ CategoryTheory.Limits.colimit (H.comp (CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringLeft Jᵒᵖ (CategoryTheory.Over (CategoryTheory.Limits.colimit F))ᵒᵖ (Type (max u v))).obj (G.op.comp (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda (CategoryTheory.Limits.colimit F)).op)))) - CategoryTheory.Filtration.diagram_map 📋 Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (F : CategoryTheory.Filtration X I) {X✝ Y✝ : I} (f : X✝ ⟶ Y✝) : F.diagram.map f = CategoryTheory.Over.Hom.left (F.toMonoOver.map f).hom - CategoryTheory.FilteredObject.Hom.comm_assoc 📋 Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] {F G : CategoryTheory.FilteredObject C I} (self : F.Hom G) (i : I) {Z : C} (h : ((CategoryTheory.Functor.const I).obj G.X).obj i ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.natTrans.app i) (CategoryTheory.CategoryStruct.comp (G.filtration.ι.app i) h) = CategoryTheory.CategoryStruct.comp (F.filtration.ι.app i) (CategoryTheory.CategoryStruct.comp self.hom h) - CategoryTheory.TwoSquare.overPost 📋 Mathlib.CategoryTheory.GuitartExact.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (X : C) : CategoryTheory.TwoSquare (CategoryTheory.Over.post F) (CategoryTheory.Over.forget X) (CategoryTheory.Over.forget (F.obj X)) F - CategoryTheory.instGuitartExactOverObjOverPostOfHasBinaryProductOfPreservesLimitDiscreteWalkingPairPair 📋 Mathlib.CategoryTheory.GuitartExact.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (X : C) [∀ (Y : C), CategoryTheory.Limits.HasBinaryProduct X Y] [∀ (Y : C), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.pair X Y) F] : (CategoryTheory.TwoSquare.overPost F X).GuitartExact - CategoryTheory.forgetAdjToOver 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) : CategoryTheory.Over.forget X ⊣ CategoryTheory.toOver X - CategoryTheory.equivToOverUnit_functor 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (CategoryTheory.equivToOverUnit C).functor = CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C) - CategoryTheory.forgetAdjToOver_counit_app 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X Z : C) : (CategoryTheory.forgetAdjToOver X).counit.app Z = CategoryTheory.SemiCartesianMonoidalCategory.fst Z X - CategoryTheory.forgetAdjToOver_unit_app 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (Z : CategoryTheory.Over X) : (CategoryTheory.forgetAdjToOver X).unit.app Z = CategoryTheory.Over.homMk (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id Z.left) Z.hom) ⋯ - CategoryTheory.equivToOverUnit_counitIso 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (CategoryTheory.equivToOverUnit C).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl (((CategoryTheory.toOverUnit C).comp (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))).obj X)) ⋯ - CategoryTheory.forgetAdjToOver.homEquiv_symm 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X : C} (Z : CategoryTheory.Over X) (A : C) (f : Z ⟶ (CategoryTheory.toOver X).obj A) : ((CategoryTheory.forgetAdjToOver X).homEquiv Z A).symm f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left f) (CategoryTheory.SemiCartesianMonoidalCategory.fst A X) - CategoryTheory.equivToOverUnit_unitIso 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (CategoryTheory.equivToOverUnit C).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Over (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))).obj X).left) ⋯) ⋯ - CategoryTheory.toOverPullbackIsoToOver_hom_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X Y : C} (f : Y ⟶ X) [CategoryTheory.ChosenPullbacksAlong f] (X✝ : C) : ((CategoryTheory.toOverPullbackIsoToOver f).hom.app X✝).left = CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Over.mapForget f).hom.app ((CategoryTheory.ChosenPullbacksAlong.pullback f).obj ((CategoryTheory.toOver X).obj X✝))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left ((CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f).counit.app ((CategoryTheory.toOver X).obj X✝))) (CategoryTheory.SemiCartesianMonoidalCategory.fst X✝ X))) ((CategoryTheory.ChosenPullbacksAlong.pullback f).obj ((CategoryTheory.toOver X).obj X✝)).hom - CategoryTheory.toOverIsoToOverUnit_hom_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) : (CategoryTheory.toOverIsoToOverUnit.hom.app X).left = CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (((CategoryTheory.mateEquiv (CategoryTheory.forgetAdjToOver (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) (CategoryTheory.equivToOverUnit C).toAdjunction) (CategoryTheory.TwoSquare.mk (CategoryTheory.Functor.id (CategoryTheory.Over (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))) (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) (CategoryTheory.Functor.id C) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).leftUnitor.hom (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).rightUnitor.inv))).natTrans.app X)) (CategoryTheory.CategoryStruct.id X) - CategoryTheory.toOverPullbackIsoToOver_inv_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X Y : C} (f : Y ⟶ X) [CategoryTheory.ChosenPullbacksAlong f] (X✝ : C) : ((CategoryTheory.toOverPullbackIsoToOver f).inv.app X✝).left = CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left ((CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f).unit.app ((CategoryTheory.toOver Y).obj X✝))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left ((CategoryTheory.ChosenPullbacksAlong.pullback f).map (CategoryTheory.Over.homMk (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorObj X✝ Y)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SemiCartesianMonoidalCategory.snd X✝ Y) f)) ⋯))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left ((CategoryTheory.ChosenPullbacksAlong.pullback f).map (CategoryTheory.Over.homMk (CategoryTheory.MonoidalCategoryStruct.whiskerRight ((CategoryTheory.Over.mapForget f).inv.app ((CategoryTheory.toOver Y).obj X✝)) X) ⋯))) (CategoryTheory.Over.Hom.left ((CategoryTheory.ChosenPullbacksAlong.pullback f).map (CategoryTheory.Over.homMk (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.SemiCartesianMonoidalCategory.fst X✝ Y) X) ⋯))))) - CategoryTheory.toOverIsoToOverUnit_inv_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) : (CategoryTheory.toOverIsoToOverUnit.inv.app X).left = CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (((CategoryTheory.mateEquiv (CategoryTheory.equivToOverUnit C).toAdjunction (CategoryTheory.forgetAdjToOver (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))) (CategoryTheory.TwoSquare.mk (CategoryTheory.Functor.id (CategoryTheory.Over (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))) (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) (CategoryTheory.Functor.id C) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).leftUnitor.hom (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).rightUnitor.inv))).natTrans.app X)) (CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorObj X (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))) - CategoryTheory.toOverIteratedSliceForwardIsoPullback_hom_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.ChosenPullbacks C] {X Y : C} (f : Y ⟶ X) (X✝ : CategoryTheory.Over X) : ((CategoryTheory.toOverIteratedSliceForwardIsoPullback f).hom.app X✝).left = (CategoryTheory.CategoryStruct.comp (((((((CategoryTheory.Over.map f).leftUnitor.symm.homCongr ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))).rightUnitor.symm).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.Functor.id (CategoryTheory.Over Y)) ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))) (CategoryTheory.Over.map f) (CategoryTheory.Functor.id (CategoryTheory.Over X))).symm).trans (CategoryTheory.mateEquiv ((CategoryTheory.Over.mk f).iteratedSliceEquiv.symm.toAdjunction.comp (CategoryTheory.forgetAdjToOver (CategoryTheory.Over.mk f))) (CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f))).trans (CategoryTheory.TwoSquare.equivNatTrans ((CategoryTheory.toOver (CategoryTheory.Over.mk f)).comp (CategoryTheory.Over.mk f).iteratedSliceForward) (CategoryTheory.Functor.id (CategoryTheory.Over X)) (CategoryTheory.Functor.id (CategoryTheory.Over Y)) (CategoryTheory.ChosenPullbacksAlong.pullback f))) (CategoryTheory.eqToIso ⋯).hom).app X✝) (CategoryTheory.CategoryStruct.id ((CategoryTheory.ChosenPullbacksAlong.pullback f).obj X✝))).left - CategoryTheory.toOverIteratedSliceForwardIsoPullback_inv_app_left 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.ChosenPullbacks C] {X Y : C} (f : Y ⟶ X) (X✝ : CategoryTheory.Over X) : ((CategoryTheory.toOverIteratedSliceForwardIsoPullback f).inv.app X✝).left = (CategoryTheory.CategoryStruct.comp ((((((((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))).leftUnitor.symm.homCongr (CategoryTheory.Over.map f).rightUnitor.symm).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.Functor.id (CategoryTheory.Over Y)) (CategoryTheory.Over.map f) ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))) (CategoryTheory.Functor.id (CategoryTheory.Over X))).symm).trans (CategoryTheory.mateEquiv (CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f) ((CategoryTheory.Over.mk f).iteratedSliceEquiv.symm.toAdjunction.comp (CategoryTheory.forgetAdjToOver (CategoryTheory.Over.mk f))))).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.ChosenPullbacksAlong.pullback f) (CategoryTheory.Functor.id (CategoryTheory.Over X)) (CategoryTheory.Functor.id (CategoryTheory.Over Y)) ((CategoryTheory.toOver (CategoryTheory.Over.mk f)).comp (CategoryTheory.Over.mk f).iteratedSliceForward))) (CategoryTheory.eqToIso ⋯).inv).app X✝) (CategoryTheory.CategoryStruct.id (CategoryTheory.Over.mk (CategoryTheory.Over.Hom.left (CategoryTheory.SemiCartesianMonoidalCategory.snd X✝ (CategoryTheory.Over.mk f)))))).left - CategoryTheory.subterminals_to_monoOver_terminal_comp_forget 📋 Mathlib.CategoryTheory.Subterminal
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).functor.comp ((CategoryTheory.MonoOver.forget (⊤_ C)).comp (CategoryTheory.Over.forget (⊤_ C))) = CategoryTheory.subterminalInclusion C - CategoryTheory.monoOver_terminal_to_subterminals_comp 📋 Mathlib.CategoryTheory.Subterminal
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).inverse.comp (CategoryTheory.subterminalInclusion C) = (CategoryTheory.MonoOver.forget (⊤_ C)).comp (CategoryTheory.Over.forget (⊤_ C)) - CategoryTheory.presheafHom_obj 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] (F G : CategoryTheory.Functor Cᵒᵖ A) (X : Cᵒᵖ) : (CategoryTheory.presheafHom F G).obj X = ((CategoryTheory.Over.forget (Opposite.unop X)).op.comp F ⟶ (CategoryTheory.Over.forget (Opposite.unop X)).op.comp G) - CategoryTheory.PresheafHom.isAmalgamation_iff 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} (S : CategoryTheory.Sieve X) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) (hx : x.Compatible) (y : (CategoryTheory.presheafHom F G).obj (Opposite.op X)) : x.IsAmalgamation y ↔ ∀ (Y : C) (g : Y ⟶ X) (hg : S.arrows g), y.app (Opposite.op (CategoryTheory.Over.mk g)) = (x g hg).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Y))) - CategoryTheory.presheafHom_map_app 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X Y Z : C} (f : Z ⟶ Y) (g : Y ⟶ X) (h : Z ⟶ X) (w : CategoryTheory.CategoryStruct.comp f g = h) (α : (CategoryTheory.presheafHom F G).obj (Opposite.op X)) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.presheafHom F G).map g.op)) α).app (Opposite.op (CategoryTheory.Over.mk f)) = α.app (Opposite.op (CategoryTheory.Over.mk h)) - CategoryTheory.PresheafHom.IsSheafFor.app_cond 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) {Y : C} (hx : x.Compatible) (g : Y ⟶ X) {Z : C} (p : Z ⟶ Y) (hp : S.arrows (CategoryTheory.CategoryStruct.comp p g)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PresheafHom.IsSheafFor.app hG x hx g) (G.map p.op) = CategoryTheory.CategoryStruct.comp (F.map p.op) ((x (CategoryTheory.CategoryStruct.comp p g) hp).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Z)))) - CategoryTheory.PresheafHom.IsSheafFor.exists_app 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) {Y : C} (hx : x.Compatible) (g : Y ⟶ X) : ∃ φ, ∀ {Z : C} (p : Z ⟶ Y) (hp : S.arrows (CategoryTheory.CategoryStruct.comp p g)), CategoryTheory.CategoryStruct.comp φ (G.map p.op) = CategoryTheory.CategoryStruct.comp (F.map p.op) ((x (CategoryTheory.CategoryStruct.comp p g) hp).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Z)))) - CategoryTheory.presheafHom_map_app_op_mk_id 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X Y : C} (g : Y ⟶ X) (α : (CategoryTheory.presheafHom F G).obj (Opposite.op X)) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.presheafHom F G).map g.op)) α).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Y))) = α.app (Opposite.op (CategoryTheory.Over.mk g))
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c