Loogle!
Error
Unknown identifier `A`
Did you maybe mean
- 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → Std.Time.Modifier.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → Std.Time.Modifier.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → _private.Std.Time.Format.Basic.0.Std.Time.GenericFormat.DateBuilder.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → _private.Std.Time.Format.Basic.0.Std.Time.GenericFormat.DateBuilder.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → _private.Lean.Meta.Tactic.Grind.Order.Internalize.0.Lean.Meta.Grind.Order.OffsetTermResult.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → Module.Basis.SmithNormalForm.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.Comonad.Coalgebra.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.Comonad.Coalgebra.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.Monad.Algebra.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.Monad.Algebra.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → GenContFract.Pair.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → Cubic.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → LieAlgebra.Basis.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CartanMatrix.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → AlgebraicGeometry.ExistsHomHomCompEqCompAux.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → AlgebraicTopology.DoldKan.MorphComponents.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → FDerivMeasurableAux.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → RightDerivMeasurableAux.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.Endofunctor.Algebra.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CategoryTheory.PreOneHypercover.Homotopy.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → PFunctor.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → MvPFunctor.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → PNat.XgcdType.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → CoxeterMatrix.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → QuaternionGroup.a - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → ADEInequality.A - 🔍
(LieAlgebra.Basis.A ∨ SSet.Subcomplex.Pairing.RankFunction.b) → ¬GenContFract.Pair.b → _private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThreeGen.Solution'.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:
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 3a988db serving mathlib revision bb88d2c