Loogle!
Result
Found 43 declarations mentioning Std.DTreeMap.Internal.Impl.Const.getD.
- Std.DTreeMap.Internal.Impl.Const.getD 📋 Std.Data.DTreeMap.Internal.Queries
{α : Type u} {δ : Type w} [Ord α] (t : Std.DTreeMap.Internal.Impl α fun x => δ) (k : α) (fallback : δ) : δ - Std.DTreeMap.Internal.Impl.Const.getD.eq_1 📋 Std.Data.DTreeMap.Internal.Model
{α : Type u} {δ : Type w} [Ord α] (k : α) (fallback : δ) : Std.DTreeMap.Internal.Impl.Const.getD Std.DTreeMap.Internal.Impl.leaf k fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_eq_getDₘ 📋 Std.Data.DTreeMap.Internal.Model
{α : Type u} {β : Type v} [Ord α] (k : α) (l : Std.DTreeMap.Internal.Impl α fun x => β) (fallback : β) : Std.DTreeMap.Internal.Impl.Const.getD l k fallback = Std.DTreeMap.Internal.Impl.Const.getDₘ l k fallback - Std.DTreeMap.Internal.Impl.Const.getD.eq_2 📋 Std.Data.DTreeMap.Internal.Model
{α : Type u} {δ : Type w} [Ord α] (k : α) (fallback : δ) (size : ℕ) (k' : α) (v' : δ) (l r : Std.DTreeMap.Internal.Impl α fun x => δ) : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.inner size k' v' l r) k fallback = match compare k k' with | Ordering.lt => Std.DTreeMap.Internal.Impl.Const.getD l k fallback | Ordering.gt => Std.DTreeMap.Internal.Impl.Const.getD r k fallback | Ordering.eq => v' - Std.DTreeMap.Internal.Impl.Const.getD_eq_getValueD 📋 Std.Data.DTreeMap.Internal.WF.Lemmas
{α : Type u} {β : Type v} [Ord α] [Std.TransOrd α] [instBEq : BEq α] [Std.LawfulBEqOrd α] {k : α} {t : Std.DTreeMap.Internal.Impl α fun x => β} {fallback : β} (hto : t.Ordered) : Std.DTreeMap.Internal.Impl.Const.getD t k fallback = Std.Internal.List.getValueD k t.toListModel fallback - Std.DTreeMap.Internal.Impl.Const.getD_empty 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} [Std.TransOrd α] {a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD Std.DTreeMap.Internal.Impl.empty a fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_erase!_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.erase! k t) k fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_eq_getD_get? 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD t a fallback = (Std.DTreeMap.Internal.Impl.Const.get? t a).getD fallback - Std.DTreeMap.Internal.Impl.Const.getD_insert!_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insert! k v t) k fallback = v - Std.DTreeMap.Internal.Impl.Const.getD_of_isEmpty 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : t.isEmpty = true → Std.DTreeMap.Internal.Impl.Const.getD t a fallback = fallback - Std.DTreeMap.Internal.Impl.Const.get!_eq_getD_default 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [Inhabited β] (h : t.WF) {a : α} : Std.DTreeMap.Internal.Impl.Const.get! t a = Std.DTreeMap.Internal.Impl.Const.getD t a default - Std.DTreeMap.Internal.Impl.Const.getD_eq_fallback_of_contains_eq_false 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.contains a t = false → Std.DTreeMap.Internal.Impl.Const.getD t a fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_eq_getD 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [Std.LawfulEqOrd α] (h : t.WF) {a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD t a fallback = t.getD a fallback - Std.DTreeMap.Internal.Impl.Const.getD_eq_fallback 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : a ∉ t → Std.DTreeMap.Internal.Impl.Const.getD t a fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_congr 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a b : α} {fallback : β} (hab : compare a b = Ordering.eq) : Std.DTreeMap.Internal.Impl.Const.getD t a fallback = Std.DTreeMap.Internal.Impl.Const.getD t b fallback - Std.DTreeMap.Internal.Impl.Const.get_eq_getD 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} {h✝ : Std.DTreeMap.Internal.Impl.contains a t = true} : Std.DTreeMap.Internal.Impl.Const.get t a h✝ = Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.get?_eq_some_getD_of_contains 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.contains a t = true → Std.DTreeMap.Internal.Impl.Const.get? t a = some (Std.DTreeMap.Internal.Impl.Const.getD t a fallback) - Std.DTreeMap.Internal.Impl.Const.getD_alter!_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback : β} {f : Option β → Option β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.alter! k f t) k fallback = (f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback - Std.DTreeMap.Internal.Impl.Const.getD_modify_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} [Std.TransOrd α] {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} (h : t.WF) {k : α} {fallback : β} {f : β → β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.modify k f t) k fallback = (Option.map f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback - Std.DTreeMap.Internal.Impl.Const.get?_eq_some_getD 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {a : α} {fallback : β} : a ∈ t → Std.DTreeMap.Internal.Impl.Const.get? t a = some (Std.DTreeMap.Internal.Impl.Const.getD t a fallback) - Std.DTreeMap.Internal.Impl.Const.getD_erase! 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.erase! k t) a fallback = if compare k a = Ordering.eq then fallback else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_insert! 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insert! k v t) a fallback = if compare k a = Ordering.eq then v else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_erase_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.erase k t ⋯).impl k fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_insert_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insert k v t ⋯).impl k fallback = v - Std.DTreeMap.Internal.Impl.Const.getD_alter! 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k k' : α} {fallback : β} {f : Option β → Option β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.alter! k f t) k' fallback = if compare k k' = Ordering.eq then (f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback else Std.DTreeMap.Internal.Impl.Const.getD t k' fallback - Std.DTreeMap.Internal.Impl.Const.getD_modify 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} [Std.TransOrd α] {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} (h : t.WF) {k k' : α} {fallback : β} {f : β → β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.modify k f t) k' fallback = if compare k k' = Ordering.eq then (Option.map f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback else Std.DTreeMap.Internal.Impl.Const.getD t k' fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertManyIfNewUnit!_list 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {t : Std.DTreeMap.Internal.Impl α fun x => Unit} {l : List α} {k : α} {fallback : Unit} : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertManyIfNewUnit! t l)) k fallback = () - Std.DTreeMap.Internal.Impl.Const.getD_alter_self 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k : α} {fallback : β} {f : Option β → Option β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.alter k f t ⋯).impl k fallback = (f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback - Std.DTreeMap.Internal.Impl.Const.getD_erase 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.erase k t ⋯).impl a fallback = if compare k a = Ordering.eq then fallback else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_insert 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insert k v t ⋯).impl a fallback = if compare k a = Ordering.eq then v else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_alter 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k k' : α} {fallback : β} {f : Option β → Option β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.Const.alter k f t ⋯).impl k' fallback = if compare k k' = Ordering.eq then (f (Std.DTreeMap.Internal.Impl.Const.get? t k)).getD fallback else Std.DTreeMap.Internal.Impl.Const.getD t k' fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertIfNew! 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insertIfNew! k v t) a fallback = if compare k a = Ordering.eq ∧ k ∉ t then v else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertManyIfNewUnit_list 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {t : Std.DTreeMap.Internal.Impl α fun x => Unit} (h : t.WF) {l : List α} {k : α} {fallback : Unit} : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertManyIfNewUnit t l ⋯)) k fallback = () - Std.DTreeMap.Internal.Impl.Const.getD_insertManyIfNewUnit_empty_list 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {l : List α} {k : α} {fallback : Unit} : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertManyIfNewUnit Std.DTreeMap.Internal.Impl.empty l ⋯)) k fallback = () - Std.DTreeMap.Internal.Impl.Const.getD_insertMany!_list_of_contains_eq_false 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [BEq α] [Std.LawfulBEqOrd α] (h : t.WF) {l : List (α × β)} {k : α} {fallback : β} (h' : (List.map Prod.fst l).contains k = false) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany! t l)) k fallback = Std.DTreeMap.Internal.Impl.Const.getD t k fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertIfNew 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {k a : α} {fallback v : β} : Std.DTreeMap.Internal.Impl.Const.getD (Std.DTreeMap.Internal.Impl.insertIfNew k v t ⋯).impl a fallback = if compare k a = Ordering.eq ∧ k ∉ t then v else Std.DTreeMap.Internal.Impl.Const.getD t a fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertMany!_list_of_mem 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {l : List (α × β)} {k k' : α} {v fallback : β} (k_beq : compare k k' = Ordering.eq) (distinct : List.Pairwise (fun a b => ¬compare a.1 b.1 = Ordering.eq) l) (mem : (k, v) ∈ l) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany! t l)) k' fallback = v - Std.DTreeMap.Internal.Impl.Const.getD_insertMany!_list 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [BEq α] [Std.LawfulBEqOrd α] (h : t.WF) {l : List (α × β)} {k : α} (fallback : β) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany! t l)) k fallback = (List.findSomeRev? (fun x => match x with | (a, b) => if compare a k = Ordering.eq then some b else none) l).getD (Std.DTreeMap.Internal.Impl.Const.getD t k fallback) - Std.DTreeMap.Internal.Impl.Const.getD_insertMany_empty_list_of_contains_eq_false 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} [Std.TransOrd α] [BEq α] [Std.LawfulBEqOrd α] {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany Std.DTreeMap.Internal.Impl.empty l ⋯)) k fallback = fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertMany_list_of_contains_eq_false 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [BEq α] [Std.LawfulBEqOrd α] (h : t.WF) {l : List (α × β)} {k : α} {fallback : β} (h' : (List.map Prod.fst l).contains k = false) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany t l ⋯)) k fallback = Std.DTreeMap.Internal.Impl.Const.getD t k fallback - Std.DTreeMap.Internal.Impl.Const.getD_insertMany_list_of_mem 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] (h : t.WF) {l : List (α × β)} {k k' : α} {v fallback : β} (k_beq : compare k k' = Ordering.eq) (distinct : List.Pairwise (fun a b => ¬compare a.1 b.1 = Ordering.eq) l) (mem : (k, v) ∈ l) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany t l ⋯)) k' fallback = v - Std.DTreeMap.Internal.Impl.Const.getD_insertMany_empty_list_of_mem 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} [Std.TransOrd α] {l : List (α × β)} {k k' : α} (k_beq : compare k k' = Ordering.eq) {v fallback : β} (distinct : List.Pairwise (fun a b => ¬compare a.1 b.1 = Ordering.eq) l) (mem : (k, v) ∈ l) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany Std.DTreeMap.Internal.Impl.empty l ⋯)) k' fallback = v - Std.DTreeMap.Internal.Impl.Const.getD_insertMany_list 📋 Std.Data.DTreeMap.Internal.Lemmas
{α : Type u} {instOrd : Ord α} {β : Type v} {t : Std.DTreeMap.Internal.Impl α fun x => β} [Std.TransOrd α] [BEq α] [Std.LawfulBEqOrd α] (h : t.WF) {l : List (α × β)} {k : α} (fallback : β) : Std.DTreeMap.Internal.Impl.Const.getD (↑(Std.DTreeMap.Internal.Impl.Const.insertMany t l ⋯)) k fallback = (List.findSomeRev? (fun x => match x with | (a, b) => if compare a k = Ordering.eq then some b else none) l).getD (Std.DTreeMap.Internal.Impl.Const.getD t k fallback)
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