Loogle!

Result

Found 47 declarations mentioning Std.ExtDTreeMap.Const.getD.

• Std.ExtDTreeMap.Const.getD 📋 Std.Data.ExtDTreeMap.Basic
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} [Std.TransCmp cmp] (t : Std.ExtDTreeMap α (fun x => β) cmp) (a : α) (fallback : β) : β
• Std.ExtDTreeMap.Const.getD_unitOfList 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} [Std.TransCmp cmp] {l : List α} {k : α} {fallback : Unit} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.unitOfList l cmp) k fallback = ()
• Std.ExtDTreeMap.Const.getD_empty 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} [Std.TransCmp cmp] {a : α} {fallback : β} : Std.ExtDTreeMap.Const.getD ∅ a fallback = fallback
• Std.ExtDTreeMap.Const.getD_erase_self 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (t.erase k) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_eq_getD_get? 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} : Std.ExtDTreeMap.Const.getD t a fallback = (Std.ExtDTreeMap.Const.get? t a).getD fallback
• Std.ExtDTreeMap.Const.getD_insert_self 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback v : β} : Std.ExtDTreeMap.Const.getD (t.insert k v) k fallback = v
• Std.ExtDTreeMap.Const.get!_eq_getD_default 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Inhabited β] {a : α} : Std.ExtDTreeMap.Const.get! t a = Std.ExtDTreeMap.Const.getD t a default
• Std.ExtDTreeMap.Const.getD_eq_fallback_of_contains_eq_false 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} : t.contains a = false → Std.ExtDTreeMap.Const.getD t a fallback = fallback
• Std.ExtDTreeMap.Const.getD_eq_getD 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Std.LawfulEqCmp cmp] {a : α} {fallback : β} : Std.ExtDTreeMap.Const.getD t a fallback = t.getD a fallback
• Std.ExtDTreeMap.Const.getD_congr 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a b : α} {fallback : β} (hab : cmp a b = Ordering.eq) : Std.ExtDTreeMap.Const.getD t a fallback = Std.ExtDTreeMap.Const.getD t b fallback
• Std.ExtDTreeMap.Const.getD_eq_fallback 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} : a ∉ t → Std.ExtDTreeMap.Const.getD t a fallback = fallback
• Std.ExtDTreeMap.Const.get?_eq_some_getD_of_contains 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} : t.contains a = true → Std.ExtDTreeMap.Const.get? t a = some (Std.ExtDTreeMap.Const.getD t a fallback)
• Std.ExtDTreeMap.Const.getD_alter_self 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} {f : Option β → Option β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.alter t k f) k fallback = (f (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.getD_modify_self 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} [Std.TransCmp cmp] {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} {k : α} {fallback : β} {f : β → β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.modify t k f) k fallback = (Option.map f (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.get_eq_getD 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} {h : a ∈ t} : Std.ExtDTreeMap.Const.get t a h = Std.ExtDTreeMap.Const.getD t a fallback
• Std.ExtDTreeMap.Const.get?_eq_some_getD 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {a : α} {fallback : β} : a ∈ t → Std.ExtDTreeMap.Const.get? t a = some (Std.ExtDTreeMap.Const.getD t a fallback)
• Std.ExtDTreeMap.Const.getD_insertManyIfNewUnit_list 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {t : Std.ExtDTreeMap α (fun x => Unit) cmp} [Std.TransCmp cmp] {l : List α} {k : α} {fallback : Unit} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.insertManyIfNewUnit t l) k fallback = ()
• Std.ExtDTreeMap.Const.getD_filter' 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Std.LawfulEqCmp cmp] {f : α → β → Bool} {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filter f t) k fallback = (Option.filter (f k) (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.getD_ofList_of_contains_eq_false 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} [Std.TransCmp cmp] [BEq α] [Std.LawfulBEqCmp cmp] {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.ofList l cmp) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_union 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (t₁.union t₂) k fallback = Std.ExtDTreeMap.Const.getD t₂ k (Std.ExtDTreeMap.Const.getD t₁ k fallback)
• Std.ExtDTreeMap.Const.get!_union 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Inhabited β] {k : α} : Std.ExtDTreeMap.Const.get! (t₁.union t₂) k = Std.ExtDTreeMap.Const.getD t₂ k (Std.ExtDTreeMap.Const.get! t₁ k)
• Std.ExtDTreeMap.Const.getD_erase 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k a : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (t.erase k) a fallback = if cmp k a = Ordering.eq then fallback else Std.ExtDTreeMap.Const.getD t a fallback
• Std.ExtDTreeMap.Const.getD_map 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Std.LawfulEqCmp cmp] {f : α → β → γ} {k : α} {fallback : γ} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.map f t) k fallback = (Option.map (f k) (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.getD_filterMap' 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Std.LawfulEqCmp cmp] {f : α → β → Option γ} {k : α} {fallback : γ} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filterMap f t) k fallback = ((Std.ExtDTreeMap.Const.get? t k).bind (f k)).getD fallback
• Std.ExtDTreeMap.Const.getD_insert 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k a : α} {fallback v : β} : Std.ExtDTreeMap.Const.getD (t.insert k v) a fallback = if cmp k a = Ordering.eq then v else Std.ExtDTreeMap.Const.getD t a fallback
• Std.ExtDTreeMap.Const.getD_diff_of_mem_right 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∈ t₂) : Std.ExtDTreeMap.Const.getD (t₁ \ t₂) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_diff_of_not_mem_left 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∉ t₁) : Std.ExtDTreeMap.Const.getD (t₁ \ t₂) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_inter_of_not_mem_left 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∉ t₁) : Std.ExtDTreeMap.Const.getD (t₁ ∩ t₂) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_inter_of_not_mem_right 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∉ t₂) : Std.ExtDTreeMap.Const.getD (t₁ ∩ t₂) k fallback = fallback
• Std.ExtDTreeMap.Const.getD_union_of_not_mem_left 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (not_mem : k ∉ t₁) : Std.ExtDTreeMap.Const.getD (t₁.union t₂) k fallback = Std.ExtDTreeMap.Const.getD t₂ k fallback
• Std.ExtDTreeMap.Const.getD_union_of_not_mem_right 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (not_mem : k ∉ t₂) : Std.ExtDTreeMap.Const.getD (t₁.union t₂) k fallback = Std.ExtDTreeMap.Const.getD t₁ k fallback
• Std.ExtDTreeMap.Const.getD_filter_of_getKey?_eq_some 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {f : α → β → Bool} {k k' : α} {fallback : β} : t.getKey? k = some k' → Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filter f t) k fallback = (Option.filter (fun x => f k' x) (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.getD_inter_of_mem_right 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∈ t₂) : Std.ExtDTreeMap.Const.getD (t₁ ∩ t₂) k fallback = Std.ExtDTreeMap.Const.getD t₁ k fallback
• Std.ExtDTreeMap.Const.getD_diff_of_not_mem_right 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} (h : k ∉ t₂) : Std.ExtDTreeMap.Const.getD (t₁ \ t₂) k fallback = Std.ExtDTreeMap.Const.getD t₁ k fallback
• Std.ExtDTreeMap.Const.getD_filterMap_of_getKey?_eq_some 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {f : α → β → Option γ} {k k' : α} {fallback : γ} (h : t.getKey? k = some k') : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filterMap f t) k fallback = ((Std.ExtDTreeMap.Const.get? t k).bind (f k')).getD fallback
• Std.ExtDTreeMap.Const.getD_alter 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k k' : α} {fallback : β} {f : Option β → Option β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.alter t k f) k' fallback = if cmp k k' = Ordering.eq then (f (Std.ExtDTreeMap.Const.get? t k)).getD fallback else Std.ExtDTreeMap.Const.getD t k' fallback
• Std.ExtDTreeMap.Const.getD_map_of_getKey?_eq_some 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [Inhabited γ] {f : α → β → γ} {k k' : α} {fallback : γ} (h : t.getKey? k = some k') : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.map f t) k fallback = (Option.map (f k') (Std.ExtDTreeMap.Const.get? t k)).getD fallback
• Std.ExtDTreeMap.Const.getD_modify 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} [Std.TransCmp cmp] {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} {k k' : α} {fallback : β} {f : β → β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.modify t k f) k' fallback = if cmp k k' = Ordering.eq then (Option.map f (Std.ExtDTreeMap.Const.get? t k)).getD fallback else Std.ExtDTreeMap.Const.getD t k' fallback
• Std.ExtDTreeMap.Const.getD_diff 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (t₁ \ t₂) k fallback = if k ∈ t₂ then fallback else Std.ExtDTreeMap.Const.getD t₁ k fallback
• Std.ExtDTreeMap.Const.getD_inter 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (t₁ ∩ t₂) k fallback = if k ∈ t₂ then Std.ExtDTreeMap.Const.getD t₁ k fallback else fallback
• Std.ExtDTreeMap.Const.getD_ofList_of_mem 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} [Std.TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v fallback : β} (distinct : List.Pairwise (fun a b => ¬cmp a.1 b.1 = Ordering.eq) l) (mem : (k, v) ∈ l) : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.ofList l cmp) k' fallback = v
• Std.ExtDTreeMap.Const.getD_insertMany_list_of_contains_eq_false 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] [BEq α] [Std.LawfulBEqCmp cmp] {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.insertMany t l) k fallback = Std.ExtDTreeMap.Const.getD t k fallback
• Std.ExtDTreeMap.Const.getD_filter 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {f : α → β → Bool} {k : α} {fallback : β} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filter f t) k fallback = ((Std.ExtDTreeMap.Const.get? t k).pfilter fun x h' => f (t.getKey k ⋯) x).getD fallback
• Std.ExtDTreeMap.Const.getD_insertMany_list_of_mem 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v fallback : β} (distinct : List.Pairwise (fun a b => ¬cmp a.1 b.1 = Ordering.eq) l) (mem : (k, v) ∈ l) : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.Const.insertMany t l) k' fallback = v
• Std.ExtDTreeMap.Const.getD_filterMap 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {f : α → β → Option γ} {k : α} {fallback : γ} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.filterMap f t) k fallback = ((Std.ExtDTreeMap.Const.get? t k).pbind fun x h' => f (t.getKey k ⋯) x).getD fallback
• Std.ExtDTreeMap.Const.getD_insertIfNew 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {k a : α} {fallback v : β} : Std.ExtDTreeMap.Const.getD (t.insertIfNew k v) a fallback = if cmp k a = Ordering.eq ∧ k ∉ t then v else Std.ExtDTreeMap.Const.getD t a fallback
• Std.ExtDTreeMap.Const.getD_map' 📋 Std.Data.ExtDTreeMap.Lemmas
  {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Std.ExtDTreeMap α (fun x => β) cmp} [Std.TransCmp cmp] {f : α → β → γ} {k : α} {fallback : γ} : Std.ExtDTreeMap.Const.getD (Std.ExtDTreeMap.map f t) k fallback = (Option.pmap (fun v h => f (t.getKey k h) v) (Std.ExtDTreeMap.Const.get? t k) ⋯).getD fallback

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. 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.

5. 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 e668239 serving mathlib revision 42b23e7