Loogle!

Result

Found 9 declarations mentioning CategoryTheory.ThinSkeleton.map.

• CategoryTheory.ThinSkeleton.map 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : CategoryTheory.Functor (CategoryTheory.ThinSkeleton C) (CategoryTheory.ThinSkeleton D)
• CategoryTheory.ThinSkeleton.map_id_eq 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [Quiver.IsThin C] : CategoryTheory.ThinSkeleton.map (CategoryTheory.Functor.id C) = CategoryTheory.Functor.id (CategoryTheory.ThinSkeleton C)
• CategoryTheory.ThinSkeleton.lowerAdjunction 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (R : CategoryTheory.Functor D C) (L : CategoryTheory.Functor C D) (h : L ⊣ R) : CategoryTheory.ThinSkeleton.map L ⊣ CategoryTheory.ThinSkeleton.map R
• CategoryTheory.ThinSkeleton.map_iso_eq 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [Quiver.IsThin C] {F₁ F₂ : CategoryTheory.Functor D C} (h : F₁ ≅ F₂) : CategoryTheory.ThinSkeleton.map F₁ = CategoryTheory.ThinSkeleton.map F₂
• CategoryTheory.ThinSkeleton.comp_toThinSkeleton 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : F.comp (CategoryTheory.toThinSkeleton D) = (CategoryTheory.toThinSkeleton C).comp (CategoryTheory.ThinSkeleton.map F)
• CategoryTheory.ThinSkeleton.map_comp_eq 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] [Quiver.IsThin C] (F : CategoryTheory.Functor E D) (G : CategoryTheory.Functor D C) : CategoryTheory.ThinSkeleton.map (F.comp G) = (CategoryTheory.ThinSkeleton.map F).comp (CategoryTheory.ThinSkeleton.map G)
• CategoryTheory.ThinSkeleton.map_obj 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (a✝ : Quotient (CategoryTheory.isIsomorphicSetoid C)) : (CategoryTheory.ThinSkeleton.map F).obj a✝ = Quotient.map F.obj ⋯ a✝
• CategoryTheory.ThinSkeleton.mapNatTrans 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F₁ F₂ : CategoryTheory.Functor C D} (k : F₁ ⟶ F₂) : CategoryTheory.ThinSkeleton.map F₁ ⟶ CategoryTheory.ThinSkeleton.map F₂
• CategoryTheory.ThinSkeleton.map_map 📋 Mathlib.CategoryTheory.Skeletal
  {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {X Y : CategoryTheory.ThinSkeleton C} (a✝ : X ⟶ Y) : (CategoryTheory.ThinSkeleton.map F).map a✝ = Quotient.recOnSubsingleton₂ (motive := fun x x_1 => (x ⟶ x_1) → (Quotient.map F.obj ⋯ x ⟶ Quotient.map F.obj ⋯ x_1)) X Y (fun x x_1 k => CategoryTheory.homOfLE ⋯) a✝

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using (by default) Ctrl-K Ctrl-S. 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:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. 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 ?a

   If 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 ?b

4. By 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 find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

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.

This is Loogle revision 19971e9 serving mathlib revision 40fea08