Dependent tree map lemmas

This file contains lemmas about Std.Data.DTreeMap.Raw.Basic. Most of the lemmas require TransCmp cmp for the comparison function cmp and a proof that the involved maps are well-formed. These proofs can be obtained from Std.Data.DTreeMap.Raw.WF.

def Std.DTreeMap.Raw.instCoeTypeForall_1 {α : Type u} : Coe (Type v) (α → Type v)

Equations

• Std.DTreeMap.Raw.instCoeTypeForall_1 = { coe := fun (γ : Type ?u.10) (x : α) => γ }

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : ∅.isEmpty = true

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).isEmpty = false

theorem Std.DTreeMap.Raw.mem_iff_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {k : α} : k ∈ t ↔ t.contains k = true

@[simp]

theorem Std.DTreeMap.Raw.contains_iff_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {k : α} : t.contains k = true ↔ k ∈ t

theorem Std.DTreeMap.Raw.contains_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' : α} (hab : cmp k k' = Ordering.eq) : t.contains k = t.contains k'

theorem Std.DTreeMap.Raw.mem_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' : α} (hab : cmp k k' = Ordering.eq) : k ∈ t ↔ k' ∈ t

@[simp]

theorem Std.DTreeMap.Raw.contains_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {k : α} : ∅.contains k = false

@[simp]

theorem Std.DTreeMap.Raw.not_mem_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {k : α} : ¬k ∈ ∅

theorem Std.DTreeMap.Raw.contains_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.isEmpty = true → t.contains a = false

theorem Std.DTreeMap.Raw.not_mem_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.isEmpty = true → ¬a ∈ t

theorem Std.DTreeMap.Raw.isEmpty_eq_false_iff_exists_contains_eq_true {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.isEmpty = false ↔ ∃ (a : α), t.contains a = true

theorem Std.DTreeMap.Raw.isEmpty_eq_false_iff_exists_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.isEmpty = false ↔ ∃ (a : α), a ∈ t

theorem Std.DTreeMap.Raw.isEmpty_eq_false_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} (hc : t.contains a = true) : t.isEmpty = false

theorem Std.DTreeMap.Raw.isEmpty_iff_forall_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.isEmpty = true ↔ ∀ (a : α), t.contains a = false

theorem Std.DTreeMap.Raw.isEmpty_iff_forall_not_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.isEmpty = true ↔ ∀ (a : α), ¬a ∈ t

@[simp]

theorem Std.DTreeMap.Raw.insert_eq_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {p : (a : α) × β a} : Insert.insert p t = t.insert p.fst p.snd

@[simp]

theorem Std.DTreeMap.Raw.singleton_eq_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {p : (a : α) × β a} : {p} = ∅.insert p.fst p.snd

@[simp]

theorem Std.DTreeMap.Raw.contains_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [h : TransCmp cmp] : t.WF → ∀ {k a : α} {v : β k}, (t.insert k v).contains a = (cmp k a == Ordering.eq || t.contains a)

@[simp]

theorem Std.DTreeMap.Raw.mem_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : a ∈ t.insert k v ↔ cmp k a = Ordering.eq ∨ a ∈ t

theorem Std.DTreeMap.Raw.contains_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).contains k = true

theorem Std.DTreeMap.Raw.mem_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : k ∈ t.insert k v

theorem Std.DTreeMap.Raw.contains_of_contains_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : (t.insert k v).contains a = true → cmp k a ≠ Ordering.eq → t.contains a = true

theorem Std.DTreeMap.Raw.mem_of_mem_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : a ∈ t.insert k v → cmp k a ≠ Ordering.eq → a ∈ t

@[simp]

theorem Std.DTreeMap.Raw.size_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : ∅.size = 0

theorem Std.DTreeMap.Raw.isEmpty_eq_size_eq_zero {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} (h : t.WF) : t.isEmpty = (t.size == 0)

theorem Std.DTreeMap.Raw.size_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).size = if t.contains k = true then t.size else t.size + 1

theorem Std.DTreeMap.Raw.size_le_size_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : t.size ≤ (t.insert k v).size

theorem Std.DTreeMap.Raw.size_insert_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).size ≤ t.size + 1

@[simp]

theorem Std.DTreeMap.Raw.erase_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {k : α} : ∅.erase k = ∅

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).isEmpty = (t.isEmpty || t.size == 1 && t.contains k)

theorem Std.DTreeMap.Raw.isEmpty_eq_isEmpty_erase_and_not_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (k : α) : t.isEmpty = ((t.erase k).isEmpty && !t.contains k)

theorem Std.DTreeMap.Raw.isEmpty_eq_false_of_isEmpty_erase_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) : t.isEmpty = false

@[simp]

theorem Std.DTreeMap.Raw.contains_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} : (t.erase k).contains a = (cmp k a != Ordering.eq && t.contains a)

@[simp]

theorem Std.DTreeMap.Raw.mem_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} : a ∈ t.erase k ↔ cmp k a ≠ Ordering.eq ∧ a ∈ t

theorem Std.DTreeMap.Raw.contains_of_contains_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} : (t.erase k).contains a = true → t.contains a = true

theorem Std.DTreeMap.Raw.mem_of_mem_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} : a ∈ t.erase k → a ∈ t

theorem Std.DTreeMap.Raw.size_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).size = if t.contains k = true then t.size - 1 else t.size

theorem Std.DTreeMap.Raw.size_erase_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).size ≤ t.size

theorem Std.DTreeMap.Raw.size_le_size_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : t.size ≤ (t.erase k).size + 1

@[simp]

theorem Std.DTreeMap.Raw.containsThenInsert_fst {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.containsThenInsert k v).fst = t.contains k

@[simp]

theorem Std.DTreeMap.Raw.containsThenInsert_snd {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.containsThenInsert k v).snd = t.insert k v

@[simp]

theorem Std.DTreeMap.Raw.containsThenInsertIfNew_fst {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.containsThenInsertIfNew k v).fst = t.contains k

@[simp]

theorem Std.DTreeMap.Raw.containsThenInsertIfNew_snd {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.containsThenInsertIfNew k v).snd = t.insertIfNew k v

@[simp]

theorem Std.DTreeMap.Raw.get?_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {a : α} : ∅.get? a = none

theorem Std.DTreeMap.Raw.get?_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : t.isEmpty = true → t.get? a = none

theorem Std.DTreeMap.Raw.get?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a k : α} {v : β k} : (t.insert k v).get? a = if h : cmp k a = Ordering.eq then some (cast ⋯ v) else t.get? a

@[simp]

theorem Std.DTreeMap.Raw.get?_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).get? k = some v

theorem Std.DTreeMap.Raw.contains_eq_isSome_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : t.contains a = (t.get? a).isSome

@[simp]

theorem Std.DTreeMap.Raw.isSome_get?_eq_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : (t.get? a).isSome = t.contains a

theorem Std.DTreeMap.Raw.mem_iff_isSome_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : a ∈ t ↔ (t.get? a).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.isSome_get?_iff_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : (t.get? a).isSome = true ↔ a ∈ t

theorem Std.DTreeMap.Raw.get?_eq_some_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : t.get? k = some v ↔ ∃ (h : k ∈ t), t.get k h = v

theorem Std.DTreeMap.Raw.get?_eq_none_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : t.contains a = false → t.get? a = none

theorem Std.DTreeMap.Raw.get?_eq_none {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : ¬a ∈ t → t.get? a = none

theorem Std.DTreeMap.Raw.get?_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} : (t.erase k).get? a = if cmp k a = Ordering.eq then none else t.get? a

@[simp]

theorem Std.DTreeMap.Raw.get?_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} : (t.erase k).get? k = none

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_emptyc {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {a : α} : get? ∅ a = none

theorem Std.DTreeMap.Raw.Const.get?_of_isEmpty {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.isEmpty = true → get? t a = none

theorem Std.DTreeMap.Raw.Const.get?_insert {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a k : α} {v : β} : get? (t.insert k v) a = if cmp k a = Ordering.eq then some v else get? t a

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_insert_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : get? (t.insert k v) k = some v

theorem Std.DTreeMap.Raw.Const.contains_eq_isSome_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.contains a = (get? t a).isSome

@[simp]

theorem Std.DTreeMap.Raw.Const.isSome_get?_eq_contains {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : (get? t a).isSome = t.contains a

theorem Std.DTreeMap.Raw.Const.mem_iff_isSome_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : a ∈ t ↔ (get? t a).isSome = true

theorem Std.DTreeMap.Raw.Const.get?_eq_some_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : get? t k = some v ↔ ∃ (h : k ∈ t), get t k h = v

@[simp]

theorem Std.DTreeMap.Raw.Const.isSome_get?_iff_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : (get? t a).isSome = true ↔ a ∈ t

theorem Std.DTreeMap.Raw.Const.get?_eq_none_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.contains a = false → get? t a = none

theorem Std.DTreeMap.Raw.Const.get?_eq_none {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} : ¬a ∈ t → get? t a = none

theorem Std.DTreeMap.Raw.Const.get?_erase {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} : get? (t.erase k) a = if cmp k a = Ordering.eq then none else get? t a

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_erase_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} : get? (t.erase k) k = none

theorem Std.DTreeMap.Raw.Const.get?_eq_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} : get? t a = t.get? a

theorem Std.DTreeMap.Raw.Const.get?_congr {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a b : α} (hab : cmp a b = Ordering.eq) : get? t a = get? t b

theorem Std.DTreeMap.Raw.get_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {v : β k} {h₁ : a ∈ t.insert k v} : (t.insert k v).get a h₁ = if h₂ : cmp k a = Ordering.eq then cast ⋯ v else t.get a ⋯

@[simp]

theorem Std.DTreeMap.Raw.get_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).get k ⋯ = v

@[simp]

theorem Std.DTreeMap.Raw.get_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {h' : a ∈ t.erase k} : (t.erase k).get a h' = t.get a ⋯

theorem Std.DTreeMap.Raw.get?_eq_some_get {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} (h' : a ∈ t) : t.get? a = some (t.get a h')

theorem Std.DTreeMap.Raw.get_eq_get_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {h' : a ∈ t} : t.get a h' = (t.get? a).get ⋯

theorem Std.DTreeMap.Raw.get_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {h' : (t.get? a).isSome = true} : (t.get? a).get h' = t.get a ⋯

theorem Std.DTreeMap.Raw.Const.get_insert {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β} {h₁ : a ∈ t.insert k v} : get (t.insert k v) a h₁ = if h₂ : cmp k a = Ordering.eq then v else get t a ⋯

@[simp]

theorem Std.DTreeMap.Raw.Const.get_insert_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : get (t.insert k v) k ⋯ = v

@[simp]

theorem Std.DTreeMap.Raw.Const.get_erase {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {h' : a ∈ t.erase k} : get (t.erase k) a h' = get t a ⋯

theorem Std.DTreeMap.Raw.Const.get?_eq_some_get {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} (h' : a ∈ t) : get? t a = some (get t a h')

theorem Std.DTreeMap.Raw.Const.get_eq_get_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {h' : a ∈ t} : get t a h' = (get? t a).get ⋯

theorem Std.DTreeMap.Raw.Const.get_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {h' : (get? t a).isSome = true} : (get? t a).get h' = get t a ⋯

theorem Std.DTreeMap.Raw.Const.get_eq_get {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {h' : a ∈ t} : get t a h' = t.get a h'

theorem Std.DTreeMap.Raw.Const.get_congr {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a b : α} (hab : cmp a b = Ordering.eq) {h' : a ∈ t} : get t a h' = get t b ⋯

@[simp]

theorem Std.DTreeMap.Raw.get!_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {a : α} [Inhabited (β a)] : ∅.get! a = default

theorem Std.DTreeMap.Raw.get!_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : t.isEmpty = true → t.get! a = default

theorem Std.DTreeMap.Raw.get!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} [Inhabited (β a)] {v : β k} : (t.insert k v).get! a = if h : cmp k a = Ordering.eq then cast ⋯ v else t.get! a

@[simp]

theorem Std.DTreeMap.Raw.get!_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] {b : β a} : (t.insert a b).get! a = b

theorem Std.DTreeMap.Raw.get!_eq_default_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : t.contains a = false → t.get! a = default

theorem Std.DTreeMap.Raw.get!_eq_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : ¬a ∈ t → t.get! a = default

theorem Std.DTreeMap.Raw.get!_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} [Inhabited (β a)] : (t.erase k).get! a = if cmp k a = Ordering.eq then default else t.get! a

@[simp]

theorem Std.DTreeMap.Raw.get!_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} [Inhabited (β k)] : (t.erase k).get! k = default

theorem Std.DTreeMap.Raw.get?_eq_some_get!_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : t.contains a = true → t.get? a = some (t.get! a)

theorem Std.DTreeMap.Raw.get?_eq_some_get! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : a ∈ t → t.get? a = some (t.get! a)

theorem Std.DTreeMap.Raw.get!_eq_get!_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : t.get! a = (t.get? a).get!

theorem Std.DTreeMap.Raw.get_eq_get! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] {h' : a ∈ t} : t.get a h' = t.get! a

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_emptyc {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [Inhabited β] {a : α} : get! ∅ a = default

theorem Std.DTreeMap.Raw.Const.get!_of_isEmpty {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : t.isEmpty = true → get! t a = default

theorem Std.DTreeMap.Raw.Const.get!_insert {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {k a : α} {v : β} : get! (t.insert k v) a = if cmp k a = Ordering.eq then v else get! t a

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_insert_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {k : α} {v : β} : get! (t.insert k v) k = v

theorem Std.DTreeMap.Raw.Const.get!_eq_default_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : t.contains a = false → get! t a = default

theorem Std.DTreeMap.Raw.Const.get!_eq_default {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : ¬a ∈ t → get! t a = default

theorem Std.DTreeMap.Raw.Const.get!_erase {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {k a : α} : get! (t.erase k) a = if cmp k a = Ordering.eq then default else get! t a

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_erase_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {k : α} : get! (t.erase k) k = default

theorem Std.DTreeMap.Raw.Const.get?_eq_some_get!_of_contains {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : t.contains a = true → get? t a = some (get! t a)

theorem Std.DTreeMap.Raw.Const.get?_eq_some_get! {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : a ∈ t → get? t a = some (get! t a)

theorem Std.DTreeMap.Raw.Const.get!_eq_get!_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : get! t a = (get? t a).get!

theorem Std.DTreeMap.Raw.Const.get_eq_get! {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} {h' : a ∈ t} : get t a h' = get! t a

theorem Std.DTreeMap.Raw.Const.get!_eq_get! {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited β] (h : t.WF) {a : α} : get! t a = t.get! a

theorem Std.DTreeMap.Raw.Const.get!_congr {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a b : α} (hab : cmp a b = Ordering.eq) : get! t a = get! t b

@[simp]

theorem Std.DTreeMap.Raw.getD_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {a : α} {fallback : β a} : ∅.getD a fallback = fallback

theorem Std.DTreeMap.Raw.getD_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : t.isEmpty = true → t.getD a fallback = fallback

theorem Std.DTreeMap.Raw.getD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {fallback : β a} {v : β k} : (t.insert k v).getD a fallback = if h : cmp k a = Ordering.eq then cast ⋯ v else t.getD a fallback

@[simp]

theorem Std.DTreeMap.Raw.getD_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback b : β a} : (t.insert a b).getD a fallback = b

theorem Std.DTreeMap.Raw.getD_eq_fallback_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : t.contains a = false → t.getD a fallback = fallback

theorem Std.DTreeMap.Raw.getD_eq_fallback {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : ¬a ∈ t → t.getD a fallback = fallback

theorem Std.DTreeMap.Raw.getD_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {fallback : β a} : (t.erase k).getD a fallback = if cmp k a = Ordering.eq then fallback else t.getD a fallback

@[simp]

theorem Std.DTreeMap.Raw.getD_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {fallback : β k} : (t.erase k).getD k fallback = fallback

theorem Std.DTreeMap.Raw.get?_eq_some_getD_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : t.contains a = true → t.get? a = some (t.getD a fallback)

theorem Std.DTreeMap.Raw.get?_eq_some_getD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : a ∈ t → t.get? a = some (t.getD a fallback)

theorem Std.DTreeMap.Raw.getD_eq_getD_get? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} : t.getD a fallback = (t.get? a).getD fallback

theorem Std.DTreeMap.Raw.get_eq_getD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β a} {h' : a ∈ t} : t.get a h' = t.getD a fallback

theorem Std.DTreeMap.Raw.get!_eq_getD_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} [Inhabited (β a)] : t.get! a = t.getD a default

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_emptyc {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {a : α} {fallback : β} : getD ∅ a fallback = fallback

theorem Std.DTreeMap.Raw.Const.getD_of_isEmpty {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : t.isEmpty = true → getD t a fallback = fallback

theorem Std.DTreeMap.Raw.Const.getD_insert {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {fallback v : β} : getD (t.insert k v) a fallback = if cmp k a = Ordering.eq then v else getD t a fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_insert_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {fallback v : β} : getD (t.insert k v) k fallback = v

theorem Std.DTreeMap.Raw.Const.getD_eq_fallback_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : t.contains a = false → getD t a fallback = fallback

theorem Std.DTreeMap.Raw.Const.getD_eq_fallback {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : ¬a ∈ t → getD t a fallback = fallback

theorem Std.DTreeMap.Raw.Const.getD_erase {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {fallback : β} : getD (t.erase k) a fallback = if cmp k a = Ordering.eq then fallback else getD t a fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_erase_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {fallback : β} : getD (t.erase k) k fallback = fallback

theorem Std.DTreeMap.Raw.Const.get?_eq_some_getD_of_contains {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : t.contains a = true → get? t a = some (getD t a fallback)

theorem Std.DTreeMap.Raw.Const.get?_eq_some_getD {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : a ∈ t → get? t a = some (getD t a fallback)

theorem Std.DTreeMap.Raw.Const.getD_eq_getD_get? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} : getD t a fallback = (get? t a).getD fallback

theorem Std.DTreeMap.Raw.Const.get_eq_getD {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a : α} {fallback : β} {h' : a ∈ t} : get t a h' = getD t a fallback

theorem Std.DTreeMap.Raw.Const.get!_eq_getD_default {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {a : α} : get! t a = getD t a default

theorem Std.DTreeMap.Raw.Const.getD_eq_getD {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {a : α} {fallback : β} : getD t a fallback = t.getD a fallback

theorem Std.DTreeMap.Raw.Const.getD_congr {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {a b : α} {fallback : β} (hab : cmp a b = Ordering.eq) : getD t a fallback = getD t b fallback

@[simp]

theorem Std.DTreeMap.Raw.getKey?_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {a : α} : ∅.getKey? a = none

theorem Std.DTreeMap.Raw.getKey?_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.isEmpty = true → t.getKey? a = none

theorem Std.DTreeMap.Raw.getKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a k : α} {v : β k} : (t.insert k v).getKey? a = if cmp k a = Ordering.eq then some k else t.getKey? a

@[simp]

theorem Std.DTreeMap.Raw.getKey?_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).getKey? k = some k

theorem Std.DTreeMap.Raw.contains_eq_isSome_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.contains a = (t.getKey? a).isSome

@[simp]

theorem Std.DTreeMap.Raw.isSome_getKey?_eq_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : (t.getKey? a).isSome = t.contains a

theorem Std.DTreeMap.Raw.mem_iff_isSome_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : a ∈ t ↔ (t.getKey? a).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.isSome_getKey?_iff_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : (t.getKey? a).isSome = true ↔ a ∈ t

theorem Std.DTreeMap.Raw.mem_of_getKey?_eq_some {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' : α} : t.getKey? k = some k' → k' ∈ t

theorem Std.DTreeMap.Raw.getKey?_eq_some_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' : α} : t.getKey? k = some k' ↔ ∃ (h : k ∈ t), t.getKey k h = k'

theorem Std.DTreeMap.Raw.getKey?_eq_none_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : t.contains a = false → t.getKey? a = none

theorem Std.DTreeMap.Raw.getKey?_eq_none {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} : ¬a ∈ t → t.getKey? a = none

theorem Std.DTreeMap.Raw.getKey?_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} : (t.erase k).getKey? a = if cmp k a = Ordering.eq then none else t.getKey? a

@[simp]

theorem Std.DTreeMap.Raw.getKey?_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).getKey? k = none

theorem Std.DTreeMap.Raw.compare_getKey?_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : Option.all (fun (x : α) => decide (cmp x k = Ordering.eq)) (t.getKey? k) = true

theorem Std.DTreeMap.Raw.getKey?_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' : α} (h' : cmp k k' = Ordering.eq) : t.getKey? k = t.getKey? k'

theorem Std.DTreeMap.Raw.getKey?_eq_some_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} (h' : t.contains k = true) : t.getKey? k = some k

theorem Std.DTreeMap.Raw.getKey?_eq_some {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} (h' : k ∈ t) : t.getKey? k = some k

theorem Std.DTreeMap.Raw.getKey_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} {h₁ : a ∈ t.insert k v} : (t.insert k v).getKey a h₁ = if h₂ : cmp k a = Ordering.eq then k else t.getKey a ⋯

@[simp]

theorem Std.DTreeMap.Raw.getKey_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).getKey k ⋯ = k

@[simp]

theorem Std.DTreeMap.Raw.getKey_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {h' : a ∈ t.erase k} : (t.erase k).getKey a h' = t.getKey a ⋯

theorem Std.DTreeMap.Raw.getKey?_eq_some_getKey {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} (h' : a ∈ t) : t.getKey? a = some (t.getKey a h')

theorem Std.DTreeMap.Raw.getKey_eq_get_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} {h' : a ∈ t} : t.getKey a h' = (t.getKey? a).get ⋯

@[simp]

theorem Std.DTreeMap.Raw.get_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a : α} {h' : (t.getKey? a).isSome = true} : (t.getKey? a).get h' = t.getKey a ⋯

theorem Std.DTreeMap.Raw.compare_getKey_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (h' : k ∈ t) : cmp (t.getKey k h') k = Ordering.eq

theorem Std.DTreeMap.Raw.getKey_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k₁ k₂ : α} (h' : cmp k₁ k₂ = Ordering.eq) (h₁ : k₁ ∈ t) : t.getKey k₁ h₁ = t.getKey k₂ ⋯

@[simp]

theorem Std.DTreeMap.Raw.getKey_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} (h' : k ∈ t) : t.getKey k h' = k

@[simp]

theorem Std.DTreeMap.Raw.getKey!_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {a : α} [Inhabited α] : ∅.getKey! a = default

theorem Std.DTreeMap.Raw.getKey!_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : t.isEmpty = true → t.getKey! a = default

theorem Std.DTreeMap.Raw.getKey!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k a : α} {v : β k} : (t.insert k v).getKey! a = if cmp k a = Ordering.eq then k else t.getKey! a

@[simp]

theorem Std.DTreeMap.Raw.getKey!_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} {b : β a} : (t.insert a b).getKey! a = a

theorem Std.DTreeMap.Raw.getKey!_eq_default_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : t.contains a = false → t.getKey! a = default

theorem Std.DTreeMap.Raw.getKey!_eq_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : ¬a ∈ t → t.getKey! a = default

theorem Std.DTreeMap.Raw.getKey!_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k a : α} : (t.erase k).getKey! a = if cmp k a = Ordering.eq then default else t.getKey! a

@[simp]

theorem Std.DTreeMap.Raw.getKey!_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} : (t.erase k).getKey! k = default

theorem Std.DTreeMap.Raw.getKey?_eq_some_getKey!_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : t.contains a = true → t.getKey? a = some (t.getKey! a)

theorem Std.DTreeMap.Raw.getKey?_eq_some_getKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : a ∈ t → t.getKey? a = some (t.getKey! a)

theorem Std.DTreeMap.Raw.getKey!_eq_get!_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : t.getKey! a = (t.getKey? a).get!

theorem Std.DTreeMap.Raw.getKey_eq_getKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} {h' : a ∈ t} : t.getKey a h' = t.getKey! a

theorem Std.DTreeMap.Raw.getKey!_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k k' : α} (h' : cmp k k' = Ordering.eq) : t.getKey! k = t.getKey! k'

theorem Std.DTreeMap.Raw.getKey!_eq_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} (h' : t.contains k = true) : t.getKey! k = k

theorem Std.DTreeMap.Raw.getKey!_eq_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} (h' : k ∈ t) : t.getKey! k = k

@[simp]

theorem Std.DTreeMap.Raw.getKeyD_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {a fallback : α} : ∅.getKeyD a fallback = fallback

theorem Std.DTreeMap.Raw.getKeyD_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : t.isEmpty = true → t.getKeyD a fallback = fallback

theorem Std.DTreeMap.Raw.getKeyD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a fallback : α} {v : β k} : (t.insert k v).getKeyD a fallback = if cmp k a = Ordering.eq then k else t.getKeyD a fallback

@[simp]

theorem Std.DTreeMap.Raw.getKeyD_insert_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} {b : β a} : (t.insert a b).getKeyD a fallback = a

theorem Std.DTreeMap.Raw.getKeyD_eq_fallback_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : t.contains a = false → t.getKeyD a fallback = fallback

theorem Std.DTreeMap.Raw.getKeyD_eq_fallback {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : ¬a ∈ t → t.getKeyD a fallback = fallback

theorem Std.DTreeMap.Raw.getKeyD_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a fallback : α} : (t.erase k).getKeyD a fallback = if cmp k a = Ordering.eq then fallback else t.getKeyD a fallback

@[simp]

theorem Std.DTreeMap.Raw.getKeyD_erase_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k fallback : α} : (t.erase k).getKeyD k fallback = fallback

theorem Std.DTreeMap.Raw.getKey?_eq_some_getKeyD_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : t.contains a = true → t.getKey? a = some (t.getKeyD a fallback)

theorem Std.DTreeMap.Raw.getKey?_eq_some_getKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : a ∈ t → t.getKey? a = some (t.getKeyD a fallback)

theorem Std.DTreeMap.Raw.getKeyD_eq_getD_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} : t.getKeyD a fallback = (t.getKey? a).getD fallback

theorem Std.DTreeMap.Raw.getKey_eq_getKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {a fallback : α} {h' : a ∈ t} : t.getKey a h' = t.getKeyD a fallback

theorem Std.DTreeMap.Raw.getKey!_eq_getKeyD_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {a : α} : t.getKey! a = t.getKeyD a default

theorem Std.DTreeMap.Raw.getKeyD_congr {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k k' fallback : α} (h' : cmp k k' = Ordering.eq) : t.getKeyD k fallback = t.getKeyD k' fallback

theorem Std.DTreeMap.Raw.getKeyD_eq_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k fallback : α} (h' : t.contains k = true) : t.getKeyD k fallback = k

theorem Std.DTreeMap.Raw.getKeyD_eq_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k fallback : α} (h' : k ∈ t) : t.getKeyD k fallback = k

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).isEmpty = false

@[simp]

theorem Std.DTreeMap.Raw.contains_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : (t.insertIfNew k v).contains a = (cmp k a == Ordering.eq || t.contains a)

@[simp]

theorem Std.DTreeMap.Raw.mem_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : a ∈ t.insertIfNew k v ↔ cmp k a = Ordering.eq ∨ a ∈ t

theorem Std.DTreeMap.Raw.contains_insertIfNew_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).contains k = true

theorem Std.DTreeMap.Raw.mem_insertIfNew_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : k ∈ t.insertIfNew k v

theorem Std.DTreeMap.Raw.contains_of_contains_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : (t.insertIfNew k v).contains a = true → cmp k a ≠ Ordering.eq → t.contains a = true

theorem Std.DTreeMap.Raw.mem_of_mem_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : a ∈ t.insertIfNew k v → cmp k a ≠ Ordering.eq → a ∈ t

theorem Std.DTreeMap.Raw.mem_of_mem_insertIfNew' {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : a ∈ t.insertIfNew k v → ¬(cmp k a = Ordering.eq ∧ ¬k ∈ t) → a ∈ t

This is a restatement of mem_of_mem_insertIfNew that is written to exactly match the proof obligation in the statement of get_insertIfNew.

theorem Std.DTreeMap.Raw.size_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {k : α} (h : t.WF) {v : β k} : (t.insertIfNew k v).size = if k ∈ t then t.size else t.size + 1

theorem Std.DTreeMap.Raw.size_le_size_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : t.size ≤ (t.insertIfNew k v).size

theorem Std.DTreeMap.Raw.size_insertIfNew_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).size ≤ t.size + 1

theorem Std.DTreeMap.Raw.get?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {v : β k} : (t.insertIfNew k v).get? a = if h : cmp k a = Ordering.eq ∧ ¬k ∈ t then some (cast ⋯ v) else t.get? a

theorem Std.DTreeMap.Raw.get_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {v : β k} {h₁ : a ∈ t.insertIfNew k v} : (t.insertIfNew k v).get a h₁ = if h₂ : cmp k a = Ordering.eq ∧ ¬k ∈ t then cast ⋯ v else t.get a ⋯

theorem Std.DTreeMap.Raw.get!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} [Inhabited (β a)] {v : β k} : (t.insertIfNew k v).get! a = if h : cmp k a = Ordering.eq ∧ ¬k ∈ t then cast ⋯ v else t.get! a

theorem Std.DTreeMap.Raw.getD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k a : α} {fallback : β a} {v : β k} : (t.insertIfNew k v).getD a fallback = if h : cmp k a = Ordering.eq ∧ ¬k ∈ t then cast ⋯ v else t.getD a fallback

theorem Std.DTreeMap.Raw.Const.get?_insertIfNew {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β} : get? (t.insertIfNew k v) a = if cmp k a = Ordering.eq ∧ ¬k ∈ t then some v else get? t a

theorem Std.DTreeMap.Raw.Const.get_insertIfNew {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β} {h₁ : a ∈ t.insertIfNew k v} : get (t.insertIfNew k v) a h₁ = if h₂ : cmp k a = Ordering.eq ∧ ¬k ∈ t then v else get t a ⋯

theorem Std.DTreeMap.Raw.Const.get!_insertIfNew {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {k a : α} {v : β} : get! (t.insertIfNew k v) a = if cmp k a = Ordering.eq ∧ ¬k ∈ t then v else get! t a

theorem Std.DTreeMap.Raw.Const.getD_insertIfNew {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k a : α} {fallback v : β} : getD (t.insertIfNew k v) a fallback = if cmp k a = Ordering.eq ∧ ¬k ∈ t then v else getD t a fallback

theorem Std.DTreeMap.Raw.getKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} : (t.insertIfNew k v).getKey? a = if cmp k a = Ordering.eq ∧ ¬k ∈ t then some k else t.getKey? a

theorem Std.DTreeMap.Raw.getKey_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a : α} {v : β k} {h₁ : a ∈ t.insertIfNew k v} : (t.insertIfNew k v).getKey a h₁ = if h₂ : cmp k a = Ordering.eq ∧ ¬k ∈ t then k else t.getKey a ⋯

theorem Std.DTreeMap.Raw.getKey!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k a : α} {v : β k} : (t.insertIfNew k v).getKey! a = if cmp k a = Ordering.eq ∧ ¬k ∈ t then k else t.getKey! a

theorem Std.DTreeMap.Raw.getKeyD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k a fallback : α} {v : β k} : (t.insertIfNew k v).getKeyD a fallback = if cmp k a = Ordering.eq ∧ ¬k ∈ t then k else t.getKeyD a fallback

@[simp]

theorem Std.DTreeMap.Raw.getThenInsertIfNew?_fst {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] : t.WF → ∀ {k : α} {v : β k}, (t.getThenInsertIfNew? k v).fst = t.get? k

@[simp]

theorem Std.DTreeMap.Raw.getThenInsertIfNew?_snd {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.getThenInsertIfNew? k v).snd = t.insertIfNew k v

@[simp]

theorem Std.DTreeMap.Raw.Const.getThenInsertIfNew?_fst {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] : t.WF → ∀ {k : α} {v : β}, (getThenInsertIfNew? t k v).fst = get? t k

@[simp]

theorem Std.DTreeMap.Raw.Const.getThenInsertIfNew?_snd {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : (getThenInsertIfNew? t k v).snd = t.insertIfNew k v

@[simp]

theorem Std.DTreeMap.Raw.length_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.keys.length = t.size

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : t.keys.isEmpty = t.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.contains_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [BEq α] [LawfulBEqCmp cmp] (h : t.WF) [TransCmp cmp] {k : α} : t.keys.contains k = t.contains k

@[simp]

theorem Std.DTreeMap.Raw.mem_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [LawfulEqCmp cmp] [TransCmp cmp] (h : t.WF) {k : α} : k ∈ t.keys ↔ k ∈ t

theorem Std.DTreeMap.Raw.mem_of_mem_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (h' : k ∈ t.keys) : k ∈ t

theorem Std.DTreeMap.Raw.distinct_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) t.keys

theorem Std.DTreeMap.Raw.nodup_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.keys.Nodup

theorem Std.DTreeMap.Raw.ordered_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : α) => cmp a b = Ordering.lt) t.keys

@[simp]

theorem Std.DTreeMap.Raw.map_fst_toList_eq_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : List.map Sigma.fst t.toList = t.keys

@[simp]

theorem Std.DTreeMap.Raw.length_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.toList.length = t.size

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : t.toList.isEmpty = t.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.mem_toList_iff_get?_eq_some {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : ⟨k, v⟩ ∈ t.toList ↔ t.get? k = some v

theorem Std.DTreeMap.Raw.find?_toList_eq_some_iff_get?_eq_some {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β k} : List.find? (fun (x : (a : α) × β a) => cmp x.fst k == Ordering.eq) t.toList = some ⟨k, v⟩ ↔ t.get? k = some v

theorem Std.DTreeMap.Raw.find?_toList_eq_none_iff_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : List.find? (fun (x : (a : α) × β a) => cmp x.fst k == Ordering.eq) t.toList = none ↔ t.contains k = false

@[simp]

theorem Std.DTreeMap.Raw.find?_toList_eq_none_iff_not_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : List.find? (fun (x : (a : α) × β a) => cmp x.fst k == Ordering.eq) t.toList = none ↔ ¬k ∈ t

theorem Std.DTreeMap.Raw.distinct_keys_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) t.toList

theorem Std.DTreeMap.Raw.ordered_keys_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : (a : α) × β a) => cmp a.fst b.fst = Ordering.lt) t.toList

@[simp]

theorem Std.DTreeMap.Raw.Const.map_fst_toList_eq_keys {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} : List.map Prod.fst (toList t) = t.keys

@[simp]

theorem Std.DTreeMap.Raw.Const.length_toList {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) : (toList t).length = t.size

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_toList {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} : (toList t).isEmpty = t.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_toList_iff_get?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {v : β} : (k, v) ∈ toList t ↔ get? t k = some v

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_toList_iff_getKey?_eq_some_and_get?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : (k, v) ∈ toList t ↔ t.getKey? k = some k ∧ get? t k = some v

theorem Std.DTreeMap.Raw.Const.get?_eq_some_iff_exists_compare_eq_eq_and_mem_toList {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β} : get? t k = some v ↔ ∃ (k' : α), cmp k k' = Ordering.eq ∧ (k', v) ∈ toList t

theorem Std.DTreeMap.Raw.Const.find?_toList_eq_some_iff_getKey?_eq_some_and_get?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {v : β} : List.find? (fun (a : α × β) => decide (cmp a.fst k = Ordering.eq)) (toList t) = some (k', v) ↔ t.getKey? k = some k' ∧ get? t k = some v

theorem Std.DTreeMap.Raw.Const.find?_toList_eq_none_iff_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} : List.find? (fun (x : α × β) => cmp x.fst k == Ordering.eq) (toList t) = none ↔ t.contains k = false

@[simp]

theorem Std.DTreeMap.Raw.Const.find?_toList_eq_none_iff_not_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} : List.find? (fun (x : α × β) => cmp x.fst k == Ordering.eq) (toList t) = none ↔ ¬k ∈ t

theorem Std.DTreeMap.Raw.Const.distinct_keys_toList {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) (toList t)

theorem Std.DTreeMap.Raw.Const.ordered_keys_toList {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) : List.Pairwise (fun (a b : α × β) => cmp a.fst b.fst = Ordering.lt) (toList t)

theorem Std.DTreeMap.Raw.foldlM_eq_foldlM_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : δ → (a : α) → β a → m δ} {init : δ} : foldlM f init t = List.foldlM (fun (a : δ) (b : (a : α) × β a) => f a b.fst b.snd) init t.toList

theorem Std.DTreeMap.Raw.foldl_eq_foldl_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {f : δ → (a : α) → β a → δ} {init : δ} : foldl f init t = List.foldl (fun (a : δ) (b : (a : α) × β a) => f a b.fst b.snd) init t.toList

theorem Std.DTreeMap.Raw.foldrM_eq_foldrM_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : (a : α) → β a → δ → m δ} {init : δ} : foldrM f init t = List.foldrM (fun (a : (a : α) × β a) (b : δ) => f a.fst a.snd b) init t.toList

theorem Std.DTreeMap.Raw.foldr_eq_foldr_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {f : (a : α) → β a → δ → δ} {init : δ} : foldr f init t = List.foldr (fun (a : (a : α) × β a) (b : δ) => f a.fst a.snd b) init t.toList

@[simp]

theorem Std.DTreeMap.Raw.forM_eq_forM {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : (a : α) → β a → m PUnit} : forM f t = ForM.forM t fun (a : (a : α) × β a) => f a.fst a.snd

theorem Std.DTreeMap.Raw.forM_eq_forM_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : (a : α) × β a → m PUnit} : ForM.forM t f = ForM.forM t.toList f

@[simp]

theorem Std.DTreeMap.Raw.forIn_eq_forIn {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : (a : α) → β a → δ → m (ForInStep δ)} {init : δ} : forIn f init t = ForIn.forIn t init fun (a : (a : α) × β a) (b : δ) => f a.fst a.snd b

theorem Std.DTreeMap.Raw.forIn_eq_forIn_toList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : (a : α) × β a → δ → m (ForInStep δ)} {init : δ} : ForIn.forIn t init f = ForIn.forIn t.toList init f

theorem Std.DTreeMap.Raw.foldlM_eq_foldlM_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : δ → α → m δ} {init : δ} : foldlM (fun (d : δ) (a : α) (x : β a) => f d a) init t = List.foldlM f init t.keys

theorem Std.DTreeMap.Raw.foldl_eq_foldl_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {f : δ → α → δ} {init : δ} : foldl (fun (d : δ) (a : α) (x : β a) => f d a) init t = List.foldl f init t.keys

theorem Std.DTreeMap.Raw.foldrM_eq_foldrM_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : α → δ → m δ} {init : δ} : foldrM (fun (a : α) (x : β a) (d : δ) => f a d) init t = List.foldrM f init t.keys

theorem Std.DTreeMap.Raw.foldr_eq_foldr_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {f : α → δ → δ} {init : δ} : foldr (fun (a : α) (x : β a) (d : δ) => f a d) init t = List.foldr f init t.keys

theorem Std.DTreeMap.Raw.forM_eq_forM_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : α → m PUnit} : (ForM.forM t fun (a : (a : α) × β a) => f a.fst) = t.keys.forM f

theorem Std.DTreeMap.Raw.forIn_eq_forIn_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] {f : α → δ → m (ForInStep δ)} {init : δ} : (ForIn.forIn t init fun (a : (a : α) × β a) (d : δ) => f a.fst d) = ForIn.forIn t.keys init f

theorem Std.DTreeMap.Raw.Const.foldlM_eq_foldlM_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : δ → α → β → m δ} {init : δ} : foldlM f init t = List.foldlM (fun (a : δ) (b : α × β) => f a b.fst b.snd) init (toList t)

theorem Std.DTreeMap.Raw.Const.foldl_eq_foldl_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {f : δ → α → β → δ} {init : δ} : foldl f init t = List.foldl (fun (a : δ) (b : α × β) => f a b.fst b.snd) init (toList t)

theorem Std.DTreeMap.Raw.Const.foldrM_eq_foldrM_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α → β → δ → m δ} {init : δ} : foldrM f init t = List.foldrM (fun (a : α × β) (b : δ) => f a.fst a.snd b) init (toList t)

theorem Std.DTreeMap.Raw.Const.foldr_eq_foldr_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {f : α → β → δ → δ} {init : δ} : foldr f init t = List.foldr (fun (a : α × β) (b : δ) => f a.fst a.snd b) init (toList t)

theorem Std.DTreeMap.Raw.Const.forM_eq_forMUncurried {α : Type u} {cmp : α → α → Ordering} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α → β → m PUnit} : forM f t = forMUncurried (fun (a : α × β) => f a.fst a.snd) t

theorem Std.DTreeMap.Raw.Const.forMUncurried_eq_forM_toList {α : Type u} {cmp : α → α → Ordering} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α × β → m PUnit} : forMUncurried f t = (toList t).forM f

@[deprecated Std.DTreeMap.Raw.Const.forMUncurried_eq_forM_toList (since := "2025-03-02")]

theorem Std.DTreeMap.Raw.Const.forM_eq_forM_toList {α : Type u} {cmp : α → α → Ordering} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α → β → m PUnit} : forM f t = (toList t).forM fun (a : α × β) => f a.fst a.snd

Deprecated, use forMUncurried_eq_forM_toList together with forM_eq_forMUncurried instead.

theorem Std.DTreeMap.Raw.Const.forIn_eq_forInUncurried {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α → β → δ → m (ForInStep δ)} {init : δ} : forIn f init t = forInUncurried (fun (a : α × β) (b : δ) => f a.fst a.snd b) init t

theorem Std.DTreeMap.Raw.Const.forInUncurried_eq_forIn_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α × β → δ → m (ForInStep δ)} {init : δ} : forInUncurried f init t = ForIn.forIn (toList t) init f

@[deprecated Std.DTreeMap.Raw.Const.forInUncurried_eq_forIn_toList (since := "2025-03-02")]

theorem Std.DTreeMap.Raw.Const.forIn_eq_forIn_toList {α : Type u} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w'} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [Monad m] [LawfulMonad m] {f : α → β → δ → m (ForInStep δ)} {init : δ} : forIn f init t = ForIn.forIn (toList t) init fun (a : α × β) (b : δ) => f a.fst a.snd b

Deprecated, use forInUncurried_eq_forIn_toList together with forIn_eq_forInUncurried instead.

@[simp]

theorem Std.DTreeMap.Raw.insertMany_nil {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : t.insertMany [] = t

@[simp]

theorem Std.DTreeMap.Raw.insertMany_list_singleton {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {k : α} {v : β k} : t.insertMany [⟨k, v⟩] = t.insert k v

theorem Std.DTreeMap.Raw.insertMany_cons {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {l : List ((a : α) × β a)} {k : α} {v : β k} : t.insertMany (⟨k, v⟩ :: l) = (t.insert k v).insertMany l

theorem Std.DTreeMap.Raw.insertMany_append {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {l₁ l₂ : List ((a : α) × β a)} : t.insertMany (l₁ ++ l₂) = (t.insertMany l₁).insertMany l₂

@[simp]

theorem Std.DTreeMap.Raw.contains_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} : (t.insertMany l).contains k = (t.contains k || (List.map Sigma.fst l).contains k)

@[simp]

theorem Std.DTreeMap.Raw.mem_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} : k ∈ t.insertMany l ↔ k ∈ t ∨ (List.map Sigma.fst l).contains k = true

theorem Std.DTreeMap.Raw.mem_of_mem_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} : k ∈ t.insertMany l → (List.map Sigma.fst l).contains k = false → k ∈ t

theorem Std.DTreeMap.Raw.get?_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).get? k = t.get? k

theorem Std.DTreeMap.Raw.get?_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (t.insertMany l).get? k' = some (cast ⋯ v)

theorem Std.DTreeMap.Raw.get_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} (contains : (List.map Sigma.fst l).contains k = false) {h' : k ∈ t.insertMany l} : (t.insertMany l).get k h' = t.get k ⋯

theorem Std.DTreeMap.Raw.get_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) {h' : k' ∈ t.insertMany l} : (t.insertMany l).get k' h' = cast ⋯ v

theorem Std.DTreeMap.Raw.get!_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} [Inhabited (β k)] (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).get! k = t.get! k

theorem Std.DTreeMap.Raw.get!_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} [Inhabited (β k')] (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (t.insertMany l).get! k' = cast ⋯ v

theorem Std.DTreeMap.Raw.getD_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} {fallback : β k} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).getD k fallback = t.getD k fallback

theorem Std.DTreeMap.Raw.getD_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} {fallback : β k'} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (t.insertMany l).getD k' fallback = cast ⋯ v

theorem Std.DTreeMap.Raw.getKey?_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).getKey? k = t.getKey? k

theorem Std.DTreeMap.Raw.getKey?_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (t.insertMany l).getKey? k' = some k

theorem Std.DTreeMap.Raw.getKey_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) {h' : k ∈ t.insertMany l} : (t.insertMany l).getKey k h' = t.getKey k ⋯

theorem Std.DTreeMap.Raw.getKey_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) {h' : k' ∈ t.insertMany l} : (t.insertMany l).getKey k' h' = k

theorem Std.DTreeMap.Raw.getKey!_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited α] (h : t.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).getKey! k = t.getKey! k

theorem Std.DTreeMap.Raw.getKey!_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (t.insertMany l).getKey! k' = k

theorem Std.DTreeMap.Raw.getKeyD_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k fallback : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (t.insertMany l).getKeyD k fallback = t.getKeyD k fallback

theorem Std.DTreeMap.Raw.getKeyD_insertMany_list_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (t.insertMany l).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.size_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) : (∀ (a : α), a ∈ t → (List.map Sigma.fst l).contains a = false) → (t.insertMany l).size = t.size + l.length

theorem Std.DTreeMap.Raw.size_le_size_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} : t.size ≤ (t.insertMany l).size

theorem Std.DTreeMap.Raw.size_insertMany_list_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} : (t.insertMany l).size ≤ t.size + l.length

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {l : List ((a : α) × β a)} : (t.insertMany l).isEmpty = (t.isEmpty && l.isEmpty)

@[simp]

theorem Std.DTreeMap.Raw.Const.insertMany_nil {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} : insertMany t [] = t

@[simp]

theorem Std.DTreeMap.Raw.Const.insertMany_list_singleton {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {k : α} {v : β} : insertMany t [(k, v)] = t.insert k v

theorem Std.DTreeMap.Raw.Const.insertMany_cons {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {l : List (α × β)} {k : α} {v : β} : insertMany t ((k, v) :: l) = insertMany (t.insert k v) l

theorem Std.DTreeMap.Raw.Const.insertMany_append {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {l₁ l₂ : List (α × β)} : insertMany t (l₁ ++ l₂) = insertMany (insertMany t l₁) l₂

@[simp]

theorem Std.DTreeMap.Raw.Const.contains_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} : (insertMany t l).contains k = (t.contains k || (List.map Prod.fst l).contains k)

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} : k ∈ insertMany t l ↔ k ∈ t ∨ (List.map Prod.fst l).contains k = true

theorem Std.DTreeMap.Raw.Const.mem_of_mem_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} : k ∈ insertMany t l → (List.map Prod.fst l).contains k = false → k ∈ t

theorem Std.DTreeMap.Raw.Const.getKey?_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany t l).getKey? k = t.getKey? k

theorem Std.DTreeMap.Raw.Const.getKey?_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (insertMany t l).getKey? k' = some k

theorem Std.DTreeMap.Raw.Const.getKey_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) {h' : k ∈ insertMany t l} : (insertMany t l).getKey k h' = t.getKey k ⋯

theorem Std.DTreeMap.Raw.Const.getKey_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) {h' : k' ∈ insertMany t l} : (insertMany t l).getKey k' h' = k

theorem Std.DTreeMap.Raw.Const.getKey!_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited α] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany t l).getKey! k = t.getKey! k

theorem Std.DTreeMap.Raw.Const.getKey!_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (insertMany t l).getKey! k' = k

theorem Std.DTreeMap.Raw.Const.getKeyD_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k fallback : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany t l).getKeyD k fallback = t.getKeyD k fallback

theorem Std.DTreeMap.Raw.Const.getKeyD_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (insertMany t l).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.Const.size_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) : (∀ (a : α), a ∈ t → (List.map Prod.fst l).contains a = false) → (insertMany t l).size = t.size + l.length

theorem Std.DTreeMap.Raw.Const.size_le_size_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} : t.size ≤ (insertMany t l).size

theorem Std.DTreeMap.Raw.Const.size_insertMany_list_le {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} : (insertMany t l).size ≤ t.size + l.length

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} : (insertMany t l).isEmpty = (t.isEmpty && l.isEmpty)

theorem Std.DTreeMap.Raw.Const.get?_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get? (insertMany t l) k = get? t k

theorem Std.DTreeMap.Raw.Const.get?_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : get? (insertMany t l) k' = some v

theorem Std.DTreeMap.Raw.Const.get?_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} : get? (insertMany t l) k = (List.findSomeRev? (fun (x : α × β) => match x with | (a, b) => if cmp a k = Ordering.eq then some b else none) l).or (get? t k)

theorem Std.DTreeMap.Raw.Const.get_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) {h' : k ∈ insertMany t l} : get (insertMany t l) k h' = get t k ⋯

theorem Std.DTreeMap.Raw.Const.get_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) {h' : k' ∈ insertMany t l} : get (insertMany t l) k' h' = v

theorem Std.DTreeMap.Raw.Const.contains_of_contains_insertMany_list' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} (h' : (insertMany t l).contains k = true) (w : List.findSomeRev? (fun (x : α × β) => match x with | (a, b) => if cmp a k = Ordering.eq then some b else none) l = none) : t.contains k = true

A variant of contains_of_contains_insertMany_list used in get_insertMany_list.

theorem Std.DTreeMap.Raw.Const.get_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [PartialEquivBEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} {h' : k ∈ insertMany t l} : get (insertMany t l) k h' = match w : List.findSomeRev? (fun (x : α × β) => match x with | (a, b) => if cmp a k = Ordering.eq then some b else none) l with | some v => v | none => get t k ⋯

theorem Std.DTreeMap.Raw.Const.get!_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited β] (h : t.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get! (insertMany t l) k = get! t k

theorem Std.DTreeMap.Raw.Const.get!_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : get! (insertMany t l) k' = v

theorem Std.DTreeMap.Raw.Const.get!_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} : get! (insertMany t l) k = (List.findSomeRev? (fun (x : α × β) => match x with | (a, b) => if cmp a k = Ordering.eq then some b else none) l).getD (get! t k)

theorem Std.DTreeMap.Raw.Const.getD_insertMany_list_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : getD (insertMany t l) k fallback = getD t k fallback

theorem Std.DTreeMap.Raw.Const.getD_insertMany_list_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v fallback : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : getD (insertMany t l) k' fallback = v

theorem Std.DTreeMap.Raw.Const.getD_insertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List (α × β)} {k : α} {fallback : β} : getD (insertMany t l) k fallback = (List.findSomeRev? (fun (x : α × β) => match x with | (a, b) => if cmp a k = Ordering.eq then some b else none) l).getD (getD t k fallback)

@[simp]

theorem Std.DTreeMap.Raw.Const.insertManyIfNewUnit_nil {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} : insertManyIfNewUnit t [] = t

@[simp]

theorem Std.DTreeMap.Raw.Const.insertManyIfNewUnit_list_singleton {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} {k : α} : insertManyIfNewUnit t [k] = t.insertIfNew k ()

theorem Std.DTreeMap.Raw.Const.insertManyIfNewUnit_cons {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} {l : List α} {k : α} : insertManyIfNewUnit t (k :: l) = insertManyIfNewUnit (t.insertIfNew k ()) l

@[simp]

theorem Std.DTreeMap.Raw.Const.contains_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k : α} : (insertManyIfNewUnit t l).contains k = (t.contains k || l.contains k)

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k : α} : k ∈ insertManyIfNewUnit t l ↔ k ∈ t ∨ l.contains k = true

theorem Std.DTreeMap.Raw.Const.mem_of_mem_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k : α} (contains_eq_false : l.contains k = false) : k ∈ insertManyIfNewUnit t l → k ∈ t

theorem Std.DTreeMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k : α} : ¬k ∈ t → l.contains k = false → (insertManyIfNewUnit t l).getKey? k = none

theorem Std.DTreeMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) : ¬k ∈ t → List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l → k ∈ l → (insertManyIfNewUnit t l).getKey? k' = some k

theorem Std.DTreeMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k : α} : k ∈ t → (insertManyIfNewUnit t l).getKey? k = t.getKey? k

theorem Std.DTreeMap.Raw.Const.getKey_insertManyIfNewUnit_list_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k : α} {h' : k ∈ insertManyIfNewUnit t l} (contains : k ∈ t) : (insertManyIfNewUnit t l).getKey k h' = t.getKey k contains

theorem Std.DTreeMap.Raw.Const.getKey_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {h' : k' ∈ insertManyIfNewUnit t l} : ¬k ∈ t → List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l → k ∈ l → (insertManyIfNewUnit t l).getKey k' h' = k

theorem Std.DTreeMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited α] (h : t.WF) {l : List α} {k : α} : ¬k ∈ t → l.contains k = false → (insertManyIfNewUnit t l).getKey! k = default

theorem Std.DTreeMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) : ¬k ∈ t → List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l → k ∈ l → (insertManyIfNewUnit t l).getKey! k' = k

theorem Std.DTreeMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {l : List α} {k : α} : k ∈ t → (insertManyIfNewUnit t l).getKey! k = t.getKey! k

theorem Std.DTreeMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k fallback : α} : ¬k ∈ t → l.contains k = false → (insertManyIfNewUnit t l).getKeyD k fallback = fallback

theorem Std.DTreeMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) : ¬k ∈ t → List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l → k ∈ l → (insertManyIfNewUnit t l).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_mem {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} {k fallback : α} : k ∈ t → (insertManyIfNewUnit t l).getKeyD k fallback = t.getKeyD k fallback

theorem Std.DTreeMap.Raw.Const.size_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) : (∀ (a : α), a ∈ t → l.contains a = false) → (insertManyIfNewUnit t l).size = t.size + l.length

theorem Std.DTreeMap.Raw.Const.size_le_size_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} : t.size ≤ (insertManyIfNewUnit t l).size

theorem Std.DTreeMap.Raw.Const.size_insertManyIfNewUnit_list_le {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} : (insertManyIfNewUnit t l).size ≤ t.size + l.length

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h : t.WF) {l : List α} : (insertManyIfNewUnit t l).isEmpty = (t.isEmpty && l.isEmpty)

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] (h : t.WF) {l : List α} {k : α} : get? (insertManyIfNewUnit t l) k = if k ∈ t ∨ l.contains k = true then some () else none

@[simp]

theorem Std.DTreeMap.Raw.Const.get_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} {l : List α} {k : α} {h' : k ∈ insertManyIfNewUnit t l} : get (insertManyIfNewUnit t l) k h' = ()

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} {l : List α} {k : α} : get! (insertManyIfNewUnit t l) k = ()

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_insertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} {t : Raw α (fun (x : α) => Unit) cmp} {l : List α} {k : α} {fallback : Unit} : getD (insertManyIfNewUnit t l) k fallback = ()

@[simp]

theorem Std.DTreeMap.Raw.ofList_nil {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : ofList [] cmp = ∅

@[simp]

theorem Std.DTreeMap.Raw.ofList_singleton {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {k : α} {v : β k} : ofList [⟨k, v⟩] cmp = ∅.insert k v

theorem Std.DTreeMap.Raw.ofList_cons {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {k : α} {v : β k} {tl : List ((a : α) × β a)} : ofList (⟨k, v⟩ :: tl) cmp = (∅.insert k v).insertMany tl

theorem Std.DTreeMap.Raw.ofList_eq_insertMany_empty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {l : List ((a : α) × β a)} : ofList l cmp = ∅.insertMany l

@[simp]

theorem Std.DTreeMap.Raw.contains_ofList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} : (ofList l cmp).contains k = (List.map Sigma.fst l).contains k

@[simp]

theorem Std.DTreeMap.Raw.mem_ofList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} : k ∈ ofList l cmp ↔ (List.map Sigma.fst l).contains k = true

theorem Std.DTreeMap.Raw.get?_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).get? k = none

theorem Std.DTreeMap.Raw.get?_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l cmp).get? k' = some (cast ⋯ v)

theorem Std.DTreeMap.Raw.get_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) {h : k' ∈ ofList l cmp} : (ofList l cmp).get k' h = cast ⋯ v

theorem Std.DTreeMap.Raw.get!_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} [Inhabited (β k)] (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).get! k = default

theorem Std.DTreeMap.Raw.get!_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} [Inhabited (β k')] (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l cmp).get! k' = cast ⋯ v

theorem Std.DTreeMap.Raw.getD_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} {fallback : β k} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).getD k fallback = fallback

theorem Std.DTreeMap.Raw.getD_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β k} {fallback : β k'} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l cmp).getD k' fallback = cast ⋯ v

theorem Std.DTreeMap.Raw.getKey?_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).getKey? k = none

theorem Std.DTreeMap.Raw.getKey?_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l cmp).getKey? k' = some k

theorem Std.DTreeMap.Raw.getKey_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) {h' : k' ∈ ofList l cmp} : (ofList l cmp).getKey k' h' = k

theorem Std.DTreeMap.Raw.getKey!_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [Inhabited α] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).getKey! k = default

theorem Std.DTreeMap.Raw.getKey!_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [Inhabited α] {l : List ((a : α) × β a)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l cmp).getKey! k' = k

theorem Std.DTreeMap.Raw.getKeyD_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List ((a : α) × β a)} {k fallback : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l cmp).getKeyD k fallback = fallback

theorem Std.DTreeMap.Raw.getKeyD_ofList_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l cmp).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.size_ofList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => ¬cmp a.fst b.fst = Ordering.eq) l) : (ofList l cmp).size = l.length

theorem Std.DTreeMap.Raw.size_ofList_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} : (ofList l cmp).inner.size ≤ l.length

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_ofList {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} [TransCmp cmp] {l : List ((a : α) × β a)} : (ofList l cmp).inner.isEmpty = l.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.Const.ofList_nil {α : Type u} {cmp : α → α → Ordering} {β : Type v} : ofList [] cmp = ∅

@[simp]

theorem Std.DTreeMap.Raw.Const.ofList_singleton {α : Type u} {cmp : α → α → Ordering} {β : Type v} {k : α} {v : β} : ofList [(k, v)] cmp = ∅.insert k v

theorem Std.DTreeMap.Raw.Const.ofList_cons {α : Type u} {cmp : α → α → Ordering} {β : Type v} {k : α} {v : β} {tl : List (α × β)} : ofList ((k, v) :: tl) cmp = insertMany (∅.insert k v) tl

theorem Std.DTreeMap.Raw.Const.ofList_eq_insertMany_empty {α : Type u} {cmp : α → α → Ordering} {β : Type v} {l : List (α × β)} : ofList l cmp = insertMany ∅ l

@[simp]

theorem Std.DTreeMap.Raw.Const.contains_ofList {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} : (ofList l cmp).contains k = (List.map Prod.fst l).contains k

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_ofList {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} : k ∈ ofList l cmp ↔ (List.map Prod.fst l).contains k = true

theorem Std.DTreeMap.Raw.Const.get?_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get? (ofList l cmp) k = none

theorem Std.DTreeMap.Raw.Const.get?_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : get? (ofList l cmp) k' = some v

theorem Std.DTreeMap.Raw.Const.get_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) {h : k' ∈ ofList l cmp} : get (ofList l cmp) k' h = v

theorem Std.DTreeMap.Raw.Const.get!_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} [Inhabited β] (contains_eq_false : (List.map Prod.fst l).contains k = false) : get! (ofList l cmp) k = default

theorem Std.DTreeMap.Raw.Const.get!_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v : β} [Inhabited β] (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : get! (ofList l cmp) k' = v

theorem Std.DTreeMap.Raw.Const.getD_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : getD (ofList l cmp) k fallback = fallback

theorem Std.DTreeMap.Raw.Const.getD_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) {v fallback : β} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : (k, v) ∈ l) : getD (ofList l cmp) k' fallback = v

theorem Std.DTreeMap.Raw.Const.getKey?_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l cmp).getKey? k = none

theorem Std.DTreeMap.Raw.Const.getKey?_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (ofList l cmp).getKey? k' = some k

theorem Std.DTreeMap.Raw.Const.getKey_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) {h' : k' ∈ ofList l cmp} : (ofList l cmp).getKey k' h' = k

theorem Std.DTreeMap.Raw.Const.getKey!_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited α] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l cmp).getKey! k = default

theorem Std.DTreeMap.Raw.Const.getKey!_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [Inhabited α] {l : List (α × β)} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (ofList l cmp).getKey! k' = k

theorem Std.DTreeMap.Raw.Const.getKeyD_ofList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List (α × β)} {k fallback : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l cmp).getKeyD k fallback = fallback

theorem Std.DTreeMap.Raw.Const.getKeyD_ofList_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) (mem : k ∈ List.map Prod.fst l) : (ofList l cmp).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.Const.size_ofList {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} (distinct : List.Pairwise (fun (a b : α × β) => ¬cmp a.fst b.fst = Ordering.eq) l) : (ofList l cmp).size = l.length

theorem Std.DTreeMap.Raw.Const.size_ofList_le {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} : (ofList l cmp).size ≤ l.length

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_ofList {α : Type u} {cmp : α → α → Ordering} {β : Type v} [TransCmp cmp] {l : List (α × β)} : (ofList l cmp).isEmpty = l.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.Const.unitOfList_nil {α : Type u} {cmp : α → α → Ordering} : unitOfList [] cmp = ∅

@[simp]

theorem Std.DTreeMap.Raw.Const.unitOfList_singleton {α : Type u} {cmp : α → α → Ordering} {k : α} : unitOfList [k] cmp = ∅.insertIfNew k ()

theorem Std.DTreeMap.Raw.Const.unitOfList_cons {α : Type u} {cmp : α → α → Ordering} {hd : α} {tl : List α} : unitOfList (hd :: tl) cmp = insertManyIfNewUnit (∅.insertIfNew hd ()) tl

@[simp]

theorem Std.DTreeMap.Raw.Const.contains_unitOfList {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List α} {k : α} : (unitOfList l cmp).contains k = l.contains k

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_unitOfList {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List α} {k : α} : k ∈ unitOfList l cmp ↔ l.contains k = true

theorem Std.DTreeMap.Raw.Const.getKey?_unitOfList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List α} {k : α} (contains_eq_false : l.contains k = false) : (unitOfList l cmp).getKey? k = none

theorem Std.DTreeMap.Raw.Const.getKey?_unitOfList_of_mem {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) (mem : k ∈ l) : (unitOfList l cmp).getKey? k' = some k

theorem Std.DTreeMap.Raw.Const.getKey_unitOfList_of_mem {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) (mem : k ∈ l) {h' : k' ∈ unitOfList l cmp} : (unitOfList l cmp).getKey k' h' = k

theorem Std.DTreeMap.Raw.Const.getKey!_unitOfList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] [Inhabited α] {l : List α} {k : α} (contains_eq_false : l.contains k = false) : (unitOfList l cmp).getKey! k = default

theorem Std.DTreeMap.Raw.Const.getKey!_unitOfList_of_mem {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [Inhabited α] {l : List α} {k k' : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) (mem : k ∈ l) : (unitOfList l cmp).getKey! k' = k

theorem Std.DTreeMap.Raw.Const.getKeyD_unitOfList_of_contains_eq_false {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List α} {k fallback : α} (contains_eq_false : l.contains k = false) : (unitOfList l cmp).getKeyD k fallback = fallback

theorem Std.DTreeMap.Raw.Const.getKeyD_unitOfList_of_mem {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} {k k' fallback : α} (k_eq : cmp k k' = Ordering.eq) (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) (mem : k ∈ l) : (unitOfList l cmp).getKeyD k' fallback = k

theorem Std.DTreeMap.Raw.Const.size_unitOfList {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} (distinct : List.Pairwise (fun (a b : α) => ¬cmp a b = Ordering.eq) l) : (unitOfList l cmp).size = l.length

theorem Std.DTreeMap.Raw.Const.size_unitOfList_le {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} : (unitOfList l cmp).size ≤ l.length

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_unitOfList {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {l : List α} : (unitOfList l cmp).isEmpty = l.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_unitOfList {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [BEq α] [LawfulBEqCmp cmp] {l : List α} {k : α} : get? (unitOfList l cmp) k = if l.contains k = true then some () else none

@[simp]

theorem Std.DTreeMap.Raw.Const.get_unitOfList {α : Type u} {cmp : α → α → Ordering} {l : List α} {k : α} {h : k ∈ unitOfList l cmp} : get (unitOfList l cmp) k h = ()

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_unitOfList {α : Type u} {cmp : α → α → Ordering} {l : List α} {k : α} : get! (unitOfList l cmp) k = ()

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_unitOfList {α : Type u} {cmp : α → α → Ordering} {l : List α} {k : α} {fallback : Unit} : getD (unitOfList l cmp) k fallback = ()

theorem Std.DTreeMap.Raw.isEmpty_alter_eq_isEmpty_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).isEmpty = ((t.erase k).isEmpty && (f (t.get? k)).isNone)

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).isEmpty = ((t.isEmpty || t.size == 1 && t.contains k) && (f (t.get? k)).isNone)

theorem Std.DTreeMap.Raw.contains_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} : (t.alter k f).contains k' = if cmp k k' = Ordering.eq then (f (t.get? k)).isSome else t.contains k'

theorem Std.DTreeMap.Raw.mem_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} : k' ∈ t.alter k f ↔ if cmp k k' = Ordering.eq then (f (t.get? k)).isSome = true else k' ∈ t

theorem Std.DTreeMap.Raw.mem_alter_of_compare_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} (he : cmp k k' = Ordering.eq) : k' ∈ t.alter k f ↔ (f (t.get? k)).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.contains_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).contains k = (f (t.get? k)).isSome

@[simp]

theorem Std.DTreeMap.Raw.mem_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : k ∈ t.alter k f ↔ (f (t.get? k)).isSome = true

theorem Std.DTreeMap.Raw.contains_alter_of_not_compare_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} (he : ¬cmp k k' = Ordering.eq) : (t.alter k f).contains k' = t.contains k'

theorem Std.DTreeMap.Raw.mem_alter_of_not_compare_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} (he : ¬cmp k k' = Ordering.eq) : k' ∈ t.alter k f ↔ k' ∈ t

theorem Std.DTreeMap.Raw.size_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).size = if k ∈ t ∧ (f (t.get? k)).isNone = true then t.size - 1 else if ¬k ∈ t ∧ (f (t.get? k)).isSome = true then t.size + 1 else t.size

theorem Std.DTreeMap.Raw.size_alter_eq_add_one {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (h₁ : ¬k ∈ t) (h₂ : (f (t.get? k)).isSome = true) : (t.alter k f).size = t.size + 1

theorem Std.DTreeMap.Raw.size_alter_eq_sub_one {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (h₁ : k ∈ t) (h₂ : (f (t.get? k)).isNone = true) : (t.alter k f).size = t.size - 1

theorem Std.DTreeMap.Raw.size_alter_eq_self_of_not_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (h₁ : ¬k ∈ t) (h₂ : (f (t.get? k)).isNone = true) : (t.alter k f).size = t.size

theorem Std.DTreeMap.Raw.size_alter_eq_self_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (h₁ : k ∈ t) (h₂ : (f (t.get? k)).isSome = true) : (t.alter k f).size = t.size

theorem Std.DTreeMap.Raw.size_alter_le_size {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).size ≤ t.size + 1

theorem Std.DTreeMap.Raw.size_le_size_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : t.size - 1 ≤ (t.alter k f).size

theorem Std.DTreeMap.Raw.get?_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} : (t.alter k f).get? k' = if h : cmp k k' = Ordering.eq then cast ⋯ (f (t.get? k)) else t.get? k'

@[simp]

theorem Std.DTreeMap.Raw.get?_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).get? k = f (t.get? k)

theorem Std.DTreeMap.Raw.get_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} {hc : k' ∈ t.alter k f} : (t.alter k f).get k' hc = if heq : cmp k k' = Ordering.eq then cast ⋯ ((f (t.get? k)).get ⋯) else t.get k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.get_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} {hc : k ∈ t.alter k f} : (t.alter k f).get k hc = (f (t.get? k)).get ⋯

theorem Std.DTreeMap.Raw.get!_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} [Inhabited (β k')] {f : Option (β k) → Option (β k)} : (t.alter k f).get! k' = if heq : cmp k k' = Ordering.eq then (Option.map (cast ⋯) (f (t.get? k))).get! else t.get! k'

@[simp]

theorem Std.DTreeMap.Raw.get!_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} [Inhabited (β k)] {f : Option (β k) → Option (β k)} : (t.alter k f).get! k = (f (t.get? k)).get!

theorem Std.DTreeMap.Raw.getD_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {fallback : β k'} {f : Option (β k) → Option (β k)} : (t.alter k f).getD k' fallback = if heq : cmp k k' = Ordering.eq then (Option.map (cast ⋯) (f (t.get? k))).getD fallback else t.getD k' fallback

@[simp]

theorem Std.DTreeMap.Raw.getD_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {fallback : β k} {f : Option (β k) → Option (β k)} : (t.alter k f).getD k fallback = (f (t.get? k)).getD fallback

theorem Std.DTreeMap.Raw.getKey?_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKey? k' = if cmp k k' = Ordering.eq then if (f (t.get? k)).isSome = true then some k else none else t.getKey? k'

theorem Std.DTreeMap.Raw.getKey?_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKey? k = if (f (t.get? k)).isSome = true then some k else none

theorem Std.DTreeMap.Raw.getKey!_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k k' : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKey! k' = if cmp k k' = Ordering.eq then if (f (t.get? k)).isSome = true then k else default else t.getKey! k'

theorem Std.DTreeMap.Raw.getKey!_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKey! k = if (f (t.get? k)).isSome = true then k else default

@[simp]

theorem Std.DTreeMap.Raw.getKey_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} {hc : k ∈ t.alter k f} : (t.alter k f).getKey k hc = k

theorem Std.DTreeMap.Raw.getKeyD_alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' fallback : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKeyD k' fallback = if cmp k k' = Ordering.eq then if (f (t.get? k)).isSome = true then k else fallback else t.getKeyD k' fallback

@[simp]

theorem Std.DTreeMap.Raw.getKeyD_alter_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k fallback : α} {f : Option (β k) → Option (β k)} : (t.alter k f).getKeyD k fallback = if (f (t.get? k)).isSome = true then k else fallback

theorem Std.DTreeMap.Raw.Const.isEmpty_alter_eq_isEmpty_erase {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).isEmpty = ((t.erase k).isEmpty && (f (get? t k)).isNone)

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).isEmpty = ((t.isEmpty || t.size == 1 && t.contains k) && (f (get? t k)).isNone)

theorem Std.DTreeMap.Raw.Const.contains_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} : (alter t k f).contains k' = if cmp k k' = Ordering.eq then (f (get? t k)).isSome else t.contains k'

theorem Std.DTreeMap.Raw.Const.mem_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} : k' ∈ alter t k f ↔ if cmp k k' = Ordering.eq then (f (get? t k)).isSome = true else k' ∈ t

theorem Std.DTreeMap.Raw.Const.mem_alter_of_compare_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} (he : cmp k k' = Ordering.eq) : k' ∈ alter t k f ↔ (f (get? t k)).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.Const.contains_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).contains k = (f (get? t k)).isSome

@[simp]

theorem Std.DTreeMap.Raw.Const.mem_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : k ∈ alter t k f ↔ (f (get? t k)).isSome = true

theorem Std.DTreeMap.Raw.Const.contains_alter_of_not_compare_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} (he : ¬cmp k k' = Ordering.eq) : (alter t k f).contains k' = t.contains k'

theorem Std.DTreeMap.Raw.Const.mem_alter_of_not_compare_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} (he : ¬cmp k k' = Ordering.eq) : k' ∈ alter t k f ↔ k' ∈ t

theorem Std.DTreeMap.Raw.Const.size_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).size = if k ∈ t ∧ (f (get? t k)).isNone = true then t.size - 1 else if ¬k ∈ t ∧ (f (get? t k)).isSome = true then t.size + 1 else t.size

theorem Std.DTreeMap.Raw.Const.size_alter_eq_add_one {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (h₁ : ¬k ∈ t) (h₂ : (f (get? t k)).isSome = true) : (alter t k f).size = t.size + 1

theorem Std.DTreeMap.Raw.Const.size_alter_eq_sub_one {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (h₁ : k ∈ t) (h₂ : (f (get? t k)).isNone = true) : (alter t k f).size = t.size - 1

theorem Std.DTreeMap.Raw.Const.size_alter_eq_self_of_not_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (h₁ : ¬k ∈ t) (h₂ : (f (get? t k)).isNone = true) : (alter t k f).size = t.size

theorem Std.DTreeMap.Raw.Const.size_alter_eq_self_of_mem {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (h₁ : k ∈ t) (h₂ : (f (get? t k)).isSome = true) : (alter t k f).size = t.size

theorem Std.DTreeMap.Raw.Const.size_alter_le_size {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).size ≤ t.size + 1

theorem Std.DTreeMap.Raw.Const.size_le_size_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : t.size - 1 ≤ (alter t k f).size

theorem Std.DTreeMap.Raw.Const.get?_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} : get? (alter t k f) k' = if cmp k k' = Ordering.eq then f (get? t k) else get? t k'

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : get? (alter t k f) k = f (get? t k)

theorem Std.DTreeMap.Raw.Const.get_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} {hc : k' ∈ alter t k f} : get (alter t k f) k' hc = if heq : cmp k k' = Ordering.eq then (f (get? t k)).get ⋯ else get t k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.Const.get_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} {hc : k ∈ alter t k f} : get (alter t k f) k hc = (f (get? t k)).get ⋯

theorem Std.DTreeMap.Raw.Const.get!_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} [Inhabited β] {f : Option β → Option β} : get! (alter t k f) k' = if cmp k k' = Ordering.eq then (f (get? t k)).get! else get! t k'

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} [Inhabited β] {f : Option β → Option β} : get! (alter t k f) k = (f (get? t k)).get!

theorem Std.DTreeMap.Raw.Const.getD_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {fallback : β} {f : Option β → Option β} : getD (alter t k f) k' fallback = if cmp k k' = Ordering.eq then (f (get? t k)).getD fallback else getD t k' fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {fallback : β} {f : Option β → Option β} : getD (alter t k f) k fallback = (f (get? t k)).getD fallback

theorem Std.DTreeMap.Raw.Const.getKey?_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' : α} {f : Option β → Option β} : (alter t k f).getKey? k' = if cmp k k' = Ordering.eq then if (f (get? t k)).isSome = true then some k else none else t.getKey? k'

theorem Std.DTreeMap.Raw.Const.getKey?_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).getKey? k = if (f (get? t k)).isSome = true then some k else none

theorem Std.DTreeMap.Raw.Const.getKey!_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k k' : α} {f : Option β → Option β} : (alter t k f).getKey! k' = if cmp k k' = Ordering.eq then if (f (get? t k)).isSome = true then k else default else t.getKey! k'

theorem Std.DTreeMap.Raw.Const.getKey!_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).getKey! k = if (f (get? t k)).isSome = true then k else default

theorem Std.DTreeMap.Raw.Const.getKey_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k k' : α} {f : Option β → Option β} {hc : k' ∈ alter t k f} : (alter t k f).getKey k' hc = if heq : cmp k k' = Ordering.eq then k else t.getKey k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.Const.getKey_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option β → Option β} {hc : k ∈ alter t k f} : (alter t k f).getKey k hc = k

theorem Std.DTreeMap.Raw.Const.getKeyD_alter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k k' fallback : α} {f : Option β → Option β} : (alter t k f).getKeyD k' fallback = if cmp k k' = Ordering.eq then if (f (get? t k)).isSome = true then k else fallback else t.getKeyD k' fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.getKeyD_alter_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k fallback : α} {f : Option β → Option β} : (alter t k f).getKeyD k fallback = if (f (get? t k)).isSome = true then k else fallback

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).isEmpty = t.isEmpty

theorem Std.DTreeMap.Raw.contains_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : β k → β k} : (t.modify k f).contains k' = t.contains k'

theorem Std.DTreeMap.Raw.mem_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : β k → β k} : k' ∈ t.modify k f ↔ k' ∈ t

theorem Std.DTreeMap.Raw.size_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).size = t.size

theorem Std.DTreeMap.Raw.get?_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : β k → β k} : (t.modify k f).get? k' = if h : cmp k k' = Ordering.eq then cast ⋯ (Option.map f (t.get? k)) else t.get? k'

@[simp]

theorem Std.DTreeMap.Raw.get?_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).get? k = Option.map f (t.get? k)

theorem Std.DTreeMap.Raw.get_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : β k → β k} {hc : k' ∈ t.modify k f} : (t.modify k f).get k' hc = if heq : cmp k k' = Ordering.eq then cast ⋯ (f (t.get k ⋯)) else t.get k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.get_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} {hc : k ∈ t.modify k f} : (t.modify k f).get k hc = f (t.get k ⋯)

theorem Std.DTreeMap.Raw.get!_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} [hi : Inhabited (β k')] {f : β k → β k} : (t.modify k f).get! k' = if heq : cmp k k' = Ordering.eq then (Option.map (cast ⋯) (Option.map f (t.get? k))).get! else t.get! k'

@[simp]

theorem Std.DTreeMap.Raw.get!_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} [Inhabited (β k)] {f : β k → β k} : (t.modify k f).get! k = (Option.map f (t.get? k)).get!

theorem Std.DTreeMap.Raw.getD_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {fallback : β k'} {f : β k → β k} : (t.modify k f).getD k' fallback = if heq : cmp k k' = Ordering.eq then (Option.map (cast ⋯) (Option.map f (t.get? k))).getD fallback else t.getD k' fallback

@[simp]

theorem Std.DTreeMap.Raw.getD_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {fallback : β k} {f : β k → β k} : (t.modify k f).getD k fallback = (Option.map f (t.get? k)).getD fallback

theorem Std.DTreeMap.Raw.getKey?_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' : α} {f : β k → β k} : (t.modify k f).getKey? k' = if cmp k k' = Ordering.eq then if k ∈ t then some k else none else t.getKey? k'

theorem Std.DTreeMap.Raw.getKey?_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).getKey? k = if k ∈ t then some k else none

theorem Std.DTreeMap.Raw.getKey!_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) [Inhabited α] {k k' : α} {f : β k → β k} : (t.modify k f).getKey! k' = if cmp k k' = Ordering.eq then if k ∈ t then k else default else t.getKey! k'

theorem Std.DTreeMap.Raw.getKey!_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) [Inhabited α] {k : α} {f : β k → β k} : (t.modify k f).getKey! k = if k ∈ t then k else default

theorem Std.DTreeMap.Raw.getKey_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) [Inhabited α] {k k' : α} {f : β k → β k} {hc : k' ∈ t.modify k f} : (t.modify k f).getKey k' hc = if cmp k k' = Ordering.eq then k else t.getKey k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.getKey_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) [Inhabited α] {k : α} {f : β k → β k} {hc : k ∈ t.modify k f} : (t.modify k f).getKey k hc = k

theorem Std.DTreeMap.Raw.getKeyD_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k k' fallback : α} {f : β k → β k} : (t.modify k f).getKeyD k' fallback = if cmp k k' = Ordering.eq then if k ∈ t then k else fallback else t.getKeyD k' fallback

theorem Std.DTreeMap.Raw.getKeyD_modify_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) [Inhabited α] {k fallback : α} {f : β k → β k} : (t.modify k f).getKeyD k fallback = if k ∈ t then k else fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.isEmpty_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {f : β → β} : (modify t k f).isEmpty = t.isEmpty

theorem Std.DTreeMap.Raw.Const.contains_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {f : β → β} : (modify t k f).contains k' = t.contains k'

theorem Std.DTreeMap.Raw.Const.mem_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {f : β → β} : k' ∈ modify t k f ↔ k' ∈ t

theorem Std.DTreeMap.Raw.Const.size_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {f : β → β} : (modify t k f).size = t.size

theorem Std.DTreeMap.Raw.Const.get?_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {f : β → β} : get? (modify t k f) k' = if cmp k k' = Ordering.eq then Option.map f (get? t k) else get? t k'

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {f : β → β} : get? (modify t k f) k = Option.map f (get? t k)

theorem Std.DTreeMap.Raw.Const.get_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {f : β → β} {hc : k' ∈ modify t k f} : get (modify t k f) k' hc = if heq : cmp k k' = Ordering.eq then f (get t k ⋯) else get t k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.Const.get_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {f : β → β} {hc : k ∈ modify t k f} : get (modify t k f) k hc = f (get t k ⋯)

theorem Std.DTreeMap.Raw.Const.get!_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} [hi : Inhabited β] {f : β → β} : get! (modify t k f) k' = if cmp k k' = Ordering.eq then (Option.map f (get? t k)).get! else get! t k'

@[simp]

theorem Std.DTreeMap.Raw.Const.get!_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} [Inhabited β] {f : β → β} : get! (modify t k f) k = (Option.map f (get? t k)).get!

theorem Std.DTreeMap.Raw.Const.getD_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {fallback : β} {f : β → β} : getD (modify t k f) k' fallback = if cmp k k' = Ordering.eq then (Option.map f (get? t k)).getD fallback else getD t k' fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.getD_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {fallback : β} {f : β → β} : getD (modify t k f) k fallback = (Option.map f (get? t k)).getD fallback

theorem Std.DTreeMap.Raw.Const.getKey?_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' : α} {f : β → β} : (modify t k f).getKey? k' = if cmp k k' = Ordering.eq then if k ∈ t then some k else none else t.getKey? k'

theorem Std.DTreeMap.Raw.Const.getKey?_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k : α} {f : β → β} : (modify t k f).getKey? k = if k ∈ t then some k else none

theorem Std.DTreeMap.Raw.Const.getKey!_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) [Inhabited α] {k k' : α} {f : β → β} : (modify t k f).getKey! k' = if cmp k k' = Ordering.eq then if k ∈ t then k else default else t.getKey! k'

theorem Std.DTreeMap.Raw.Const.getKey!_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) [Inhabited α] {k : α} {f : β → β} : (modify t k f).getKey! k = if k ∈ t then k else default

theorem Std.DTreeMap.Raw.Const.getKey_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) [Inhabited α] {k k' : α} {f : β → β} {hc : k' ∈ modify t k f} : (modify t k f).getKey k' hc = if cmp k k' = Ordering.eq then k else t.getKey k' ⋯

@[simp]

theorem Std.DTreeMap.Raw.Const.getKey_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) [Inhabited α] {k : α} {f : β → β} {hc : k ∈ modify t k f} : (modify t k f).getKey k hc = k

theorem Std.DTreeMap.Raw.Const.getKeyD_modify {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) {k k' fallback : α} {f : β → β} : (modify t k f).getKeyD k' fallback = if cmp k k' = Ordering.eq then if k ∈ t then k else fallback else t.getKeyD k' fallback

theorem Std.DTreeMap.Raw.Const.getKeyD_modify_self {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {β : Type v} {t : Raw α (fun (x : α) => β) cmp} (h : t.WF) [Inhabited α] {k fallback : α} {f : β → β} : (modify t k f).getKeyD k fallback = if k ∈ t then k else fallback

@[simp]

theorem Std.DTreeMap.Raw.minKey?_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : ∅.minKey? = none

theorem Std.DTreeMap.Raw.minKey?_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = true) : t.minKey? = none

@[simp]

theorem Std.DTreeMap.Raw.minKey?_eq_none_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey? = none ↔ t.isEmpty = true

theorem Std.DTreeMap.Raw.minKey?_eq_some_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} : t.minKey? = some km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKey?_eq_some_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {km : α} : t.minKey? = some km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

@[simp]

theorem Std.DTreeMap.Raw.isNone_minKey?_eq_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey?.isNone = t.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.isSome_minKey?_eq_not_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey?.isSome = !t.isEmpty

theorem Std.DTreeMap.Raw.isSome_minKey?_iff_isEmpty_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey?.isSome = true ↔ t.isEmpty = false

theorem Std.DTreeMap.Raw.minKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).minKey? = some (t.minKey?.elim k fun (k' : α) => if (cmp k k').isLE = true then k else k')

theorem Std.DTreeMap.Raw.isSome_minKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).minKey?.isSome = true

theorem Std.DTreeMap.Raw.minKey?_insert_le_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {km kmi : α} (hkm : t.minKey? = some km) (hkmi : (t.insert k v).minKey?.get ⋯ = kmi) : (cmp kmi km).isLE = true

theorem Std.DTreeMap.Raw.minKey?_insert_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {kmi : α} (hkmi : (t.insert k v).minKey?.get ⋯ = kmi) : (cmp kmi k).isLE = true

theorem Std.DTreeMap.Raw.contains_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.minKey? = some km) : t.contains km = true

theorem Std.DTreeMap.Raw.minKey?_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.minKey? = some km) : km ∈ t

theorem Std.DTreeMap.Raw.isSome_minKey?_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : t.contains k = true) : t.minKey?.isSome = true

theorem Std.DTreeMap.Raw.isSome_minKey?_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : k ∈ t → t.minKey?.isSome = true

theorem Std.DTreeMap.Raw.minKey?_le_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km : α} (hc : t.contains k = true) (hkm : t.minKey?.get ⋯ = km) : (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKey?_le_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km : α} (hc : k ∈ t) (hkm : t.minKey?.get ⋯ = km) : (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.le_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {k : α} (h : t.WF) : (∀ (k' : α), t.minKey? = some k' → (cmp k k').isLE = true) ↔ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.getKey?_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.minKey? = some km) : t.getKey? km = some km

theorem Std.DTreeMap.Raw.getKey_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} {hc : t.contains km = true} (hkm : t.minKey?.get ⋯ = km) : t.getKey km hc = km

theorem Std.DTreeMap.Raw.getKey!_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {km : α} (hkm : t.minKey? = some km) : t.getKey! km = km

theorem Std.DTreeMap.Raw.getKeyD_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km fallback : α} (hkm : t.minKey? = some km) : t.getKeyD km fallback = km

@[simp]

theorem Std.DTreeMap.Raw.minKey?_bind_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey?.bind t.getKey? = t.minKey?

theorem Std.DTreeMap.Raw.minKey?_erase_eq_iff_not_compare_eq_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).minKey? = t.minKey? ↔ ∀ {km : α}, t.minKey? = some km → ¬cmp k km = Ordering.eq

theorem Std.DTreeMap.Raw.minKey?_erase_eq_of_not_compare_eq_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : ∀ {km : α}, t.minKey? = some km → ¬cmp k km = Ordering.eq) : (t.erase k).minKey? = t.minKey?

theorem Std.DTreeMap.Raw.isSome_minKey?_of_isSome_minKey?_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hs : (t.erase k).minKey?.isSome = true) : t.minKey?.isSome = true

theorem Std.DTreeMap.Raw.minKey?_le_minKey?_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km kme : α} (hkme : (t.erase k).minKey? = some kme) (hkm : t.minKey?.get ⋯ = km) : (cmp km kme).isLE = true

theorem Std.DTreeMap.Raw.minKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).minKey? = some (t.minKey?.elim k fun (k' : α) => if cmp k k' = Ordering.lt then k else k')

theorem Std.DTreeMap.Raw.isSome_minKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).minKey?.isSome = true

theorem Std.DTreeMap.Raw.minKey?_insertIfNew_le_minKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {km kmi : α} (hkm : t.minKey? = some km) (hkmi : (t.insertIfNew k v).minKey?.get ⋯ = kmi) : (cmp kmi km).isLE = true

theorem Std.DTreeMap.Raw.minKey?_insertIfNew_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {kmi : α} (hkmi : (t.insertIfNew k v).minKey?.get ⋯ = kmi) : (cmp kmi k).isLE = true

theorem Std.DTreeMap.Raw.minKey?_eq_head?_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.minKey? = t.keys.head?

@[simp]

theorem Std.DTreeMap.Raw.minKey?_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} {f : β k → β k} (h : t.WF) : (t.modify k f).minKey? = t.minKey?

theorem Std.DTreeMap.Raw.minKey?_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).minKey? = some k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.Const.minKey?_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).minKey? = Option.map (fun (km : α) => if cmp km k = Ordering.eq then k else km) t.minKey?

@[simp]

theorem Std.DTreeMap.Raw.Const.minKey?_modify_eq_minKey? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).minKey? = t.minKey?

theorem Std.DTreeMap.Raw.Const.isSome_minKey?_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {f : β → β} (h : t.WF) : (modify t k f).minKey?.isSome = !t.isEmpty

theorem Std.DTreeMap.Raw.Const.isSome_minKey?_modify_eq_isSome {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).minKey?.isSome = t.minKey?.isSome

theorem Std.DTreeMap.Raw.Const.compare_minKey?_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} {km kmm : α} (hkm : t.minKey? = some km) (hkmm : (modify t k f).minKey?.get ⋯ = kmm) : cmp kmm km = Ordering.eq

theorem Std.DTreeMap.Raw.Const.minKey?_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).minKey? = some k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.minKey?_eq_some_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.minKey? = some t.minKey!

theorem Std.DTreeMap.Raw.minKey!_eq_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = true) : t.minKey! = default

theorem Std.DTreeMap.Raw.minKey!_eq_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {km : α} : t.minKey! = km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKey!_eq_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {km : α} : t.minKey! = km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKey!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (t.insert k v).minKey! = t.minKey?.elim k fun (k' : α) => if (cmp k k').isLE = true then k else k'

theorem Std.DTreeMap.Raw.minKey!_insert_le_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} : (cmp (t.insert k v).minKey! t.minKey!).isLE = true

theorem Std.DTreeMap.Raw.minKey!_insert_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (cmp (t.insert k v).minKey! k).isLE = true

theorem Std.DTreeMap.Raw.contains_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.contains t.minKey! = true

theorem Std.DTreeMap.Raw.minKey!_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.minKey! ∈ t

theorem Std.DTreeMap.Raw.minKey!_le_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (hc : t.contains k = true) : (cmp t.minKey! k).isLE = true

theorem Std.DTreeMap.Raw.minKey!_le_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (hc : k ∈ t) : (cmp t.minKey! k).isLE = true

theorem Std.DTreeMap.Raw.le_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} : (cmp k t.minKey!).isLE = true ↔ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.getKey?_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.getKey? t.minKey! = some t.minKey!

theorem Std.DTreeMap.Raw.getKey_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {hc : t.minKey! ∈ t} : t.getKey t.minKey! hc = t.minKey!

theorem Std.DTreeMap.Raw.getKey!_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.getKey! t.minKey! = t.minKey!

theorem Std.DTreeMap.Raw.getKeyD_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKeyD t.minKey! fallback = t.minKey!

theorem Std.DTreeMap.Raw.minKey!_erase_eq_of_not_compare_minKey!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) (heq : ¬cmp k t.minKey! = Ordering.eq) : (t.erase k).minKey! = t.minKey!

theorem Std.DTreeMap.Raw.minKey!_le_minKey!_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) : (cmp t.minKey! (t.erase k).minKey!).isLE = true

theorem Std.DTreeMap.Raw.minKey!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).minKey! = t.minKey?.elim k fun (k' : α) => if cmp k k' = Ordering.lt then k else k'

theorem Std.DTreeMap.Raw.minKey!_insertIfNew_le_minKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} : (cmp (t.insertIfNew k v).minKey! t.minKey!).isLE = true

theorem Std.DTreeMap.Raw.minKey!_insertIfNew_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (cmp (t.insertIfNew k v).minKey! k).isLE = true

theorem Std.DTreeMap.Raw.minKey!_eq_head!_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) : t.minKey! = t.keys.head!

@[simp]

theorem Std.DTreeMap.Raw.minKey!_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).minKey! = t.minKey!

theorem Std.DTreeMap.Raw.minKey!_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (he : (t.alter k f).isEmpty = false) : (t.alter k f).minKey! = k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.Const.minKey!_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} (he : (modify t k f).isEmpty = false) : (modify t k f).minKey! = if cmp t.minKey! k = Ordering.eq then k else t.minKey!

@[simp]

theorem Std.DTreeMap.Raw.Const.minKey!_modify_eq_minKey! {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} : (modify t k f).minKey! = t.minKey!

theorem Std.DTreeMap.Raw.Const.compare_minKey!_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} : cmp (modify t k f).minKey! t.minKey! = Ordering.eq

@[simp]

theorem Std.DTreeMap.Raw.Const.ordCompare_minKey!_modify_eq {α : Type u} {β : Type v} [Ord α] [TransOrd α] {t : Raw α (fun (x : α) => β) compare} [Inhabited α] (h : t.WF) {k : α} {f : β → β} : compare (modify t k f).minKey! t.minKey! = Ordering.eq

theorem Std.DTreeMap.Raw.Const.minKey!_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option β → Option β} (he : (alter t k f).isEmpty = false) : (alter t k f).minKey! = k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.minKey?_eq_some_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.minKey? = some (t.minKeyD fallback)

theorem Std.DTreeMap.Raw.minKeyD_eq_fallback {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = true) {fallback : α} : t.minKeyD fallback = fallback

theorem Std.DTreeMap.Raw.minKey!_eq_minKeyD_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) : t.minKey! = t.minKeyD default

theorem Std.DTreeMap.Raw.minKeyD_eq_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {km fallback : α} : t.minKeyD fallback = km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_eq_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) (he : t.isEmpty = false) {km fallback : α} : t.minKeyD fallback = km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp km k).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (t.insert k v).minKeyD fallback = t.minKey?.elim k fun (k' : α) => if (cmp k k').isLE = true then k else k'

theorem Std.DTreeMap.Raw.minKeyD_insert_le_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} {fallback : α} : (cmp ((t.insert k v).minKeyD fallback) (t.minKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_insert_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (cmp ((t.insert k v).minKeyD fallback) k).isLE = true

theorem Std.DTreeMap.Raw.contains_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.contains (t.minKeyD fallback) = true

theorem Std.DTreeMap.Raw.minKeyD_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.minKeyD fallback ∈ t

theorem Std.DTreeMap.Raw.minKeyD_le_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : t.contains k = true) {fallback : α} : (cmp (t.minKeyD fallback) k).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_le_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : k ∈ t) {fallback : α} : (cmp (t.minKeyD fallback) k).isLE = true

theorem Std.DTreeMap.Raw.le_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k fallback : α} : (cmp k (t.minKeyD fallback)).isLE = true ↔ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.getKey?_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKey? (t.minKeyD fallback) = some (t.minKeyD fallback)

theorem Std.DTreeMap.Raw.getKey_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {fallback : α} {hc : t.minKeyD fallback ∈ t} : t.getKey (t.minKeyD fallback) hc = t.minKeyD fallback

theorem Std.DTreeMap.Raw.getKey!_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKey! (t.minKeyD fallback) = t.minKeyD fallback

theorem Std.DTreeMap.Raw.getKeyD_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback fallback' : α} : t.getKeyD (t.minKeyD fallback) fallback' = t.minKeyD fallback

theorem Std.DTreeMap.Raw.minKeyD_erase_eq_of_not_compare_minKeyD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k fallback : α} (he : (t.erase k).isEmpty = false) (heq : ¬cmp k (t.minKeyD fallback) = Ordering.eq) : (t.erase k).minKeyD fallback = t.minKeyD fallback

theorem Std.DTreeMap.Raw.minKeyD_le_minKeyD_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) {fallback : α} : (cmp (t.minKeyD fallback) ((t.erase k).minKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (t.insertIfNew k v).minKeyD fallback = t.minKey?.elim k fun (k' : α) => if cmp k k' = Ordering.lt then k else k'

theorem Std.DTreeMap.Raw.minKeyD_insertIfNew_le_minKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} {fallback : α} : (cmp ((t.insertIfNew k v).minKeyD fallback) (t.minKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_insertIfNew_le_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (cmp ((t.insertIfNew k v).minKeyD fallback) k).isLE = true

theorem Std.DTreeMap.Raw.minKeyD_eq_headD_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {fallback : α} : t.minKeyD fallback = t.keys.headD fallback

@[simp]

theorem Std.DTreeMap.Raw.minKeyD_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} {fallback : α} : (t.modify k f).minKeyD fallback = t.minKeyD fallback

theorem Std.DTreeMap.Raw.minKeyD_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (he : (t.alter k f).isEmpty = false) {fallback : α} : (t.alter k f).minKeyD fallback = k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

theorem Std.DTreeMap.Raw.Const.minKeyD_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} (he : (modify t k f).isEmpty = false) {fallback : α} : (modify t k f).minKeyD fallback = if cmp (t.minKeyD fallback) k = Ordering.eq then k else t.minKeyD fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.minKeyD_modify_eq_minKeyD {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β → β} {fallback : α} : (modify t k f).minKeyD fallback = t.minKeyD fallback

theorem Std.DTreeMap.Raw.Const.compare_minKeyD_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} {fallback : α} : cmp ((modify t k f).minKeyD fallback) (t.minKeyD fallback) = Ordering.eq

@[simp]

theorem Std.DTreeMap.Raw.Const.ordCompare_minKeyD_modify_eq {α : Type u} {β : Type v} [Ord α] [TransOrd α] {t : Raw α (fun (x : α) => β) compare} (h : t.WF) {k : α} {f : β → β} {fallback : α} : compare ((modify t k f).minKeyD fallback) (t.minKeyD fallback) = Ordering.eq

theorem Std.DTreeMap.Raw.Const.minKeyD_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (he : (alter t k f).isEmpty = false) {fallback : α} : (alter t k f).minKeyD fallback = k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k k').isLE = true

@[simp]

theorem Std.DTreeMap.Raw.maxKey?_emptyc {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : ∅.maxKey? = none

theorem Std.DTreeMap.Raw.maxKey?_of_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = true) : t.maxKey? = none

@[simp]

theorem Std.DTreeMap.Raw.maxKey?_eq_none_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey? = none ↔ t.isEmpty = true

theorem Std.DTreeMap.Raw.maxKey?_eq_some_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} : t.maxKey? = some km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_eq_some_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {km : α} : t.maxKey? = some km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

@[simp]

theorem Std.DTreeMap.Raw.isNone_maxKey?_eq_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey?.isNone = t.isEmpty

@[simp]

theorem Std.DTreeMap.Raw.isSome_maxKey?_eq_not_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey?.isSome = !t.isEmpty

theorem Std.DTreeMap.Raw.isSome_maxKey?_iff_isEmpty_eq_false {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey?.isSome = true ↔ t.isEmpty = false

theorem Std.DTreeMap.Raw.maxKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).maxKey? = some (t.maxKey?.elim k fun (k' : α) => if (cmp k' k).isLE = true then k else k')

theorem Std.DTreeMap.Raw.isSome_maxKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insert k v).maxKey?.isSome = true

theorem Std.DTreeMap.Raw.maxKey?_le_maxKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {km kmi : α} (hkm : t.maxKey? = some km) (hkmi : (t.insert k v).maxKey?.get ⋯ = kmi) : (cmp km kmi).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKey?_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {kmi : α} (hkmi : (t.insert k v).maxKey?.get ⋯ = kmi) : (cmp k kmi).isLE = true

theorem Std.DTreeMap.Raw.contains_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.maxKey? = some km) : t.contains km = true

theorem Std.DTreeMap.Raw.maxKey?_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.maxKey? = some km) : km ∈ t

theorem Std.DTreeMap.Raw.isSome_maxKey?_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : t.contains k = true) : t.maxKey?.isSome = true

theorem Std.DTreeMap.Raw.isSome_maxKey?_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : k ∈ t → t.maxKey?.isSome = true

theorem Std.DTreeMap.Raw.le_maxKey?_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km : α} (hc : t.contains k = true) (hkm : t.maxKey?.get ⋯ = km) : (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.le_maxKey?_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km : α} (hc : k ∈ t) (hkm : t.maxKey?.get ⋯ = km) : (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {k : α} (h : t.WF) : (∀ (k' : α), t.maxKey? = some k' → (cmp k' k).isLE = true) ↔ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.getKey?_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} (hkm : t.maxKey? = some km) : t.getKey? km = some km

theorem Std.DTreeMap.Raw.getKey_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km : α} {hc : t.contains km = true} (hkm : t.maxKey?.get ⋯ = km) : t.getKey km hc = km

theorem Std.DTreeMap.Raw.getKey!_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {km : α} (hkm : t.maxKey? = some km) : t.getKey! km = km

theorem Std.DTreeMap.Raw.getKeyD_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {km fallback : α} (hkm : t.maxKey? = some km) : t.getKeyD km fallback = km

@[simp]

theorem Std.DTreeMap.Raw.maxKey?_bind_getKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey?.bind t.getKey? = t.maxKey?

theorem Std.DTreeMap.Raw.maxKey?_erase_eq_iff_not_compare_eq_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} : (t.erase k).maxKey? = t.maxKey? ↔ ∀ {km : α}, t.maxKey? = some km → ¬cmp k km = Ordering.eq

theorem Std.DTreeMap.Raw.maxKey?_erase_eq_of_not_compare_eq_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : ∀ {km : α}, t.maxKey? = some km → ¬cmp k km = Ordering.eq) : (t.erase k).maxKey? = t.maxKey?

theorem Std.DTreeMap.Raw.isSome_maxKey?_of_isSome_maxKey?_erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hs : (t.erase k).maxKey?.isSome = true) : t.maxKey?.isSome = true

theorem Std.DTreeMap.Raw.maxKey?_erase_le_maxKey? {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k km kme : α} (hkme : (t.erase k).maxKey? = some kme) (hkm : t.maxKey?.get ⋯ = km) : (cmp kme km).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).maxKey? = some (t.maxKey?.elim k fun (k' : α) => if cmp k' k = Ordering.lt then k else k')

theorem Std.DTreeMap.Raw.isSome_maxKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).maxKey?.isSome = true

theorem Std.DTreeMap.Raw.maxKey?_le_maxKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {km kmi : α} (hkm : t.maxKey? = some km) (hkmi : (t.insertIfNew k v).maxKey?.get ⋯ = kmi) : (cmp km kmi).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKey?_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {kmi : α} (hkmi : (t.insertIfNew k v).maxKey?.get ⋯ = kmi) : (cmp k kmi).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_eq_getLast?_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) : t.maxKey? = t.keys.getLast?

@[simp]

theorem Std.DTreeMap.Raw.maxKey?_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} {f : β k → β k} (h : t.WF) : (t.modify k f).maxKey? = t.maxKey?

theorem Std.DTreeMap.Raw.maxKey?_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} : (t.alter k f).maxKey? = some k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.Const.maxKey?_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).maxKey? = Option.map (fun (km : α) => if cmp km k = Ordering.eq then k else km) t.maxKey?

@[simp]

theorem Std.DTreeMap.Raw.Const.maxKey?_modify_eq_maxKey? {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).maxKey? = t.maxKey?

theorem Std.DTreeMap.Raw.Const.isSome_maxKey?_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {f : β → β} (h : t.WF) : (modify t k f).maxKey?.isSome = !t.isEmpty

theorem Std.DTreeMap.Raw.Const.isSome_maxKey?_modify_eq_isSome {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} : (modify t k f).maxKey?.isSome = t.maxKey?.isSome

theorem Std.DTreeMap.Raw.Const.compare_maxKey?_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} {km kmm : α} (hkm : t.maxKey? = some km) (hkmm : (modify t k f).maxKey?.get ⋯ = kmm) : cmp kmm km = Ordering.eq

theorem Std.DTreeMap.Raw.Const.maxKey?_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} : (alter t k f).maxKey? = some k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_eq_some_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.maxKey? = some t.maxKey!

theorem Std.DTreeMap.Raw.maxKey!_eq_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = true) : t.maxKey! = default

theorem Std.DTreeMap.Raw.maxKey!_eq_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {km : α} : t.maxKey! = km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKey!_eq_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {km : α} : t.maxKey! = km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKey!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (t.insert k v).maxKey! = t.maxKey?.elim k fun (k' : α) => if (cmp k' k).isLE = true then k else k'

theorem Std.DTreeMap.Raw.maxKey!_le_maxKey!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} : (cmp t.maxKey! (t.insert k v).maxKey!).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKey!_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (cmp k (t.insert k v).maxKey!).isLE = true

theorem Std.DTreeMap.Raw.contains_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.contains t.maxKey! = true

theorem Std.DTreeMap.Raw.maxKey!_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.maxKey! ∈ t

theorem Std.DTreeMap.Raw.le_maxKey!_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (hc : t.contains k = true) : (cmp k t.maxKey!).isLE = true

theorem Std.DTreeMap.Raw.le_maxKey!_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (hc : k ∈ t) : (cmp k t.maxKey!).isLE = true

theorem Std.DTreeMap.Raw.maxKey!_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} : (cmp t.maxKey! k).isLE = true ↔ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.getKey?_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.getKey? t.maxKey! = some t.maxKey!

theorem Std.DTreeMap.Raw.getKey_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {hc : t.maxKey! ∈ t} : t.getKey t.maxKey! hc = t.maxKey!

theorem Std.DTreeMap.Raw.getKey!_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) : t.getKey! t.maxKey! = t.maxKey!

theorem Std.DTreeMap.Raw.getKeyD_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKeyD t.maxKey! fallback = t.maxKey!

theorem Std.DTreeMap.Raw.maxKey!_erase_eq_of_not_compare_maxKey!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) (heq : ¬cmp k t.maxKey! = Ordering.eq) : (t.erase k).maxKey! = t.maxKey!

theorem Std.DTreeMap.Raw.maxKey!_erase_le_maxKey! {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) : (cmp (t.erase k).maxKey! t.maxKey!).isLE = true

theorem Std.DTreeMap.Raw.maxKey!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (t.insertIfNew k v).maxKey! = t.maxKey?.elim k fun (k' : α) => if cmp k' k = Ordering.lt then k else k'

theorem Std.DTreeMap.Raw.maxKey!_le_maxKey!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} : (cmp t.maxKey! (t.insertIfNew k v).maxKey!).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKey!_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {v : β k} : (cmp k (t.insertIfNew k v).maxKey!).isLE = true

theorem Std.DTreeMap.Raw.maxKey!_eq_getLast!_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) : t.maxKey! = t.keys.getLast!

@[simp]

theorem Std.DTreeMap.Raw.maxKey!_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β k → β k} : (t.modify k f).maxKey! = t.maxKey!

theorem Std.DTreeMap.Raw.maxKey!_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (he : (t.alter k f).isEmpty = false) : (t.alter k f).maxKey! = k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.Const.maxKey!_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} (he : (modify t k f).isEmpty = false) : (modify t k f).maxKey! = if cmp t.maxKey! k = Ordering.eq then k else t.maxKey!

@[simp]

theorem Std.DTreeMap.Raw.Const.maxKey!_modify_eq_maxKey! {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} : (modify t k f).maxKey! = t.maxKey!

theorem Std.DTreeMap.Raw.Const.compare_maxKey!_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : β → β} : cmp (modify t k f).maxKey! t.maxKey! = Ordering.eq

@[simp]

theorem Std.DTreeMap.Raw.Const.ordCompare_maxKey!_modify_eq {α : Type u} {β : Type v} [Ord α] [TransOrd α] {t : Raw α (fun (x : α) => β) compare} [Inhabited α] (h : t.WF) {k : α} {f : β → β} : compare (modify t k f).maxKey! t.maxKey! = Ordering.eq

theorem Std.DTreeMap.Raw.Const.maxKey!_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) {k : α} {f : Option β → Option β} (he : (alter t k f).isEmpty = false) : (alter t k f).maxKey! = k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.maxKey?_eq_some_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.maxKey? = some (t.maxKeyD fallback)

theorem Std.DTreeMap.Raw.maxKeyD_eq_fallback {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = true) {fallback : α} : t.maxKeyD fallback = fallback

theorem Std.DTreeMap.Raw.maxKey!_eq_maxKeyD_default {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) : t.maxKey! = t.maxKeyD default

theorem Std.DTreeMap.Raw.maxKeyD_eq_iff_getKey?_eq_self_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {km fallback : α} : t.maxKeyD fallback = km ↔ t.getKey? km = some km ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKeyD_eq_iff_mem_and_forall {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) (he : t.isEmpty = false) {km fallback : α} : t.maxKeyD fallback = km ↔ km ∈ t ∧ ∀ (k : α), k ∈ t → (cmp k km).isLE = true

theorem Std.DTreeMap.Raw.maxKeyD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (t.insert k v).maxKeyD fallback = t.maxKey?.elim k fun (k' : α) => if (cmp k' k).isLE = true then k else k'

theorem Std.DTreeMap.Raw.maxKeyD_le_maxKeyD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} {fallback : α} : (cmp (t.maxKeyD fallback) ((t.insert k v).maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKeyD_insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (cmp k ((t.insert k v).maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.contains_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.contains (t.maxKeyD fallback) = true

theorem Std.DTreeMap.Raw.maxKeyD_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.maxKeyD fallback ∈ t

theorem Std.DTreeMap.Raw.le_maxKeyD_of_contains {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : t.contains k = true) {fallback : α} : (cmp k (t.maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.le_maxKeyD_of_mem {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (hc : k ∈ t) {fallback : α} : (cmp k (t.maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.maxKeyD_le {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k fallback : α} : (cmp (t.maxKeyD fallback) k).isLE = true ↔ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.getKey?_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKey? (t.maxKeyD fallback) = some (t.maxKeyD fallback)

theorem Std.DTreeMap.Raw.getKey_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {fallback : α} {hc : t.maxKeyD fallback ∈ t} : t.getKey (t.maxKeyD fallback) hc = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.getKey!_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h : t.WF) (he : t.isEmpty = false) {fallback : α} : t.getKey! (t.maxKeyD fallback) = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.getKeyD_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {fallback fallback' : α} : t.getKeyD (t.maxKeyD fallback) fallback' = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.maxKeyD_erase_eq_of_not_compare_maxKeyD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k fallback : α} (he : (t.erase k).isEmpty = false) (heq : ¬cmp k (t.maxKeyD fallback) = Ordering.eq) : (t.erase k).maxKeyD fallback = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.maxKeyD_erase_le_maxKeyD {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} (he : (t.erase k).isEmpty = false) {fallback : α} : (cmp ((t.erase k).maxKeyD fallback) (t.maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.maxKeyD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (t.insertIfNew k v).maxKeyD fallback = t.maxKey?.elim k fun (k' : α) => if cmp k' k = Ordering.lt then k else k'

theorem Std.DTreeMap.Raw.maxKeyD_le_maxKeyD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) (he : t.isEmpty = false) {k : α} {v : β k} {fallback : α} : (cmp (t.maxKeyD fallback) ((t.insertIfNew k v).maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.self_le_maxKeyD_insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {k : α} {v : β k} {fallback : α} : (cmp k ((t.insertIfNew k v).maxKeyD fallback)).isLE = true

theorem Std.DTreeMap.Raw.maxKeyD_eq_getLastD_keys {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] (h : t.WF) {fallback : α} : t.maxKeyD fallback = t.keys.getLastD fallback

@[simp]

theorem Std.DTreeMap.Raw.maxKeyD_modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β k → β k} {fallback : α} : (t.modify k f).maxKeyD fallback = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.maxKeyD_alter_eq_self {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : Option (β k) → Option (β k)} (he : (t.alter k f).isEmpty = false) {fallback : α} : (t.alter k f).maxKeyD fallback = k ↔ (f (t.get? k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

theorem Std.DTreeMap.Raw.Const.maxKeyD_modify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} (he : (modify t k f).isEmpty = false) {fallback : α} : (modify t k f).maxKeyD fallback = if cmp (t.maxKeyD fallback) k = Ordering.eq then k else t.maxKeyD fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.maxKeyD_modify_eq_maxKeyD {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h : t.WF) {k : α} {f : β → β} {fallback : α} : (modify t k f).maxKeyD fallback = t.maxKeyD fallback

theorem Std.DTreeMap.Raw.Const.compare_maxKeyD_modify_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : β → β} {fallback : α} : cmp ((modify t k f).maxKeyD fallback) (t.maxKeyD fallback) = Ordering.eq

@[simp]

theorem Std.DTreeMap.Raw.Const.ordCompare_maxKeyD_modify_eq {α : Type u} {β : Type v} [Ord α] [TransOrd α] {t : Raw α (fun (x : α) => β) compare} (h : t.WF) {k : α} {f : β → β} {fallback : α} : compare ((modify t k f).maxKeyD fallback) (t.maxKeyD fallback) = Ordering.eq

theorem Std.DTreeMap.Raw.Const.maxKeyD_alter_eq_self {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h : t.WF) {k : α} {f : Option β → Option β} (he : (alter t k f).isEmpty = false) {fallback : α} : (alter t k f).maxKeyD fallback = k ↔ (f (get? t k)).isSome = true ∧ ∀ (k' : α), k' ∈ t → (cmp k' k).isLE = true

@[simp]

theorem Std.DTreeMap.Raw.Equiv.rfl {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : t.Equiv t

theorem Std.DTreeMap.Raw.Equiv.symm {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} : t₁.Equiv t₂ → t₂.Equiv t₁

theorem Std.DTreeMap.Raw.Equiv.trans {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ t₃ : Raw α β cmp} : t₁.Equiv t₂ → t₂.Equiv t₃ → t₁.Equiv t₃

instance Std.DTreeMap.Raw.Equiv.instTrans {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} : Trans Equiv Equiv Equiv

Equations

• Std.DTreeMap.Raw.Equiv.instTrans = { trans := ⋯ }

theorem Std.DTreeMap.Raw.Equiv.comm {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} : t₁.Equiv t₂ ↔ t₂.Equiv t₁

theorem Std.DTreeMap.Raw.Equiv.congr_left {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ t₃ : Raw α β cmp} (h : t₁.Equiv t₂) : t₁.Equiv t₃ ↔ t₂.Equiv t₃

theorem Std.DTreeMap.Raw.Equiv.congr_right {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ t₃ : Raw α β cmp} (h : t₁.Equiv t₂) : t₃.Equiv t₁ ↔ t₃.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.isEmpty_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h : t₁.Equiv t₂) : t₁.isEmpty = t₂.isEmpty

theorem Std.DTreeMap.Raw.Equiv.contains_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.contains k = t₂.contains k

theorem Std.DTreeMap.Raw.Equiv.mem_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : k ∈ t₁ ↔ k ∈ t₂

theorem Std.DTreeMap.Raw.Equiv.size_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.size = t₂.size

theorem Std.DTreeMap.Raw.Equiv.get?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.get? k = t₂.get? k

theorem Std.DTreeMap.Raw.Equiv.get_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} {hk : k ∈ t₁} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.get k hk = t₂.get k ⋯

theorem Std.DTreeMap.Raw.Equiv.get!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} [Inhabited (β k)] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.get! k = t₂.get! k

theorem Std.DTreeMap.Raw.Equiv.getD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {k : α} {fallback : β k} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getD k fallback = t₂.getD k fallback

theorem Std.DTreeMap.Raw.Equiv.getKey?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKey? k = t₂.getKey? k

theorem Std.DTreeMap.Raw.Equiv.getKey_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} {hk : k ∈ t₁} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKey k hk = t₂.getKey k ⋯

theorem Std.DTreeMap.Raw.Equiv.getKey!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKey! k = t₂.getKey! k

theorem Std.DTreeMap.Raw.Equiv.getKeyD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyD k fallback = t₂.getKeyD k fallback

theorem Std.DTreeMap.Raw.Equiv.toList_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.toList = t₂.toList

theorem Std.DTreeMap.Raw.Equiv.toArray_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.toArray = t₂.toArray

theorem Std.DTreeMap.Raw.Equiv.keys_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.keys = t₂.keys

theorem Std.DTreeMap.Raw.Equiv.keysArray_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.keysArray = t₂.keysArray

theorem Std.DTreeMap.Raw.Equiv.foldlM_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [TransCmp cmp] [Monad m] [LawfulMonad m] {f : δ → (a : α) → β a → m δ} {init : δ} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : foldlM f init t₁ = foldlM f init t₂

theorem Std.DTreeMap.Raw.Equiv.foldl_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {δ : Type w} [TransCmp cmp] {f : δ → (a : α) → β a → δ} {init : δ} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : foldl f init t₁ = foldl f init t₂

theorem Std.DTreeMap.Raw.Equiv.foldrM_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [TransCmp cmp] [Monad m] [LawfulMonad m] {f : (a : α) → β a → δ → m δ} {init : δ} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : foldrM f init t₁ = foldrM f init t₂

theorem Std.DTreeMap.Raw.Equiv.foldr_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {δ : Type w} [TransCmp cmp] {f : (a : α) → β a → δ → δ} {init : δ} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : foldr f init t₁ = foldr f init t₂

theorem Std.DTreeMap.Raw.Equiv.forIn_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {δ : Type w} {m : Type w → Type w'} [TransCmp cmp] [Monad m] [LawfulMonad m] {b : δ} {f : (a : α) × β a → δ → m (ForInStep δ)} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : ForIn.forIn t₁ b f = ForIn.forIn t₂ b f

theorem Std.DTreeMap.Raw.Equiv.forM_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} {m : Type w → Type w'} [TransCmp cmp] [Monad m] [LawfulMonad m] {f : (a : α) × β a → m PUnit} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : ForM.forM t₁ f = ForM.forM t₂ f

theorem Std.DTreeMap.Raw.Equiv.any_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {p : (a : α) → β a → Bool} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.any p = t₂.any p

theorem Std.DTreeMap.Raw.Equiv.all_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {p : (a : α) → β a → Bool} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.all p = t₂.all p

theorem Std.DTreeMap.Raw.Equiv.minKey?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minKey? = t₂.minKey?

theorem Std.DTreeMap.Raw.Equiv.minKey!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minKey! = t₂.minKey!

theorem Std.DTreeMap.Raw.Equiv.minKeyD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minKeyD fallback = t₂.minKeyD fallback

theorem Std.DTreeMap.Raw.Equiv.maxKey?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxKey? = t₂.maxKey?

theorem Std.DTreeMap.Raw.Equiv.maxKey!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxKey! = t₂.maxKey!

theorem Std.DTreeMap.Raw.Equiv.maxKeyD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxKeyD fallback = t₂.maxKeyD fallback

theorem Std.DTreeMap.Raw.Equiv.minEntry?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minEntry? = t₂.minEntry?

theorem Std.DTreeMap.Raw.Equiv.minEntry!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minEntry! = t₂.minEntry!

theorem Std.DTreeMap.Raw.Equiv.minEntryD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.minEntryD fallback = t₂.minEntryD fallback

theorem Std.DTreeMap.Raw.Equiv.maxEntry?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxEntry? = t₂.maxEntry?

theorem Std.DTreeMap.Raw.Equiv.maxEntry!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxEntry! = t₂.maxEntry!

theorem Std.DTreeMap.Raw.Equiv.maxEntryD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.maxEntryD fallback = t₂.maxEntryD fallback

theorem Std.DTreeMap.Raw.Equiv.entryAtIdx?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.entryAtIdx? i = t₂.entryAtIdx? i

theorem Std.DTreeMap.Raw.Equiv.entryAtIdx!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.entryAtIdx! i = t₂.entryAtIdx! i

theorem Std.DTreeMap.Raw.Equiv.entryAtIdxD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {i : Nat} {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.entryAtIdxD i fallback = t₂.entryAtIdxD i fallback

theorem Std.DTreeMap.Raw.Equiv.keyAtIdx?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.keyAtIdx? i = t₂.keyAtIdx? i

theorem Std.DTreeMap.Raw.Equiv.keyAtIdx!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.keyAtIdx! i = t₂.keyAtIdx! i

theorem Std.DTreeMap.Raw.Equiv.keyAtIdxD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {i : Nat} {fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.keyAtIdxD i fallback = t₂.keyAtIdxD i fallback

theorem Std.DTreeMap.Raw.Equiv.getEntryGE?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGE? k = t₂.getEntryGE? k

theorem Std.DTreeMap.Raw.Equiv.getEntryGE!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGE! k = t₂.getEntryGE! k

theorem Std.DTreeMap.Raw.Equiv.getEntryGED_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGED k fallback = t₂.getEntryGED k fallback

theorem Std.DTreeMap.Raw.Equiv.getEntryGT?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGT? k = t₂.getEntryGT? k

theorem Std.DTreeMap.Raw.Equiv.getEntryGT!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGT! k = t₂.getEntryGT! k

theorem Std.DTreeMap.Raw.Equiv.getEntryGTD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryGTD k fallback = t₂.getEntryGTD k fallback

theorem Std.DTreeMap.Raw.Equiv.getEntryLE?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLE? k = t₂.getEntryLE? k

theorem Std.DTreeMap.Raw.Equiv.getEntryLE!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLE! k = t₂.getEntryLE! k

theorem Std.DTreeMap.Raw.Equiv.getEntryLED_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLED k fallback = t₂.getEntryLED k fallback

theorem Std.DTreeMap.Raw.Equiv.getEntryLT?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLT? k = t₂.getEntryLT? k

theorem Std.DTreeMap.Raw.Equiv.getEntryLT!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited ((a : α) × β a)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLT! k = t₂.getEntryLT! k

theorem Std.DTreeMap.Raw.Equiv.getEntryLTD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} {fallback : (a : α) × β a} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getEntryLTD k fallback = t₂.getEntryLTD k fallback

theorem Std.DTreeMap.Raw.Equiv.getKeyGE?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGE? k = t₂.getKeyGE? k

theorem Std.DTreeMap.Raw.Equiv.getKeyGE!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGE! k = t₂.getKeyGE! k

theorem Std.DTreeMap.Raw.Equiv.getKeyGED_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGED k fallback = t₂.getKeyGED k fallback

theorem Std.DTreeMap.Raw.Equiv.getKeyGT?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGT? k = t₂.getKeyGT? k

theorem Std.DTreeMap.Raw.Equiv.getKeyGT!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGT! k = t₂.getKeyGT! k

theorem Std.DTreeMap.Raw.Equiv.getKeyGTD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyGTD k fallback = t₂.getKeyGTD k fallback

theorem Std.DTreeMap.Raw.Equiv.getKeyLE?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLE? k = t₂.getKeyLE? k

theorem Std.DTreeMap.Raw.Equiv.getKeyLE!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLE! k = t₂.getKeyLE! k

theorem Std.DTreeMap.Raw.Equiv.getKeyLED_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLED k fallback = t₂.getKeyLED k fallback

theorem Std.DTreeMap.Raw.Equiv.getKeyLT?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLT? k = t₂.getKeyLT? k

theorem Std.DTreeMap.Raw.Equiv.getKeyLT!_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [Inhabited α] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLT! k = t₂.getKeyLT! k

theorem Std.DTreeMap.Raw.Equiv.getKeyLTD_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] {k fallback : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.getKeyLTD k fallback = t₂.getKeyLTD k fallback

theorem Std.DTreeMap.Raw.Equiv.insert {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (v : β k) : (t₁.insert k v).Equiv (t₂.insert k v)

theorem Std.DTreeMap.Raw.Equiv.erase {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) : (t₁.erase k).Equiv (t₂.erase k)

theorem Std.DTreeMap.Raw.Equiv.insertIfNew {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (v : β k) : (t₁.insertIfNew k v).Equiv (t₂.insertIfNew k v)

theorem Std.DTreeMap.Raw.Equiv.alter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (f : Option (β k) → Option (β k)) : (t₁.alter k f).Equiv (t₂.alter k f)

theorem Std.DTreeMap.Raw.Equiv.modify {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (f : β k → β k) : (t₁.modify k f).Equiv (t₂.modify k f)

theorem Std.DTreeMap.Raw.Equiv.filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (f : (a : α) → β a → Bool) : (Raw.filter f t₁).Equiv (Raw.filter f t₂)

theorem Std.DTreeMap.Raw.Equiv.map {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h : t₁.Equiv t₂) (f : (a : α) → β a → γ a) : (Raw.map f t₁).Equiv (Raw.map f t₂)

theorem Std.DTreeMap.Raw.Equiv.filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (f : (a : α) → β a → Option (γ a)) : (Raw.filterMap f t₁).Equiv (Raw.filterMap f t₂)

theorem Std.DTreeMap.Raw.Equiv.insertMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (l : List ((a : α) × β a)) : (t₁.insertMany l).Equiv (t₂.insertMany l)

theorem Std.DTreeMap.Raw.Equiv.eraseMany_list {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (l : List α) : (t₁.eraseMany l).Equiv (t₂.eraseMany l)

theorem Std.DTreeMap.Raw.Equiv.mergeWith {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ t₃ t₄ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h₃ : t₃.WF) (h₄ : t₄.WF) (f : (a : α) → β a → β a → β a) (h : t₁.Equiv t₂) (h' : t₃.Equiv t₄) : (Raw.mergeWith f t₁ t₃).Equiv (Raw.mergeWith f t₂ t₄)

theorem Std.DTreeMap.Raw.Equiv.constGet?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.get? t₁ k = Const.get? t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGet_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {hk : k ∈ t₁} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.get t₁ k hk = Const.get t₂ k ⋯

theorem Std.DTreeMap.Raw.Equiv.constGet!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.get! t₁ k = Const.get! t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {fallback : β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getD t₁ k fallback = Const.getD t₂ k fallback

theorem Std.DTreeMap.Raw.Equiv.constToList_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.toList t₁ = Const.toList t₂

theorem Std.DTreeMap.Raw.Equiv.constToArray_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.toArray t₁ = Const.toArray t₂

theorem Std.DTreeMap.Raw.Equiv.values_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.values = t₂.values

theorem Std.DTreeMap.Raw.Equiv.valuesArray_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : t₁.valuesArray = t₂.valuesArray

theorem Std.DTreeMap.Raw.Equiv.constMinEntry?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.minEntry? t₁ = Const.minEntry? t₂

theorem Std.DTreeMap.Raw.Equiv.constMinEntry!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.minEntry! t₁ = Const.minEntry! t₂

theorem Std.DTreeMap.Raw.Equiv.constMinEntryD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.minEntryD t₁ fallback = Const.minEntryD t₂ fallback

theorem Std.DTreeMap.Raw.Equiv.constMaxEntry?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.maxEntry? t₁ = Const.maxEntry? t₂

theorem Std.DTreeMap.Raw.Equiv.constMaxEntry!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.maxEntry! t₁ = Const.maxEntry! t₂

theorem Std.DTreeMap.Raw.Equiv.constMaxEntryD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.maxEntryD t₁ fallback = Const.maxEntryD t₂ fallback

theorem Std.DTreeMap.Raw.Equiv.constEntryAtIdx?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.entryAtIdx? t₁ i = Const.entryAtIdx? t₂ i

theorem Std.DTreeMap.Raw.Equiv.constEntryAtIdx!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] {i : Nat} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.entryAtIdx! t₁ i = Const.entryAtIdx! t₂ i

theorem Std.DTreeMap.Raw.Equiv.constEntryAtIdxD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {i : Nat} {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.entryAtIdxD t₁ i fallback = Const.entryAtIdxD t₂ i fallback

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGE?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGE? t₁ k = Const.getEntryGE? t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGE!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGE! t₁ k = Const.getEntryGE! t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGED_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGED t₁ k fallback = Const.getEntryGED t₂ k fallback

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGT?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGT? t₁ k = Const.getEntryGT? t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGT!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGT! t₁ k = Const.getEntryGT! t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryGTD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryGTD t₁ k fallback = Const.getEntryGTD t₂ k fallback

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLE?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLE? t₁ k = Const.getEntryLE? t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLE!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLE! t₁ k = Const.getEntryLE! t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLED_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLED t₁ k fallback = Const.getEntryLED t₂ k fallback

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLT?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLT? t₁ k = Const.getEntryLT? t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLT!_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited (α × β)] {k : α} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLT! t₁ k = Const.getEntryLT! t₂ k

theorem Std.DTreeMap.Raw.Equiv.constGetEntryLTD_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {k : α} {fallback : α × β} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) : Const.getEntryLTD t₁ k fallback = Const.getEntryLTD t₂ k fallback

theorem Std.DTreeMap.Raw.Equiv.constAlter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (f : Option β → Option β) : (Const.alter t₁ k f).Equiv (Const.alter t₂ k f)

theorem Std.DTreeMap.Raw.Equiv.constModify {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (k : α) (f : β → β) : (Const.modify t₁ k f).Equiv (Const.modify t₂ k f)

theorem Std.DTreeMap.Raw.Equiv.constInsertMany_list {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (l : List (α × β)) : (Const.insertMany t₁ l).Equiv (Const.insertMany t₂ l)

theorem Std.DTreeMap.Raw.Equiv.constInsertManyIfNewUnit_list {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : t₁.Equiv t₂) (l : List α) : (Const.insertManyIfNewUnit t₁ l).Equiv (Const.insertManyIfNewUnit t₂ l)

theorem Std.DTreeMap.Raw.Equiv.constMergeWith {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ t₃ t₄ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h₃ : t₃.WF) (h₄ : t₄.WF) (f : α → β → β → β) (h : t₁.Equiv t₂) (h' : t₃.Equiv t₄) : (Const.mergeWith f t₁ t₃).Equiv (Const.mergeWith f t₂ t₄)

theorem Std.DTreeMap.Raw.Equiv.of_forall_get?_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : ∀ (k : α), t₁.get? k = t₂.get? k) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_forall_getKey_eq_of_forall_constGet?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (hk : ∀ (k : α) (hk : k ∈ t₁) (hk' : k ∈ t₂), t₁.getKey k hk = t₂.getKey k hk') (hv : ∀ (k : α), Const.get? t₁ k = Const.get? t₂ k) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_forall_constGet?_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) (h : ∀ (k : α), Const.get? t₁ k = Const.get? t₂ k) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_forall_getKey?_unit_eq {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : ∀ (k : α), t₁.getKey? k = t₂.getKey? k) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_forall_contains_unit_eq {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : ∀ (k : α), t₁.contains k = t₂.contains k) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_forall_mem_unit_iff {α : Type u} {cmp : α → α → Ordering} [TransCmp cmp] [LawfulEqCmp cmp] {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} (h₁ : t₁.WF) (h₂ : t₂.WF) (h : ∀ (k : α), k ∈ t₁ ↔ k ∈ t₂) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.equiv_empty_iff_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : t.Equiv empty ↔ t.isEmpty = true

theorem Std.DTreeMap.Raw.empty_equiv_iff_isEmpty {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : empty.Equiv t ↔ t.isEmpty = true

theorem Std.DTreeMap.Raw.equiv_iff_toList_perm {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} : t₁.Equiv t₂ ↔ t₁.toList.Perm t₂.toList

theorem Std.DTreeMap.Raw.Equiv.of_toList_perm {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} (h : t₁.toList.Perm t₂.toList) : t₁.Equiv t₂

theorem Std.DTreeMap.Raw.equiv_iff_toList_eq {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Raw α β cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) : t₁.Equiv t₂ ↔ t₁.toList = t₂.toList

theorem Std.DTreeMap.Raw.Const.equiv_iff_toList_perm {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} : t₁.Equiv t₂ ↔ (toList t₁).Perm (toList t₂)

theorem Std.DTreeMap.Raw.Const.equiv_iff_toList_eq {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) : t₁.Equiv t₂ ↔ toList t₁ = toList t₂

theorem Std.DTreeMap.Raw.Const.equiv_iff_keys_unit_perm {α : Type u} {cmp : α → α → Ordering} {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} : t₁.Equiv t₂ ↔ t₁.keys.Perm t₂.keys

theorem Std.DTreeMap.Raw.Const.equiv_iff_keys_unit_eq {α : Type u} {cmp : α → α → Ordering} {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} [TransCmp cmp] (h₁ : t₁.WF) (h₂ : t₂.WF) : t₁.Equiv t₂ ↔ t₁.keys = t₂.keys

theorem Std.DTreeMap.Raw.Equiv.of_constToList_perm {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t₁ t₂ : Raw α (fun (x : α) => β) cmp} : (Const.toList t₁).Perm (Const.toList t₂) → t₁.Equiv t₂

theorem Std.DTreeMap.Raw.Equiv.of_keys_unit_perm {α : Type u} {cmp : α → α → Ordering} {t₁ t₂ : Raw α (fun (x : α) => Unit) cmp} : t₁.keys.Perm t₂.keys → t₁.Equiv t₂

theorem Std.DTreeMap.Raw.toList_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} {f : (a : α) → β a → Option (γ a)} (h : t.WF) : (filterMap f t).toList = List.filterMap (fun (p : (a : α) × β a) => Option.map (fun (x : γ p.fst) => ⟨p.fst, x⟩) (f p.fst p.snd)) t.toList

theorem Std.DTreeMap.Raw.isEmpty_filterMap_iff {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} (h : t.WF) : (filterMap f t).isEmpty = true ↔ ∀ (k : α) (h : k ∈ t), f k (t.get k h) = none

theorem Std.DTreeMap.Raw.isEmpty_filterMap_eq_false_iff {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} (h : t.WF) : (filterMap f t).isEmpty = false ↔ ∃ (k : α), ∃ (h : k ∈ t), (f k (t.get k h)).isSome = true

theorem Std.DTreeMap.Raw.contains_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : (filterMap f t).contains k = Option.any (fun (x : β k) => (f k x).isSome) (t.get? k)

theorem Std.DTreeMap.Raw.mem_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : k ∈ filterMap f t ↔ ∃ (h : k ∈ t), (f k (t.get k h)).isSome = true

theorem Std.DTreeMap.Raw.contains_of_contains_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : (filterMap f t).contains k = true → t.contains k = true

theorem Std.DTreeMap.Raw.mem_of_mem_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : k ∈ filterMap f t → k ∈ t

theorem Std.DTreeMap.Raw.size_filterMap_le_size {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Option (γ a)} (h : t.WF) : (filterMap f t).size ≤ t.size

theorem Std.DTreeMap.Raw.size_filterMap_eq_size_iff {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} (h : t.WF) : (filterMap f t).size = t.size ↔ ∀ (a : α) (h : a ∈ t), (f a (t.get a h)).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.get?_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : (filterMap f t).get? k = (t.get? k).bind (f k)

theorem Std.DTreeMap.Raw.isSome_apply_of_mem_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) (h' : k ∈ filterMap f t) : (f k (t.get k ⋯)).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.get_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} {h' : k ∈ filterMap f t} (h : t.WF) : (filterMap f t).get k h' = (f k (t.get k ⋯)).get ⋯

theorem Std.DTreeMap.Raw.get!_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} [Inhabited (γ k)] (h : t.WF) : (filterMap f t).get! k = ((t.get? k).bind (f k)).get!

theorem Std.DTreeMap.Raw.getD_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} {fallback : γ k} (h : t.WF) : (filterMap f t).getD k fallback = ((t.get? k).bind (f k)).getD fallback

theorem Std.DTreeMap.Raw.getKey?_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : (filterMap f t).getKey? k = (t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (t.get x ⋯)).isSome

@[simp]

theorem Std.DTreeMap.Raw.getKey_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Option (γ a)} {k : α} {h' : k ∈ filterMap f t} (h : t.WF) : (filterMap f t).getKey k h' = t.getKey k ⋯

theorem Std.DTreeMap.Raw.getKey!_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] {f : (a : α) → β a → Option (γ a)} {k : α} (h : t.WF) : (filterMap f t).getKey! k = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (t.get x ⋯)).isSome).get!

theorem Std.DTreeMap.Raw.getKeyD_filterMap {α : Type u} {β : α → Type v} {γ : α → Type w} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Option (γ a)} {k fallback : α} (h : t.WF) : (filterMap f t).getKeyD k fallback = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (t.get x ⋯)).isSome).getD fallback

theorem Std.DTreeMap.Raw.Const.isEmpty_filterMap_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} (h : t.WF) : (filterMap f t).isEmpty = true ↔ ∀ (k : α) (h : k ∈ t), f (t.getKey k h) (get t k h) = none

theorem Std.DTreeMap.Raw.Const.isEmpty_filterMap_eq_false_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} (h : t.WF) : (filterMap f t).isEmpty = false ↔ ∃ (k : α), ∃ (h : k ∈ t), (f (t.getKey k h) (get t k h)).isSome = true

theorem Std.DTreeMap.Raw.Const.mem_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} (h : t.WF) : k ∈ filterMap f t ↔ ∃ (h : k ∈ t), (f (t.getKey k h) (get t k h)).isSome = true

theorem Std.DTreeMap.Raw.Const.size_filterMap_eq_size_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} (h : t.WF) : (filterMap f t).size = t.size ↔ ∀ (k : α) (h : k ∈ t), (f (t.getKey k h) (get t k h)).isSome = true

theorem Std.DTreeMap.Raw.Const.get?_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} (h : t.WF) : get? (filterMap f t) k = (get? t k).pbind fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_filterMap' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → Option γ} {k : α} (h : t.WF) : get? (filterMap f t) k = (get? t k).bind (f k)

Simpler variant of get?_filterMap when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.get?_filterMap_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get? (filterMap f t) k = (get? t k).bind (f k')

theorem Std.DTreeMap.Raw.Const.isSome_apply_of_mem_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} (h : t.WF) (h' : k ∈ filterMap f t) : (f (t.getKey k ⋯) (get t k ⋯)).isSome = true

@[simp]

theorem Std.DTreeMap.Raw.Const.get_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} {h' : k ∈ filterMap f t} (h : t.WF) : get (filterMap f t) k h' = (f (t.getKey k ⋯) (get t k ⋯)).get ⋯

theorem Std.DTreeMap.Raw.Const.get!_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited γ] {f : α → β → Option γ} {k : α} (h : t.WF) : get! (filterMap f t) k = ((get? t k).pbind fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x).get!

theorem Std.DTreeMap.Raw.Const.get!_filterMap' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited γ] {f : α → β → Option γ} {k : α} (h : t.WF) : get! (filterMap f t) k = ((get? t k).bind (f k)).get!

Simpler variant of get!_filterMap when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.get!_filterMap_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited γ] {f : α → β → Option γ} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get! (filterMap f t) k = ((get? t k).bind fun (x : β) => f k' x).get!

theorem Std.DTreeMap.Raw.Const.getD_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} {fallback : γ} (h : t.WF) : getD (filterMap f t) k fallback = ((get? t k).pbind fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x).getD fallback

theorem Std.DTreeMap.Raw.Const.getD_filterMap' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → Option γ} {k : α} {fallback : γ} (h : t.WF) : getD (filterMap f t) k fallback = ((get? t k).bind (f k)).getD fallback

Simpler variant of getD_filterMap when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.getD_filterMap_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k k' : α} {fallback : γ} (h : t.WF) : t.getKey? k = some k' → getD (filterMap f t) k fallback = ((get? t k).bind fun (x : β) => f k' x).getD fallback

theorem Std.DTreeMap.Raw.Const.toList_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} {f : α → β → Option γ} (h : t.WF) : toList (filterMap f t) = List.filterMap (fun (p : α × β) => Option.map (fun (x : γ) => (p.fst, x)) (f p.fst p.snd)) (toList t)

theorem Std.DTreeMap.Raw.Const.getKey?_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} (h : t.WF) : (filterMap f t).getKey? k = (t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (get t x ⋯)).isSome

@[simp]

theorem Std.DTreeMap.Raw.Const.getKey_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k : α} {h' : k ∈ filterMap f t} (h : t.WF) : (filterMap f t).getKey k h' = t.getKey k ⋯

theorem Std.DTreeMap.Raw.Const.getKey!_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] {f : α → β → Option γ} {k : α} (h : t.WF) : (filterMap f t).getKey! k = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (get t x ⋯)).isSome).get!

theorem Std.DTreeMap.Raw.Const.getKeyD_filterMap {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Option γ} {k fallback : α} (h : t.WF) : (filterMap f t).getKeyD k fallback = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => (f x (get t x ⋯)).isSome).getD fallback

theorem Std.DTreeMap.Raw.filterMap_equiv_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {f : (a : α) → β a → Bool} (h : t.WF) : (filterMap (fun (k : α) => Option.guard fun (v : β k) => f k v) t).Equiv (filter f t)

theorem Std.DTreeMap.Raw.toList_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).toList = List.filter (fun (p : (a : α) × β a) => f p.fst p.snd) t.toList

theorem Std.DTreeMap.Raw.keys_filter_key {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {f : α → Bool} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).keys = List.filter f t.keys

theorem Std.DTreeMap.Raw.isEmpty_filter_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).isEmpty = true ↔ ∀ (k : α) (h : k ∈ t), f k (t.get k h) = false

theorem Std.DTreeMap.Raw.isEmpty_filter_eq_false_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).isEmpty = false ↔ ∃ (k : α), ∃ (h : k ∈ t), f k (t.get k h) = true

theorem Std.DTreeMap.Raw.isEmpty_filter_key_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} (h : t.WF) : (filter (fun (a : α) (x : β a) => f a) t).isEmpty = true ↔ ∀ (k : α) (h : k ∈ t), f (t.getKey k h) = false

theorem Std.DTreeMap.Raw.isEmpty_filter_key_eq_false_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} (h : t.WF) : (filter (fun (a : α) (x : β a) => f a) t).isEmpty = false ↔ ∃ (k : α), ∃ (h : k ∈ t), f (t.getKey k h) = true

theorem Std.DTreeMap.Raw.contains_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : (filter f t).contains k = Option.any (f k) (t.get? k)

theorem Std.DTreeMap.Raw.mem_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : k ∈ filter f t ↔ Option.any (f k) (t.get? k) = true

theorem Std.DTreeMap.Raw.mem_filter_key {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} {k : α} (h : t.WF) : k ∈ filter (fun (a : α) (x : β a) => f a) t ↔ ∃ (h : k ∈ t), f (t.getKey k h) = true

theorem Std.DTreeMap.Raw.contains_of_contains_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : (filter f t).contains k = true → t.contains k = true

theorem Std.DTreeMap.Raw.mem_of_mem_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : k ∈ filter f t → k ∈ t

theorem Std.DTreeMap.Raw.size_filter_le_size {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).size ≤ t.size

theorem Std.DTreeMap.Raw.size_filter_eq_size_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).size = t.size ↔ ∀ (k : α) (h : k ∈ t), f k (t.get k h) = true

theorem Std.DTreeMap.Raw.filter_equiv_self_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).Equiv t ↔ ∀ (k : α) (h : k ∈ t), f k (t.get k h) = true

theorem Std.DTreeMap.Raw.filter_key_equiv_self_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).Equiv t ↔ ∀ (k : α) (h : k ∈ t), f (t.getKey k h) = true

theorem Std.DTreeMap.Raw.size_filter_key_eq_size_iff {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).size = t.size ↔ ∀ (k : α) (h : k ∈ t), f (t.getKey k h) = true

@[simp]

theorem Std.DTreeMap.Raw.get?_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : (filter f t).get? k = Option.filter (f k) (t.get? k)

@[simp]

theorem Std.DTreeMap.Raw.get_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} {h' : k ∈ filter f t} (h : t.WF) : (filter f t).get k h' = t.get k ⋯

theorem Std.DTreeMap.Raw.get!_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} [Inhabited (β k)] (h : t.WF) : (filter f t).get! k = (Option.filter (f k) (t.get? k)).get!

theorem Std.DTreeMap.Raw.getD_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} {fallback : β k} (h : t.WF) : (filter f t).getD k fallback = (Option.filter (f k) (t.get? k)).getD fallback

theorem Std.DTreeMap.Raw.keys_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} (h : t.WF) : (filter f t).keys = (List.filter (fun (x : { x : α // x ∈ t.keys }) => match x with | ⟨x, h'⟩ => f x (t.get x ⋯)) t.keys.attach).unattach

theorem Std.DTreeMap.Raw.getKey?_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : (filter f t).getKey? k = (t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (t.get x ⋯)

theorem Std.DTreeMap.Raw.getKey?_filter_key {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} {k : α} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).getKey? k = Option.filter f (t.getKey? k)

@[simp]

theorem Std.DTreeMap.Raw.getKey_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : (a : α) → β a → Bool} {k : α} {h' : k ∈ filter f t} (h : t.WF) : (filter f t).getKey k h' = t.getKey k ⋯

theorem Std.DTreeMap.Raw.getKey!_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited α] {f : (a : α) → β a → Bool} {k : α} (h : t.WF) : (filter f t).getKey! k = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (t.get x ⋯)).get!

theorem Std.DTreeMap.Raw.getKey!_filter_key {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [Inhabited α] {f : α → Bool} {k : α} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).getKey! k = (Option.filter f (t.getKey? k)).get!

theorem Std.DTreeMap.Raw.getKeyD_filter {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → Bool} {k fallback : α} (h : t.WF) : (filter f t).getKeyD k fallback = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (t.get x ⋯)).getD fallback

theorem Std.DTreeMap.Raw.getKeyD_filter_key {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} [TransCmp cmp] {f : α → Bool} {k fallback : α} (h : t.WF) : (filter (fun (k : α) (x : β k) => f k) t).getKeyD k fallback = (Option.filter f (t.getKey? k)).getD fallback

theorem Std.DTreeMap.Raw.Const.isEmpty_filter_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).isEmpty = true ↔ ∀ (k : α) (h : k ∈ t), f (t.getKey k h) (get t k h) = false

theorem Std.DTreeMap.Raw.Const.isEmpty_filter_eq_false_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).isEmpty = false ↔ ∃ (k : α), ∃ (h : k ∈ t), f (t.getKey k h) (get t k h) = true

theorem Std.DTreeMap.Raw.Const.mem_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k : α} (h : t.WF) : k ∈ filter f t ↔ ∃ (h' : k ∈ t), f (t.getKey k h') (get t k h') = true

theorem Std.DTreeMap.Raw.Const.size_filter_le_size {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).size ≤ t.size

theorem Std.DTreeMap.Raw.Const.size_filter_eq_size_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).size = t.size ↔ ∀ (a : α) (h : a ∈ t), f (t.getKey a h) (get t a h) = true

theorem Std.DTreeMap.Raw.Const.filter_equiv_self_iff {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).Equiv t ↔ ∀ (a : α) (h : a ∈ t), f (t.getKey a h) (get t a h) = true

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k : α} (h : t.WF) : get? (filter f t) k = (get? t k).pfilter fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x

theorem Std.DTreeMap.Raw.Const.get?_filter' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → Bool} {k : α} (h : t.WF) : get? (filter f t) k = Option.filter (f k) (get? t k)

Simpler variant of get?_filter when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.get?_filter_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get? (filter f t) k = Option.filter (fun (x : β) => f k' x) (get? t k)

@[simp]

theorem Std.DTreeMap.Raw.Const.get_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k : α} {h' : k ∈ filter f t} (h : t.WF) : get (filter f t) k h' = get t k ⋯

theorem Std.DTreeMap.Raw.Const.get!_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] {f : α → β → Bool} {k : α} (h : t.WF) : get! (filter f t) k = ((get? t k).pfilter fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x).get!

theorem Std.DTreeMap.Raw.Const.get!_filter' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited β] {f : α → β → Bool} {k : α} (h : t.WF) : get! (filter f t) k = (Option.filter (f k) (get? t k)).get!

Simpler variant of get!_filter when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.get!_filter_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited β] {f : α → β → Bool} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get! (filter f t) k = (Option.filter (fun (x : β) => f k' x) (get? t k)).get!

theorem Std.DTreeMap.Raw.Const.getD_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k : α} {fallback : β} (h : t.WF) : getD (filter f t) k fallback = ((get? t k).pfilter fun (x : β) (h' : get? t k = some x) => f (t.getKey k ⋯) x).getD fallback

theorem Std.DTreeMap.Raw.Const.getD_filter' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → Bool} {k : α} {fallback : β} (h : t.WF) : getD (filter f t) k fallback = (Option.filter (f k) (get? t k)).getD fallback

Simpler variant of getD_filter when LawfulEqCmp is available.

theorem Std.DTreeMap.Raw.Const.getD_filter_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k k' : α} {fallback : β} (h : t.WF) : t.getKey? k = some k' → getD (filter f t) k fallback = (Option.filter (fun (x : β) => f k' x) (get? t k)).getD fallback

theorem Std.DTreeMap.Raw.Const.toList_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} {f : α → β → Bool} (h : t.WF) : toList (filter f t) = List.filter (fun (p : α × β) => f p.fst p.snd) (toList t)

theorem Std.DTreeMap.Raw.Const.keys_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} (h : t.WF) : (filter f t).keys = (List.filter (fun (x : { x : α // x ∈ t.keys }) => match x with | ⟨x, h'⟩ => f x (get t x ⋯)) t.keys.attach).unattach

theorem Std.DTreeMap.Raw.Const.getKey?_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k : α} (h : t.WF) : (filter f t).getKey? k = (t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (get t x ⋯)

theorem Std.DTreeMap.Raw.Const.getKey!_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited α] {f : α → β → Bool} {k : α} (h : t.WF) : (filter f t).getKey! k = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (get t x ⋯)).get!

theorem Std.DTreeMap.Raw.Const.getKeyD_filter {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → Bool} {k fallback : α} (h : t.WF) : (filter f t).getKeyD k fallback = ((t.getKey? k).pfilter fun (x : α) (h' : t.getKey? k = some x) => f x (get t x ⋯)).getD fallback

theorem Std.DTreeMap.Raw.map_id_equiv {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} : (map (fun (x : α) (v : β x) => v) t).Equiv t

theorem Std.DTreeMap.Raw.map_map_equiv {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} {δ : α → Type w'} {f : (a : α) → β a → γ a} {g : (a : α) → γ a → δ a} : (map g (map f t)).Equiv (map (fun (k : α) (v : β k) => g k (f k v)) t)

theorem Std.DTreeMap.Raw.toList_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} {f : (a : α) → β a → γ a} : (map f t).toList = List.map (fun (p : (a : α) × β a) => ⟨p.fst, f p.fst p.snd⟩) t.toList

theorem Std.DTreeMap.Raw.keys_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} {f : (a : α) → β a → γ a} : (map f t).keys = t.keys

theorem Std.DTreeMap.Raw.filterMap_equiv_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} (h : t.WF) : (filterMap (fun (k : α) (v : β k) => some (f k v)) t).Equiv (map f t)

@[simp]

theorem Std.DTreeMap.Raw.isEmpty_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} : (map f t).isEmpty = t.isEmpty

theorem Std.DTreeMap.Raw.contains_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : (map f t).contains k = t.contains k

theorem Std.DTreeMap.Raw.contains_of_contains_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : (map f t).contains k = true → t.contains k = true

@[simp]

theorem Std.DTreeMap.Raw.mem_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : k ∈ map f t ↔ k ∈ t

theorem Std.DTreeMap.Raw.mem_of_mem_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : k ∈ map f t → k ∈ t

@[simp]

theorem Std.DTreeMap.Raw.size_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} : (map f t).size = t.size

@[simp]

theorem Std.DTreeMap.Raw.get?_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : (map f t).get? k = Option.map (f k) (t.get? k)

@[simp]

theorem Std.DTreeMap.Raw.get_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → γ a} {k : α} {h' : k ∈ map f t} (h : t.WF) : (map f t).get k h' = f k (t.get k ⋯)

theorem Std.DTreeMap.Raw.get!_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → γ a} {k : α} [Inhabited (γ k)] (h : t.WF) : (map f t).get! k = (Option.map (f k) (t.get? k)).get!

theorem Std.DTreeMap.Raw.getD_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] [LawfulEqCmp cmp] {f : (a : α) → β a → γ a} {k : α} {fallback : γ k} (h : t.WF) : (map f t).getD k fallback = (Option.map (f k) (t.get? k)).getD fallback

@[simp]

theorem Std.DTreeMap.Raw.getKey?_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : (map f t).getKey? k = t.getKey? k

@[simp]

theorem Std.DTreeMap.Raw.getKey_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k : α} {h' : k ∈ map f t} (h : t.WF) : (map f t).getKey k h' = t.getKey k ⋯

@[simp]

theorem Std.DTreeMap.Raw.getKey!_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] [Inhabited α] {f : (a : α) → β a → γ a} {k : α} (h : t.WF) : (map f t).getKey! k = t.getKey! k

@[simp]

theorem Std.DTreeMap.Raw.getKeyD_map {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Raw α β cmp} {γ : α → Type w} [TransCmp cmp] {f : (a : α) → β a → γ a} {k fallback : α} (h : t.WF) : (map f t).getKeyD k fallback = t.getKeyD k fallback

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_map' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → γ} {k : α} (h : t.WF) : get? (map f t) k = Option.pmap (fun (v : β) (h' : k ∈ t) => f (t.getKey k h') v) (get? t k) ⋯

Variant of get?_map that holds without LawfulEqCmp.

@[simp]

theorem Std.DTreeMap.Raw.Const.get?_map {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → γ} {k : α} (h : t.WF) : get? (map f t) k = Option.map (f k) (get? t k)

theorem Std.DTreeMap.Raw.Const.get?_map_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → γ} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get? (map f t) k = Option.map (f k') (get? t k)

@[simp]

theorem Std.DTreeMap.Raw.Const.get_map' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → γ} {k : α} {h' : k ∈ map f t} (h : t.WF) : get (map f t) k h' = f (t.getKey k ⋯) (get t k ⋯)

Variant of get_map that holds without LawfulEqCmp.

@[simp]

theorem Std.DTreeMap.Raw.Const.get_map {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → γ} {k : α} (h : t.WF) {h' : k ∈ map f t} : get (map f t) k h' = f k (get t k ⋯)

theorem Std.DTreeMap.Raw.Const.get!_map' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited γ] {f : α → β → γ} {k : α} (h : t.WF) : get! (map f t) k = (Option.pmap (fun (v : β) (h : k ∈ t) => f (t.getKey k h) v) (get? t k) ⋯).get!

Variant of get!_map that holds without LawfulEqCmp.

theorem Std.DTreeMap.Raw.Const.get!_map {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] [Inhabited γ] {f : α → β → γ} {k : α} (h : t.WF) : get! (map f t) k = (Option.map (f k) (get? t k)).get!

theorem Std.DTreeMap.Raw.Const.get!_map_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [Inhabited γ] {f : α → β → γ} {k k' : α} (h : t.WF) : t.getKey? k = some k' → get! (map f t) k = (Option.map (f k') (get? t k)).get!

theorem Std.DTreeMap.Raw.Const.getD_map' {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → γ} {k : α} {fallback : γ} (h : t.WF) : getD (map f t) k fallback = (Option.pmap (fun (v : β) (h : k ∈ t) => f (t.getKey k h) v) (get? t k) ⋯).getD fallback

Variant of getD_map that holds without LawfulEqCmp.

theorem Std.DTreeMap.Raw.Const.getD_map {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] [LawfulEqCmp cmp] {f : α → β → γ} {k : α} {fallback : γ} (h : t.WF) : getD (map f t) k fallback = (Option.map (f k) (get? t k)).getD fallback

theorem Std.DTreeMap.Raw.Const.getD_map_of_getKey?_eq_some {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} [TransCmp cmp] {f : α → β → γ} {k k' : α} {fallback : γ} (h : t.WF) : t.getKey? k = some k' → getD (map f t) k fallback = (Option.map (f k') (get? t k)).getD fallback

theorem Std.DTreeMap.Raw.Const.toList_map {α : Type u} {cmp : α → α → Ordering} {β : Type v} {γ : Type w} {t : Raw α (fun (x : α) => β) cmp} {f : α → β → γ} : toList (map f t) = List.map (fun (p : α × β) => (p.fst, f p.fst p.snd)) (toList t)