Loogle!
Result
Found 145 declarations mentioning CategoryTheory.Subfunctor.
- CategoryTheory.Subfunctor 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : Type (max u w) - CategoryTheory.instCompleteLatticeSubfunctor 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} : CompleteLattice (CategoryTheory.Subfunctor F) - CategoryTheory.instPartialOrderSubfunctor 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} : PartialOrder (CategoryTheory.Subfunctor F) - CategoryTheory.Subfunctor.instNonempty 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} : Nonempty (CategoryTheory.Subfunctor F) - CategoryTheory.Subfunctor.toFunctor 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : CategoryTheory.Functor C (Type w) - CategoryTheory.Subfunctor.obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (self : CategoryTheory.Subfunctor F) (U : C) : Set (F.obj U) - CategoryTheory.Subfunctor.instCoeHeadObjToFunctor 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) {U : C} : CoeHead (G.toFunctor.obj U) (F.obj U) - CategoryTheory.Subfunctor.instMonoFunctorTypeι 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : CategoryTheory.Mono G.ι - CategoryTheory.Subfunctor.toFunctor_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (U : C) : G.toFunctor.obj U = ↑(G.obj U) - CategoryTheory.Subfunctor.ι 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : G.toFunctor ⟶ F - CategoryTheory.Subfunctor.ext 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {F : CategoryTheory.Functor C (Type w)} {x y : CategoryTheory.Subfunctor F} (obj : x.obj = y.obj) : x = y - CategoryTheory.Subfunctor.ext_iff 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {F : CategoryTheory.Functor C (Type w)} {x y : CategoryTheory.Subfunctor F} : x = y ↔ x.obj = y.obj - CategoryTheory.Subfunctor.instMonoFunctorTypeHomOfLe 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {G G' : CategoryTheory.Subfunctor F} (h : G ≤ G') : CategoryTheory.Mono (CategoryTheory.Subfunctor.homOfLe h) - CategoryTheory.Subfunctor.le_def 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S T : CategoryTheory.Subfunctor F) : S ≤ T ↔ ∀ (U : C), S.obj U ⊆ T.obj U - CategoryTheory.Subfunctor.iInf_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {ι : Sort u_1} (S : ι → CategoryTheory.Subfunctor F) (U : C) : (⨅ i, S i).obj U = ⋂ i, (S i).obj U - CategoryTheory.Subfunctor.iSup_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {ι : Sort u_1} (S : ι → CategoryTheory.Subfunctor F) (U : C) : (⨆ i, S i).obj U = ⋃ i, (S i).obj U - CategoryTheory.Subfunctor.homOfLe 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {G G' : CategoryTheory.Subfunctor F} (h : G ≤ G') : G.toFunctor ⟶ G'.toFunctor - CategoryTheory.Subfunctor.max_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S T : CategoryTheory.Subfunctor F) (i : C) : (S ⊔ T).obj i = S.obj i ∪ T.obj i - CategoryTheory.Subfunctor.min_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S T : CategoryTheory.Subfunctor F) (i : C) : (S ⊓ T).obj i = S.obj i ∩ T.obj i - CategoryTheory.Subfunctor.sInf_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S : Set (CategoryTheory.Subfunctor F)) (U : C) : (sInf S).obj U = sInf ((fun T => T.obj U) '' S) - CategoryTheory.Subfunctor.sSup_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S : Set (CategoryTheory.Subfunctor F)) (U : C) : (sSup S).obj U = sSup ((fun T => T.obj U) '' S) - CategoryTheory.Subfunctor.homOfLe_ι 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {G G' : CategoryTheory.Subfunctor F} (h : G ≤ G') : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.homOfLe h) G'.ι = G.ι - CategoryTheory.Subfunctor.iSup_min 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {ι : Sort u_1} (S : ι → CategoryTheory.Subfunctor F) (T : CategoryTheory.Subfunctor F) : (⨆ i, S i) ⊓ T = ⨆ i, S i ⊓ T - CategoryTheory.Subfunctor.eq_top_iff_isIso 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : G = ⊤ ↔ CategoryTheory.IsIso G.ι - CategoryTheory.Subfunctor.bot_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (i : C) : ⊥.obj i = ⊥ - CategoryTheory.Subfunctor.top_obj 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (i : C) : ⊤.obj i = ⊤ - CategoryTheory.Subfunctor.ι_app 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (x✝ : C) : G.ι.app x✝ = TypeCat.ofHom fun x => ↑x - CategoryTheory.Subfunctor.max_min 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (S₁ S₂ T : CategoryTheory.Subfunctor F) : (S₁ ⊔ S₂) ⊓ T = S₁ ⊓ T ⊔ S₂ ⊓ T - CategoryTheory.Subfunctor.map 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (self : CategoryTheory.Subfunctor F) {U V : C} (i : U ⟶ V) : self.obj U ⊆ ⇑(CategoryTheory.ConcreteCategory.hom (F.map i)) ⁻¹' self.obj V - CategoryTheory.Subfunctor.mk 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (obj : (U : C) → Set (F.obj U)) (map : ∀ {U V : C} (i : U ⟶ V), obj U ⊆ ⇑(CategoryTheory.ConcreteCategory.hom (F.map i)) ⁻¹' obj V) : CategoryTheory.Subfunctor F - CategoryTheory.Subfunctor.homOfLe_ι_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {G G' : CategoryTheory.Subfunctor F} (h : G ≤ G') {Z : CategoryTheory.Functor C (Type w)} (h✝ : F ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.homOfLe h) (CategoryTheory.CategoryStruct.comp G'.ι h✝) = CategoryTheory.CategoryStruct.comp G.ι h✝ - CategoryTheory.Subfunctor.instIsIsoFunctorTypeιTop 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} : CategoryTheory.IsIso ⊤.ι - CategoryTheory.Subfunctor.homOfLe_app 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {G G' : CategoryTheory.Subfunctor F} (h : G ≤ G') (U : C) : (CategoryTheory.Subfunctor.homOfLe h).app U = TypeCat.ofHom fun x => ⟨↑x, ⋯⟩ - CategoryTheory.Subfunctor.toFunctor_map 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) {X✝ Y✝ : C} (i : X✝ ⟶ Y✝) : G.toFunctor.map i = TypeCat.ofHom fun x => ⟨(CategoryTheory.ConcreteCategory.hom (F.map i)) ↑x, ⋯⟩ - CategoryTheory.Subfunctor.nat_trans_naturality 📋 Mathlib.CategoryTheory.Subfunctor.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F' ⟶ G.toFunctor) {U V : C} (i : U ⟶ V) (x : F'.obj U) : ↑((CategoryTheory.ConcreteCategory.hom (f.app V)) ((CategoryTheory.ConcreteCategory.hom (F'.map i)) x)) = (CategoryTheory.ConcreteCategory.hom (F.map i)) ↑((CategoryTheory.ConcreteCategory.hom (f.app U)) x) - CategoryTheory.Sieve.shrinkFunctor 📋 Mathlib.CategoryTheory.Sites.Sieves.Shrink
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] {X : C} (S : CategoryTheory.Sieve X) : CategoryTheory.Subfunctor (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.obj X) - CategoryTheory.Subfunctor.range_ι 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : CategoryTheory.Subfunctor.range G.ι = G - CategoryTheory.Subfunctor.preimage_id 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) : G.preimage (CategoryTheory.CategoryStruct.id F) = G - CategoryTheory.Subfunctor.range 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (p : F' ⟶ F) : CategoryTheory.Subfunctor F - CategoryTheory.Subfunctor.image 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F ⟶ F') : CategoryTheory.Subfunctor F' - CategoryTheory.Subfunctor.preimage 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) : CategoryTheory.Subfunctor F' - CategoryTheory.Subfunctor.preimage_image_of_epi 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) [hp : CategoryTheory.Epi p] : (G.preimage p).image p = G - CategoryTheory.Subfunctor.fromPreimage 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) : (G.preimage p).toFunctor ⟶ G.toFunctor - CategoryTheory.Subfunctor.lift 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (f : F' ⟶ F) {G : CategoryTheory.Subfunctor F} (hf : CategoryTheory.Subfunctor.range f ≤ G) : F' ⟶ G.toFunctor - CategoryTheory.Subfunctor.image_le_iff 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F ⟶ F') (G' : CategoryTheory.Subfunctor F') : G.image f ≤ G' ↔ G ≤ G'.preimage f - CategoryTheory.Subfunctor.image_iSup 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} {ι : Type u_1} (G : ι → CategoryTheory.Subfunctor F) (f : F ⟶ F') : (⨆ i, G i).image f = ⨆ i, (G i).image f - CategoryTheory.Subfunctor.range_comp 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' F'' : CategoryTheory.Functor C (Type w)} (f : F ⟶ F') (g : F' ⟶ F'') : CategoryTheory.Subfunctor.range (CategoryTheory.CategoryStruct.comp f g) = (CategoryTheory.Subfunctor.range f).image g - CategoryTheory.Subfunctor.image_comp 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' F'' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F ⟶ F') (g : F' ⟶ F'') : G.image (CategoryTheory.CategoryStruct.comp f g) = (G.image f).image g - CategoryTheory.Subfunctor.preimage_comp 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' F'' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F'' ⟶ F') (g : F' ⟶ F) : G.preimage (CategoryTheory.CategoryStruct.comp f g) = (G.preimage g).preimage f - CategoryTheory.Subfunctor.range_id 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Subfunctor.range (CategoryTheory.CategoryStruct.id F) = ⊤ - CategoryTheory.Subfunctor.range_comp_le 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' F'' : CategoryTheory.Functor C (Type w)} (f : F ⟶ F') (g : F' ⟶ F'') : CategoryTheory.Subfunctor.range (CategoryTheory.CategoryStruct.comp f g) ≤ CategoryTheory.Subfunctor.range g - CategoryTheory.Subfunctor.lift_ι 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (f : F' ⟶ F) {G : CategoryTheory.Subfunctor F} (hf : CategoryTheory.Subfunctor.range f ≤ G) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.lift f hf) G.ι = f - CategoryTheory.Subfunctor.image_top 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (f : F ⟶ F') : ⊤.image f = CategoryTheory.Subfunctor.range f - CategoryTheory.Subfunctor.range_eq_top 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (p : F' ⟶ F) [CategoryTheory.Epi p] : CategoryTheory.Subfunctor.range p = ⊤ - CategoryTheory.Subfunctor.epi_iff_range_eq_top 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (p : F' ⟶ F) : CategoryTheory.Epi p ↔ CategoryTheory.Subfunctor.range p = ⊤ - CategoryTheory.Subfunctor.preimage_eq_top_iff 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) : G.preimage p = ⊤ ↔ CategoryTheory.Subfunctor.range p ≤ G - CategoryTheory.Subfunctor.fromPreimage_ι 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) : CategoryTheory.CategoryStruct.comp (G.fromPreimage p) G.ι = CategoryTheory.CategoryStruct.comp (G.preimage p).ι p - CategoryTheory.Subfunctor.image_obj 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (f : F ⟶ F') (i : C) : (G.image f).obj i = ⇑(CategoryTheory.ConcreteCategory.hom (f.app i)) '' G.obj i - CategoryTheory.Subfunctor.preimage_obj 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) (n : C) : (G.preimage p).obj n = ⇑(CategoryTheory.ConcreteCategory.hom (p.app n)) ⁻¹' G.obj n - CategoryTheory.Subfunctor.lift_ι_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (f : F' ⟶ F) {G : CategoryTheory.Subfunctor F} (hf : CategoryTheory.Subfunctor.range f ≤ G) {Z : CategoryTheory.Functor C (Type w)} (h : F ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.lift f hf) (CategoryTheory.CategoryStruct.comp G.ι h) = CategoryTheory.CategoryStruct.comp f h - CategoryTheory.Subfunctor.fromPreimage_ι_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (G : CategoryTheory.Subfunctor F) (p : F' ⟶ F) {Z : CategoryTheory.Functor C (Type w)} (h : F ⟶ Z) : CategoryTheory.CategoryStruct.comp (G.fromPreimage p) (CategoryTheory.CategoryStruct.comp G.ι h) = CategoryTheory.CategoryStruct.comp (G.preimage p).ι (CategoryTheory.CategoryStruct.comp p h) - CategoryTheory.Subfunctor.lift_app 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (f : F' ⟶ F) {G : CategoryTheory.Subfunctor F} (hf : CategoryTheory.Subfunctor.range f ≤ G) (U : C) : (CategoryTheory.Subfunctor.lift f hf).app U = TypeCat.ofHom fun x => ⟨(CategoryTheory.ConcreteCategory.hom (f.app U)) x, ⋯⟩ - CategoryTheory.Subfunctor.range_toRange 📋 Mathlib.CategoryTheory.Subfunctor.Image
{C : Type u} [CategoryTheory.Category.{v, u} C] {F F' : CategoryTheory.Functor C (Type w)} (p : F' ⟶ F) : CategoryTheory.Subfunctor.range (CategoryTheory.Subfunctor.toRange p) = ⊤ - CategoryTheory.Subfunctor.sieveOfSection 📋 Mathlib.CategoryTheory.Subfunctor.Sieves
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {U : Cᵒᵖ} (s : F.obj U) : CategoryTheory.Sieve (Opposite.unop U) - CategoryTheory.Subfunctor.familyOfElementsOfSection 📋 Mathlib.CategoryTheory.Subfunctor.Sieves
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {U : Cᵒᵖ} (s : F.obj U) : CategoryTheory.Presieve.FamilyOfElements G.toFunctor (G.sieveOfSection s).arrows - CategoryTheory.Subfunctor.family_of_elements_compatible 📋 Mathlib.CategoryTheory.Subfunctor.Sieves
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {U : Cᵒᵖ} (s : F.obj U) : (G.familyOfElementsOfSection s).Compatible - CategoryTheory.Subfunctor.sieveOfSection_apply 📋 Mathlib.CategoryTheory.Subfunctor.Sieves
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {U : Cᵒᵖ} (s : F.obj U) (V : C) (f : V ⟶ Opposite.unop U) : (G.sieveOfSection s).arrows f = ((CategoryTheory.ConcreteCategory.hom (F.map f.op)) s ∈ G.obj (Opposite.op V)) - CategoryTheory.Subfunctor.sheafify 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) : CategoryTheory.Subfunctor F - CategoryTheory.Subfunctor.isSeparated 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {J : CategoryTheory.GrothendieckTopology C} (h : CategoryTheory.Presieve.IsSeparated J F) : CategoryTheory.Presieve.IsSeparated J G.toFunctor - CategoryTheory.Subfunctor.sheafify_isSheaf 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (hF : CategoryTheory.Presieve.IsSheaf J F) : CategoryTheory.Presieve.IsSheaf J (CategoryTheory.Subfunctor.sheafify J G).toFunctor - CategoryTheory.Subfunctor.sheafify_sheafify 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (h : CategoryTheory.Presieve.IsSheaf J F) : CategoryTheory.Subfunctor.sheafify J (CategoryTheory.Subfunctor.sheafify J G) = CategoryTheory.Subfunctor.sheafify J G - CategoryTheory.Subfunctor.eq_sheafify 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (h : CategoryTheory.Presieve.IsSheaf J F) (hG : CategoryTheory.Presieve.IsSheaf J G.toFunctor) : G = CategoryTheory.Subfunctor.sheafify J G - CategoryTheory.Subfunctor.eq_sheafify_iff 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (h : CategoryTheory.Presieve.IsSheaf J F) : G = CategoryTheory.Subfunctor.sheafify J G ↔ CategoryTheory.Presieve.IsSheaf J G.toFunctor - CategoryTheory.Subfunctor.le_sheafify 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) : G ≤ CategoryTheory.Subfunctor.sheafify J G - CategoryTheory.Subfunctor.sheafify_le 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G G' : CategoryTheory.Subfunctor F) (h : G ≤ G') (hF : CategoryTheory.Presieve.IsSheaf J F) (hG' : CategoryTheory.Presieve.IsSheaf J G'.toFunctor) : CategoryTheory.Subfunctor.sheafify J G ≤ G' - CategoryTheory.Subfunctor.sheafifyLift 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (f : G.toFunctor ⟶ F') (h : CategoryTheory.Presieve.IsSheaf J F') : (CategoryTheory.Subfunctor.sheafify J G).toFunctor ⟶ F' - CategoryTheory.Subfunctor.isSheaf_iff 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (h : CategoryTheory.Presieve.IsSheaf J F) : CategoryTheory.Presieve.IsSheaf J G.toFunctor ↔ ∀ (U : Cᵒᵖ) (s : F.obj U), G.sieveOfSection s ∈ J (Opposite.unop U) → s ∈ G.obj U - CategoryTheory.Subfunctor.to_sheafifyLift 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (f : G.toFunctor ⟶ F') (h : CategoryTheory.Presieve.IsSheaf J F') : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.homOfLe ⋯) (G.sheafifyLift f h) = f - CategoryTheory.Subfunctor.to_sheafify_lift_unique 📋 Mathlib.CategoryTheory.Sites.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {F F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) (h : CategoryTheory.Presieve.IsSheaf J F') (l₁ l₂ : (CategoryTheory.Subfunctor.sheafify J G).toFunctor ⟶ F') (e : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.homOfLe ⋯) l₁ = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.homOfLe ⋯) l₂) : l₁ = l₂ - CategoryTheory.Presheaf.instIsLocallyInjectiveFunιOpposite 📋 Mathlib.CategoryTheory.Sites.LocallyInjective
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (F : CategoryTheory.Functor Cᵒᵖ (Type w)) (G : CategoryTheory.Subfunctor F) : CategoryTheory.Presheaf.IsLocallyInjective J G.ι - CategoryTheory.Presheaf.isLocallySurjective_iff_range_sheafify_eq_top' 📋 Mathlib.CategoryTheory.Sites.LocallySurjective
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {F G : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ G) : CategoryTheory.Presheaf.IsLocallySurjective J f ↔ CategoryTheory.Subfunctor.sheafify J (CategoryTheory.Subfunctor.range f) = ⊤ - CategoryTheory.Presheaf.isLocallySurjective_iff_range_sheafify_eq_top 📋 Mathlib.CategoryTheory.Sites.LocallySurjective
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {A : Type u'} [CategoryTheory.Category.{v', u'} A] {FA : A → A → Type u_1} {CA : A → Type w'} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] {F G : CategoryTheory.Functor Cᵒᵖ A} (f : F ⟶ G) : CategoryTheory.Presheaf.IsLocallySurjective J f ↔ CategoryTheory.Subfunctor.sheafify J (CategoryTheory.Subfunctor.range (CategoryTheory.Functor.whiskerRight f (CategoryTheory.forget A))) = ⊤ - PresheafOfModules.Submodule.toSubfunctor 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Submodule
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {R : CategoryTheory.Functor Cᵒᵖ RingCat} {M : PresheafOfModules R} (N : M.Submodule) : CategoryTheory.Subfunctor (M.presheaf.comp (CategoryTheory.forget AddCommGrpCat)) - CategoryTheory.Functor.closedSieves 📋 Mathlib.CategoryTheory.Sites.Closed
{C : Type u} [CategoryTheory.Category.{v, u} C] (J₁ : CategoryTheory.GrothendieckTopology C) : CategoryTheory.Subfunctor (CategoryTheory.Functor.sieves C) - CategoryTheory.Subfunctor.ofSection 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {X : Cᵒᵖ} (x : F.obj X) : CategoryTheory.Subfunctor F - CategoryTheory.Subfunctor.ofSection_le_iff 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {X : Cᵒᵖ} (x : F.obj X) (G : CategoryTheory.Subfunctor F) : CategoryTheory.Subfunctor.ofSection x ≤ G ↔ x ∈ G.obj X - CategoryTheory.Subfunctor.ofSection_image 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {X : Cᵒᵖ} (x : F.obj X) {F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ F') : (CategoryTheory.Subfunctor.ofSection x).image f = CategoryTheory.Subfunctor.ofSection ((CategoryTheory.ConcreteCategory.hom (f.app X)) x) - CategoryTheory.Subfunctor.range_eq_ofSection 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v)} {X : C} (f : CategoryTheory.yoneda.obj X ⟶ F) : CategoryTheory.Subfunctor.range f = CategoryTheory.Subfunctor.ofSection (CategoryTheory.yonedaEquiv f) - CategoryTheory.Subfunctor.ofSection_eq_range 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v)} {X : Cᵒᵖ} (x : F.obj X) : CategoryTheory.Subfunctor.ofSection x = CategoryTheory.Subfunctor.range (CategoryTheory.yonedaEquiv.symm x) - CategoryTheory.Subfunctor.ofSection_eq_range' 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type (max v w))} {X : Cᵒᵖ} (x : F.obj X) : CategoryTheory.Subfunctor.ofSection x = CategoryTheory.Subfunctor.range (CategoryTheory.uliftYonedaEquiv.symm x) - CategoryTheory.Subfunctor.range_eq_ofSection' 📋 Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type (max v w))} {X : C} (f : (CategoryTheory.yoneda.obj X).comp CategoryTheory.uliftFunctor.{w, v} ⟶ F) : CategoryTheory.Subfunctor.range f = CategoryTheory.Subfunctor.ofSection (CategoryTheory.uliftYonedaEquiv f) - 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.Subfunctor.equalizer_self 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f : A.toFunctor ⟶ F₂) : CategoryTheory.Subfunctor.equalizer f f = A - CategoryTheory.Subfunctor.equalizer 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Subfunctor F₁ - CategoryTheory.Subfunctor.equalizer.fork 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Limits.Fork f g - CategoryTheory.Subfunctor.equalizer_le 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Subfunctor.equalizer f g ≤ A - CategoryTheory.Subfunctor.instMonoFunctorTypeι_1 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Mono (CategoryTheory.Subfunctor.equalizer.ι f g) - CategoryTheory.Subfunctor.equalizer.forkIsLimit 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Limits.IsLimit (CategoryTheory.Subfunctor.equalizer.fork f g) - CategoryTheory.Subfunctor.equalizer.ι 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : (CategoryTheory.Subfunctor.equalizer f g).toFunctor ⟶ A.toFunctor - CategoryTheory.Subfunctor.equalizer_eq_iff 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.Subfunctor.equalizer f g = A ↔ f = g - CategoryTheory.Subfunctor.equalizer.fork_pt 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : (CategoryTheory.Subfunctor.equalizer.fork f g).pt = (CategoryTheory.Subfunctor.equalizer f g).toFunctor - CategoryTheory.Subfunctor.equalizer.ι_ι 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) A.ι = (CategoryTheory.Subfunctor.equalizer f g).ι - CategoryTheory.Subfunctor.equalizer.fork_ι 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : (CategoryTheory.Subfunctor.equalizer.fork f g).ι = CategoryTheory.Subfunctor.equalizer.ι f g - CategoryTheory.Subfunctor.equalizer.condition 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) g - CategoryTheory.Subfunctor.equalizer.lift 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) (w : CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g) : G ⟶ (CategoryTheory.Subfunctor.equalizer f g).toFunctor - CategoryTheory.Subfunctor.range_le_equalizer_iff 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) : CategoryTheory.Subfunctor.range (CategoryTheory.CategoryStruct.comp φ A.ι) ≤ CategoryTheory.Subfunctor.equalizer f g ↔ CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g - CategoryTheory.Subfunctor.equalizer.ι_ι_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {Z : CategoryTheory.Functor C (Type w)} (h : F₁ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) (CategoryTheory.CategoryStruct.comp A.ι h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer f g).ι h - CategoryTheory.Subfunctor.equalizer.lift_ι 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) (w : CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.lift f g φ w) (CategoryTheory.Subfunctor.equalizer.ι f g) = φ - CategoryTheory.Subfunctor.equalizer.condition_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {Z : CategoryTheory.Functor C (Type w)} (h : F₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) (CategoryTheory.CategoryStruct.comp g h) - CategoryTheory.Subfunctor.equalizer.lift_ι' 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) (w : CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.lift f g φ w) (CategoryTheory.Subfunctor.equalizer f g).ι = CategoryTheory.CategoryStruct.comp φ A.ι - CategoryTheory.Subfunctor.equalizer.lift_ι_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) (w : CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g) {Z : CategoryTheory.Functor C (Type w)} (h : A.toFunctor ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.lift f g φ w) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.ι f g) h) = CategoryTheory.CategoryStruct.comp φ h - CategoryTheory.Subfunctor.equalizer.lift_ι'_assoc 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {G : CategoryTheory.Functor C (Type w)} (φ : G ⟶ A.toFunctor) (w : CategoryTheory.CategoryStruct.comp φ f = CategoryTheory.CategoryStruct.comp φ g) {Z : CategoryTheory.Functor C (Type w)} (h : F₁ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer.lift f g φ w) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subfunctor.equalizer f g).ι h) = CategoryTheory.CategoryStruct.comp φ (CategoryTheory.CategoryStruct.comp A.ι h) - CategoryTheory.Subfunctor.mem_equalizer_iff 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) {i : C} (x : A.toFunctor.obj i) : ↑x ∈ (CategoryTheory.Subfunctor.equalizer f g).obj i ↔ (CategoryTheory.ConcreteCategory.hom (f.app i)) x = (CategoryTheory.ConcreteCategory.hom (g.app i)) x - CategoryTheory.Subfunctor.equalizer_obj 📋 Mathlib.CategoryTheory.Subfunctor.Equalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} {A : CategoryTheory.Subfunctor F₁} (f g : A.toFunctor ⟶ F₂) (U : C) : (CategoryTheory.Subfunctor.equalizer f g).obj U = {x | ∃ (hx : x ∈ A.obj U), (CategoryTheory.ConcreteCategory.hom (f.app U)) ⟨x, hx⟩ = (CategoryTheory.ConcreteCategory.hom (g.app U)) ⟨x, hx⟩} - CategoryTheory.Precoverage.subsheafify 📋 Mathlib.CategoryTheory.Sites.Precoverage.Subsheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (𝒮 : (Z : C) → Set (F.obj (Opposite.op Z))) : CategoryTheory.Subfunctor F - CategoryTheory.Subfunctor.IsFinite 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) : Prop - CategoryTheory.Subfunctor.IsFinite.Index 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) [hG : G.IsFinite] : Type - CategoryTheory.Subfunctor.IsFinite.instFiniteIndex 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) [hG : G.IsFinite] : Finite (CategoryTheory.Subfunctor.IsFinite.Index G) - CategoryTheory.Subfunctor.IsFinite.X 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} [hG : G.IsFinite] : CategoryTheory.Subfunctor.IsFinite.Index G → Cᵒᵖ - CategoryTheory.Subfunctor.IsGeneratedBy 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {ι : Type w'} {X : ι → Cᵒᵖ} (x : (i : ι) → F.obj (X i)) : Prop - CategoryTheory.Subfunctor.IsFinite.x 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} [hG : G.IsFinite] (i : CategoryTheory.Subfunctor.IsFinite.Index G) : F.obj (CategoryTheory.Subfunctor.IsFinite.X i) - CategoryTheory.Subfunctor.isGeneratedBy_of_isFinite 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) [hG : G.IsFinite] : G.IsGeneratedBy CategoryTheory.Subfunctor.IsFinite.x - CategoryTheory.Subfunctor.IsGeneratedBy.isFinite 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {ι : Type w'} [Finite ι] {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) : G.IsFinite - CategoryTheory.Subfunctor.IsFinite.exists_isGeneratedBy 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} [self : G.IsFinite] : ∃ ι, ∃ (_ : Finite ι), ∃ X x, Nonempty (G.IsGeneratedBy x) - CategoryTheory.Subfunctor.IsFinite.mk 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} (exists_isGeneratedBy : ∃ ι, ∃ (_ : Finite ι), ∃ X x, Nonempty (G.IsGeneratedBy x)) : G.IsFinite - CategoryTheory.Subfunctor.image_isFinite 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) [G.IsFinite] {F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ F') : (G.image f).IsFinite - CategoryTheory.Subfunctor.IsGeneratedBy.ofSection_le 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} {ι : Type w'} {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) (i : ι) : CategoryTheory.Subfunctor.ofSection (x i) ≤ G - CategoryTheory.Subfunctor.IsGeneratedBy.mem 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} {ι : Type w'} {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) (i : ι) : x i ∈ G.obj (X i) - CategoryTheory.Subfunctor.IsGeneratedBy.iSup_eq 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} {ι : Type w'} {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) : ⨆ i, CategoryTheory.Subfunctor.ofSection (x i) = G - CategoryTheory.Subfunctor.IsGeneratedBy.of_equiv 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} {ι : Type w'} {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) {ι' : Type w''} (e : ι' ≃ ι) : G.IsGeneratedBy fun i' => x (e i') - CategoryTheory.Subfunctor.isGeneratedBy_iff 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} (G : CategoryTheory.Subfunctor F) {ι : Type w'} {X : ι → Cᵒᵖ} (x : (i : ι) → F.obj (X i)) : G.IsGeneratedBy x ↔ ⨆ i, CategoryTheory.Subfunctor.ofSection (x i) = G - CategoryTheory.Subfunctor.IsGeneratedBy.image 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {G : CategoryTheory.Subfunctor F} {ι : Type w'} {X : ι → Cᵒᵖ} {x : (i : ι) → F.obj (X i)} (h : G.IsGeneratedBy x) {F' : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ F') : (G.image f).IsGeneratedBy fun i => (CategoryTheory.ConcreteCategory.hom (f.app (X i))) (x i) - CategoryTheory.presheafIsGeneratedBy_of_isFinite 📋 Mathlib.CategoryTheory.Subfunctor.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type w)) [CategoryTheory.PresheafIsFinite F] : CategoryTheory.PresheafIsGeneratedBy F CategoryTheory.Subfunctor.IsFinite.x - CategoryTheory.SubmonoidFunctor.toSubfunctor 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) : CategoryTheory.Subfunctor (M.comp (CategoryTheory.forget MonCat)) - CategoryTheory.Subfunctor.equivalenceMonoOver 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Subfunctor F ≌ CategoryTheory.MonoOver F - CategoryTheory.Subfunctor.orderIsoSubobject 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Subfunctor F ≃o CategoryTheory.Subobject F - CategoryTheory.Subfunctor.range_subobjectMk_ι 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (A : CategoryTheory.Subfunctor F) : CategoryTheory.Subfunctor.range (CategoryTheory.Subobject.mk A.ι).arrow = A - CategoryTheory.Subfunctor.equivalenceMonoOver_functor_obj 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (A : CategoryTheory.Subfunctor F) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).functor.obj A = CategoryTheory.MonoOver.mk A.ι - CategoryTheory.Subfunctor.equivalenceMonoOver_inverse_obj 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.MonoOver F) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).inverse.obj X = CategoryTheory.Subfunctor.range X.arrow - CategoryTheory.Subfunctor.orderIsoSubobject_apply 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (A : CategoryTheory.Subfunctor F) : (CategoryTheory.Subfunctor.orderIsoSubobject F) A = CategoryTheory.Subobject.mk A.ι - CategoryTheory.Subfunctor.equivalenceMonoOver_functor_map 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {A B : CategoryTheory.Subfunctor F} (f : A ⟶ B) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).functor.map f = CategoryTheory.MonoOver.homMk (CategoryTheory.Subfunctor.homOfLe ⋯) ⋯ - CategoryTheory.Subfunctor.orderIsoSubobject_symm_apply 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Subobject F) : (RelIso.symm (CategoryTheory.Subfunctor.orderIsoSubobject F)) X = CategoryTheory.Subfunctor.range X.arrow - CategoryTheory.Subfunctor.equivalenceMonoOver_inverse_map 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X Y : CategoryTheory.MonoOver F} (f : X ⟶ Y) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).inverse.map f = CategoryTheory.homOfLE ⋯ - CategoryTheory.Subfunctor.equivalenceMonoOver_unitIso 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.eqToIso ⋯) ⋯ - CategoryTheory.Subfunctor.equivalenceMonoOver_counitIso 📋 Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.MonoOver.isoMk (CategoryTheory.asIso (CategoryTheory.Subfunctor.toRange X.arrow)).symm ⋯) ⋯
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