Loogle!
Result
Found 122 declarations mentioning CategoryTheory.Limits.PreservesFiniteProducts.
- CategoryTheory.Limits.PreservesFiniteProducts 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Prop - CategoryTheory.Limits.instPreservesFiniteProductsOfPreservesFiniteLimits 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteLimits F] : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Limits.instPreservesLimitsOfShapeDiscreteOfFiniteOfPreservesFiniteProducts 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (J : Type u) [Finite J] [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete J) F - CategoryTheory.Limits.PreservesFiniteProducts.mk 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} (preserves : ∀ (n : ℕ), CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete (Fin n)) F) : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Limits.PreservesFiniteProducts.preserves 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {F : CategoryTheory.Functor C D} [self : CategoryTheory.Limits.PreservesFiniteProducts F] (n : ℕ) : CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete (Fin n)) F - CategoryTheory.Limits.reflectsFiniteProducts_of_reflectsIsomorphisms 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.ReflectsIsomorphisms] [CategoryTheory.Limits.HasFiniteProducts C] [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.ReflectsFiniteProducts F - CategoryTheory.Limits.comp_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) [CategoryTheory.Limits.PreservesFiniteProducts F] [CategoryTheory.Limits.PreservesFiniteProducts G] : CategoryTheory.Limits.PreservesFiniteProducts (F.comp G) - CategoryTheory.Limits.preservesFiniteProducts_of_reflects_of_preserves 📋 Mathlib.CategoryTheory.Limits.Preserves.Finite
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp G)] [CategoryTheory.Limits.ReflectsFiniteProducts G] : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Functor.preservesFiniteProductsOfAdditive 📋 Mathlib.CategoryTheory.Preadditive.AdditiveFunctor
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D) [F.Additive] : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Limits.PreservesFiniteProducts.of_preserves_binary_and_terminal 📋 Mathlib.CategoryTheory.Limits.Constructions.FiniteProductsOfBinaryProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete CategoryTheory.Limits.WalkingPair) F] [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) F] [CategoryTheory.Limits.HasFiniteProducts C] : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Functor.Monoidal.instPreservesFiniteProducts 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Monoidal] : CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Functor.Monoidal.ofChosenFiniteProducts 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteProducts F] : F.Monoidal - CategoryTheory.Functor.Monoidal.nonempty_monoidal_iff_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) : Nonempty F.Monoidal ↔ CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Functor.Braided.ofChosenFiniteProducts 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] [CategoryTheory.BraidedCategory C] [CategoryTheory.BraidedCategory D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteProducts F] : F.Braided - CategoryTheory.Functor.OplaxMonoidal.instIsIsoη 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.OplaxMonoidal] [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.IsIso (CategoryTheory.Functor.OplaxMonoidal.η F) - CategoryTheory.Functor.OplaxMonoidal.instIsIsoδ 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.OplaxMonoidal] [CategoryTheory.Limits.PreservesFiniteProducts F] (X Y : C) : CategoryTheory.IsIso (CategoryTheory.Functor.OplaxMonoidal.δ F X Y) - CategoryTheory.Functor.Monoidal.ε_of_cartesianMonoidalCategory 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Monoidal] [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Functor.LaxMonoidal.ε F = (CategoryTheory.CartesianMonoidalCategory.preservesTerminalIso F).inv - CategoryTheory.Functor.Monoidal.μ_of_cartesianMonoidalCategory 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Monoidal] [CategoryTheory.Limits.PreservesFiniteProducts F] (X Y : C) : CategoryTheory.Functor.LaxMonoidal.μ F X Y = (CategoryTheory.CartesianMonoidalCategory.prodComparisonIso F X Y).inv - CategoryTheory.Functor.EssImageSubcategory.tensor_obj 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Full] [F.Faithful] [CategoryTheory.Limits.PreservesFiniteProducts F] (X Y : F.EssImageSubcategory) : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj = CategoryTheory.MonoidalCategoryStruct.tensorObj X.obj Y.obj - CategoryTheory.Functor.EssImageSubcategory.toUnit_def 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Full] [F.Faithful] [CategoryTheory.Limits.PreservesFiniteProducts F] (X : F.EssImageSubcategory) : CategoryTheory.SemiCartesianMonoidalCategory.toUnit X = CategoryTheory.ObjectProperty.homMk (CategoryTheory.SemiCartesianMonoidalCategory.toUnit X.obj) - CategoryTheory.Functor.EssImageSubcategory.lift_def 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Full] [F.Faithful] [CategoryTheory.Limits.PreservesFiniteProducts F] {T X Y : F.EssImageSubcategory} (f : T ⟶ X) (g : T ⟶ Y) : CategoryTheory.CartesianMonoidalCategory.lift f g = CategoryTheory.ObjectProperty.homMk (CategoryTheory.CartesianMonoidalCategory.lift f.hom g.hom) - CategoryTheory.Functor.EssImageSubcategory.associator_hom_def 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Full] [F.Faithful] [CategoryTheory.Limits.PreservesFiniteProducts F] (X Y Z : F.EssImageSubcategory) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).hom = CategoryTheory.ObjectProperty.homMk (CategoryTheory.MonoidalCategoryStruct.associator X.obj Y.obj Z.obj).hom - CategoryTheory.Functor.EssImageSubcategory.associator_inv_def 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.CartesianMonoidalCategory D] (F : CategoryTheory.Functor C D) [F.Full] [F.Faithful] [CategoryTheory.Limits.PreservesFiniteProducts F] (X Y Z : F.EssImageSubcategory) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).inv = CategoryTheory.ObjectProperty.homMk (CategoryTheory.MonoidalCategoryStruct.associator X.obj Y.obj Z.obj).inv - CategoryTheory.Limits.preservesFiniteLimits_of_preservesEqualizers_and_finiteProducts 📋 Mathlib.CategoryTheory.Limits.Constructions.LimitsOfProductsAndEqualizers
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Limits.HasEqualizers C] [CategoryTheory.Limits.HasFiniteProducts C] (G : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingParallelPair G] [CategoryTheory.Limits.PreservesFiniteProducts G] : CategoryTheory.Limits.PreservesFiniteLimits G - CategoryTheory.Functor.Monoidal.tensorObjComp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.FunctorCategory
{C : Type u_2} {D : Type u_3} {E : Type u_4} [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Category.{v_4, u_4} E] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.CartesianMonoidalCategory E] (F G : CategoryTheory.Functor D C) (H : CategoryTheory.Functor C E) [CategoryTheory.Limits.PreservesFiniteProducts H] : (CategoryTheory.MonoidalCategoryStruct.tensorObj F G).comp H ≅ CategoryTheory.MonoidalCategoryStruct.tensorObj (F.comp H) (G.comp H) - CategoryTheory.Functor.Monoidal.tensorObjComp_hom_app 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.FunctorCategory
{C : Type u_2} {D : Type u_3} {E : Type u_4} [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Category.{v_4, u_4} E] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.CartesianMonoidalCategory E] (F G : CategoryTheory.Functor D C) (H : CategoryTheory.Functor C E) [CategoryTheory.Limits.PreservesFiniteProducts H] (X : D) : (CategoryTheory.Functor.Monoidal.tensorObjComp F G H).hom.app X = CategoryTheory.CartesianMonoidalCategory.prodComparison H (F.obj X) (G.obj X) - CategoryTheory.Functor.Monoidal.tensorObjComp_inv_app 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.FunctorCategory
{C : Type u_2} {D : Type u_3} {E : Type u_4} [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Category.{v_4, u_4} E] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.CartesianMonoidalCategory E] (F G : CategoryTheory.Functor D C) (H : CategoryTheory.Functor C E) [CategoryTheory.Limits.PreservesFiniteProducts H] (X : D) : (CategoryTheory.Functor.Monoidal.tensorObjComp F G H).inv.app X = (CategoryTheory.CartesianMonoidalCategory.prodComparisonIso H (F.obj X) (G.obj X)).inv - CategoryTheory.IsSifted.colim_preservesFiniteProducts_of_isSifted 📋 Mathlib.CategoryTheory.Limits.Sifted
{C : Type u} [CategoryTheory.SmallCategory C] [CategoryTheory.IsSifted C] : CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim - CategoryTheory.IsSifted.isSiftedOrEmpty_of_colim_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Limits.Sifted
(C : Type u) [CategoryTheory.SmallCategory C] [h : CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim] : CategoryTheory.IsSiftedOrEmpty C - CategoryTheory.IsSifted.of_colim_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Limits.Sifted
(C : Type u) [CategoryTheory.SmallCategory C] [h : CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim] : CategoryTheory.IsSifted C - CategoryTheory.Limits.preservesFiniteCoproducts_op 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.PreservesFiniteCoproducts F.op - CategoryTheory.Limits.preservesFiniteProducts_op 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteCoproducts F] : CategoryTheory.Limits.PreservesFiniteProducts F.op - CategoryTheory.Limits.preservesFiniteCoproducts_leftOp 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C Dᵒᵖ) [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.PreservesFiniteCoproducts F.leftOp - CategoryTheory.Limits.preservesFiniteCoproducts_rightOp 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor Cᵒᵖ D) [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.PreservesFiniteCoproducts F.rightOp - CategoryTheory.Limits.preservesFiniteProducts_leftOp 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C Dᵒᵖ) [CategoryTheory.Limits.PreservesFiniteCoproducts F] : CategoryTheory.Limits.PreservesFiniteProducts F.leftOp - CategoryTheory.Limits.preservesFiniteProducts_rightOp 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor Cᵒᵖ D) [CategoryTheory.Limits.PreservesFiniteCoproducts F] : CategoryTheory.Limits.PreservesFiniteProducts F.rightOp - CategoryTheory.Limits.preservesFiniteCoproducts_unop 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor Cᵒᵖ Dᵒᵖ) [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Limits.PreservesFiniteCoproducts F.unop - CategoryTheory.Limits.preservesFiniteProducts_unop 📋 Mathlib.CategoryTheory.Limits.Preserves.Opposites
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor Cᵒᵖ Dᵒᵖ) [CategoryTheory.Limits.PreservesFiniteCoproducts F] : CategoryTheory.Limits.PreservesFiniteProducts F.unop - CommRingCat.Under.instPreservesFiniteProductsUnderTensorProd 📋 Mathlib.Algebra.Category.Ring.Under.Limits
{R S : CommRingCat} [Algebra ↑R ↑S] : CategoryTheory.Limits.PreservesFiniteProducts (R.tensorProd S) - CommRingCat.Under.instPreservesFiniteProductsUnderPushout 📋 Mathlib.Algebra.Category.Ring.Under.Limits
{R S : CommRingCat} (f : R ⟶ S) : CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.Under.pushout f) - RingHom.HasFiniteProducts.preservesFiniteProducts_pushout 📋 Mathlib.Algebra.Category.Ring.Under.Property
{Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop} (hQi : RingHom.RespectsIso fun {R S} [CommRing R] [CommRing S] => Q) (hQp : RingHom.HasFiniteProducts fun {R S} [CommRing R] [CommRing S] => Q) [(RingHom.toMorphismProperty fun {R S} [CommRing R] [CommRing S] => Q).IsStableUnderCobaseChange] {R S : CommRingCat} (f : R ⟶ S) : CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.MorphismProperty.Under.pushout (RingHom.toMorphismProperty fun {R S} [CommRing R] [CommRing S] => Q) ⊤ f) - CategoryTheory.hoFunctor.preservesFiniteProducts 📋 Mathlib.AlgebraicTopology.SimplicialSet.NerveAdjunction
: CategoryTheory.Limits.PreservesFiniteProducts SSet.hoFunctor - CategoryTheory.PreGaloisCategory.instPreservesFiniteProductsActionFintypeCatAutFunctorFunctorToAction 📋 Mathlib.CategoryTheory.Galois.Action
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (F : CategoryTheory.Functor C FintypeCat) [CategoryTheory.GaloisCategory C] [CategoryTheory.PreGaloisCategory.FiberFunctor F] : CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.PreGaloisCategory.functorToAction F) - CategoryTheory.Localization.instPreservesFiniteProductsLocalizationQ 📋 Mathlib.CategoryTheory.Localization.FiniteProducts
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (W : CategoryTheory.MorphismProperty C) [W.ContainsIdentities] [CategoryTheory.Limits.HasFiniteProducts C] [W.IsStableUnderFiniteProducts] : CategoryTheory.Limits.PreservesFiniteProducts W.Q - CategoryTheory.Localization.preservesFiniteProducts 📋 Mathlib.CategoryTheory.Localization.FiniteProducts
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (L : CategoryTheory.Functor C D) (W : CategoryTheory.MorphismProperty C) [L.IsLocalization W] [W.ContainsIdentities] [CategoryTheory.Limits.HasFiniteProducts C] [W.IsStableUnderFiniteProducts] : CategoryTheory.Limits.PreservesFiniteProducts L - CategoryTheory.Localization.instPreservesFiniteProductsLocalization'Q' 📋 Mathlib.CategoryTheory.Localization.FiniteProducts
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (W : CategoryTheory.MorphismProperty C) [W.ContainsIdentities] [CategoryTheory.Limits.HasFiniteProducts C] [W.IsStableUnderFiniteProducts] [W.HasLocalization] : CategoryTheory.Limits.PreservesFiniteProducts W.Q' - CategoryTheory.Limits.PreservesFiniteProducts.of_exponentialIdeal 📋 Mathlib.CategoryTheory.Monoidal.Closed.Ideal
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] (i : CategoryTheory.Functor D C) [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.Reflective i] [CategoryTheory.MonoidalClosed C] [CategoryTheory.CartesianMonoidalCategory D] [CategoryTheory.ExponentialIdeal i] [CategoryTheory.BraidedCategory C] : CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.reflector i) - CategoryTheory.Presieve.isSheaf_iff_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.FinitaryPreExtensive C] [CategoryTheory.FinitaryExtensive C] (F : CategoryTheory.Functor Cᵒᵖ (Type w)) : CategoryTheory.Presieve.IsSheaf (CategoryTheory.extensiveTopology C) F ↔ CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.isSheafFor_extensive_of_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.FinitaryPreExtensive C] {X : C} (S : CategoryTheory.Presieve X) [S.Extensive] (F : CategoryTheory.Functor Cᵒᵖ (Type w)) [CategoryTheory.Limits.PreservesFiniteProducts F] : CategoryTheory.Presieve.IsSheafFor F S - CategoryTheory.Presheaf.isSheaf_iff_preservesFiniteProducts 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.FinitaryPreExtensive C] [CategoryTheory.FinitaryExtensive C] (F : CategoryTheory.Functor Cᵒᵖ D) : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.extensiveTopology C) F ↔ CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.instPreservesFiniteProductsOppositeObjFunctorIsSheafExtensiveTopology 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveSheaves
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.FinitaryPreExtensive C] [CategoryTheory.FinitaryExtensive C] (F : CategoryTheory.Sheaf (CategoryTheory.extensiveTopology C) D) : CategoryTheory.Limits.PreservesFiniteProducts F.obj - CategoryTheory.Presheaf.instHasSheafComposeCoherentTopologyOfProjectiveOfPreservesFiniteProducts 📋 Mathlib.CategoryTheory.Sites.Coherent.SheafComparison
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A : Type u₃} [CategoryTheory.Category.{v₃, u₃} A] {B : Type u₄} [CategoryTheory.Category.{v₄, u₄} B] (s : CategoryTheory.Functor A B) [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] [∀ (X : C), CategoryTheory.Projective X] [CategoryTheory.Limits.PreservesFiniteProducts s] : (CategoryTheory.coherentTopology C).HasSheafCompose s - CategoryTheory.Presheaf.isSheaf_iff_preservesFiniteProducts_of_projective 📋 Mathlib.CategoryTheory.Sites.Coherent.SheafComparison
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A : Type u₃} [CategoryTheory.Category.{v₃, u₃} A] (F : CategoryTheory.Functor Cᵒᵖ A) [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] [∀ (X : C), CategoryTheory.Projective X] : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.coherentTopology C) F ↔ CategoryTheory.Limits.PreservesFiniteProducts F - CategoryTheory.Presheaf.instPreservesFiniteProductsOppositeObjFunctorIsSheafCoherentTopology 📋 Mathlib.CategoryTheory.Sites.Coherent.SheafComparison
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A : Type u₃} [CategoryTheory.Category.{v₃, u₃} A] [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] (F : CategoryTheory.Sheaf (CategoryTheory.coherentTopology C) A) : CategoryTheory.Limits.PreservesFiniteProducts F.obj - CategoryTheory.Presheaf.isSheaf_iff_preservesFiniteProducts_and_equalizerCondition 📋 Mathlib.CategoryTheory.Sites.Coherent.SheafComparison
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A : Type u₃} [CategoryTheory.Category.{v₃, u₃} A] (F : CategoryTheory.Functor Cᵒᵖ A) [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] [h : ∀ {Y X : C} (f : Y ⟶ X) [CategoryTheory.EffectiveEpi f], CategoryTheory.Limits.HasPullback f f] : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.coherentTopology C) F ↔ CategoryTheory.Limits.PreservesFiniteProducts F ∧ CategoryTheory.regularTopology.EqualizerCondition F - CategoryTheory.Presheaf.isSheaf_coherent_of_projective_comp 📋 Mathlib.CategoryTheory.Sites.Coherent.SheafComparison
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A : Type u₃} [CategoryTheory.Category.{v₃, u₃} A] (F : CategoryTheory.Functor Cᵒᵖ A) {B : Type u₄} [CategoryTheory.Category.{v₄, u₄} B] (s : CategoryTheory.Functor A B) [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] [∀ (X : C), CategoryTheory.Projective X] [CategoryTheory.Limits.PreservesFiniteProducts s] (hF : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.coherentTopology C) F) : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.coherentTopology C) (F.comp s) - CategoryTheory.instPreservesFiniteProductsFunctorColimOfPreadditive 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveColimits
{A : Type u_1} {J : Type u_3} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_3, u_3} J] [CategoryTheory.Limits.HasColimitsOfShape J A] [CategoryTheory.Preadditive A] : CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim - CategoryTheory.instPreservesColimitsOfShapeSheafExtensiveTopologyFunctorOppositeSheafToPresheafOfPreservesFiniteProductsColim 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveColimits
{A : Type u_1} {C : Type u_2} {J : Type u_3} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Category.{v_3, u_3} J] [CategoryTheory.FinitaryExtensive C] [CategoryTheory.Limits.HasColimitsOfShape J A] [CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim] : CategoryTheory.Limits.PreservesColimitsOfShape J (CategoryTheory.sheafToPresheaf (CategoryTheory.extensiveTopology C) A) - CategoryTheory.isSheaf_pointwiseColimit 📋 Mathlib.CategoryTheory.Sites.Coherent.ExtensiveColimits
{A : Type u_1} {C : Type u_2} {J : Type u_3} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Category.{v_3, u_3} J] [CategoryTheory.FinitaryExtensive C] [CategoryTheory.Limits.HasColimitsOfShape J A] [CategoryTheory.Limits.PreservesFiniteProducts CategoryTheory.Limits.colim] (G : CategoryTheory.Functor J (CategoryTheory.Sheaf (CategoryTheory.extensiveTopology C) A)) : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.extensiveTopology C) (CategoryTheory.Limits.pointwiseCocone (G.comp (CategoryTheory.sheafToPresheaf (CategoryTheory.extensiveTopology C) A))).pt - CategoryTheory.regularTopology.isLocallySurjective_sheaf_of_types 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preregular C] [CategoryTheory.FinitaryPreExtensive C] {F G : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ G) [CategoryTheory.Limits.PreservesFiniteProducts F] [CategoryTheory.Limits.PreservesFiniteProducts G] (h : CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.coherentTopology C) f) : CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.regularTopology C) f - CategoryTheory.coherentTopology.presheafIsLocallySurjective_iff 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} (D : Type u_2) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {FD : D → D → Type u_3} {CD : D → Type w} [(X Y : D) → FunLike (FD X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory D FD] {F G : CategoryTheory.Functor Cᵒᵖ D} (f : F ⟶ G) [CategoryTheory.Preregular C] [CategoryTheory.FinitaryPreExtensive C] [CategoryTheory.Limits.PreservesFiniteProducts F] [CategoryTheory.Limits.PreservesFiniteProducts G] [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget D)] : CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.coherentTopology C) f ↔ CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.regularTopology C) f - CategoryTheory.extensiveTopology.surjective_of_isLocallySurjective_sheaf_of_types 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.FinitaryPreExtensive C] {F G : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : F ⟶ G) [CategoryTheory.Limits.PreservesFiniteProducts F] [CategoryTheory.Limits.PreservesFiniteProducts G] (h : CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.extensiveTopology C) f) {X : C} : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op X))) - CategoryTheory.extensiveTopology.presheafIsLocallySurjective_iff 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} (D : Type u_2) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {FD : D → D → Type u_3} {CD : D → Type w} [(X Y : D) → FunLike (FD X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory D FD] [CategoryTheory.FinitaryPreExtensive C] {F G : CategoryTheory.Functor Cᵒᵖ D} (f : F ⟶ G) [CategoryTheory.Limits.PreservesFiniteProducts F] [CategoryTheory.Limits.PreservesFiniteProducts G] [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget D)] : CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.extensiveTopology C) f ↔ ∀ (X : C), Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op X))) - CategoryTheory.coherentTopology.isLocallySurjective_iff 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} (D : Type u_2) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {FD : D → D → Type u_3} {CD : D → Type w} [(X Y : D) → FunLike (FD X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory D FD] [CategoryTheory.Preregular C] [CategoryTheory.FinitaryExtensive C] {F G : CategoryTheory.Sheaf (CategoryTheory.coherentTopology C) D} (f : F ⟶ G) [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget D)] : CategoryTheory.Sheaf.IsLocallySurjective f ↔ CategoryTheory.Presheaf.IsLocallySurjective (CategoryTheory.regularTopology C) f.hom - CategoryTheory.extensiveTopology.isLocallySurjective_iff 📋 Mathlib.CategoryTheory.Sites.Coherent.LocallySurjective
{C : Type u_1} (D : Type u_2) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {FD : D → D → Type u_3} {CD : D → Type w} [(X Y : D) → FunLike (FD X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory D FD] [CategoryTheory.FinitaryExtensive C] {F G : CategoryTheory.Sheaf (CategoryTheory.extensiveTopology C) D} (f : F ⟶ G) [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget D)] : CategoryTheory.Sheaf.IsLocallySurjective f ↔ ∀ (X : C), Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op X))) - instPreservesFiniteCoproductsSheafTypeUliftYonedaOfPreservesFiniteProductsOppositeObjFunctorIsSheaf 📋 Mathlib.CategoryTheory.Sites.PreservesLimits
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} [J.Subcanonical] [∀ (X : CategoryTheory.Sheaf J (Type (max v v'))), CategoryTheory.Limits.PreservesFiniteProducts X.obj] : CategoryTheory.Limits.PreservesFiniteCoproducts (CategoryTheory.GrothendieckTopology.uliftYoneda.{v', v, u} J) - instPreservesFiniteCoproductsSheafTypeYonedaOfPreservesFiniteProductsOppositeObjFunctorIsSheaf 📋 Mathlib.CategoryTheory.Sites.PreservesLimits
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} [J.Subcanonical] [∀ (X : CategoryTheory.Sheaf J (Type v)), CategoryTheory.Limits.PreservesFiniteProducts X.obj] : CategoryTheory.Limits.PreservesFiniteCoproducts J.yoneda - ContinuousMap.instPreservesFiniteProductsOppositeTopCatYonedaPresheaf' 📋 Mathlib.Topology.Category.TopCat.Yoneda
(Y : Type w') [TopologicalSpace Y] : CategoryTheory.Limits.PreservesFiniteProducts (ContinuousMap.yonedaPresheaf' Y) - instPreservesFiniteProductsOppositeYonedaPresheafOfPreservesFiniteCoproductsTopCat 📋 Mathlib.Condensed.TopComparison
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C TopCat) (X : Type w') [TopologicalSpace X] [CategoryTheory.Limits.PreservesFiniteCoproducts G] : CategoryTheory.Limits.PreservesFiniteProducts (ContinuousMap.yonedaPresheaf G X) - CompHausLike.isIsoSigmaComparison 📋 Mathlib.Topology.Category.CompHausLike.SigmaComparison
{P : TopCat → Prop} [CompHausLike.HasExplicitFiniteCoproducts P] (X : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts X] {α : Type u} [Finite α] (σ : α → Type u) [(a : α) → TopologicalSpace (σ a)] [∀ (a : α), CompactSpace (σ a)] [∀ (a : α), T2Space (σ a)] [∀ (a : α), CompHausLike.HasProp P (σ a)] : CategoryTheory.IsIso (CompHausLike.sigmaComparison X σ) - CompHausLike.sigmaComparison_eq_comp_isos 📋 Mathlib.Topology.Category.CompHausLike.SigmaComparison
{P : TopCat → Prop} [CompHausLike.HasExplicitFiniteCoproducts P] (X : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts X] {α : Type u} [Finite α] (σ : α → Type u) [(a : α) → TopologicalSpace (σ a)] [∀ (a : α), CompactSpace (σ a)] [∀ (a : α), T2Space (σ a)] [∀ (a : α), CompHausLike.HasProp P (σ a)] : CompHausLike.sigmaComparison X σ = CategoryTheory.CategoryStruct.comp (X.mapIso (CategoryTheory.Limits.opCoproductIsoProduct' (CompHausLike.finiteCoproduct.isColimit fun a => CompHausLike.of P (σ a)) (CategoryTheory.Limits.productIsProduct fun x => Opposite.op (CompHausLike.of P (σ x))))).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PreservesProduct.iso X fun a => Opposite.op (CompHausLike.of P (σ a))).hom (CategoryTheory.Limits.Types.productIso fun a => X.obj (Opposite.op (CompHausLike.of P (σ a)))).hom) - CompHausLike.LocallyConstant.counitAppApp 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] [CompHausLike.HasProp P PUnit.{u + 1}] (S : CompHausLike P) (Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts Y] [CompHausLike.HasExplicitFiniteCoproducts P] : LocallyConstant (↑S.toTop) (Y.obj (Opposite.op (CompHausLike.of P PUnit.{u + 1}))) ⟶ Y.obj (Opposite.op S) - CompHausLike.LocallyConstant.counitApp 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] [CompHausLike.HasProp P PUnit.{u + 1}] [CompHausLike.HasExplicitFiniteCoproducts P] (Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts Y] : CompHausLike.LocallyConstant.functorToPresheaves.obj (Y.obj (Opposite.op (CompHausLike.of P PUnit.{u + 1}))) ⟶ Y - CompHausLike.LocallyConstant.counitApp_app 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] [CompHausLike.HasProp P PUnit.{u + 1}] [CompHausLike.HasExplicitFiniteCoproducts P] (Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts Y] (x✝ : (CompHausLike P)ᵒᵖ) : (CompHausLike.LocallyConstant.counitApp Y).app x✝ = CompHausLike.LocallyConstant.counitAppApp (Opposite.unop x✝) Y - CompHausLike.LocallyConstant.incl_of_counitAppApp 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] {S : CompHausLike P} {Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))} [CompHausLike.HasProp P PUnit.{u + 1}] (f : LocallyConstant (↑S.toTop) (Y.obj (Opposite.op (CompHausLike.of P PUnit.{u + 1})))) [CategoryTheory.Limits.PreservesFiniteProducts Y] [CompHausLike.HasExplicitFiniteCoproducts P] (a : Function.Fiber ⇑f) : (CategoryTheory.ConcreteCategory.hom (Y.map (CompHausLike.LocallyConstant.sigmaIncl f a).op)) ((CategoryTheory.ConcreteCategory.hom (CompHausLike.LocallyConstant.counitAppApp S Y)) f) = CompHausLike.LocallyConstant.counitAppAppImage f a - CompHausLike.LocallyConstant.presheaf_ext 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] {S : CompHausLike P} {Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))} [CompHausLike.HasProp P PUnit.{u + 1}] (f : LocallyConstant (↑S.toTop) (Y.obj (Opposite.op (CompHausLike.of P PUnit.{u + 1})))) (X : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))) [CategoryTheory.Limits.PreservesFiniteProducts X] (x y : X.obj (Opposite.op S)) [CompHausLike.HasExplicitFiniteCoproducts P] (h : ∀ (a : Function.Fiber ⇑f), (CategoryTheory.ConcreteCategory.hom (X.map (CompHausLike.LocallyConstant.sigmaIncl f a).op)) x = (CategoryTheory.ConcreteCategory.hom (X.map (CompHausLike.LocallyConstant.sigmaIncl f a).op)) y) : x = y - Condensed.instPreservesLimitsOfShapeOppositeProfiniteDiscreteCarrierToTopTotallyDisconnectedSpaceOfFinite 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete ↑X.toTop) F - LightCondensed.instPreservesLimitsOfShapeOppositeLightProfiniteDiscreteObjFinite 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCat) : CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete X.obj) F - Condensed.isoFinYoneda 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] : FintypeCat.toProfinite.op.comp F ≅ Condensed.finYoneda F - LightCondensed.isoFinYoneda 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] : FintypeCat.toLightProfinite.op.comp F ≅ LightCondensed.finYoneda F - Condensed.isoFinYonedaComponents 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : F.obj (Opposite.op X) ≅ ↑X.toTop → F.obj (Opposite.op (Profinite.of PUnit.{u + 1})) - LightCondensed.isoFinYonedaComponents 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : LightProfinite) [Finite ↑X.toTop] : F.obj (Opposite.op X) ≅ ↑X.toTop → F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1})) - LightCondensed.isoLocallyConstantOfIsColimit 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : (S : LightProfinite) → CategoryTheory.Limits.IsColimit (F.mapCocone (CategoryTheory.Limits.coconeRightOpOfCone S.asLimitCone))) : F ≅ LightCondensed.locallyConstantPresheaf (F.obj (FintypeCat.toLightProfinite.op.obj (Opposite.op (FintypeCat.of PUnit.{u + 1})))) - LightCondensed.isoLocallyConstantOfIsColimit_inv 📋 Mathlib.Condensed.Discrete.Colimit
(X : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts X] (hX : (S : LightProfinite) → CategoryTheory.Limits.IsColimit (X.mapCocone (CategoryTheory.Limits.coconeRightOpOfCone S.asLimitCone))) : (LightCondensed.isoLocallyConstantOfIsColimit X hX).inv = CompHausLike.LocallyConstant.counitApp X - Condensed.isoLocallyConstantOfIsColimit 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : (S : Profinite) → CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) : F ≅ Condensed.locallyConstantPresheaf (F.obj (FintypeCat.toProfinite.op.obj (Opposite.op (FintypeCat.of PUnit.{u + 1})))) - Condensed.isoFinYonedaComponents_hom 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : (Condensed.isoFinYonedaComponents F X).hom = TypeCat.ofHom fun y x => (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (Profinite.of PUnit.{u + 1}) x).op)) y - Condensed.isoLocallyConstantOfIsColimit_inv 📋 Mathlib.Condensed.Discrete.Colimit
(X : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts X] (hX : (S : Profinite) → CategoryTheory.Limits.IsColimit (X.mapCocone S.asLimitCone.op)) : (Condensed.isoLocallyConstantOfIsColimit X hX).inv = CompHausLike.LocallyConstant.counitApp X - Condensed.isoFinYonedaComponents_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] (y : F.obj (Opposite.op X)) (x : ↑X.toTop) : (CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F X).hom) y x = (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (Profinite.of PUnit.{u + 1}) x).op)) y - LightCondensed.isoFinYonedaComponents_hom 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : LightProfinite) [Finite ↑X.toTop] : (LightCondensed.isoFinYonedaComponents F X).hom = TypeCat.ofHom fun y x => (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (LightProfinite.of PUnit.{u + 1}) x).op)) y - LightCondensed.isoFinYonedaComponents_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : LightProfinite) [Finite ↑X.toTop] (y : F.obj (Opposite.op X)) (x : ↑X.toTop) : (CategoryTheory.ConcreteCategory.hom (LightCondensed.isoFinYonedaComponents F X).hom) y x = (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (LightProfinite.of PUnit.{u + 1}) x).op)) y - Condensed.isoFinYonedaComponents_inv_comp 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] {X Y : Profinite} [Finite ↑X.toTop] [Finite ↑Y.toTop] (f : ↑Y.toTop → F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))) (g : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F X).inv) (f ∘ ⇑(CategoryTheory.ConcreteCategory.hom g)) = (CategoryTheory.ConcreteCategory.hom (F.map g.op)) ((CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F Y).inv) f) - LightCondensed.isoFinYonedaComponents_inv_comp 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] {X Y : LightProfinite} [Finite ↑X.toTop] [Finite ↑Y.toTop] (f : ↑Y.toTop → F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))) (g : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (LightCondensed.isoFinYonedaComponents F X).inv) (f ∘ ⇑(CategoryTheory.ConcreteCategory.hom g)) = (CategoryTheory.ConcreteCategory.hom (F.map g.op)) ((CategoryTheory.ConcreteCategory.hom (LightCondensed.isoFinYonedaComponents F Y).inv) f) - Condensed.isoFinYoneda_hom_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (x : (CategoryTheory.Limits.Fan.mk (F.obj (Opposite.op (Condensed.fintypeCatAsCofan (FintypeCat.toProfinite.obj (Opposite.unop X))).pt)) fun j => F.map ((Condensed.fintypeCatAsCofan (FintypeCat.toProfinite.obj (Opposite.unop X))).inj j).op).pt) (j : ↑(FintypeCat.toProfinite.obj (Opposite.unop X)).toTop) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isoFinYoneda F).hom.app X)) x j = (CategoryTheory.ConcreteCategory.hom (F.map ((Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).inj j).op)) x - LightCondensed.isoFinYoneda_hom_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (x : (CategoryTheory.Limits.Fan.mk (F.obj (Opposite.op (LightCondensed.fintypeCatAsCofan (FintypeCat.toLightProfinite.obj (Opposite.unop X))).pt)) fun j => F.map ((LightCondensed.fintypeCatAsCofan (FintypeCat.toLightProfinite.obj (Opposite.unop X))).inj j).op).pt) (j : ↑(FintypeCat.toLightProfinite.obj (Opposite.unop X)).toTop) : (CategoryTheory.ConcreteCategory.hom ((LightCondensed.isoFinYoneda F).hom.app X)) x j = (CategoryTheory.ConcreteCategory.hom (F.map ((LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).inj j).op)) x - Condensed.isoFinYoneda_inv_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (a✝ : (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone.pt) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isoFinYoneda F).inv.app X)) a✝ = (CategoryTheory.CategoryStruct.id (F.obj (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt))).hom' ((((CategoryTheory.Limits.IsLimit.postcomposeHomEquiv (CategoryTheory.Discrete.natIso fun j => CategoryTheory.Iso.refl (F.obj (Opposite.op (Profinite.of PUnit.{u + 1})))) (F.mapCone (CategoryTheory.Limits.Fan.mk (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt) fun a => ((Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).inj a).op))).symm (CategoryTheory.Limits.isLimitOfPreserves F (CategoryTheory.Limits.Cofan.IsColimit.op (Condensed.fintypeCatAsCofanIsColimit (Profinite.of (Opposite.unop X).obj))))).lift (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone).hom' a✝) - LightCondensed.isoFinYoneda_inv_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (a✝ : (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))).cone.pt) : (CategoryTheory.ConcreteCategory.hom ((LightCondensed.isoFinYoneda F).inv.app X)) a✝ = (CategoryTheory.CategoryStruct.id (F.obj (Opposite.op (LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).pt))).hom' ((((CategoryTheory.Limits.IsLimit.postcomposeHomEquiv (CategoryTheory.Discrete.natIso fun j => CategoryTheory.Iso.refl (F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1})))) (F.mapCone (CategoryTheory.Limits.Fan.mk (Opposite.op (LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).pt) fun a => ((LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).inj a).op))).symm (CategoryTheory.Limits.isLimitOfPreserves F (CategoryTheory.Limits.Cofan.IsColimit.op (LightCondensed.fintypeCatAsCofanIsColimit (LightProfinite.of (Opposite.unop X).obj))))).lift (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))).cone).hom' a✝) - Condensed.epi_iff_surjective_on_stonean 📋 Mathlib.Condensed.Epi
(A : Type u') [CategoryTheory.Category.{v', u'} A] {FA : A → A → Type u_1} {CA : A → Type v'} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.ConcreteCategory.HasFunctorialSurjectiveInjectiveFactorization A] {X Y : Condensed A} (f : X ⟶ Y) [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget A)] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X Stonean.toCompHaus.op) A] [(CategoryTheory.extensiveTopology Stonean).WEqualsLocallyBijective A] [CategoryTheory.HasSheafify (CategoryTheory.extensiveTopology Stonean) A] [(CategoryTheory.extensiveTopology Stonean).HasSheafCompose (CategoryTheory.forget A)] [CategoryTheory.Balanced (CategoryTheory.Sheaf (CategoryTheory.extensiveTopology Stonean) A)] : CategoryTheory.Epi f ↔ ∀ (S : Stonean), Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op S.compHaus))) - Condensed.epi_iff_locallySurjective_on_compHaus 📋 Mathlib.Condensed.Epi
(A : Type u') [CategoryTheory.Category.{v', u'} A] {FA : A → A → Type u_1} {CA : A → Type v'} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.ConcreteCategory.HasFunctorialSurjectiveInjectiveFactorization A] {X Y : Condensed A} (f : X ⟶ Y) [(CategoryTheory.coherentTopology CompHaus).WEqualsLocallyBijective A] [CategoryTheory.HasSheafify (CategoryTheory.coherentTopology CompHaus) A] [(CategoryTheory.coherentTopology CompHaus).HasSheafCompose (CategoryTheory.forget A)] [CategoryTheory.Balanced (CategoryTheory.Sheaf (CategoryTheory.coherentTopology CompHaus) A)] [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget A)] : CategoryTheory.Epi f ↔ ∀ (S : CompHaus) (y : CategoryTheory.ToType (Y.obj.obj (Opposite.op S))), ∃ S' φ, ∃ (_ : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom φ)), ∃ x, (CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op S'))) x = (CategoryTheory.ConcreteCategory.hom (Y.obj.map (Opposite.op φ))) y - CondensedSet.ofSheafCompHaus 📋 Mathlib.Condensed.Explicit
(F : CategoryTheory.Functor CompHausᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedSet - CondensedSet.ofSheafStonean 📋 Mathlib.Condensed.Explicit
(F : CategoryTheory.Functor Stoneanᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] : CondensedSet - Condensed.ofSheafCompHaus 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (F : CategoryTheory.Functor CompHausᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : Condensed A - CondensedSet.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedSet - CondensedMod.ofSheafStonean 📋 Mathlib.Condensed.Explicit
(R : Type (u + 1)) [Ring R] (F : CategoryTheory.Functor Stoneanᵒᵖ (ModuleCat R)) [CategoryTheory.Limits.PreservesFiniteProducts F] : CondensedMod R - CondensedMod.ofSheafCompHaus 📋 Mathlib.Condensed.Explicit
(R : Type (u + 1)) [Ring R] (F : CategoryTheory.Functor CompHausᵒᵖ (ModuleCat R)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedMod R - Condensed.instPreservesFiniteProductsOppositeCompHausObjFunctorIsSheafCoherentTopology 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : Condensed A) : CategoryTheory.Limits.PreservesFiniteProducts X.obj - CondensedMod.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
(R : Type (u + 1)) [Ring R] (F : CategoryTheory.Functor Profiniteᵒᵖ (ModuleCat R)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedMod R - Condensed.ofSheafForgetCompHaus 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteLimits (CategoryTheory.forget A)] (F : CategoryTheory.Functor CompHausᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] (hF : CategoryTheory.regularTopology.EqualizerCondition (F.comp (CategoryTheory.forget A))) : Condensed A - Condensed.ofSheafStonean 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X Stonean.toCompHaus.op) A] (F : CategoryTheory.Functor Stoneanᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] : Condensed A - Condensed.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X profiniteToCompHaus.op) A] (F : CategoryTheory.Functor Profiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : Condensed A - Condensed.instPreservesFiniteProductsOppositeStoneanObjFunctorIsSheafCoherentTopology 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Stonean) A) : CategoryTheory.Limits.PreservesFiniteProducts X.obj - Condensed.instPreservesFiniteProductsOppositeProfiniteObjFunctorIsSheafCoherentTopology 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) A) : CategoryTheory.Limits.PreservesFiniteProducts X.obj - Condensed.ofSheafForgetStonean 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X Stonean.toCompHaus.op) A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteProducts (CategoryTheory.forget A)] (F : CategoryTheory.Functor Stoneanᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] : Condensed A - Condensed.ofSheafForgetProfinite 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X profiniteToCompHaus.op) A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteLimits (CategoryTheory.forget A)] (F : CategoryTheory.Functor Profiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] (hF : CategoryTheory.regularTopology.EqualizerCondition (F.comp (CategoryTheory.forget A))) : Condensed A - LightCondensed.isLocallySurjective_iff_locallySurjective_on_lightProfinite 📋 Mathlib.Condensed.Light.Epi
(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] [CategoryTheory.Limits.PreservesFiniteProducts (CategoryTheory.forget A)] {X Y : LightCondensed A} (f : X ⟶ Y) : CategoryTheory.Sheaf.IsLocallySurjective f ↔ ∀ (S : LightProfinite) (y : CategoryTheory.ToType (Y.obj.obj (Opposite.op S))), ∃ S' φ, ∃ (_ : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom φ)), ∃ x, (CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op S'))) x = (CategoryTheory.ConcreteCategory.hom (Y.obj.map (Opposite.op φ))) y - LightCondSet.ofSheafLightProfinite 📋 Mathlib.Condensed.Light.Explicit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : LightCondSet - LightCondensed.ofSheafLightProfinite 📋 Mathlib.Condensed.Light.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (F : CategoryTheory.Functor LightProfiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : LightCondensed A - LightCondAb.ofSheafLightProfinite 📋 Mathlib.Condensed.Light.Explicit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (ModuleCat ℤ)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : LightCondAb - LightCondMod.ofSheafLightProfinite 📋 Mathlib.Condensed.Light.Explicit
(R : Type u) [Ring R] (F : CategoryTheory.Functor LightProfiniteᵒᵖ (ModuleCat R)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : LightCondMod R - LightCondensed.instPreservesFiniteProductsOppositeLightProfiniteObjFunctorIsSheafCoherentTopology 📋 Mathlib.Condensed.Light.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : LightCondensed A) : CategoryTheory.Limits.PreservesFiniteProducts X.obj - LightCondensed.ofSheafForgetLightProfinite 📋 Mathlib.Condensed.Light.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteLimits (CategoryTheory.forget A)] (F : CategoryTheory.Functor LightProfiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] (hF : CategoryTheory.regularTopology.EqualizerCondition (F.comp (CategoryTheory.forget A))) : LightCondensed A - LightCondensed.ofSheafLightProfinite_obj 📋 Mathlib.Condensed.Light.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (F : CategoryTheory.Functor LightProfiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : (LightCondensed.ofSheafLightProfinite F hF).obj = F - LightCondensed.ofSheafForgetLightProfinite_obj 📋 Mathlib.Condensed.Light.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteLimits (CategoryTheory.forget A)] (F : CategoryTheory.Functor LightProfiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] (hF : CategoryTheory.regularTopology.EqualizerCondition (F.comp (CategoryTheory.forget A))) : (LightCondensed.ofSheafForgetLightProfinite F hF).obj = F
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