Loogle!
Result
Found 6 declarations mentioning EquivFunctor.map.
- EquivFunctor.map š Mathlib.Control.EquivFunctor
{f : Type uā ā Type uā} [self : EquivFunctor f] {α β : Type uā} : α ā β ā f α ā f β - EquivFunctor.map_refl' š Mathlib.Control.EquivFunctor
{f : Type uā ā Type uā} [self : EquivFunctor f] (α : Type uā) : EquivFunctor.map (Equiv.refl α) = id - EquivFunctor.mapEquiv_apply š Mathlib.Control.EquivFunctor
(f : Type uā ā Type uā) [EquivFunctor f] {α β : Type uā} (e : α ā β) (x : f α) : (EquivFunctor.mapEquiv f e) x = EquivFunctor.map e x - EquivFunctor.map_trans' š Mathlib.Control.EquivFunctor
{f : Type uā ā Type uā} [self : EquivFunctor f] {α β γ : Type uā} (k : α ā β) (h : β ā γ) : EquivFunctor.map (k.trans h) = EquivFunctor.map h ā EquivFunctor.map k - EquivFunctor.mapEquiv_symm_apply š Mathlib.Control.EquivFunctor
(f : Type uā ā Type uā) [EquivFunctor f] {α β : Type uā} (e : α ā β) (y : f β) : (EquivFunctor.mapEquiv f e).symm y = EquivFunctor.map e.symm y - EquivFunctor.mapEquiv.eq_1 š Mathlib.Control.EquivFunctor
(f : Type uā ā Type uā) [EquivFunctor f] {α β : Type uā} (e : α ā β) : EquivFunctor.mapEquiv f e = { toFun := EquivFunctor.map e, invFun := EquivFunctor.map e.symm, left_inv := āÆ, right_inv := ⯠}
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:
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 ?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
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 findtsum_lt_tsum
even though the hypothesisf 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 bce1d65