Loogle!
Result
Found 91 declarations mentioning TopCat.Hom.hom.
- TopCat.Hom.hom 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y : TopCat} (f : X.Hom Y) : C(↑X, ↑Y) - TopCat.hom_id 📋 Mathlib.Topology.Category.TopCat.Basic
{X : TopCat} : TopCat.Hom.hom (CategoryTheory.CategoryStruct.id X) = ContinuousMap.id ↑X - TopCat.hom_ofHom 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y : Type u} [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) : TopCat.Hom.hom (TopCat.ofHom f) = f - TopCat.ofHom_hom 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y : TopCat} (f : X ⟶ Y) : TopCat.ofHom (TopCat.Hom.hom f) = f - TopCat.hom_ext 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y : TopCat} {f g : X ⟶ Y} (hf : TopCat.Hom.hom f = TopCat.Hom.hom g) : f = g - TopCat.hom_ext_iff 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y : TopCat} {f g : X ⟶ Y} : f = g ↔ TopCat.Hom.hom f = TopCat.Hom.hom g - TopCat.isEmbedding_iff 📋 Mathlib.Topology.Category.TopCat.Basic
⦃A X : TopCat⦄ (f : A ⟶ X) : TopCat.isEmbedding f ↔ Topology.IsEmbedding ⇑(TopCat.Hom.hom f) - TopCat.hom_comp 📋 Mathlib.Topology.Category.TopCat.Basic
{X Y Z : TopCat} (f : X ⟶ Y) (g : Y ⟶ Z) : TopCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (TopCat.Hom.hom g).comp (TopCat.Hom.hom f) - TopCat.Hom.equivContinuousMap_apply 📋 Mathlib.Topology.Category.TopCat.Basic
(X Y : TopCat) (f : X ⟶ Y) : (TopCat.Hom.equivContinuousMap X Y) f = TopCat.Hom.hom f - TopologicalSpace.Opens.mem_map 📋 Mathlib.Topology.Category.TopCat.Opens
{X Y : TopCat} {f : X ⟶ Y} {U : TopologicalSpace.Opens ↑Y} {x : ↑X} : x ∈ (TopologicalSpace.Opens.map f).obj U ↔ (TopCat.Hom.hom f) x ∈ U - TopologicalSpace.Opens.map_obj 📋 Mathlib.Topology.Category.TopCat.Opens
{X Y : TopCat} (f : X ⟶ Y) (U : Set ↑Y) (p : IsOpen U) : (TopologicalSpace.Opens.map f).obj { carrier := U, is_open' := p } = { carrier := ⇑(CategoryTheory.ConcreteCategory.hom f) ⁻¹' U, is_open' := ⋯ } - TopologicalSpace.Opens.inclusion'_hom_apply 📋 Mathlib.Topology.Category.TopCat.Opens
{X : TopCat} (U : TopologicalSpace.Opens ↑X) : ⇑(TopCat.Hom.hom U.inclusion') = Subtype.val - TopologicalSpace.Opens.map_def 📋 Mathlib.Topology.Category.TopCat.Opens
{X Y : TopCat} (f : X ⟶ Y) : TopologicalSpace.Opens.map f = { obj := fun U => { carrier := ⇑(CategoryTheory.ConcreteCategory.hom f) ⁻¹' ↑U, is_open' := ⋯ }, map := fun {X_1 Y_1} i => { down := { down := ⋯ } }, map_id := ⋯, map_comp := ⋯ } - TopCat.Presheaf.stalkSpecializes_stalkPushforward 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : TopCat} (f : X ⟶ Y) (F : TopCat.Presheaf C X) {x y : ↑X} (h : x ⤳ y) : CategoryTheory.CategoryStruct.comp (((TopCat.Presheaf.pushforward C f).obj F).stalkSpecializes ⋯) (TopCat.Presheaf.stalkPushforward C f F x) = CategoryTheory.CategoryStruct.comp (TopCat.Presheaf.stalkPushforward C f F y) (F.stalkSpecializes h) - TopCat.Presheaf.stalkSpecializes_stalkPushforward_assoc 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : TopCat} (f : X ⟶ Y) (F : TopCat.Presheaf C X) {x y : ↑X} (h : x ⤳ y) {Z : C} (h✝ : F.stalk x ⟶ Z) : CategoryTheory.CategoryStruct.comp (((TopCat.Presheaf.pushforward C f).obj F).stalkSpecializes ⋯) (CategoryTheory.CategoryStruct.comp (TopCat.Presheaf.stalkPushforward C f F x) h✝) = CategoryTheory.CategoryStruct.comp (TopCat.Presheaf.stalkPushforward C f F y) (CategoryTheory.CategoryStruct.comp (F.stalkSpecializes h) h✝) - TopCat.Presheaf.stalkSpecializes_stalkPushforward_apply 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : TopCat} (f : X ⟶ Y) (F : TopCat.Presheaf C X) {x y : ↑X} (h : x ⤳ y) {F✝ : C → C → Type uF} {carrier : C → Type w} {instFunLike : (X Y : C) → FunLike (F✝ X Y) (carrier X) (carrier Y)} [inst : CategoryTheory.ConcreteCategory C F✝] (x✝ : carrier (((TopCat.Presheaf.pushforward C f).obj F).stalk ((TopCat.Hom.hom f) y))) : (CategoryTheory.ConcreteCategory.hom (TopCat.Presheaf.stalkPushforward C f F x)) ((CategoryTheory.ConcreteCategory.hom (((TopCat.Presheaf.pushforward C f).obj F).stalkSpecializes ⋯)) x✝) = (CategoryTheory.ConcreteCategory.hom (F.stalkSpecializes h)) ((CategoryTheory.ConcreteCategory.hom (TopCat.Presheaf.stalkPushforward C f F y)) x✝) - TopModuleCat.freeMap_map 📋 Mathlib.Algebra.Category.ModuleCat.Topology.Basic
(R : Type u) [Ring R] [TopologicalSpace R] {X Y : TopCat} (f : X ⟶ Y) (v : ↑X →₀ R) : (CategoryTheory.ConcreteCategory.hom (TopModuleCat.freeMap R f)) v = Finsupp.mapDomain (⇑(TopCat.Hom.hom f)) v - TopModuleCat.hom_forget₂_TopCat_map 📋 Mathlib.Algebra.Category.ModuleCat.Topology.Basic
(R : Type u) [Ring R] [TopologicalSpace R] {X Y : TopModuleCat R} (f : X ⟶ Y) : TopCat.Hom.hom ((CategoryTheory.forget₂ (TopModuleCat R) TopCat).map f) = ↑(TopModuleCat.Hom.hom f) - AlgebraicGeometry.PresheafedSpace.stalkMap.stalkSpecializes_stalkMap 📋 Mathlib.Geometry.RingedSpace.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Y) {x y : ↑↑X} (h : x ⤳ y) : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f x) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f y) (X.presheaf.stalkSpecializes h) - AlgebraicGeometry.PresheafedSpace.stalkMap.stalkSpecializes_stalkMap_assoc 📋 Mathlib.Geometry.RingedSpace.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Y) {x y : ↑↑X} (h : x ⤳ y) {Z : C} (h✝ : X.presheaf.stalk x ⟶ Z) : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f x) h✝) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f y) (CategoryTheory.CategoryStruct.comp (X.presheaf.stalkSpecializes h) h✝) - AlgebraicGeometry.PresheafedSpace.stalkMap.stalkSpecializes_stalkMap_apply 📋 Mathlib.Geometry.RingedSpace.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X Y : AlgebraicGeometry.PresheafedSpace C} (f : X ⟶ Y) {x y : ↑↑X} (h : x ⤳ y) {F : C → C → Type uF} {carrier : C → Type w} {instFunLike : (X Y : C) → FunLike (F X Y) (carrier X) (carrier Y)} [inst : CategoryTheory.ConcreteCategory C F] (x✝ : carrier (Y.presheaf.stalk ((TopCat.Hom.hom f.base) y))) : (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f x)) ((CategoryTheory.ConcreteCategory.hom (Y.presheaf.stalkSpecializes ⋯)) x✝) = (CategoryTheory.ConcreteCategory.hom (X.presheaf.stalkSpecializes h)) ((CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f y)) x✝) - AlgebraicGeometry.LocallyRingedSpace.stalkSpecializes_stalkMap 📋 Mathlib.Geometry.RingedSpace.LocallyRingedSpace
{X Y : AlgebraicGeometry.LocallyRingedSpace} (f : X ⟶ Y) (x x' : ↑X.toTopCat) (h : x ⤳ x') : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x') (X.presheaf.stalkSpecializes h) - AlgebraicGeometry.LocallyRingedSpace.stalkSpecializes_stalkMap_assoc 📋 Mathlib.Geometry.RingedSpace.LocallyRingedSpace
{X Y : AlgebraicGeometry.LocallyRingedSpace} (f : X ⟶ Y) (x x' : ↑X.toTopCat) (h : x ⤳ x') {Z : CommRingCat} (h✝ : X.presheaf.stalk x ⟶ Z) : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x) h✝) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x') (CategoryTheory.CategoryStruct.comp (X.presheaf.stalkSpecializes h) h✝) - AlgebraicGeometry.LocallyRingedSpace.stalkSpecializes_stalkMap_apply 📋 Mathlib.Geometry.RingedSpace.LocallyRingedSpace
{X Y : AlgebraicGeometry.LocallyRingedSpace} (f : X ⟶ Y) (x x' : ↑X.toTopCat) (h : x ⤳ x') (y : ↑(Y.presheaf.stalk ((TopCat.Hom.hom f.base) x'))) : (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x)) ((CategoryTheory.ConcreteCategory.hom (Y.presheaf.stalkSpecializes ⋯)) y) = (CategoryTheory.ConcreteCategory.hom (X.presheaf.stalkSpecializes h)) ((CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.LocallyRingedSpace.Hom.stalkMap f x')) y) - AlgebraicGeometry.Spec.coe_toTop_map_hom_apply_asIdeal 📋 Mathlib.AlgebraicGeometry.Spec
{x✝ x✝¹ : CommRingCatᵒᵖ} (f : x✝ ⟶ x✝¹) (p : PrimeSpectrum ↑(Opposite.unop x✝)) : ↑((TopCat.Hom.hom (AlgebraicGeometry.Spec.toTop.map f)) p).asIdeal = ⇑(CommRingCat.Hom.hom f.unop) ⁻¹' ↑p.asIdeal - AlgebraicGeometry.Scheme.Hom.stalkSpecializes_stalkMap 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (x x' : ↥X) (h : x ⤳ x') : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (AlgebraicGeometry.Scheme.Hom.stalkMap f x) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.stalkMap f x') (X.presheaf.stalkSpecializes h) - AlgebraicGeometry.Scheme.Hom.stalkSpecializes_stalkMap_assoc 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (x x' : ↥X) (h : x ⤳ x') {Z : CommRingCat} (h✝ : X.presheaf.stalk x ⟶ Z) : CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkSpecializes ⋯) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.stalkMap f x) h✝) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.stalkMap f x') (CategoryTheory.CategoryStruct.comp (X.presheaf.stalkSpecializes h) h✝) - AlgebraicGeometry.Scheme.Hom.stalkSpecializes_stalkMap_apply 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (x x' : ↥X) (h : x ⤳ x') (y : ↑(Y.presheaf.stalk ((TopCat.Hom.hom f.base) x'))) : (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.stalkMap f x)) ((CategoryTheory.ConcreteCategory.hom (Y.presheaf.stalkSpecializes ⋯)) y) = (CategoryTheory.ConcreteCategory.hom (X.presheaf.stalkSpecializes h)) ((CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.stalkMap f x')) y) - AlgebraicGeometry.LocallyRingedSpace.coe_toΓSpecSheafedSpace_hom_base_hom_apply_asIdeal 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
(X : AlgebraicGeometry.LocallyRingedSpace) (a✝ : ↑X.toTopCat) : ↑((TopCat.Hom.hom X.toΓSpecSheafedSpace.hom.base) a✝).asIdeal = ⇑(CommRingCat.Hom.hom (X.presheaf.Γgerm a✝)) ⁻¹' ↑(IsLocalRing.closedPoint ↑(X.presheaf.stalk a✝)).asIdeal - AlgebraicGeometry.Scheme.descResidueField_stalkClosedPointTo_comp 📋 Mathlib.AlgebraicGeometry.ResidueField
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {K : Type u} [Field K] (g : AlgebraicGeometry.Spec (CommRingCat.of K) ⟶ X) : AlgebraicGeometry.Scheme.descResidueField (AlgebraicGeometry.Scheme.stalkClosedPointTo (CategoryTheory.CategoryStruct.comp g f)) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.residueFieldMap f (g (IsLocalRing.closedPoint K))) (AlgebraicGeometry.Scheme.descResidueField (AlgebraicGeometry.Scheme.stalkClosedPointTo g)) - AlgebraicGeometry.ProjIsoSpecTopComponent.toSpec_hom_apply_asIdeal 📋 Mathlib.AlgebraicGeometry.ProjectiveSpectrum.Scheme
{A : Type u_1} {σ : Type u_2} [CommRing A] [SetLike σ A] [AddSubgroupClass σ A] (𝒜 : ℕ → σ) [GradedRing 𝒜] (f : A) (x : ↑↑((AlgebraicGeometry.Proj.toLocallyRingedSpace 𝒜).restrict ⋯).toPresheafedSpace) : ((TopCat.Hom.hom (AlgebraicGeometry.ProjIsoSpecTopComponent.toSpec 𝒜 f)) x).asIdeal = AlgebraicGeometry.ProjIsoSpecTopComponent.ToSpec.carrier x - AlgebraicGeometry.Proj.sheafedSpaceMap_hom_base_hom_apply_asHomogeneousIdeal_carrier 📋 Mathlib.AlgebraicGeometry.ProjectiveSpectrum.Functor
{A B σ τ : Type u} [CommRing A] [SetLike σ A] [AddSubgroupClass σ A] [CommRing B] [SetLike τ B] [AddSubgroupClass τ B] {𝒜 : ℕ → σ} {ℬ : ℕ → τ} [GradedRing 𝒜] [GradedRing ℬ] (f : 𝒜 →+*ᵍ ℬ) (hf : HomogeneousIdeal.irrelevant ℬ ≤ HomogeneousIdeal.map f (HomogeneousIdeal.irrelevant 𝒜)) (p : ProjectiveSpectrum ℬ) : ↑((TopCat.Hom.hom (AlgebraicGeometry.Proj.sheafedSpaceMap f hf).hom.base) p).asHomogeneousIdeal = ⇑f ⁻¹' ↑p.asHomogeneousIdeal - AlgebraicGeometry.continuousMapPresheaf_map 📋 Mathlib.AlgebraicGeometry.Sites.ConstantSheaf
(T : Type v) [TopologicalSpace T] {U V : AlgebraicGeometry.Schemeᵒᵖ} (f : U ⟶ V) : (AlgebraicGeometry.continuousMapPresheaf T).map f = TypeCat.ofHom fun g => g.comp (TopCat.Hom.hom f.unop.base) - TopCat.tensor_apply 📋 Mathlib.Topology.Category.TopCat.Monoidal
{W X Y Z : TopCat} (f : W ⟶ X) (g : Y ⟶ Z) (p : ↑(CategoryTheory.MonoidalCategoryStruct.tensorObj W Y)) : (TopCat.Hom.hom (CategoryTheory.MonoidalCategoryStruct.tensorHom f g)) p = ((CategoryTheory.ConcreteCategory.hom f) p.1, (CategoryTheory.ConcreteCategory.hom g) p.2) - TopCat.Homotopy.refl 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} (f : X ⟶ Y) : (TopCat.Hom.hom f).Homotopy (TopCat.Hom.hom f) - TopCat.Homotopy.symm 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} {f₀ f₁ : X ⟶ Y} (F : TopCat.Homotopy f₀ f₁) : (TopCat.Hom.hom f₁).Homotopy (TopCat.Hom.hom f₀) - TopCat.Homotopy.trans 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} {f₀ f₁ f₂ : X ⟶ Y} (F : TopCat.Homotopy f₀ f₁) (G : TopCat.Homotopy f₁ f₂) : (TopCat.Hom.hom f₀).Homotopy (TopCat.Hom.hom f₂) - TopCat.Homotopy.comp_apply 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y Z : TopCat} {f₀ f₁ : X ⟶ Y} {g₀ g₁ : Y ⟶ Z} (G : TopCat.Homotopy g₀ g₁) (F : TopCat.Homotopy f₀ f₁) (x : ↑unitInterval × ↑X) : (G.comp F) x = G (x.1, F x) - TopCat.Homotopy.h_hom_apply 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} {f₀ f₁ : X ⟶ Y} (F : TopCat.Homotopy f₀ f₁) (p : ↑(CategoryTheory.MonoidalCategoryStruct.tensorObj X TopCat.I)) : (CategoryTheory.ConcreteCategory.hom F.h) p = F (TopCat.I.homeomorph p.2, p.1) - TopPair.Homotopy.refl_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} (f : X ⟶ Y) : (TopPair.Homotopy.refl f).fst = TopCat.Homotopy.refl (TopPair.Hom.fst f) - TopPair.Homotopy.refl_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} (f : X ⟶ Y) : (TopPair.Homotopy.refl f).snd = TopCat.Homotopy.refl (TopPair.Hom.snd f) - TopPair.Homotopy.symm_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) : F.symm.fst = F.fst.symm - TopPair.Homotopy.symm_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) : F.symm.snd = F.snd.symm - TopPair.Homotopy.trans_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ f₂ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) (G : TopPair.Homotopy f₁ f₂) : (F.trans G).fst = F.fst.trans G.fst - TopPair.Homotopy.trans_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ f₂ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) (G : TopPair.Homotopy f₁ f₂) : (F.trans G).snd = F.snd.trans G.snd - TopPair.Homotopy.w_apply' 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f g : X ⟶ Y} (H : TopPair.Homotopy f g) (x : ↑TopPair.snd) (t : ↑unitInterval) : H.fst (t, (CategoryTheory.ConcreteCategory.hom TopPair.map) x) = (CategoryTheory.ConcreteCategory.hom TopPair.map) (H.snd (t, x)) - TopPair.Homotopy.w_apply 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f g : X ⟶ Y} (self : TopPair.Homotopy f g) (x : ↑(CategoryTheory.MonoidalCategoryStruct.tensorObj TopPair.snd TopCat.I)) : self.fst (TopCat.I.homeomorph x.2, (CategoryTheory.ConcreteCategory.hom TopPair.map) x.1) = (CategoryTheory.ConcreteCategory.hom TopPair.map) (self.snd (TopCat.I.homeomorph x.2, x.1)) - ContinuousMap.Homotopy.eq_path_of_eq_image 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X₁ X₂ Y : TopCat} {f : C(↑X₁, ↑Y)} {g : C(↑X₂, ↑Y)} {x₀ x₁ : ↑X₁} {x₂ x₃ : ↑X₂} {p : Path x₀ x₁} {q : Path x₂ x₃} (hfg : ∀ (t : ↑unitInterval), f (p t) = g (q t)) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom f)).map ⟦p⟧ = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom g)).map ⟦q⟧) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.evalAt_eq 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) (x : ↑X) : ⟦H.evalAt x⟧ = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI unitInterval.uhpath01 (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop x)))) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.apply_one_path 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom g)).map p = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop { down := 1 })) p)) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.apply_zero_path 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom f)).map p = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop { down := 0 })) p)) (ContinuousMap.Homotopy.hcast ⋯)) - SSet.stdSimplexToTop_app_app_hom_apply_down_hom_apply 📋 Mathlib.AlgebraicTopology.SingularSet
(X : SimplexCategory) (X✝ : SimplexCategoryᵒᵖ) (a✝ : (SSet.stdSimplex.obj X).obj X✝) (a✝¹ : ↑(Opposite.unop (SimplexCategory.toTop.{u}.op.obj X✝))) : (TopCat.Hom.hom ((CategoryTheory.ConcreteCategory.hom ((SSet.stdSimplexToTop.app X).app X✝)) a✝).down) a✝¹ = (SSet.toTopSimplex.hom.app X).hom' ((((sSetTopAdj.unit.app (SSet.stdSimplex.obj X)).app X✝).hom' a✝).down.hom' a✝¹) - SimplexCategory.toTopHomeo_symm_naturality 📋 Mathlib.AlgebraicTopology.SimplicialSet.TopAdj
{n m : SimplexCategory} (f : n ⟶ m) : ⇑m.toTopHomeo.symm ∘ Convexity.StdSimplex.map ⇑(CategoryTheory.ConcreteCategory.hom f) = ⇑(TopCat.Hom.hom (SSet.toTop.map (SSet.stdSimplex.map f))) ∘ ⇑n.toTopHomeo.symm - TopCat.pathEquiv_apply_apply 📋 Mathlib.Topology.Homotopy.TopCat.Path
{X : TopCat} {x y : ↑X} (p : X.Path x y) (a✝ : ↑unitInterval) : (TopCat.pathEquiv p) a✝ = (TopCat.Hom.hom p.hom) (TopCat.I.homeomorph.symm a✝) - TopCat.pathEquiv_symm_apply_hom_hom_apply 📋 Mathlib.Topology.Homotopy.TopCat.Path
{X : TopCat} {x y : ↑X} (p : Path x y) (a✝ : ULift.{u, 0} ↑unitInterval) : (TopCat.Hom.hom (TopCat.pathEquiv.symm p).hom) a✝ = p (TopCat.I.homeomorph a✝) - CompHausLike.toCompHausLike_map 📋 Mathlib.Topology.Category.CompHausLike.Basic
{P P' : TopCat → Prop} (h : ∀ (X : CompHausLike P), P X.toTop → P' X.toTop) {X Y : CompHausLike P} (f : X ⟶ Y) : (CompHausLike.toCompHausLike h).map f = CategoryTheory.ConcreteCategory.ofHom (TopCat.Hom.hom f.hom) - CompHausLike.isoOfHomeo_hom_hom_hom_apply 📋 Mathlib.Topology.Category.CompHausLike.Basic
{P : TopCat → Prop} {X Y : CompHausLike P} (f : ↑X.toTop ≃ₜ ↑Y.toTop) (a : ↑((CompHausLike.compHausLikeToTop P).obj X)) : (TopCat.Hom.hom (CompHausLike.isoOfHomeo f).hom.hom) a = f a - CompHausLike.isoOfHomeo_inv_hom_hom_apply 📋 Mathlib.Topology.Category.CompHausLike.Basic
{P : TopCat → Prop} {X Y : CompHausLike P} (f : ↑X.toTop ≃ₜ ↑Y.toTop) (a : ↑((CompHausLike.compHausLikeToTop P).obj Y)) : (TopCat.Hom.hom (CompHausLike.isoOfHomeo f).inv.hom) a = f.symm a - FintypeCat.toProfinite_map_hom_hom_apply 📋 Mathlib.Topology.Category.Profinite.Basic
{X✝ Y✝ : FintypeCat} (f : X✝ ⟶ Y✝) (a : X✝.obj) : (TopCat.Hom.hom (FintypeCat.toProfinite.map f).hom) a = (CategoryTheory.ConcreteCategory.hom f) a - Profinite.exists_locallyConstant 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_finite_nonempty 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} [Finite α] [Nonempty α] (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_fin_two 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) (Fin 2)) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_finite_aux 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} [Finite α] (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, LocallyConstant.map (fun a b => if a = b then 0 else 1) f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - LightDiagram.id_hom_hom_hom_apply 📋 Mathlib.Topology.Category.LightProfinite.Basic
(X : LightDiagram) (a : ↑X.toProfinite.toTop) : (TopCat.Hom.hom (CategoryTheory.CategoryStruct.id X).hom.hom) a = a - FintypeCat.toLightProfinite_map_hom_hom_apply 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X✝ Y✝ : FintypeCat} (f : X✝ ⟶ Y✝) (a : X✝.obj) : (TopCat.Hom.hom (FintypeCat.toLightProfinite.map f).hom) a = (CategoryTheory.ConcreteCategory.hom f) a - LightDiagram.comp_hom_hom_hom_apply 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X Y Z : LightDiagram} (a✝ : X ⟶ Y) (a✝¹ : Y ⟶ Z) (a✝² : ↑X.toProfinite.toTop) : (TopCat.Hom.hom (CategoryTheory.CategoryStruct.comp a✝ a✝¹).hom.hom) a✝² = a✝¹.hom.hom.hom' (a✝.hom.hom.hom' a✝²) - ContinuousMap.yonedaPresheaf_map 📋 Mathlib.Topology.Category.TopCat.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C TopCat) (Y : Type w') [TopologicalSpace Y] {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : (ContinuousMap.yonedaPresheaf F Y).map f = TypeCat.ofHom fun g => g.comp (TopCat.Hom.hom (F.map f.unop)) - TopCat.toSheafCompHausLike_obj_map 📋 Mathlib.Condensed.TopComparison
(P : TopCat → Prop) (X : TopCat) [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) {X✝ Y✝ : (CompHausLike P)ᵒᵖ} (f : X✝ ⟶ Y✝) : (TopCat.toSheafCompHausLike P X hs).obj.map f = TypeCat.ofHom fun g => g.comp (TopCat.Hom.hom f.unop.hom) - topCatToSheafCompHausLike_map_hom_app 📋 Mathlib.Condensed.TopComparison
(P : TopCat → Prop) [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) {X✝ Y✝ : TopCat} (f : X✝ ⟶ Y✝) (x✝ : (CompHausLike P)ᵒᵖ) : ((topCatToSheafCompHausLike P hs).map f).hom.app x✝ = TypeCat.ofHom fun g => (TopCat.Hom.hom f).comp g - CompHausLike.LocallyConstant.functorToPresheaves_obj_map 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} (X : Type (max u w)) {X✝ Y✝ : (CompHausLike P)ᵒᵖ} (f : X✝ ⟶ Y✝) : (CompHausLike.LocallyConstant.functorToPresheaves.obj X).map f = TypeCat.ofHom fun g => LocallyConstant.comap (TopCat.Hom.hom f.unop.hom) g - CompHausLike.LocallyConstant.functor_obj_obj_map 📋 Mathlib.Condensed.Discrete.LocallyConstant
(P : TopCat → Prop) [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) (X : Type (max u w)) {X✝ Y✝ : (CompHausLike P)ᵒᵖ} (f : X✝ ⟶ Y✝) : ((CompHausLike.LocallyConstant.functor P hs).obj X).obj.map f = TypeCat.ofHom fun g => LocallyConstant.comap (TopCat.Hom.hom f.unop.hom) g - CompHausLike.LocallyConstant.componentHom 📋 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})))) {T : CompHausLike P} (g : T ⟶ S) (a : Function.Fiber ⇑(LocallyConstant.comap (TopCat.Hom.hom g.hom) f)) : CompHausLike.LocallyConstant.fiber (LocallyConstant.comap (TopCat.Hom.hom g.hom) f) a ⟶ CompHausLike.LocallyConstant.fiber f (Function.Fiber.mk (⇑f) ((CategoryTheory.ConcreteCategory.hom g) (Function.Fiber.preimage (⇑(LocallyConstant.comap (TopCat.Hom.hom g.hom) f)) a))) - CompHausLike.LocallyConstant.functor_map_hom 📋 Mathlib.Condensed.Discrete.LocallyConstant
(P : TopCat → Prop) [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) {X✝ Y✝ : Type (max u w)} (f : X✝ ⟶ Y✝) (x✝ : (CompHausLike P)ᵒᵖ) : ((CompHausLike.LocallyConstant.functor P hs).map f).hom.app x✝ = TypeCat.ofHom fun t => LocallyConstant.map (⇑(CategoryTheory.ConcreteCategory.hom f)) t - CompHausLike.LocallyConstant.functor_map_hom_app 📋 Mathlib.Condensed.Discrete.LocallyConstant
(P : TopCat → Prop) [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) {X✝ Y✝ : Type (max u w)} (f : X✝ ⟶ Y✝) (x✝ : (CompHausLike P)ᵒᵖ) : ((CompHausLike.LocallyConstant.functor P hs).map f).hom.app x✝ = TypeCat.ofHom fun t => LocallyConstant.map (⇑(CategoryTheory.ConcreteCategory.hom f)) t - CompHausLike.LocallyConstant.functorToPresheaves_map_app 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} {X✝ Y✝ : Type (max u w)} (f : X✝ ⟶ Y✝) (x✝ : (CompHausLike P)ᵒᵖ) : (CompHausLike.LocallyConstant.functorToPresheaves.map f).app x✝ = TypeCat.ofHom fun t => LocallyConstant.map (⇑(CategoryTheory.ConcreteCategory.hom f)) t - CompHausLike.LocallyConstant.incl_comap 📋 Mathlib.Condensed.Discrete.LocallyConstant
{P : TopCat → Prop} [∀ (S : CompHausLike P) (p : ↑S.toTop → Prop), CompHausLike.HasProp P (Subtype p)] {Y : CategoryTheory.Functor (CompHausLike P)ᵒᵖ (Type (max u w))} [CompHausLike.HasProp P PUnit.{u + 1}] {S T : (CompHausLike P)ᵒᵖ} (f : LocallyConstant (↑(Opposite.unop S).toTop) (Y.obj (Opposite.op (CompHausLike.of P PUnit.{u + 1})))) (g : S ⟶ T) (a : Function.Fiber ⇑(LocallyConstant.comap (TopCat.Hom.hom g.unop.hom) f)) : CategoryTheory.CategoryStruct.comp g (CompHausLike.LocallyConstant.sigmaIncl (LocallyConstant.comap (TopCat.Hom.hom g.unop.hom) f) a).op = CategoryTheory.CategoryStruct.comp (CompHausLike.LocallyConstant.sigmaIncl f (Function.Fiber.mk (⇑f) ((CategoryTheory.ConcreteCategory.hom g.unop) (Function.Fiber.preimage (⇑(LocallyConstant.comap (TopCat.Hom.hom g.unop.hom) f)) a)))).op (CompHausLike.LocallyConstant.componentHom f g.unop a).op - LightCondensed.isColimitLocallyConstantPresheafDiagram_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type u) (S : LightProfinite) (s : CategoryTheory.Limits.Cocone (S.diagram.rightOp.comp (LightCondensed.locallyConstantPresheaf X))) (n : ℕ) (f : LocallyConstant (↑(S.diagram.obj (Opposite.op n)).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((LightCondensed.isColimitLocallyConstantPresheafDiagram X S).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (S.asLimitCone.π.app (Opposite.op n)).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app n)) f - Condensed.isColimitLocallyConstantPresheaf_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
{I : Type u} [CategoryTheory.Category.{u, u} I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (X : Type (u + 1)) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] (s : CategoryTheory.Limits.Cocone ((F.comp FintypeCat.toProfinite).op.comp (Condensed.locallyConstantPresheaf X))) (i : I) (f : LocallyConstant (↑(FintypeCat.toProfinite.obj (F.obj i)).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isColimitLocallyConstantPresheaf c X hc).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (c.π.app i).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app (Opposite.op i))) f - LightCondensed.isColimitLocallyConstantPresheaf_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
{F : CategoryTheory.Functor ℕᵒᵖ FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toLightProfinite)) (X : Type u) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : ℕᵒᵖ), CategoryTheory.Epi (c.π.app i)] (s : CategoryTheory.Limits.Cocone ((F.comp FintypeCat.toLightProfinite).op.comp (LightCondensed.locallyConstantPresheaf X))) (n : ℕᵒᵖ) (f : LocallyConstant (↑(FintypeCat.toLightProfinite.obj (F.obj n)).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((LightCondensed.isColimitLocallyConstantPresheaf c X hc).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (c.π.app n).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app (Opposite.op n))) f - Condensed.isColimitLocallyConstantPresheafDiagram_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type (u + 1)) (S : Profinite) (s : CategoryTheory.Limits.Cocone (S.diagram.op.comp (Condensed.locallyConstantPresheaf X))) (i : DiscreteQuotient ↑S.toTop) (f : LocallyConstant (↑(S.diagram.obj i).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isColimitLocallyConstantPresheafDiagram X S).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (S.asLimitCone.π.app i).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app (Opposite.op i))) f - CompHausLike.LocallyConstantModule.functorToPresheaves_obj_map 📋 Mathlib.Condensed.Discrete.Module
{P : TopCat → Prop} (R : Type (max u w)) [Ring R] (X : ModuleCat R) {X✝ Y✝ : (CompHausLike P)ᵒᵖ} (f : X✝ ⟶ Y✝) : ((CompHausLike.LocallyConstantModule.functorToPresheaves R).obj X).map f = ModuleCat.ofHom (LocallyConstant.comapₗ R (TopCat.Hom.hom f.unop.hom)) - CompHausLike.LocallyConstantModule.functorToPresheaves_map_app 📋 Mathlib.Condensed.Discrete.Module
{P : TopCat → Prop} (R : Type (max u w)) [Ring R] {X✝ Y✝ : ModuleCat R} (f : X✝ ⟶ Y✝) (S : (CompHausLike P)ᵒᵖ) : ((CompHausLike.LocallyConstantModule.functorToPresheaves R).map f).app S = ModuleCat.ofHom (LocallyConstant.mapₗ R (ModuleCat.Hom.hom f)) - CompHausLike.LocallyConstantModule.functor_obj_obj_map_hom_apply_apply 📋 Mathlib.Condensed.Discrete.Module
{P : TopCat → Prop} (R : Type (max u w)) [Ring R] [CompHausLike.HasExplicitFiniteCoproducts P] [CompHausLike.HasExplicitPullbacks P] (hs : ∀ ⦃X Y : CompHausLike P⦄ (f : X ⟶ Y), CategoryTheory.EffectiveEpi f → Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f)) (X : ModuleCat R) {X✝ Y✝ : (CompHausLike P)ᵒᵖ} (f : X✝ ⟶ Y✝) (g : LocallyConstant ↑(Opposite.unop X✝).toTop ↑X) (a✝ : ↑(Opposite.unop Y✝).toTop) : ((ModuleCat.Hom.hom (((CompHausLike.LocallyConstantModule.functor R hs).obj X).obj.map f)) g) a✝ = g ((TopCat.Hom.hom f.unop.hom) a✝) - LightCondSet.toTopCatMap_hom_apply 📋 Mathlib.Condensed.Light.TopCatAdjunction
{X Y : LightCondSet} (f : X ⟶ Y) (a : X.obj.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))) : (TopCat.Hom.hom (LightCondSet.toTopCatMap f)) a = (CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op (LightProfinite.of PUnit.{u + 1})))) a - lightProfiniteToLightCondSetIsoTopCatToLightCondSet_inv_app_hom_app_hom_apply_hom_hom 📋 Mathlib.Condensed.Light.Functors
(X : LightProfinite) (X✝ : LightProfiniteᵒᵖ) (f : (topCatToLightCondSet.obj (LightProfinite.toTopCat.obj X)).obj.obj X✝) : TopCat.Hom.hom ((CategoryTheory.ConcreteCategory.hom ((lightProfiniteToLightCondSetIsoTopCatToLightCondSet.inv.app X).hom.app X✝)) f).hom = f - CondensedSet.topCatAdjunctionCounit_hom_apply 📋 Mathlib.Condensed.TopCatAdjunction
(X : TopCat) (x : X.toCondensedSet.obj.obj (Opposite.op (CompHaus.of PUnit.{u + 1}))) : (TopCat.Hom.hom (CondensedSet.topCatAdjunctionCounit X)) x = x PUnit.unit - CondensedSet.toTopCatMap_hom_apply 📋 Mathlib.Condensed.TopCatAdjunction
{X Y : CondensedSet} (f : X ⟶ Y) (a : X.obj.obj (Opposite.op (CompHaus.of PUnit.{u + 1}))) : (TopCat.Hom.hom (CondensedSet.toTopCatMap f)) a = (CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op (CompHaus.of PUnit.{u + 1})))) a - topCatOpToFrm_map 📋 Mathlib.Topology.Category.CompHaus.Frm
{X✝ Y✝ : TopCatᵒᵖ} (f : X✝ ⟶ Y✝) : topCatOpToFrm.map f = Frm.ofHom (TopologicalSpace.Opens.comap (TopCat.Hom.hom f.unop)) - topToLocale_map 📋 Mathlib.Topology.Category.Locale
{X✝ Y✝ : TopCat} (f : X✝ ⟶ Y✝) : topToLocale.map f = (Frm.ofHom (TopologicalSpace.Opens.comap (TopCat.Hom.hom f))).op - Profinite.NobelingProof.spanFunctorIsoIndexFunctor_hom_app_hom_hom_apply_coe 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) (X : (Finset I)ᵒᵖ) (x : ↑(Profinite.NobelingProof.π C fun x => x ∈ Opposite.unop X)) (i : { i // (fun x => x ∈ Opposite.unop X) i }) : ↑((TopCat.Hom.hom ((Profinite.NobelingProof.spanFunctorIsoIndexFunctor hC).hom.app X).hom) x) i = ↑x ↑i - topToPreord_map 📋 Mathlib.Topology.Specialization
{X✝ Y✝ : TopCat} (f : X✝ ⟶ Y✝) : topToPreord.map f = Preord.ofHom (Specialization.map (TopCat.Hom.hom 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