Loogle!
Result
Found 2838 definitions mentioning List and Nat. Of these, 37 match your pattern(s).
- List.set Init.Prelude
{α : Type u_1} → List α → ℕ → α → List α - List.replicate Init.Data.List.Basic
{α : Type u} → ℕ → α → List α - List.replicateTR Init.Data.List.Impl
{α : Type u} → ℕ → α → List α - List.setTR Init.Data.List.Impl
{α : Type u_1} → List α → ℕ → α → List α - List.replicateTR.loop Init.Data.List.Impl
{α : Type u} → α → ℕ → List α → List α - List.replicate_eq_replicateTR Init.Data.List.Impl
@List.replicate = @List.replicateTR - List.set_eq_setTR Init.Data.List.Impl
@List.set = @List.setTR - List.setTR.go Init.Data.List.Impl
{α : Type u_1} → List α → α → List α → ℕ → Array α → List α - List.insertNth Batteries.Data.List.Basic
{α : Type u_1} → ℕ → α → List α → List α - List.insertNthTR Batteries.Data.List.Basic
{α : Type u_1} → ℕ → α → List α → List α - List.leftpad Batteries.Data.List.Basic
{α : Type u_1} → ℕ → α → List α → List α - List.leftpadTR Batteries.Data.List.Basic
{α : Type u_1} → ℕ → α → List α → List α - List.takeD Batteries.Data.List.Basic
{α : Type u_1} → ℕ → List α → α → List α - List.takeDTR Batteries.Data.List.Basic
{α : Type u_1} → ℕ → List α → α → List α - List.toChunks Batteries.Data.List.Basic
{α : Type u_1} → ℕ → List α → List (List α) - List.insertNthTR.go Batteries.Data.List.Basic
{α : Type u_1} → α → ℕ → List α → Array α → List α - List.takeDTR.go Batteries.Data.List.Basic
{α : Type u_1} → α → ℕ → List α → Array α → List α - List.insertNth_eq_insertNthTR Batteries.Data.List.Basic
@List.insertNth = @List.insertNthTR - List.leftpad_eq_leftpadTR Batteries.Data.List.Basic
@List.leftpad = @List.leftpadTR - List.takeD_eq_takeDTR Batteries.Data.List.Basic
@List.takeD = @List.takeDTR - List.range' Batteries.Data.List.Basic
ℕ → ℕ → optParam ℕ 1 → List ℕ - List.range'TR Batteries.Data.List.Basic
ℕ → ℕ → optParam ℕ 1 → List ℕ - List.toChunks.go Batteries.Data.List.Basic
{α : Type u_1} → ℕ → List α → Array α → Array (List α) → List (List α) - List.range'TR.go Batteries.Data.List.Basic
optParam ℕ 1 → ℕ → ℕ → List ℕ → List ℕ - List.range'_eq_range'TR Batteries.Data.List.Basic
@List.range' = @List.range'TR - List.iterate Mathlib.Data.List.Defs
{α : Type u_1} → (α → α) → α → ℕ → List α - List.iterateTR Mathlib.Data.List.Defs
{α : Type u_1} → (α → α) → α → ℕ → List α - List.iterateTR.loop Mathlib.Data.List.Defs
{α : Type u_1} → (α → α) → α → ℕ → List α → List α - List.iterate_eq_iterateTR Mathlib.Data.List.Defs
@List.iterate = @List.iterateTR - List.sublistsLen Mathlib.Data.List.Sublists
{α : Type u} → ℕ → List α → List (List α) - Nat.digits Mathlib.Data.Nat.Digits
ℕ → ℕ → List ℕ - Nat.digitsAux Mathlib.Data.Nat.Digits
(b : ℕ) → 2 ≤ b → ℕ → List ℕ - List.splitWrtComposition Mathlib.Combinatorics.Enumerative.Composition
{n : ℕ} → {α : Type u_1} → List α → Composition n → List (List α) - Matrix.Pivot.listTransvecCol Mathlib.LinearAlgebra.Matrix.Transvection
{𝕜 : Type u_3} → [inst : Field 𝕜] → {r : ℕ} → Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜 → List (Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜) - Matrix.Pivot.listTransvecRow Mathlib.LinearAlgebra.Matrix.Transvection
{𝕜 : Type u_3} → [inst : Field 𝕜] → {r : ℕ} → Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜 → List (Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜) - List.Ico Mathlib.Data.List.Intervals
ℕ → ℕ → List ℕ - CoxeterSystem.alternatingWord Mathlib.GroupTheory.Coxeter.Basic
{B : Type u_1} → B → B → ℕ → List B
About
Loogle searches of Lean and Mathlib definitions and theorems.
You may also want to try the CLI version, the 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, _ * _, _ ^ _, |- _ < _ → _
woould 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 currently provided by Joachim Breitner <mail@joachim-breitner.de>.
This is Loogle revision fcc2c2c
serving mathlib revision c655316