Loogle!

Result

Found 13 declarations mentioning FreeAddGroup.map.

• FreeAddGroup.map 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} (f : α → β) : FreeAddGroup α →+ FreeAddGroup β
• FreeAddGroup.map.id 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} (x : FreeAddGroup α) : (FreeAddGroup.map id) x = x
• FreeAddGroup.map.id' 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} (x : FreeAddGroup α) : (FreeAddGroup.map fun z => z) x = x
• FreeAddGroup.map.of 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} {f : α → β} {x : α} : (FreeAddGroup.map f) (FreeAddGroup.of x) = FreeAddGroup.of (f x)
• FreeAddGroup.map.eq_1 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} (f : α → β) : FreeAddGroup.map f = AddMonoidHom.mk' (Quot.map (List.map fun x => (f x.1, x.2)) ⋯) ⋯
• FreeAddGroup.map.mk 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {L : List (α × Bool)} {β : Type v} {f : α → β} : (FreeAddGroup.map f) (FreeAddGroup.mk L) = FreeAddGroup.mk (List.map (fun x => (f x.1, x.2)) L)
• FreeAddGroup.freeAddGroupCongr_apply 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u_1} {β : Type u_2} (e : α ≃ β) (a : FreeAddGroup α) : (FreeAddGroup.freeAddGroupCongr e) a = (FreeAddGroup.map ⇑e) a
• FreeAddGroup.freeAddGroupCongr.eq_1 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u_1} {β : Type u_2} (e : α ≃ β) : FreeAddGroup.freeAddGroupCongr e = { toFun := ⇑(FreeAddGroup.map ⇑e), invFun := ⇑(FreeAddGroup.map ⇑e.symm), left_inv := ⋯, right_inv := ⋯, map_add' := ⋯ }
• FreeAddGroup.map.comp 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} {γ : Type w} (f : α → β) (g : β → γ) (x : FreeAddGroup α) : (FreeAddGroup.map g) ((FreeAddGroup.map f) x) = (FreeAddGroup.map (g ∘ f)) x
• FreeAddGroup.map.unique 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} {f : α → β} (g : FreeAddGroup α →+ FreeAddGroup β) (hg : ∀ (x : α), g (FreeAddGroup.of x) = FreeAddGroup.of (f x)) {x : FreeAddGroup α} : g x = (FreeAddGroup.map f) x
• FreeAddGroup.map_eq_lift 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} {f : α → β} {x : FreeAddGroup α} : (FreeAddGroup.map f) x = (FreeAddGroup.lift (FreeAddGroup.of ∘ f)) x
• FreeAddGroup.lift_eq_sum_map 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} {β : Type v} [AddGroup β] {f : α → β} {x : FreeAddGroup α} : (FreeAddGroup.lift f) x = FreeAddGroup.sum ((FreeAddGroup.map f) x)
• FreeAddGroup.instMonad.eq_1 📋 Mathlib.GroupTheory.FreeGroup.Basic
  : FreeAddGroup.instMonad = { map := fun {_α _β} {f} => ⇑(FreeAddGroup.map f), pure := fun {_α} => FreeAddGroup.of, seq := fun {α β} f x {_α _β} {x} {f} => (FreeAddGroup.lift f) x, seqLeft := fun {α β} x y {_α _β} {x} {f} => (FreeAddGroup.lift f) x, seqRight := fun {α β} x y {_α _β} {x} {f} => (FreeAddGroup.lift f) x, bind := fun {_α _β} {x} {f} => (FreeAddGroup.lift f) x }

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 ff04530 serving mathlib revision 8623f65