path
stringlengths
12
84
imports
listlengths
0
4.45k
premises
listlengths
0
625
.lake/packages/lean4/src/lean/Init/Prelude.lean
[]
[ { "full_name": "id", "code": "@[inline] def id {α : Sort u} (a : α) : α := a", "start": [ 21, 1 ], "end": [ 33, 47 ], "kind": "commanddeclaration" }, { "full_name": "Function.comp", "code": "@[inline] def Function.comp {α : Sort u} {β : Sort v} {δ : So...
.lake/packages/lean4/src/lean/Init/Coe.lean
[ ".lake/packages/lean4/src/lean/Init/Prelude.lean" ]
[ { "full_name": "Coe", "code": "class Coe (α : semiOutParam (Sort u)) (β : Sort v) where\n \n coe : α → β", "start": [ 120, 1 ], "end": [ 129, 14 ], "kind": "commanddeclaration" }, { "full_name": "CoeTC", "code": "class CoeTC (α : Sort u) (β : Sort v)...
.lake/packages/lean4/src/lean/Init/Notation.lean
[ ".lake/packages/lean4/src/lean/Init/Coe.lean", ".lake/packages/lean4/src/lean/Init/Prelude.lean" ]
[ { "full_name": "Lean.Parser.Category", "code": "structure Parser.Category", "start": [ 15, 1 ], "end": [ 19, 26 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Parser.Category.command", "code": "def command : Category := {}", "start": [ ...
.lake/packages/lean4/src/lean/Init/Tactics.lean
[ ".lake/packages/lean4/src/lean/Init/Notation.lean" ]
[ { "full_name": "Lean.Parser.Tactic.simpArg", "code": "def simpArg := simpStar.binary `orelse (simpErase.binary `orelse simpLemma)", "start": [ 588, 1 ], "end": [ 592, 76 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Parser.Tactic.dsimpArg", "...
.lake/packages/lean4/src/lean/Init/SizeOf.lean
[ ".lake/packages/lean4/src/lean/Init/Tactics.lean" ]
[ { "full_name": "SizeOf", "code": "class SizeOf (α : Sort u) where\n \n sizeOf : α → Nat", "start": [ 12, 1 ], "end": [ 28, 19 ], "kind": "commanddeclaration" }, { "full_name": "default.sizeOf", "code": "protected def default.sizeOf (α : Sort u) : α →...
.lake/packages/lean4/src/lean/Init/Core.lean
[ ".lake/packages/lean4/src/lean/Init/Prelude.lean", ".lake/packages/lean4/src/lean/Init/SizeOf.lean" ]
[ { "full_name": "inline", "code": "@[simp] def inline {α : Sort u} (a : α) : α := a", "start": [ 15, 1 ], "end": [ 20, 49 ], "kind": "commanddeclaration" }, { "full_name": "id_def", "code": "theorem id_def {α : Sort u} (a : α) : id a = a", "start": ...
.lake/packages/lean4/src/lean/Init/SimpLemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "of_eq_true", "code": "theorem of_eq_true (h : p = True) : p", "start": [ 12, 1 ], "end": [ 12, 53 ], "kind": "commanddeclaration" }, { "full_name": "of_eq_false", "code": "theorem of_eq_false (h : p = False) : ¬ p", "start": [ ...
.lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/SimpLemmas.lean" ]
[ { "full_name": "Nat.recCompiled", "code": "private def recCompiled {motive : Nat → Sort u} (zero : motive zero) (succ : (n : Nat) → motive n → motive (Nat.succ n)) : (t : Nat) → motive t\n | .zero => zero\n | .succ n => succ n (recCompiled zero succ n)", "start": [ 13, 1 ], "end": ...
.lake/packages/lean4/src/lean/Init/MetaTypes.lean
[ ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "Lean.NameGenerator", "code": "structure NameGenerator where\n namePrefix : Name := `_uniq\n idx : Nat := 1\n deriving Inhabited", "start": [ 11, 1 ], "end": [ 14, 21 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Module"...
.lake/packages/lean4/src/lean/Init/WF.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean", ".lake/packages/lean4/src/lean/Init/SizeOf.lean" ]
[ { "full_name": "Acc", "code": "inductive Acc {α : Sort u} (r : α → α → Prop) : α → Prop where\n \n | intro (x : α) (h : (y : α) → r y x → Acc r y) : Acc r x", "start": [ 12, 1 ], "end": [ 24, 60 ], "kind": "commanddeclaration" }, { "full_name": "Acc.ndre...
.lake/packages/lean4/src/lean/Init/WFTactics.lean
[ ".lake/packages/lean4/src/lean/Init/WF.lean", ".lake/packages/lean4/src/lean/Init/MetaTypes.lean", ".lake/packages/lean4/src/lean/Init/SizeOf.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean
[ ".lake/packages/lean4/src/lean/Init/WF.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean", ".lake/packages/lean4/src/lean/Init/WFTactics.lean" ]
[ { "full_name": "Nat.div_rec_lemma", "code": "theorem div_rec_lemma {x y : Nat} : 0 < y ∧ y ≤ x → x - y < x", "start": [ 20, 1 ], "end": [ 21, 65 ], "kind": "commanddeclaration" }, { "full_name": "Nat.div", "code": "@[extern \"lean_nat_div\"]\nprotected...
.lake/packages/lean4/src/lean/Init/Data/Nat/Bitwise/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean", ".lake/packages/lean4/src/lean/Init/Coe.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean" ]
[ { "full_name": "Nat.bitwise_rec_lemma", "code": "theorem bitwise_rec_lemma {n : Nat} (hNe : n ≠ 0) : n / 2 < n", "start": [ 13, 1 ], "end": [ 14, 68 ], "kind": "commanddeclaration" }, { "full_name": "Nat.bitwise", "code": "def bitwise (f : Bool → Bool ...
.lake/packages/lean4/src/lean/Init/Data/Fin/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Bitwise/Basic.lean" ]
[ { "full_name": "Fin.coeToNat", "code": "instance coeToNat : CoeOut (Fin n) Nat :=\n ⟨fun v => v.val⟩", "start": [ 13, 1 ], "end": [ 14, 19 ], "kind": "commanddeclaration" }, { "full_name": "Fin.elim0", "code": "def elim0.{u} {α : Sort u} : Fin 0 → α\n...
.lake/packages/lean4/src/lean/Init/Data/List/Notation.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Control/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "Functor.mapRev", "code": "@[reducible]\ndef Functor.mapRev {f : Type u → Type v} [Functor f] {α β : Type u} : f α → (α → β) → f β :=\n fun a f => f <$> a", "start": [ 11, 1 ], "end": [ 13, 21 ], "kind": "commanddeclaration" }, { "full_name...
.lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Fin/Basic.lean" ]
[ { "full_name": "UInt8.ofNat", "code": "@[extern \"lean_uint8_of_nat\"]\ndef UInt8.ofNat (n : @& Nat) : UInt8 := ⟨Fin.ofNat n⟩", "start": [ 11, 1 ], "end": [ 12, 54 ], "kind": "commanddeclaration" }, { "full_name": "Nat.toUInt8", "code": "abbrev Nat.toU...
.lake/packages/lean4/src/lean/Init/Control/Id.lean
[ ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "Id", "code": "def Id (type : Type u) : Type u := type", "start": [ 13, 1 ], "end": [ 13, 40 ], "kind": "commanddeclaration" }, { "full_name": "Id.hasBind", "code": "def hasBind : Bind Id :=\n inferInstance", "start": [ 23, ...
.lake/packages/lean4/src/lean/Init/Data/Cast.lean
[ ".lake/packages/lean4/src/lean/Init/Coe.lean" ]
[ { "full_name": "NatCast", "code": "class NatCast (R : Type u) where\n \n protected natCast : Nat → R", "start": [ 47, 1 ], "end": [ 50, 30 ], "kind": "commanddeclaration" }, { "full_name": "Nat.cast", "code": "@[coe, reducible, match_pattern] protect...
.lake/packages/lean4/src/lean/Init/Data/List/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/SimpLemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/List/Notation.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean" ]
[ { "full_name": "List.length_nil", "code": "@[simp] theorem length_nil : length ([] : List α) = 0", "start": [ 65, 1 ], "end": [ 66, 6 ], "kind": "commanddeclaration" }, { "full_name": "List.length_singleton", "code": "@[simp 1100] theorem length_single...
.lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Coe.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean", ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "Option.getM", "code": "def getM [Alternative m] : Option α → m α\n | none => failure\n | some a => pure a", "start": [ 16, 1 ], "end": [ 19, 23 ], "kind": "commanddeclaration" }, { "full_name": "Option.toMonad", "code": "@[depre...
.lake/packages/lean4/src/lean/Init/Data/Char/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean" ]
[ { "full_name": "isValidChar", "code": "@[inline, reducible] def isValidChar (n : UInt32) : Prop :=\n n < 0xd800 ∨ (0xdfff < n ∧ n < 0x110000)", "start": [ 9, 1 ], "end": [ 14, 43 ], "kind": "commanddeclaration" }, { "full_name": "Char.lt", "code": "pr...
.lake/packages/lean4/src/lean/Init/Control/Except.lean
[ ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Coe.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean" ]
[ { "full_name": "Except.pure", "code": "@[always_inline, inline]\nprotected def pure (a : α) : Except ε α :=\n Except.ok a", "start": [ 16, 1 ], "end": [ 18, 14 ], "kind": "commanddeclaration" }, { "full_name": "Except.map", "code": "@[always_inline, i...
.lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/List/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Cast.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean" ]
[ { "full_name": "Int", "code": "inductive Int : Type where\n \n | ofNat : Nat → Int\n \n | negSucc : Nat → Int", "start": [ 26, 1 ], "end": [ 45, 24 ], "kind": "commanddeclaration" }, { "full_name": "instOfNat", "code": "instance instOfNat : OfNat...
.lake/packages/lean4/src/lean/Init/Data/String/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Char/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/List/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean" ]
[ { "full_name": "List.asString", "code": "def List.asString (s : List Char) : String :=\n ⟨s⟩", "start": [ 13, 1 ], "end": [ 14, 6 ], "kind": "commanddeclaration" }, { "full_name": "String.decLt", "code": "@[extern \"lean_string_dec_lt\"]\ninstance dec...
.lake/packages/lean4/src/lean/Init/Control/State.lean
[ ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Except.lean" ]
[ { "full_name": "StateT", "code": "def StateT (σ : Type u) (m : Type u → Type v) (α : Type u) : Type (max u v) :=\n σ → m (α × σ)", "start": [ 14, 1 ], "end": [ 15, 16 ], "kind": "commanddeclaration" }, { "full_name": "StateT.run", "code": "@[always_in...
.lake/packages/lean4/src/lean/Init/Data/Format/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Control/State.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean" ]
[ { "full_name": "Std.Format.FlattenBehavior", "code": "inductive Format.FlattenBehavior where\n | allOrNone\n | fill\n deriving Inhabited, BEq", "start": [ 13, 1 ], "end": [ 31, 26 ], "kind": "commanddeclaration" }, { "full_name": "Std.Format", "code...
.lake/packages/lean4/src/lean/Init/Data/Repr.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Format/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean" ]
[ { "full_name": "Repr", "code": "class Repr (α : Type u) where\n \n reprPrec : α → Nat → Format", "start": [ 16, 1 ], "end": [ 27, 30 ], "kind": "commanddeclaration" }, { "full_name": "repr", "code": "abbrev repr [Repr α] (a : α) : Format :=\n reprPr...
.lake/packages/lean4/src/lean/Init/Control/Option.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Except.lean" ]
[ { "full_name": "OptionT", "code": "def OptionT (m : Type u → Type v) (α : Type u) : Type v :=\n m (Option α)", "start": [ 15, 1 ], "end": [ 16, 15 ], "kind": "commanddeclaration" }, { "full_name": "OptionT.run", "code": "@[always_inline, inline]\ndef ...
.lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Format/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Option.lean", ".lake/packages/...
[ { "full_name": "ToString", "code": "class ToString (α : Type u) where\n toString : α → String", "start": [ 19, 1 ], "end": [ 20, 24 ], "kind": "commanddeclaration" }, { "full_name": "List.toString", "code": "protected def List.toString [ToString α] : ...
.lake/packages/lean4/src/lean/Init/Util.lean
[ ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean" ]
[ { "full_name": "dbgTrace", "code": "@[never_extract, extern \"lean_dbg_trace\"]\ndef dbgTrace {α : Type u} (s : String) (f : Unit → α) : α := f ()", "start": [ 15, 1 ], "end": [ 16, 66 ], "kind": "commanddeclaration" }, { "full_name": "dbgTraceVal", "c...
.lake/packages/lean4/src/lean/Init/GetElem.lean
[ ".lake/packages/lean4/src/lean/Init/Util.lean" ]
[ { "full_name": "outOfBounds", "code": "@[never_extract]\ndef outOfBounds [Inhabited α] : α :=\n panic! \"index out of bounds\"", "start": [ 9, 1 ], "end": [ 11, 31 ], "kind": "commanddeclaration" }, { "full_name": "outOfBounds_eq_default", "code": "th...
.lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Fin/Basic.lean", ".lake/packages/lean4/src/lean/Init/GetElem.lean", ".lake/packages/l...
[ { "full_name": "Array.mkArray", "code": "@[extern \"lean_mk_array\"]\ndef mkArray {α : Type u} (n : Nat) (v : α) : Array α := {\n data := List.replicate n v\n}", "start": [ 19, 1 ], "end": [ 22, 2 ], "kind": "commanddeclaration" }, { "full_name": "Array.o...
.lake/packages/lean4/src/lean/Init/Data/Option/BasicAux.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean", ".lake/packages/lean4/src/lean/Init/Util.lean" ]
[ { "full_name": "Option.get!", "code": "@[inline] def get! {α : Type u} [Inhabited α] : Option α → α\n | some x => x\n | none => panic! \"value is none\"", "start": [ 14, 1 ], "end": [ 16, 37 ], "kind": "commanddeclaration" } ]
.lake/packages/lean4/src/lean/Init/Conv.lean
[ ".lake/packages/lean4/src/lean/Init/Tactics.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Array/Subarray.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean" ]
[ { "full_name": "Subarray", "code": "structure Subarray (α : Type u) where\n array : Array α\n start : Nat\n stop : Nat\n start_le_stop : start ≤ stop\n stop_le_array_size : stop ≤ array.size", "start": [ 11, 1 ], "end": [ 16, 41 ], "kind": "commanddeclaratio...
.lake/packages/lean4/src/lean/Init/Meta.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean", ".lake/packages/lean4/src/lean/Init/MetaTypes.lean", ".lake/packages/lean4/src/lean/Init/Data/Option/BasicAux.lean" ]
[ { "full_name": "Lean.version.getMajor", "code": "@[extern \"lean_version_get_major\"]\nprivate opaque version.getMajor (u : Unit) : Nat", "start": [ 15, 1 ], "end": [ 16, 49 ], "kind": "commanddeclaration" }, { "full_name": "Lean.version.major", "code"...
.lake/packages/lean4/src/lean/Init/NotationExtra.lean
[ ".lake/packages/lean4/src/lean/Init/Meta.lean", ".lake/packages/lean4/src/lean/Init/Data/Array/Subarray.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/Conv.lean" ]
[ { "full_name": "Lean.expandExplicitBindersAux", "code": "def expandExplicitBindersAux (combinator : Syntax) (idents : Array Syntax) (type? : Option Syntax) (body : Syntax) : MacroM Syntax :=\n let rec loop (i : Nat) (acc : Syntax) := do\n match i with\n | 0 => pure acc\n | i+1 =>\n let iden...
.lake/packages/lean4/src/lean/Init/PropLemmas.lean
[ ".lake/packages/lean4/src/lean/Init/NotationExtra.lean", ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "eq_mp_eq_cast", "code": "@[simp] theorem eq_mp_eq_cast (h : α = β) : Eq.mp h = cast h", "start": [ 16, 1 ], "end": [ 16, 70 ], "kind": "commanddeclaration" }, { "full_name": "eq_mpr_eq_cast", "code": "@[simp] theorem eq_mpr_eq_cast (h...
.lake/packages/lean4/src/lean/Init/Classical.lean
[ ".lake/packages/lean4/src/lean/Init/PropLemmas.lean" ]
[ { "full_name": "Classical.indefiniteDescription", "code": "noncomputable def indefiniteDescription {α : Sort u} (p : α → Prop) (h : ∃ x, p x) : {x // p x} :=\n choice <| let ⟨x, px⟩ := h; ⟨⟨x, px⟩⟩", "start": [ 15, 1 ], "end": [ 16, 40 ], "kind": "commanddeclarat...
.lake/packages/lean4/src/lean/Init/ByCases.lean
[ ".lake/packages/lean4/src/lean/Init/Classical.lean" ]
[ { "full_name": "if_true", "code": "@[simp] theorem if_true {_ : Decidable True} (t e : α) : ite True t e = t", "start": [ 24, 1 ], "end": [ 24, 92 ], "kind": "commanddeclaration" }, { "full_name": "if_false", "code": "@[simp] theorem if_false {_ : Deci...
.lake/packages/lean4/src/lean/Init/Data/Prod.lean
[ ".lake/packages/lean4/src/lean/Init/SimpLemmas.lean" ]
[]
.lake/packages/lean4/src/lean/Init/TacticsExtra.lean
[ ".lake/packages/lean4/src/lean/Init/NotationExtra.lean", ".lake/packages/lean4/src/lean/Init/Tactics.lean" ]
[ { "full_name": "Lean.Parser.Tactic.expandIfThenElse", "code": "private def expandIfThenElse\n (ifTk thenTk elseTk pos neg : Syntax)\n (mkIf : Term → Term → MacroM Term) : MacroM (TSyntax `tactic) := do\n let mkCase tk holeOrTacticSeq mkName : MacroM (Term × Array (TSyntax `tactic)) := do\n if hole...
.lake/packages/lean4/src/lean/Init/RCases.lean
[ ".lake/packages/lean4/src/lean/Init/Meta.lean", ".lake/packages/lean4/src/lean/Init/Tactics.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/ToString/Macro.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/Meta.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Int/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/NotationExtra.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean", ".lake/packages/lean4/src/lean/Init/Conv.lean" ]
[ { "full_name": "Int.subNatNat_of_sub_eq_zero", "code": "theorem subNatNat_of_sub_eq_zero {m n : Nat} (h : n - m = 0) : subNatNat m n = ↑(m - n)", "start": [ 17, 1 ], "end": [ 18, 34 ], "kind": "commanddeclaration" }, { "full_name": "Int.subNatNat_of_sub_eq...
.lake/packages/lean4/src/lean/Init/BinderPredicates.lean
[ ".lake/packages/lean4/src/lean/Init/NotationExtra.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Prod.lean", ".lake/packages/lean4/src/lean/Init/ByCases.lean" ]
[ { "full_name": "Nat.Linear.Var", "code": "abbrev Var := Nat", "start": [ 16, 1 ], "end": [ 16, 18 ], "kind": "commanddeclaration" }, { "full_name": "Nat.Linear.Context", "code": "abbrev Context := List Nat", "start": [ 18, 1 ], ...
.lake/packages/lean4/src/lean/Init/Data/Option/Instances.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean" ]
[ { "full_name": "Option.eq_of_eq_some", "code": "theorem eq_of_eq_some {α : Type u} : ∀ {x y : Option α}, (∀z, x = some z ↔ y = some z) → x = y", "start": [ 13, 1 ], "end": [ 17, 74 ], "kind": "commanddeclaration" }, { "full_name": "Option.eq_none_of_isNone...
.lake/packages/lean4/src/lean/Init/Ext.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Macro.lean", ".lake/packages/lean4/src/lean/Init/RCases.lean", ".lake/packages/lean4/src/lean/Init/TacticsExtra.lean" ]
[ { "full_name": "Lean.Elab.Tactic.Ext.$extName", "code": "@[ext $(prio)?] protected theorem $extName:ident : ext_type% $flat $struct:ident", "start": [ 59, 5 ], "end": [ 60, 49 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Elab.Tactic.Ext.$extIffN...
.lake/packages/lean4/src/lean/Init/Data/Nat/Dvd.lean
[ ".lake/packages/lean4/src/lean/Init/Meta.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Div.lean" ]
[ { "full_name": "Nat.dvd_refl", "code": "protected theorem dvd_refl (a : Nat) : a ∣ a", "start": [ 12, 1 ], "end": [ 12, 61 ], "kind": "commanddeclaration" }, { "full_name": "Nat.dvd_zero", "code": "protected theorem dvd_zero (a : Nat) : a ∣ 0", "st...
.lake/packages/lean4/src/lean/Init/Data/Int/Order.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Int/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/ByCases.lean" ]
[ { "full_name": "Int.nonneg_def", "code": "theorem nonneg_def {a : Int} : NonNeg a ↔ ∃ n : Nat, a = n", "start": [ 20, 1 ], "end": [ 21, 71 ], "kind": "commanddeclaration" }, { "full_name": "Int.NonNeg.elim", "code": "theorem NonNeg.elim {a : Int} : Non...
.lake/packages/lean4/src/lean/Init/Data/Int/DivMod.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Int/Basic.lean" ]
[ { "full_name": "Int.div", "code": "@[extern \"lean_int_div\"]\ndef div : (@& Int) → (@& Int) → Int\n | ofNat m, ofNat n => ofNat (m / n)\n | ofNat m, -[n +1] => -ofNat (m / succ n)\n | -[m +1], ofNat n => -ofNat (succ m / n)\n | -[m +1], -[n +1] => ofNat (succ m / succ n)", "start": [ 23, ...
.lake/packages/lean4/src/lean/Init/Control/Lawful/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/SimpLemmas.lean", ".lake/packages/lean4/src/lean/Init/Meta.lean" ]
[ { "full_name": "monadLift_self", "code": "@[simp] theorem monadLift_self {m : Type u → Type v} (x : m α) : monadLift x = x", "start": [ 12, 1 ], "end": [ 13, 6 ], "kind": "commanddeclaration" }, { "full_name": "LawfulFunctor", "code": "class LawfulFunc...
.lake/packages/lean4/src/lean/Init/Hints.lean
[ ".lake/packages/lean4/src/lean/Init/NotationExtra.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Bool.lean
[ ".lake/packages/lean4/src/lean/Init/BinderPredicates.lean" ]
[ { "full_name": "xor", "code": "abbrev xor : Bool → Bool → Bool := bne", "start": [ 9, 1 ], "end": [ 10, 39 ], "kind": "commanddeclaration" }, { "full_name": "Bool.not", "code": "@[inherit_doc not] protected abbrev not := not", "start": [ 15, ...
.lake/packages/lean4/src/lean/Init/Data/List/Control.lean
[ ".lake/packages/lean4/src/lean/Init/Data/List/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean" ]
[ { "full_name": "List.mapM", "code": "@[inline]\ndef mapM {m : Type u → Type v} [Monad m] {α : Type w} {β : Type u} (f : α → m β) (as : List α) : m (List β) :=\n let rec @[specialize] loop\n | [], bs => pure bs.reverse\n | a :: as, bs => do loop as ((← f a)::bs)\n loop as []", "start": [ ...
.lake/packages/lean4/src/lean/Init/Data/List/BasicAux.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean" ]
[ { "full_name": "List.get!", "code": "def get! [Inhabited α] : (as : List α) → (i : Nat) → α\n | a::_, 0 => a\n | _::as, n+1 => get! as n\n | _, _ => panic! \"invalid index\"", "start": [ 19, 1 ], "end": [ 28, 41 ], "kind": "commanddeclaration" }, {...
.lake/packages/lean4/src/lean/Init/Data/Option/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Classical.lean", ".lake/packages/lean4/src/lean/Init/Ext.lean", ".lake/packages/lean4/src/lean/Init/Data/Option/Instances.lean" ]
[ { "full_name": "Option.mem_iff", "code": "theorem mem_iff {a : α} {b : Option α} : a ∈ b ↔ b = a", "start": [ 13, 1 ], "end": [ 13, 63 ], "kind": "commanddeclaration" }, { "full_name": "Option.some_ne_none", "code": "theorem some_ne_none (x : α) : some...
.lake/packages/lean4/src/lean/Init/Data/Nat/Gcd.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Dvd.lean", ".lake/packages/lean4/src/lean/Init/RCases.lean", ".lake/packages/lean4/src/lean/Init/NotationExtra.lean" ]
[ { "full_name": "Nat.gcd", "code": "@[extern \"lean_nat_gcd\"]\ndef gcd (m n : @& Nat) : Nat :=\n if m = 0 then\n n\n else\n gcd (n % m) m\n termination_by m\n decreasing_by simp_wf; apply mod_lt _ (zero_lt_of_ne_zero _); assumption", "start": [ 13, 1 ], "end": [ 38, ...
.lake/packages/lean4/src/lean/Init/Data/Int/DivModLemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Int/DivMod.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Dvd.lean", ".lake/packages/lean4/src/lean/Init/RCases.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Order.lean" ]
[ { "full_name": "Int.dvd_def", "code": "protected theorem dvd_def (a b : Int) : (a ∣ b) = Exists (fun c => b = a * c)", "start": [ 26, 1 ], "end": [ 26, 85 ], "kind": "commanddeclaration" }, { "full_name": "Int.dvd_zero", "code": "protected theorem dvd_...
.lake/packages/lean4/src/lean/Init/Data/List/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Option/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/List/BasicAux.lean", ".lake/packages/lean4/src/lean/Init/Data/List/Control.lean", ".lake/packages/lean4/src/lean/Init/Data/Bool.lean", ".lake/packages/lean4/src/lean/Init/Hints.lean", ".lake/packages/lea...
[ { "full_name": "List.cons_ne_nil", "code": "theorem cons_ne_nil (a : α) (l : List α) : a :: l ≠ []", "start": [ 71, 1 ], "end": [ 71, 64 ], "kind": "commanddeclaration" }, { "full_name": "List.cons_ne_self", "code": "@[simp]\ntheorem cons_ne_self (a : ...
.lake/packages/lean4/src/lean/Init/Omega/IntList.lean
[ ".lake/packages/lean4/src/lean/Init/Data/List/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/DivModLemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Gcd.lean" ]
[ { "full_name": "Lean.Omega.IntList", "code": "abbrev IntList := List Int", "start": [ 13, 1 ], "end": [ 19, 27 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Omega.IntList.get", "code": "def get (xs : IntList) (i : Nat) : Int := (xs.get? i).ge...
.lake/packages/lean4/src/lean/Init/Omega/Coeffs.lean
[ ".lake/packages/lean4/src/lean/Init/Omega/IntList.lean" ]
[ { "full_name": "Lean.Omega.Coeffs", "code": "abbrev Coeffs := IntList", "start": [ 31, 1 ], "end": [ 32, 25 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Omega.Coeffs.toList", "code": "abbrev toList (xs : Coeffs) : List Int := xs", "start...
.lake/packages/lean4/src/lean/Init/Omega/LinearCombo.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Macro.lean", ".lake/packages/lean4/src/lean/Init/Omega/Coeffs.lean" ]
[ { "full_name": "Lean.Omega.LinearCombo", "code": "structure LinearCombo where\n \n const : Int := 0\n \n coeffs : Coeffs := []\nderiving DecidableEq, Repr", "start": [ 19, 1 ], "end": [ 25, 27 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Ome...
.lake/packages/lean4/src/lean/Init/Omega/Int.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Int/DivMod.lean", ".lake/packages/lean4/src/lean/Init/Data/Int/Order.lean" ]
[ { "full_name": "Lean.Omega.Int.ofNat_pow", "code": "theorem ofNat_pow (a b : Nat) : ((a ^ b : Nat) : Int) = (a : Int) ^ b", "start": [ 23, 1 ], "end": [ 26, 59 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Omega.Int.pos_pow_of_pos", "code": "...
.lake/packages/lean4/src/lean/Init/Omega/Logic.lean
[ ".lake/packages/lean4/src/lean/Init/PropLemmas.lean" ]
[ { "full_name": "Lean.Omega.and_not_not_of_not_or", "code": "theorem and_not_not_of_not_or (h : ¬ (p ∨ q)) : ¬ p ∧ ¬ q", "start": [ 19, 1 ], "end": [ 19, 73 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Omega.Decidable.or_not_not_of_not_and", ...
.lake/packages/lean4/src/lean/Init/Omega/Constraint.lean
[ ".lake/packages/lean4/src/lean/Init/Omega/Int.lean", ".lake/packages/lean4/src/lean/Init/Omega/LinearCombo.lean" ]
[ { "full_name": "Lean.Omega.LowerBound", "code": "abbrev LowerBound : Type := Option Int", "start": [ 17, 1 ], "end": [ 18, 39 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Omega.UpperBound", "code": "abbrev UpperBound : Type := Option Int", ...
.lake/packages/lean4/src/lean/Init/Data/Nat/MinMax.lean
[ ".lake/packages/lean4/src/lean/Init/ByCases.lean" ]
[ { "full_name": "Nat.min_eq_min", "code": "protected theorem min_eq_min (a : Nat) : Nat.min a b = min a b", "start": [ 13, 1 ], "end": [ 13, 70 ], "kind": "commanddeclaration" }, { "full_name": "Nat.min_comm", "code": "protected theorem min_comm (a b : ...
.lake/packages/lean4/src/lean/Init/Data/Nat/Power2.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean" ]
[ { "full_name": "Nat.two_pow_pos", "code": "protected theorem two_pow_pos (w : Nat) : 0 < 2^w", "start": [ 11, 1 ], "end": [ 11, 86 ], "kind": "commanddeclaration" }, { "full_name": "Nat.nextPowerOfTwo_dec", "code": "theorem nextPowerOfTwo_dec {n power ...
.lake/packages/lean4/src/lean/Init/Omega.lean
[ ".lake/packages/lean4/src/lean/Init/Omega/Constraint.lean", ".lake/packages/lean4/src/lean/Init/Omega/IntList.lean", ".lake/packages/lean4/src/lean/Init/Omega/Logic.lean", ".lake/packages/lean4/src/lean/Init/Omega/Int.lean", ".lake/packages/lean4/src/lean/Init/Omega/LinearCombo.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Nat/Log2.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean" ]
[ { "full_name": "Nat.log2_terminates", "code": "theorem log2_terminates : ∀ n, n ≥ 2 → n / 2 < n", "start": [ 11, 1 ], "end": [ 18, 15 ], "kind": "commanddeclaration" }, { "full_name": "Nat.log2", "code": "@[extern \"lean_nat_log2\"]\ndef log2 (n : @& N...
.lake/packages/lean4/src/lean/Init/Data/Nat/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Log2.lean", ".lake/packages/lean4/src/lean/Init/Omega.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Power2.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/MinMax.lean" ]
[ { "full_name": "Nat.add_add_add_comm", "code": "protected theorem add_add_add_comm (a b c d : Nat) : (a + b) + (c + d) = (a + c) + (b + d)", "start": [ 24, 1 ], "end": [ 25, 57 ], "kind": "commanddeclaration" }, { "full_name": "Nat.one_add", "code": "t...
.lake/packages/lean4/src/lean/Init/Data/Fin/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Omega.lean", ".lake/packages/lean4/src/lean/Init/Ext.lean", ".lake/packages/lean4/src/lean/Init/Data/Fin/Basic.lean", ".lake/packages/lean4/src/lean/Init/Conv.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/ByCases.l...
[ { "full_name": "Fin.size_pos", "code": "theorem size_pos (i : Fin n) : 0 < n", "start": [ 19, 1 ], "end": [ 20, 79 ], "kind": "commanddeclaration" }, { "full_name": "Fin.mod_def", "code": "theorem mod_def (a m : Fin n) : a % m = Fin.mk (a % m) (Nat.lt_...
.lake/packages/lean4/src/lean/Init/Data/ByteArray/Basic.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Array/Subarray.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Option/Basic.lean" ]
[ { "full_name": "ByteArray", "code": "structure ByteArray where\n data : Array UInt8", "start": [ 13, 1 ], "end": [ 14, 21 ], "kind": "commanddeclaration" }, { "full_name": "ByteArray.mkEmpty", "code": "@[extern \"lean_mk_empty_byte_array\"]\ndef mkEmp...
.lake/packages/lean4/src/lean/Init/Data/UInt/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Fin/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean" ]
[ { "full_name": "zero_def", "code": "theorem zero_def : (0 : $typeName) = ⟨0⟩", "start": [ 18, 1 ], "end": [ 18, 48 ], "kind": "commanddeclaration" }, { "full_name": "one_def", "code": "theorem one_def : (1 : $typeName) = ⟨1⟩", "start": [ 19, ...
.lake/packages/lean4/src/lean/Init/Data/ByteArray.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ByteArray/Basic.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Char/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Char/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Lemmas.lean" ]
[ { "full_name": "Char.le_def", "code": "theorem le_def {a b : Char} : a ≤ b ↔ a.1 ≤ b.1", "start": [ 12, 1 ], "end": [ 12, 56 ], "kind": "commanddeclaration" }, { "full_name": "Char.lt_def", "code": "theorem lt_def {a b : Char} : a < b ↔ a.1 < b.1", ...
.lake/packages/lean4/src/lean/Init/Data/String/Extra.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ByteArray.lean" ]
[ { "full_name": "String.toNat!", "code": "def toNat! (s : String) : Nat :=\n if s.isNat then\n s.foldl (fun n c => n*10 + (c.toNat - '0'.toNat)) 0\n else\n panic! \"Nat expected\"", "start": [ 11, 1 ], "end": [ 18, 26 ], "kind": "commanddeclaration" }, ...
.lake/packages/lean4/src/lean/Init/Data/String/Lemmas.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Char/Lemmas.lean" ]
[ { "full_name": "String.data_eq_of_eq", "code": "protected theorem data_eq_of_eq {a b : String} (h : a = b) : a.data = b.data", "start": [ 11, 1 ], "end": [ 12, 10 ], "kind": "commanddeclaration" }, { "full_name": "String.ne_of_data_ne", "code": "protec...
.lake/packages/lean4/src/lean/Lean/Data/AssocList.lean
[ ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Data/List/Basic.lean" ]
[ { "full_name": "Lean.AssocList", "code": "inductive AssocList (α : Type u) (β : Type v) where\n | nil : AssocList α β\n | cons (key : α) (value : β) (tail : AssocList α β) : AssocList α β\n deriving Inhabited", "start": [ 12, 1 ], "end": [ 16, 21 ], "kind": "co...
.lake/packages/lean4/src/lean/Init/Data/Array/BasicAux.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean", ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean", ".lake/packages/lean4/src/lean/Init/NotationExtra.lean" ]
[ { "full_name": "Array.of_push_eq_push", "code": "theorem Array.of_push_eq_push {as bs : Array α} (h : as.push a = bs.push b) : as = bs ∧ a = b", "start": [ 11, 1 ], "end": [ 15, 11 ], "kind": "commanddeclaration" }, { "full_name": "List.size_toArrayAux", ...
.lake/packages/lean4/src/lean/Init/Data/String.lean
[ ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Lemmas.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Extra.lean" ]
[]
.lake/packages/lean4/src/lean/Lean/Data/HashMap.lean
[ ".lake/packages/lean4/src/lean/Lean/Data/AssocList.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Power2.lean" ]
[ { "full_name": "Lean.HashMapBucket", "code": "def HashMapBucket (α : Type u) (β : Type v) :=\n { b : Array (AssocList α β) // b.size.isPowerOfTwo }", "start": [ 11, 1 ], "end": [ 12, 55 ], "kind": "commanddeclaration" }, { "full_name": "Lean.HashMapBucket...
.lake/packages/lean4/src/lean/Lean/Data/PersistentHashMap.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Array/BasicAux.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Macro.lean" ]
[ { "full_name": "Lean.PersistentHashMap.Entry", "code": "inductive Entry (α : Type u) (β : Type v) (σ : Type w) where\n | entry (key : α) (val : β) : Entry α β σ\n | ref (node : σ) : Entry α β σ\n | null : Entry α β σ", "start": [ 15, 1 ], "end": [ 18, 24 ], ...
.lake/packages/lean4/src/lean/Init/Data/Ord.lean
[ ".lake/packages/lean4/src/lean/Init/Data/String.lean", ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean" ]
[ { "full_name": "Ordering", "code": "inductive Ordering where\n | lt | eq | gt\nderiving Inhabited, BEq", "start": [ 11, 1 ], "end": [ 13, 24 ], "kind": "commanddeclaration" }, { "full_name": "Ordering.swap", "code": "def swap : Ordering → Ordering\n ...
.lake/packages/lean4/src/lean/Init/Control/EState.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/State.lean", ".lake/packages/lean4/src/lean/Init/Control/Except.lean" ]
[ { "full_name": "EStateM.orElse'", "code": "@[always_inline, inline]\nprotected def orElse' {δ} [Backtrackable δ σ] (x₁ x₂ : EStateM ε σ α) (useFirstEx := true) : EStateM ε σ α := fun s =>\n let d := Backtrackable.save s;\n match x₁ s with\n | Result.error e₁ s₁ =>\n match x₂ (Backtrackable.restore s₁ ...
.lake/packages/lean4/src/lean/Init/Control/Reader.lean
[ ".lake/packages/lean4/src/lean/Init/Control/Id.lean", ".lake/packages/lean4/src/lean/Init/Control/Basic.lean", ".lake/packages/lean4/src/lean/Init/Control/Except.lean" ]
[ { "full_name": "ReaderT.orElse", "code": "@[always_inline, inline]\nprotected def orElse [Alternative m] (x₁ : ReaderT ρ m α) (x₂ : Unit → ReaderT ρ m α) : ReaderT ρ m α :=\n fun s => x₁ s <|> x₂ () s", "start": [ 15, 1 ], "end": [ 17, 28 ], "kind": "commanddecla...
.lake/packages/lean4/src/lean/Init/System/Platform.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean" ]
[ { "full_name": "System.Platform.getIsWindows", "code": "@[extern \"lean_system_platform_windows\"] opaque getIsWindows : Unit → Bool", "start": [ 13, 1 ], "end": [ 13, 75 ], "kind": "commanddeclaration" }, { "full_name": "System.Platform.getIsOSX", "co...
.lake/packages/lean4/src/lean/Lean/Data/SMap.lean
[ ".lake/packages/lean4/src/lean/Lean/Data/PersistentHashMap.lean", ".lake/packages/lean4/src/lean/Lean/Data/HashMap.lean" ]
[ { "full_name": "Lean.SMap", "code": "structure SMap (α : Type u) (β : Type v) [BEq α] [Hashable α] where\n stage₁ : Bool := true\n map₁ : HashMap α β := {}\n map₂ : PHashMap α β := {}", "start": [ 13, 1 ], "end": [ 32, 30 ], "kind": "commanddeclara...
.lake/packages/lean4/src/lean/Lean/Data/RBMap.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Nat/Linear.lean", ".lake/packages/lean4/src/lean/Init/Data/Ord.lean" ]
[ { "full_name": "Lean.RBColor", "code": "inductive RBColor where\n | red | black", "start": [ 13, 1 ], "end": [ 14, 16 ], "kind": "commanddeclaration" }, { "full_name": "Lean.RBNode", "code": "inductive RBNode (α : Type u) (β : α → Type v) where\n | l...
.lake/packages/lean4/src/lean/Init/System/ST.lean
[ ".lake/packages/lean4/src/lean/Init/Control/Reader.lean", ".lake/packages/lean4/src/lean/Init/Classical.lean", ".lake/packages/lean4/src/lean/Init/Control/EState.lean" ]
[ { "full_name": "EST", "code": "def EST (ε : Type) (σ : Type) : Type → Type := EStateM ε σ", "start": [ 11, 1 ], "end": [ 11, 59 ], "kind": "commanddeclaration" }, { "full_name": "ST", "code": "abbrev ST (σ : Type) := EST Empty σ", "start": [ ...
.lake/packages/lean4/src/lean/Init/System/FilePath.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/System/Platform.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Repr.lean" ]
[ { "full_name": "System.FilePath", "code": "structure FilePath where\n toString : String\n deriving Inhabited, DecidableEq, Hashable", "start": [ 15, 1 ], "end": [ 17, 44 ], "kind": "commanddeclaration" }, { "full_name": "System.FilePath.pathSeparator", ...
.lake/packages/lean4/src/lean/Init/System/IOError.lean
[ ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/UInt/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/String/Basic.lean", ".lake/packages/lean4/src/lean/Init/Core.lean" ]
[ { "full_name": "IO.Error", "code": "inductive IO.Error where\n | alreadyExists (filename : Option String) (osCode : UInt32) (details : String) | otherError (osCode : UInt32) (details : String) | resourceBusy (osCode : UInt32) (details : String)\n | resourceVanished (osCode : UInt32) (details : Stri...
.lake/packages/lean4/src/lean/Init/Data/Format/Macro.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Format/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Macro.lean" ]
[]
.lake/packages/lean4/src/lean/Init/Data/Format/Instances.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Format/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/Array/Basic.lean", ".lake/packages/lean4/src/lean/Init/Data/ToString/Basic.lean" ]
[ { "full_name": "List.format", "code": "def List.format [ToFormat α] : List α → Format\n | [] => \"[]\"\n | xs => Format.sbracket <| Format.joinSep xs (\",\" ++ Format.line)", "start": [ 16, 1 ], "end": [ 18, 68 ], "kind": "commanddeclaration" }, { "full_...
.lake/packages/lean4/src/lean/Lean/Data/SSet.lean
[ ".lake/packages/lean4/src/lean/Lean/Data/SMap.lean" ]
[ { "full_name": "Lean.SSet", "code": "def SSet (α : Type u) [BEq α] [Hashable α] := SMap α Unit", "start": [ 11, 1 ], "end": [ 12, 58 ], "kind": "commanddeclaration" }, { "full_name": "Lean.SSet.empty", "code": "abbrev empty : SSet α := SMap.empty", ...
.lake/packages/lean4/src/lean/Lean/Data/RBTree.lean
[ ".lake/packages/lean4/src/lean/Lean/Data/RBMap.lean" ]
[ { "full_name": "Lean.RBTree", "code": "def RBTree (α : Type u) (cmp : α → α → Ordering) : Type u :=\n RBMap α Unit cmp", "start": [ 11, 1 ], "end": [ 12, 19 ], "kind": "commanddeclaration" }, { "full_name": "Lean.mkRBTree", "code": "@[inline] def mkRB...
.lake/packages/lean4/src/lean/Lean/Data/HashSet.lean
[ ".lake/packages/lean4/src/lean/Init/Data/List/Control.lean", ".lake/packages/lean4/src/lean/Init/Data/Nat/Power2.lean" ]
[ { "full_name": "Lean.HashSetBucket", "code": "def HashSetBucket (α : Type u) :=\n { b : Array (List α) // b.size.isPowerOfTwo }", "start": [ 12, 1 ], "end": [ 13, 48 ], "kind": "commanddeclaration" }, { "full_name": "Lean.HashSetBucket.update", "code"...
.lake/packages/lean4/src/lean/Lean/Data/Name.lean
[ ".lake/packages/lean4/src/lean/Init/Data/Ord.lean" ]
[ { "full_name": "Lean.Name.hashEx", "code": "@[export lean_name_hash_exported] def hashEx : Name → UInt64 :=\n Name.hash", "start": [ 12, 1 ], "end": [ 13, 12 ], "kind": "commanddeclaration" }, { "full_name": "Lean.Name.getPrefix", "code": "def getPref...