Loogle!
Result
Found 71 declarations mentioning CategoryTheory.Pairwise.
- CategoryTheory.Pairwise 📋 Mathlib.CategoryTheory.Category.Pairwise
(ι : Type v) : Type v - CategoryTheory.Pairwise.instCategory 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} : CategoryTheory.Category.{v, v} (CategoryTheory.Pairwise ι) - CategoryTheory.Pairwise.instCategoryStruct 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} : CategoryTheory.CategoryStruct.{v, v} (CategoryTheory.Pairwise ι) - CategoryTheory.Pairwise.single 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} : ι → CategoryTheory.Pairwise ι - CategoryTheory.Pairwise.pair 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} : ι → ι → CategoryTheory.Pairwise ι - CategoryTheory.instDecidableEqPairwise 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι✝ : Type u_1} [DecidableEq ι✝] : DecidableEq (CategoryTheory.Pairwise ι✝) - CategoryTheory.instFintypePairwise 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι✝ : Type u_1} [Fintype ι✝] : Fintype (CategoryTheory.Pairwise ι✝) - CategoryTheory.Pairwise.Hom 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} : CategoryTheory.Pairwise ι → CategoryTheory.Pairwise ι → Type v - CategoryTheory.Pairwise.pairwiseInhabited 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} [Inhabited ι] : Inhabited (CategoryTheory.Pairwise ι) - CategoryTheory.Pairwise.id 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} (o : CategoryTheory.Pairwise ι) : o.Hom o - CategoryTheory.Pairwise.diagramObj 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [SemilatticeInf α] : CategoryTheory.Pairwise ι → α - CategoryTheory.Pairwise.instFinCategoryOfFintypeOfDecidableEq 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} [Fintype ι] [DecidableEq ι] : CategoryTheory.FinCategory (CategoryTheory.Pairwise ι) - CategoryTheory.Pairwise.instDecidableEqHom 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι✝ : Type u_1} {a✝ a✝¹ : CategoryTheory.Pairwise ι✝} [DecidableEq ι✝] : DecidableEq (a✝.Hom a✝¹) - CategoryTheory.instDecidableEqPairwise.decEq 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι✝ : Type u_1} [DecidableEq ι✝] (x✝ x✝¹ : CategoryTheory.Pairwise ι✝) : Decidable (x✝ = x✝¹) - CategoryTheory.Pairwise.instDecidableEqHom_1 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {i j : CategoryTheory.Pairwise ι} [DecidableEq ι] : DecidableEq (i ⟶ j) - CategoryTheory.Pairwise.comp 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {o₁ o₂ o₃ : CategoryTheory.Pairwise ι} : o₁.Hom o₂ → o₂.Hom o₃ → o₁.Hom o₃ - CategoryTheory.Pairwise.diagram 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [SemilatticeInf α] : CategoryTheory.Functor (CategoryTheory.Pairwise ι) α - CategoryTheory.Pairwise.instDecidableEqHom.decEq 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι✝ : Type u_1} {a✝ a✝¹ : CategoryTheory.Pairwise ι✝} [DecidableEq ι✝] (x✝ x✝¹ : a✝.Hom a✝¹) : Decidable (x✝ = x✝¹) - CategoryTheory.Pairwise.cocone 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [CompleteLattice α] : CategoryTheory.Limits.Cocone (CategoryTheory.Pairwise.diagram U) - CategoryTheory.Pairwise.diagram_obj 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [SemilatticeInf α] (a✝ : CategoryTheory.Pairwise ι) : (CategoryTheory.Pairwise.diagram U).obj a✝ = CategoryTheory.Pairwise.diagramObj U a✝ - CategoryTheory.Pairwise.coconeIsColimit 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [CompleteLattice α] : CategoryTheory.Limits.IsColimit (CategoryTheory.Pairwise.cocone U) - CategoryTheory.Pairwise.coconeιApp 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [CompleteLattice α] (o : CategoryTheory.Pairwise ι) : CategoryTheory.Pairwise.diagramObj U o ⟶ iSup U - CategoryTheory.Pairwise.diagramMap 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [SemilatticeInf α] {o₁ o₂ : CategoryTheory.Pairwise ι} : (o₁ ⟶ o₂) → (CategoryTheory.Pairwise.diagramObj U o₁ ⟶ CategoryTheory.Pairwise.diagramObj U o₂) - CategoryTheory.Pairwise.cocone_pt 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [CompleteLattice α] : (CategoryTheory.Pairwise.cocone U).pt = iSup U - CategoryTheory.Pairwise.diagram_map 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [SemilatticeInf α] {X✝ Y✝ : CategoryTheory.Pairwise ι} (x✝ : X✝ ⟶ Y✝) : (CategoryTheory.Pairwise.diagram U).map x✝ = CategoryTheory.Pairwise.diagramMap U x✝ - CategoryTheory.Pairwise.cocone_ι_app 📋 Mathlib.CategoryTheory.Category.Pairwise
{ι : Type v} {α : Type u} (U : ι → α) [CompleteLattice α] (o : CategoryTheory.Pairwise ι) : (CategoryTheory.Pairwise.cocone U).ι.app o = CategoryTheory.Pairwise.coconeιApp U o - TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverObj 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Pairwise ι → TopCat.Presheaf.SheafCondition.OpensLeCover U - TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Functor (CategoryTheory.Pairwise ι) (TopCat.Presheaf.SheafCondition.OpensLeCover U) - TopCat.Presheaf.SheafCondition.instFinalPairwiseOpensLeCoverPairwiseToOpensLeCover 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U).Final - TopCat.Presheaf.SheafCondition.instNonemptyStructuredArrowPairwiseOpensLeCoverPairwiseToOpensLeCover 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (V : TopCat.Presheaf.SheafCondition.OpensLeCover U) : Nonempty (CategoryTheory.StructuredArrow V (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U)) - TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover_obj 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (a✝ : CategoryTheory.Pairwise ι) : (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U).obj a✝ = TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverObj U a✝ - TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverMap 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {V W : CategoryTheory.Pairwise ι} : (V ⟶ W) → (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverObj U V ⟶ TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverObj U W) - TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover_map 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {x✝ x✝¹ : CategoryTheory.Pairwise ι} (i : x✝ ⟶ x✝¹) : (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U).map i = TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCoverMap U i - TopCat.Presheaf.IsSheaf.isSheafPreservesLimitPairwiseIntersections 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} {F : TopCat.Presheaf C X} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (h : F.IsSheaf) : CategoryTheory.Limits.PreservesLimit (CategoryTheory.Pairwise.diagram U).op F - TopCat.Presheaf.SheafCondition.pairwiseDiagramIso 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Pairwise.diagram U ≅ (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U).comp (CategoryTheory.ObjectProperty.ι fun V => ∃ i, V ≤ U i) - TopCat.Presheaf.IsSheaf.isSheafPairwiseIntersections 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} {F : TopCat.Presheaf C X} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (h : F.IsSheaf) : Nonempty (CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op)) - TopCat.Presheaf.isLimitOpensLeCoverEquivPairwise 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op) - TopCat.Presheaf.SheafCondition.pairwiseCoconeIso 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{X : TopCat} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : (CategoryTheory.Pairwise.cocone U).op ≅ (CategoryTheory.Limits.Cone.postcomposeEquivalence (CategoryTheory.NatIso.op (TopCat.Presheaf.SheafCondition.pairwiseDiagramIso U))).functor.obj (CategoryTheory.Limits.Cone.whisker (TopCat.Presheaf.SheafCondition.pairwiseToOpensLeCover U).op (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op) - TopCat.Presheaf.objPairwiseOfFamily 📋 Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing
{X : TopCat} {F : TopCat.Presheaf (Type u_4) X} {ι : Type u_5} {U : ι → TopologicalSpace.Opens ↑X} (sf : (i : ι) → F.obj (Opposite.op (U i))) (i : (CategoryTheory.Pairwise ι)ᵒᵖ) : ((CategoryTheory.Pairwise.diagram U).op.comp F).obj i - TopCat.Presheaf.IsCompatible.sectionPairwise 📋 Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing
{X : TopCat} {F : TopCat.Presheaf (Type u_4) X} {ι : Type u_5} {U : ι → TopologicalSpace.Opens ↑X} {sf : (i : ι) → CategoryTheory.ToType (F.obj (Opposite.op (U i)))} (h : F.IsCompatible U sf) : ↑((CategoryTheory.Pairwise.diagram U).op.comp F).sections - TopCat.Presheaf.isGluing_iff_pairwise 📋 Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing
{X : TopCat} {F : TopCat.Presheaf (Type u_4) X} {ι : Type u_5} {U : ι → TopologicalSpace.Opens ↑X} {sf : (i : ι) → CategoryTheory.ToType (F.obj (Opposite.op (U i)))} {s : CategoryTheory.ToType (F.obj (Opposite.op (iSup U)))} : F.IsGluing U sf s ↔ ∀ (i : (CategoryTheory.Pairwise ι)ᵒᵖ), (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op).π.app i)) s = TopCat.Presheaf.objPairwiseOfFamily sf i - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctorObj 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverseObj 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverseObj_pt 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverseObj F U c).pt = c.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctorObj_pt 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctorObj F U c).pt = c.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F) ≌ CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Functor (CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) (CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Functor (CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) (CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) - TopCat.Presheaf.SheafConditionPairwiseIntersections.isLimitMapConeOfIsLimitSheafConditionFork 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (P : CategoryTheory.Limits.IsLimit (TopCat.Presheaf.SheafConditionEqualizerProducts.fork F U)) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op) - TopCat.Presheaf.SheafConditionPairwiseIntersections.isLimitSheafConditionForkOfIsLimitMapCone 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (Q : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op)) : CategoryTheory.Limits.IsLimit (TopCat.Presheaf.SheafConditionEqualizerProducts.fork F U) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U).comp (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U) ≅ CategoryTheory.Functor.id (CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse_obj_pt 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U).obj c).pt = c.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse_map_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) {c c' : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)} (f : c ⟶ c') : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U).map f).hom = f.hom - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor_obj_pt 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).obj c).pt = c.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv_functor 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv F U).functor = TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv_inverse 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv F U).inverse = TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv_counitIso 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv F U).counitIso = TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso F U - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse_obj_π_app 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) (x : (CategoryTheory.Pairwise ι)ᵒᵖ) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U).obj c).π.app x = CategoryTheory.Pairwise.rec (fun a => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Fork.ι c) (CategoryTheory.Limits.Pi.π (fun i => F.obj (Opposite.op (U i))) a)) (fun a a_1 => CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Fork.ι c) (CategoryTheory.CategoryStruct.comp (TopCat.Presheaf.SheafConditionEqualizerProducts.leftRes F U) (CategoryTheory.Limits.Pi.π (fun p => F.obj (Opposite.op (U p.1 ⊓ U p.2))) (a, a_1)))) (Opposite.unop x) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso_inv_app_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (X✝ : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso F U).inv.app X✝).hom = CategoryTheory.CategoryStruct.id X✝.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor_map_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) {c c' : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)} (f : c ⟶ c') : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).map f).hom = f.hom - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverseObj_π_app 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) (x : (CategoryTheory.Pairwise ι)ᵒᵖ) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverseObj F U c).π.app x = Opposite.rec (fun x => CategoryTheory.Pairwise.casesOn x (fun i => CategoryTheory.CategoryStruct.comp (c.π.app CategoryTheory.Limits.WalkingParallelPair.zero) (CategoryTheory.Limits.Pi.π (fun i => F.obj (Opposite.op (U i))) i)) fun i j => CategoryTheory.CategoryStruct.comp (c.π.app CategoryTheory.Limits.WalkingParallelPair.one) (CategoryTheory.Limits.Pi.π (fun p => F.obj (Opposite.op (U p.1 ⊓ U p.2))) (i, j))) x - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Functor.id (CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) ≅ (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).comp (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctorObj_π_app 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) (Z : CategoryTheory.Limits.WalkingParallelPair) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctorObj F U c).π.app Z = CategoryTheory.Limits.WalkingParallelPair.casesOn Z (CategoryTheory.Limits.Pi.lift fun i => c.π.app (Opposite.op (CategoryTheory.Pairwise.single i))) (CategoryTheory.Limits.Pi.lift fun b => c.π.app (Opposite.op (CategoryTheory.Pairwise.pair b.1 b.2))) - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso_hom_app_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (X✝ : CategoryTheory.Limits.Cone (TopCat.Presheaf.SheafConditionEqualizerProducts.diagram F U)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivCounitIso F U).hom.app X✝).hom = CategoryTheory.CategoryStruct.id X✝.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv_unitIso 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquiv F U).unitIso = TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso F U - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor_obj_π_app 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) (Z : CategoryTheory.Limits.WalkingParallelPair) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).obj c).π.app Z = CategoryTheory.Limits.WalkingParallelPair.rec (CategoryTheory.Limits.Pi.lift fun i => c.π.app (Opposite.op (CategoryTheory.Pairwise.single i))) (CategoryTheory.Limits.Pi.lift fun b => c.π.app (Opposite.op (CategoryTheory.Pairwise.pair b.1 b.2))) Z - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIsoApp 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : (CategoryTheory.Functor.id (CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F))).obj c ≅ ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).comp (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U)).obj c - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIsoApp_hom_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIsoApp F U c).hom.hom = CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F))).obj c).pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso_hom_app_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (X✝ : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso F U).hom.app X✝).hom = CategoryTheory.CategoryStruct.id X✝.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso_inv_app_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (X✝ : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : ((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIso F U).inv.app X✝).hom = CategoryTheory.CategoryStruct.id X✝.pt - TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIsoApp_inv_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (c : CategoryTheory.Limits.Cone ((CategoryTheory.Pairwise.diagram U).op.comp F)) : (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivUnitIsoApp F U c).inv.hom = CategoryTheory.CategoryStruct.id (((TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivFunctor F U).comp (TopCat.Presheaf.SheafConditionPairwiseIntersections.coneEquivInverse F U)).obj c).pt
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