Dependent hash map lemmas

This file contains lemmas about Std.Data.DHashMap.Raw. Most of the lemmas require EquivBEq α and LawfulHashable α for the key type α. The easiest way to obtain these instances is to provide an instance of LawfulBEq α.

def Std.DHashMap.Internal.Raw.tacticSimp_to_rawUsing_ : Lean.ParserDescr

Internal implementation detail of the hash map

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Std.DHashMap.Raw.size_empty {α : Type u} {β : α → Type v} {c : Nat} : (empty c).size = 0

@[simp]

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

theorem Std.DHashMap.Raw.isEmpty_eq_size_eq_zero {α : Type u} {β : α → Type v} {m : Raw α β} : m.isEmpty = (m.size == 0)

@[simp]

theorem Std.DHashMap.Raw.isEmpty_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {c : Nat} : (empty c).isEmpty = true

@[simp]

theorem Std.DHashMap.Raw.isEmpty_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] : ∅.isEmpty = true

@[simp]

theorem Std.DHashMap.Raw.isEmpty_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).isEmpty = false

theorem Std.DHashMap.Raw.mem_iff_contains {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} {a : α} : a ∈ m ↔ m.contains a = true

theorem Std.DHashMap.Raw.contains_congr {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a b : α} (hab : (a == b) = true) : m.contains a = m.contains b

theorem Std.DHashMap.Raw.mem_congr {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a b : α} (hab : (a == b) = true) : a ∈ m ↔ b ∈ m

@[simp]

theorem Std.DHashMap.Raw.contains_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} {c : Nat} : (empty c).contains a = false

@[simp]

theorem Std.DHashMap.Raw.not_mem_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} {c : Nat} : ¬a ∈ empty c

@[simp]

theorem Std.DHashMap.Raw.contains_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} : ∅.contains a = false

@[simp]

theorem Std.DHashMap.Raw.not_mem_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} : ¬a ∈ ∅

theorem Std.DHashMap.Raw.contains_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.isEmpty = true → m.contains a = false

theorem Std.DHashMap.Raw.not_mem_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.isEmpty = true → ¬a ∈ m

theorem Std.DHashMap.Raw.isEmpty_eq_false_iff_exists_contains_eq_true {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.isEmpty = false ↔ ∃ (a : α), m.contains a = true

theorem Std.DHashMap.Raw.isEmpty_eq_false_iff_exists_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.isEmpty = false ↔ ∃ (a : α), a ∈ m

theorem Std.DHashMap.Raw.isEmpty_iff_forall_contains {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.isEmpty = true ↔ ∀ (a : α), m.contains a = false

theorem Std.DHashMap.Raw.isEmpty_iff_forall_not_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.isEmpty = true ↔ ∀ (a : α), ¬a ∈ m

@[simp]

theorem Std.DHashMap.Raw.insert_eq_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] {p : (a : α) × β a} : Insert.insert p m = m.insert p.fst p.snd

@[simp]

theorem Std.DHashMap.Raw.singleton_eq_insert {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {p : (a : α) × β a} : {p} = ∅.insert p.fst p.snd

@[simp]

theorem Std.DHashMap.Raw.contains_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a k : α} {v : β k} : (m.insert k v).contains a = (k == a || m.contains a)

@[simp]

theorem Std.DHashMap.Raw.mem_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : a ∈ m.insert k v ↔ (k == a) = true ∨ a ∈ m

theorem Std.DHashMap.Raw.contains_of_contains_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a k : α} {v : β k} : (m.insert k v).contains a = true → (k == a) = false → m.contains a = true

theorem Std.DHashMap.Raw.mem_of_mem_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : a ∈ m.insert k v → (k == a) = false → a ∈ m

@[simp]

theorem Std.DHashMap.Raw.contains_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).contains k = true

@[simp]

theorem Std.DHashMap.Raw.mem_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : k ∈ m.insert k v

theorem Std.DHashMap.Raw.size_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).size = if k ∈ m then m.size else m.size + 1

theorem Std.DHashMap.Raw.size_le_size_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : m.size ≤ (m.insert k v).size

theorem Std.DHashMap.Raw.size_insert_le {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).size ≤ m.size + 1

@[simp]

theorem Std.DHashMap.Raw.erase_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {k : α} {c : Nat} : (empty c).erase k = empty c

@[simp]

theorem Std.DHashMap.Raw.erase_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {k : α} : ∅.erase k = ∅

@[simp]

theorem Std.DHashMap.Raw.isEmpty_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : (m.erase k).isEmpty = (m.isEmpty || m.size == 1 && m.contains k)

@[simp]

theorem Std.DHashMap.Raw.contains_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : (m.erase k).contains a = (!k == a && m.contains a)

@[simp]

theorem Std.DHashMap.Raw.mem_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : a ∈ m.erase k ↔ (k == a) = false ∧ a ∈ m

theorem Std.DHashMap.Raw.contains_of_contains_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : (m.erase k).contains a = true → m.contains a = true

theorem Std.DHashMap.Raw.mem_of_mem_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : a ∈ m.erase k → a ∈ m

theorem Std.DHashMap.Raw.size_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : (m.erase k).size = if k ∈ m then m.size - 1 else m.size

theorem Std.DHashMap.Raw.size_erase_le {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : (m.erase k).size ≤ m.size

theorem Std.DHashMap.Raw.size_le_size_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : m.size ≤ (m.erase k).size + 1

@[simp]

theorem Std.DHashMap.Raw.containsThenInsert_fst {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] (h : m.WF) {k : α} {v : β k} : (m.containsThenInsert k v).fst = m.contains k

@[simp]

theorem Std.DHashMap.Raw.containsThenInsert_snd {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] (h : m.WF) {k : α} {v : β k} : (m.containsThenInsert k v).snd = m.insert k v

@[simp]

theorem Std.DHashMap.Raw.containsThenInsertIfNew_fst {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] (h : m.WF) {k : α} {v : β k} : (m.containsThenInsertIfNew k v).fst = m.contains k

@[simp]

theorem Std.DHashMap.Raw.containsThenInsertIfNew_snd {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] (h : m.WF) {k : α} {v : β k} : (m.containsThenInsertIfNew k v).snd = m.insertIfNew k v

@[simp]

theorem Std.DHashMap.Raw.get?_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} {c : Nat} : (empty c).get? a = none

@[simp]

theorem Std.DHashMap.Raw.get?_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} : ∅.get? a = none

theorem Std.DHashMap.Raw.get?_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} : m.isEmpty = true → m.get? a = none

theorem Std.DHashMap.Raw.get?_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a k : α} {v : β k} : (m.insert k v).get? a = if h : (k == a) = true then some (cast ⋯ v) else m.get? a

@[simp]

theorem Std.DHashMap.Raw.get?_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).get? k = some v

theorem Std.DHashMap.Raw.contains_eq_isSome_get? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} : m.contains a = (m.get? a).isSome

theorem Std.DHashMap.Raw.get?_eq_none_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} : m.contains a = false → m.get? a = none

theorem Std.DHashMap.Raw.get?_eq_none {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} : ¬a ∈ m → m.get? a = none

theorem Std.DHashMap.Raw.get?_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} : (m.erase k).get? a = if (k == a) = true then none else m.get? a

@[simp]

theorem Std.DHashMap.Raw.get?_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} : (m.erase k).get? k = none

@[simp]

theorem Std.DHashMap.Raw.Const.get?_empty {α : Type u} [BEq α] [Hashable α] {β : Type v} {a : α} {c : Nat} : get? (empty c) a = none

@[simp]

theorem Std.DHashMap.Raw.Const.get?_emptyc {α : Type u} [BEq α] [Hashable α] {β : Type v} {a : α} : get? ∅ a = none

theorem Std.DHashMap.Raw.Const.get?_of_isEmpty {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.isEmpty = true → get? m a = none

theorem Std.DHashMap.Raw.Const.get?_insert {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β} : get? (m.insert k v) a = if (k == a) = true then some v else get? m a

@[simp]

theorem Std.DHashMap.Raw.Const.get?_insert_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β} : get? (m.insert k v) k = some v

theorem Std.DHashMap.Raw.Const.contains_eq_isSome_get? {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.contains a = (get? m a).isSome

theorem Std.DHashMap.Raw.Const.get?_eq_none_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.contains a = false → get? m a = none

theorem Std.DHashMap.Raw.Const.get?_eq_none {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : ¬a ∈ m → get? m a = none

theorem Std.DHashMap.Raw.Const.get?_erase {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : get? (m.erase k) a = if (k == a) = true then none else get? m a

@[simp]

theorem Std.DHashMap.Raw.Const.get?_erase_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : get? (m.erase k) k = none

theorem Std.DHashMap.Raw.Const.get?_eq_get? {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] (h : m.WF) {a : α} : get? m a = m.get? a

theorem Std.DHashMap.Raw.Const.get?_congr {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a b : α} (hab : (a == b) = true) : get? m a = get? m b

theorem Std.DHashMap.Raw.get_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {v : β k} {h₁ : a ∈ m.insert k v} : (m.insert k v).get a h₁ = if h₂ : (k == a) = true then cast ⋯ v else m.get a ⋯

@[simp]

theorem Std.DHashMap.Raw.get_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).get k ⋯ = v

@[simp]

theorem Std.DHashMap.Raw.get_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {h' : k ∈ m.erase a} : (m.erase a).get k h' = m.get k ⋯

theorem Std.DHashMap.Raw.get?_eq_some_get {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {h✝ : a ∈ m} : m.get? a = some (m.get a h✝)

theorem Std.DHashMap.Raw.Const.get_insert {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β} {h₁ : a ∈ m.insert k v} : get (m.insert k v) a h₁ = if h₂ : (k == a) = true then v else get m a ⋯

@[simp]

theorem Std.DHashMap.Raw.Const.get_insert_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β} : get (m.insert k v) k ⋯ = v

@[simp]

theorem Std.DHashMap.Raw.Const.get_erase {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {h' : a ∈ m.erase k} : get (m.erase k) a h' = get m a ⋯

theorem Std.DHashMap.Raw.Const.get?_eq_some_get {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {h✝ : a ∈ m} : get? m a = some (get m a h✝)

theorem Std.DHashMap.Raw.Const.get_eq_get {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] (h : m.WF) {a : α} {h✝ : a ∈ m} : get m a h✝ = m.get a h✝

theorem Std.DHashMap.Raw.Const.get_congr {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] (h : m.WF) {a b : α} (hab : (a == b) = true) {h' : a ∈ m} : get m a h' = get m b ⋯

@[simp]

theorem Std.DHashMap.Raw.get!_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} [Inhabited (β a)] {c : Nat} : (empty c).get! a = default

@[simp]

theorem Std.DHashMap.Raw.get!_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} [Inhabited (β a)] : ∅.get! a = default

theorem Std.DHashMap.Raw.get!_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : m.isEmpty = true → m.get! a = default

theorem Std.DHashMap.Raw.get!_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} [Inhabited (β a)] {v : β k} : (m.insert k v).get! a = if h : (k == a) = true then cast ⋯ v else m.get! a

@[simp]

theorem Std.DHashMap.Raw.get!_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} [Inhabited (β k)] {v : β k} : (m.insert k v).get! k = v

theorem Std.DHashMap.Raw.get!_eq_default_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : m.contains a = false → m.get! a = default

theorem Std.DHashMap.Raw.get!_eq_default {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : ¬a ∈ m → m.get! a = default

theorem Std.DHashMap.Raw.get!_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} [Inhabited (β a)] : (m.erase k).get! a = if (k == a) = true then default else m.get! a

@[simp]

theorem Std.DHashMap.Raw.get!_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} [Inhabited (β k)] : (m.erase k).get! k = default

theorem Std.DHashMap.Raw.get?_eq_some_get!_of_contains {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : m.contains a = true → m.get? a = some (m.get! a)

theorem Std.DHashMap.Raw.get?_eq_some_get! {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : a ∈ m → m.get? a = some (m.get! a)

theorem Std.DHashMap.Raw.get!_eq_get!_get? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : m.get! a = (m.get? a).get!

theorem Std.DHashMap.Raw.get_eq_get! {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] {h✝ : a ∈ m} : m.get a h✝ = m.get! a

@[simp]

theorem Std.DHashMap.Raw.Const.get!_empty {α : Type u} [BEq α] [Hashable α] {β : Type v} [Inhabited β] {a : α} {c : Nat} : get! (empty c) a = default

@[simp]

theorem Std.DHashMap.Raw.Const.get!_emptyc {α : Type u} [BEq α] [Hashable α] {β : Type v} [Inhabited β] {a : α} : get! ∅ a = default

theorem Std.DHashMap.Raw.Const.get!_of_isEmpty {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : m.isEmpty = true → get! m a = default

theorem Std.DHashMap.Raw.Const.get!_insert {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {k a : α} {v : β} : get! (m.insert k v) a = if (k == a) = true then v else get! m a

@[simp]

theorem Std.DHashMap.Raw.Const.get!_insert_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {k : α} {v : β} : get! (m.insert k v) k = v

theorem Std.DHashMap.Raw.Const.get!_eq_default_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : m.contains a = false → get! m a = default

theorem Std.DHashMap.Raw.Const.get!_eq_default {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : ¬a ∈ m → get! m a = default

theorem Std.DHashMap.Raw.Const.get!_erase {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {k a : α} : get! (m.erase k) a = if (k == a) = true then default else get! m a

@[simp]

theorem Std.DHashMap.Raw.Const.get!_erase_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {k : α} : get! (m.erase k) k = default

theorem Std.DHashMap.Raw.Const.get?_eq_some_get!_of_contains {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : m.contains a = true → get? m a = some (get! m a)

theorem Std.DHashMap.Raw.Const.get?_eq_some_get! {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : a ∈ m → get? m a = some (get! m a)

theorem Std.DHashMap.Raw.Const.get!_eq_get!_get? {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : get! m a = (get? m a).get!

theorem Std.DHashMap.Raw.Const.get_eq_get! {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} {h✝ : a ∈ m} : get m a h✝ = get! m a

theorem Std.DHashMap.Raw.Const.get!_eq_get! {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] [Inhabited β] (h : m.WF) {a : α} : get! m a = m.get! a

theorem Std.DHashMap.Raw.Const.get!_congr {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a b : α} (hab : (a == b) = true) : get! m a = get! m b

@[simp]

theorem Std.DHashMap.Raw.getD_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} {fallback : β a} {c : Nat} : (empty c).getD a fallback = fallback

@[simp]

theorem Std.DHashMap.Raw.getD_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {a : α} {fallback : β a} : ∅.getD a fallback = fallback

theorem Std.DHashMap.Raw.getD_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : m.isEmpty = true → m.getD a fallback = fallback

theorem Std.DHashMap.Raw.getD_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {fallback : β a} {v : β k} : (m.insert k v).getD a fallback = if h : (k == a) = true then cast ⋯ v else m.getD a fallback

@[simp]

theorem Std.DHashMap.Raw.getD_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback b : β a} : (m.insert a b).getD a fallback = b

theorem Std.DHashMap.Raw.getD_eq_fallback_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : m.contains a = false → m.getD a fallback = fallback

theorem Std.DHashMap.Raw.getD_eq_fallback {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : ¬a ∈ m → m.getD a fallback = fallback

theorem Std.DHashMap.Raw.getD_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {fallback : β a} : (m.erase k).getD a fallback = if (k == a) = true then fallback else m.getD a fallback

@[simp]

theorem Std.DHashMap.Raw.getD_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} {fallback : β k} : (m.erase k).getD k fallback = fallback

theorem Std.DHashMap.Raw.get?_eq_some_getD_of_contains {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : m.contains a = true → m.get? a = some (m.getD a fallback)

theorem Std.DHashMap.Raw.get?_eq_some_getD {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : a ∈ m → m.get? a = some (m.getD a fallback)

theorem Std.DHashMap.Raw.getD_eq_getD_get? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} : m.getD a fallback = (m.get? a).getD fallback

theorem Std.DHashMap.Raw.get_eq_getD {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} {fallback : β a} {h✝ : a ∈ m} : m.get a h✝ = m.getD a fallback

theorem Std.DHashMap.Raw.get!_eq_getD_default {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {a : α} [Inhabited (β a)] : m.get! a = m.getD a default

@[simp]

theorem Std.DHashMap.Raw.Const.getD_empty {α : Type u} [BEq α] [Hashable α] {β : Type v} {a : α} {fallback : β} {c : Nat} : getD (empty c) a fallback = fallback

@[simp]

theorem Std.DHashMap.Raw.Const.getD_emptyc {α : Type u} [BEq α] [Hashable α] {β : Type v} {a : α} {fallback : β} : getD ∅ a fallback = fallback

theorem Std.DHashMap.Raw.Const.getD_of_isEmpty {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : m.isEmpty = true → getD m a fallback = fallback

theorem Std.DHashMap.Raw.Const.getD_insert {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {fallback v : β} : getD (m.insert k v) a fallback = if (k == a) = true then v else getD m a fallback

@[simp]

theorem Std.DHashMap.Raw.Const.getD_insert_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {fallback v : β} : getD (m.insert k v) k fallback = v

theorem Std.DHashMap.Raw.Const.getD_eq_fallback_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : m.contains a = false → getD m a fallback = fallback

theorem Std.DHashMap.Raw.Const.getD_eq_fallback {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : ¬a ∈ m → getD m a fallback = fallback

theorem Std.DHashMap.Raw.Const.getD_erase {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {fallback : β} : getD (m.erase k) a fallback = if (k == a) = true then fallback else getD m a fallback

@[simp]

theorem Std.DHashMap.Raw.Const.getD_erase_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {fallback : β} : getD (m.erase k) k fallback = fallback

theorem Std.DHashMap.Raw.Const.get?_eq_some_getD_of_contains {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : m.contains a = true → get? m a = some (getD m a fallback)

theorem Std.DHashMap.Raw.Const.get?_eq_some_getD {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : a ∈ m → get? m a = some (getD m a fallback)

theorem Std.DHashMap.Raw.Const.getD_eq_getD_get? {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} : getD m a fallback = (get? m a).getD fallback

theorem Std.DHashMap.Raw.Const.get_eq_getD {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {fallback : β} {h✝ : a ∈ m} : get m a h✝ = getD m a fallback

theorem Std.DHashMap.Raw.Const.get!_eq_getD_default {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {a : α} : get! m a = getD m a default

theorem Std.DHashMap.Raw.Const.getD_eq_getD {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] (h : m.WF) {a : α} {fallback : β} : getD m a fallback = m.getD a fallback

theorem Std.DHashMap.Raw.Const.getD_congr {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {a b : α} {fallback : β} (hab : (a == b) = true) : getD m a fallback = getD m b fallback

@[simp]

theorem Std.DHashMap.Raw.getKey?_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} {c : Nat} : (empty c).getKey? a = none

@[simp]

theorem Std.DHashMap.Raw.getKey?_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a : α} : ∅.getKey? a = none

theorem Std.DHashMap.Raw.getKey?_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.isEmpty = true → m.getKey? a = none

theorem Std.DHashMap.Raw.getKey?_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a k : α} {v : β k} : (m.insert k v).getKey? a = if (k == a) = true then some k else m.getKey? a

@[simp]

theorem Std.DHashMap.Raw.getKey?_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).getKey? k = some k

theorem Std.DHashMap.Raw.contains_eq_isSome_getKey? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.contains a = (m.getKey? a).isSome

theorem Std.DHashMap.Raw.getKey?_eq_none_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : m.contains a = false → m.getKey? a = none

theorem Std.DHashMap.Raw.getKey?_eq_none {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} : ¬a ∈ m → m.getKey? a = none

theorem Std.DHashMap.Raw.getKey?_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} : (m.erase k).getKey? a = if (k == a) = true then none else m.getKey? a

@[simp]

theorem Std.DHashMap.Raw.getKey?_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : (m.erase k).getKey? k = none

theorem Std.DHashMap.Raw.getKey_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} {h₁ : a ∈ m.insert k v} : (m.insert k v).getKey a h₁ = if h₂ : (k == a) = true then k else m.getKey a ⋯

@[simp]

theorem Std.DHashMap.Raw.getKey_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).getKey k ⋯ = k

@[simp]

theorem Std.DHashMap.Raw.getKey_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {h' : k ∈ m.erase a} : (m.erase a).getKey k h' = m.getKey k ⋯

theorem Std.DHashMap.Raw.getKey?_eq_some_getKey {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a : α} {h✝ : a ∈ m} : m.getKey? a = some (m.getKey a h✝)

@[simp]

theorem Std.DHashMap.Raw.getKey!_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [Inhabited α] {a : α} {c : Nat} : (empty c).getKey! a = default

@[simp]

theorem Std.DHashMap.Raw.getKey!_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [Inhabited α] {a : α} : ∅.getKey! a = default

theorem Std.DHashMap.Raw.getKey!_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : m.isEmpty = true → m.getKey! a = default

theorem Std.DHashMap.Raw.getKey!_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {k a : α} {v : β k} : (m.insert k v).getKey! a = if (k == a) = true then k else m.getKey! a

@[simp]

theorem Std.DHashMap.Raw.getKey!_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {k : α} {v : β k} : (m.insert k v).getKey! k = k

theorem Std.DHashMap.Raw.getKey!_eq_default_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : m.contains a = false → m.getKey! a = default

theorem Std.DHashMap.Raw.getKey!_eq_default {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : ¬a ∈ m → m.getKey! a = default

theorem Std.DHashMap.Raw.getKey!_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {k a : α} : (m.erase k).getKey! a = if (k == a) = true then default else m.getKey! a

@[simp]

theorem Std.DHashMap.Raw.getKey!_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {k : α} : (m.erase k).getKey! k = default

theorem Std.DHashMap.Raw.getKey?_eq_some_getKey!_of_contains {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : m.contains a = true → m.getKey? a = some (m.getKey! a)

theorem Std.DHashMap.Raw.getKey?_eq_some_getKey! {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : a ∈ m → m.getKey? a = some (m.getKey! a)

theorem Std.DHashMap.Raw.getKey!_eq_get!_getKey? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : m.getKey! a = (m.getKey? a).get!

theorem Std.DHashMap.Raw.getKey_eq_getKey! {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} {h✝ : a ∈ m} : m.getKey a h✝ = m.getKey! a

@[simp]

theorem Std.DHashMap.Raw.getKeyD_empty {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a fallback : α} {c : Nat} : (empty c).getKeyD a fallback = fallback

@[simp]

theorem Std.DHashMap.Raw.getKeyD_emptyc {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {a fallback : α} : ∅.getKeyD a fallback = fallback

theorem Std.DHashMap.Raw.getKeyD_of_isEmpty {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : m.isEmpty = true → m.getKeyD a fallback = fallback

theorem Std.DHashMap.Raw.getKeyD_insert {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a fallback : α} {v : β k} : (m.insert k v).getKeyD a fallback = if (k == a) = true then k else m.getKeyD a fallback

@[simp]

theorem Std.DHashMap.Raw.getKeyD_insert_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} {b : β a} : (m.insert a b).getKeyD a fallback = a

theorem Std.DHashMap.Raw.getKeyD_eq_fallback_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : m.contains a = false → m.getKeyD a fallback = fallback

theorem Std.DHashMap.Raw.getKeyD_eq_fallback {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : ¬a ∈ m → m.getKeyD a fallback = fallback

theorem Std.DHashMap.Raw.getKeyD_erase {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a fallback : α} : (m.erase k).getKeyD a fallback = if (k == a) = true then fallback else m.getKeyD a fallback

@[simp]

theorem Std.DHashMap.Raw.getKeyD_erase_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k fallback : α} : (m.erase k).getKeyD k fallback = fallback

theorem Std.DHashMap.Raw.getKey?_eq_some_getKeyD_of_contains {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : m.contains a = true → m.getKey? a = some (m.getKeyD a fallback)

theorem Std.DHashMap.Raw.getKey?_eq_some_getKeyD {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : a ∈ m → m.getKey? a = some (m.getKeyD a fallback)

theorem Std.DHashMap.Raw.getKeyD_eq_getD_getKey? {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} : m.getKeyD a fallback = (m.getKey? a).getD fallback

theorem Std.DHashMap.Raw.getKey_eq_getKeyD {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {a fallback : α} {h✝ : a ∈ m} : m.getKey a h✝ = m.getKeyD a fallback

theorem Std.DHashMap.Raw.getKey!_eq_getKeyD_default {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {a : α} : m.getKey! a = m.getKeyD a default

@[simp]

theorem Std.DHashMap.Raw.isEmpty_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insertIfNew k v).isEmpty = false

@[simp]

theorem Std.DHashMap.Raw.contains_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).contains a = (k == a || m.contains a)

@[simp]

theorem Std.DHashMap.Raw.mem_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : a ∈ m.insertIfNew k v ↔ (k == a) = true ∨ a ∈ m

theorem Std.DHashMap.Raw.contains_insertIfNew_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insertIfNew k v).contains k = true

theorem Std.DHashMap.Raw.mem_insertIfNew_self {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : k ∈ m.insertIfNew k v

theorem Std.DHashMap.Raw.contains_of_contains_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).contains a = true → (k == a) = false → m.contains a = true

theorem Std.DHashMap.Raw.mem_of_mem_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : a ∈ m.insertIfNew k v → (k == a) = false → a ∈ m

theorem Std.DHashMap.Raw.contains_of_contains_insertIfNew' {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).contains a = true → ¬((k == a) = true ∧ m.contains k = false) → m.contains a = true

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

theorem Std.DHashMap.Raw.mem_of_mem_insertIfNew' {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : a ∈ m.insertIfNew k v → ¬((k == a) = true ∧ ¬k ∈ m) → a ∈ m

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

theorem Std.DHashMap.Raw.size_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insertIfNew k v).size = if k ∈ m then m.size else m.size + 1

theorem Std.DHashMap.Raw.size_le_size_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : m.size ≤ (m.insertIfNew k v).size

theorem Std.DHashMap.Raw.size_insertIfNew_le {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} {v : β k} : (m.insertIfNew k v).size ≤ m.size + 1

theorem Std.DHashMap.Raw.get?_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).get? a = if h : (k == a) = true ∧ ¬k ∈ m then some (cast ⋯ v) else m.get? a

theorem Std.DHashMap.Raw.get_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {v : β k} {h₁ : a ∈ m.insertIfNew k v} : (m.insertIfNew k v).get a h₁ = if h₂ : (k == a) = true ∧ ¬k ∈ m then cast ⋯ v else m.get a ⋯

theorem Std.DHashMap.Raw.get!_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} [Inhabited (β a)] {v : β k} : (m.insertIfNew k v).get! a = if h : (k == a) = true ∧ ¬k ∈ m then cast ⋯ v else m.get! a

theorem Std.DHashMap.Raw.getD_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k a : α} {fallback : β a} {v : β k} : (m.insertIfNew k v).getD a fallback = if h : (k == a) = true ∧ ¬k ∈ m then cast ⋯ v else m.getD a fallback

theorem Std.DHashMap.Raw.Const.get?_insertIfNew {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β} : get? (m.insertIfNew k v) a = if (k == a) = true ∧ ¬k ∈ m then some v else get? m a

theorem Std.DHashMap.Raw.Const.get_insertIfNew {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β} {h₁ : a ∈ m.insertIfNew k v} : get (m.insertIfNew k v) a h₁ = if h₂ : (k == a) = true ∧ ¬k ∈ m then v else get m a ⋯

theorem Std.DHashMap.Raw.Const.get!_insertIfNew {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {k a : α} {v : β} : get! (m.insertIfNew k v) a = if (k == a) = true ∧ ¬k ∈ m then v else get! m a

theorem Std.DHashMap.Raw.Const.getD_insertIfNew {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {fallback v : β} : getD (m.insertIfNew k v) a fallback = if (k == a) = true ∧ ¬k ∈ m then v else getD m a fallback

theorem Std.DHashMap.Raw.getKey?_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).getKey? a = if (k == a) = true ∧ ¬k ∈ m then some k else m.getKey? a

theorem Std.DHashMap.Raw.getKey_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a : α} {v : β k} {h₁ : a ∈ m.insertIfNew k v} : (m.insertIfNew k v).getKey a h₁ = if h₂ : (k == a) = true ∧ ¬k ∈ m then k else m.getKey a ⋯

theorem Std.DHashMap.Raw.getKey!_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {k a : α} {v : β k} : (m.insertIfNew k v).getKey! a = if (k == a) = true ∧ ¬k ∈ m then k else m.getKey! a

theorem Std.DHashMap.Raw.getKeyD_insertIfNew {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k a fallback : α} {v : β k} : (m.insertIfNew k v).getKeyD a fallback = if (k == a) = true ∧ ¬k ∈ m then k else m.getKeyD a fallback

@[simp]

theorem Std.DHashMap.Raw.getThenInsertIfNew?_fst {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} {v : β k} : (m.getThenInsertIfNew? k v).fst = m.get? k

@[simp]

theorem Std.DHashMap.Raw.getThenInsertIfNew?_snd {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {k : α} {v : β k} : (m.getThenInsertIfNew? k v).snd = m.insertIfNew k v

@[simp]

theorem Std.DHashMap.Raw.Const.getThenInsertIfNew?_fst {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} (h : m.WF) {k : α} {v : β} : (getThenInsertIfNew? m k v).fst = get? m k

@[simp]

theorem Std.DHashMap.Raw.Const.getThenInsertIfNew?_snd {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} (h : m.WF) {k : α} {v : β} : (getThenInsertIfNew? m k v).snd = m.insertIfNew k v

@[simp]

theorem Std.DHashMap.Raw.length_keys {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.keys.length = m.size

@[simp]

theorem Std.DHashMap.Raw.isEmpty_keys {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.keys.isEmpty = m.isEmpty

@[simp]

theorem Std.DHashMap.Raw.contains_keys {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {k : α} : m.keys.contains k = m.contains k

@[simp]

theorem Std.DHashMap.Raw.mem_keys {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] [LawfulHashable α] (h : m.WF) {k : α} : k ∈ m.keys ↔ k ∈ m

theorem Std.DHashMap.Raw.distinct_keys {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : List.Pairwise (fun (a b : α) => (a == b) = false) m.keys

@[simp]

theorem Std.DHashMap.Raw.insertMany_nil {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.insertMany [] = m

@[simp]

theorem Std.DHashMap.Raw.insertMany_list_singleton {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] {k : α} {v : β k} [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.insertMany [⟨k, v⟩] = m.insert k v

theorem Std.DHashMap.Raw.insertMany_cons {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] {l : List ((a : α) × β a)} {k : α} {v : β k} [EquivBEq α] [LawfulHashable α] (h : m.WF) : m.insertMany (⟨k, v⟩ :: l) = (m.insert k v).insertMany l

@[simp]

theorem Std.DHashMap.Raw.contains_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} : (m.insertMany l).contains k = (m.contains k || (List.map Sigma.fst l).contains k)

@[simp]

theorem Std.DHashMap.Raw.mem_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} : k ∈ m.insertMany l ↔ k ∈ m ∨ (List.map Sigma.fst l).contains k = true

theorem Std.DHashMap.Raw.mem_of_mem_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} : k ∈ m.insertMany l → (List.map Sigma.fst l).contains k = false → k ∈ m

theorem Std.DHashMap.Raw.get?_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).get? k = m.get? k

theorem Std.DHashMap.Raw.get?_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (m.insertMany l).get? k' = some (cast ⋯ v)

theorem Std.DHashMap.Raw.get_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) {h' : k ∈ m.insertMany l} : (m.insertMany l).get k h' = m.get k ⋯

theorem Std.DHashMap.Raw.get_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) {h' : k' ∈ m.insertMany l} : (m.insertMany l).get k' h' = cast ⋯ v

theorem Std.DHashMap.Raw.get!_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} [Inhabited (β k)] (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).get! k = m.get! k

theorem Std.DHashMap.Raw.get!_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} [Inhabited (β k')] (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (m.insertMany l).get! k' = cast ⋯ v

theorem Std.DHashMap.Raw.getD_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} {fallback : β k} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).getD k fallback = m.getD k fallback

theorem Std.DHashMap.Raw.getD_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [LawfulBEq α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} {fallback : β k'} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (m.insertMany l).getD k' fallback = cast ⋯ v

theorem Std.DHashMap.Raw.getKey?_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).getKey? k = m.getKey? k

theorem Std.DHashMap.Raw.getKey?_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (m.insertMany l).getKey? k' = some k

theorem Std.DHashMap.Raw.getKey_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) {h' : k ∈ m.insertMany l} : (m.insertMany l).getKey k h' = m.getKey k ⋯

theorem Std.DHashMap.Raw.getKey_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) {h' : k' ∈ m.insertMany l} : (m.insertMany l).getKey k' h' = k

theorem Std.DHashMap.Raw.getKey!_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).getKey! k = m.getKey! k

theorem Std.DHashMap.Raw.getKey!_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (m.insertMany l).getKey! k' = k

theorem Std.DHashMap.Raw.getKeyD_insertMany_list_of_contains_eq_false {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k fallback : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (m.insertMany l).getKeyD k fallback = m.getKeyD k fallback

theorem Std.DHashMap.Raw.getKeyD_insertMany_list_of_mem {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} {k k' fallback : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (m.insertMany l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.size_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) : (∀ (a : α), a ∈ m → (List.map Sigma.fst l).contains a = false) → (m.insertMany l).size = m.size + l.length

theorem Std.DHashMap.Raw.size_le_size_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} : m.size ≤ (m.insertMany l).size

theorem Std.DHashMap.Raw.size_insertMany_list_le {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} : (m.insertMany l).size ≤ m.size + l.length

@[simp]

theorem Std.DHashMap.Raw.isEmpty_insertMany_list {α : Type u} {β : α → Type v} {m : Raw α β} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List ((a : α) × β a)} : (m.insertMany l).isEmpty = (m.isEmpty && l.isEmpty)

@[simp]

theorem Std.DHashMap.Raw.Const.insertMany_nil {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} (h : m.WF) : insertMany m [] = m

@[simp]

theorem Std.DHashMap.Raw.Const.insertMany_list_singleton {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} (h : m.WF) {k : α} {v : β} : insertMany m [(k, v)] = m.insert k v

theorem Std.DHashMap.Raw.Const.insertMany_cons {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} (h : m.WF) {l : List (α × β)} {k : α} {v : β} : insertMany m ((k, v) :: l) = insertMany (m.insert k v) l

@[simp]

theorem Std.DHashMap.Raw.Const.contains_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} : (insertMany m l).contains k = (m.contains k || (List.map Prod.fst l).contains k)

@[simp]

theorem Std.DHashMap.Raw.Const.mem_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} : k ∈ insertMany m l ↔ k ∈ m ∨ (List.map Prod.fst l).contains k = true

theorem Std.DHashMap.Raw.Const.mem_of_mem_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} : k ∈ insertMany m l → (List.map Prod.fst l).contains k = false → k ∈ m

theorem Std.DHashMap.Raw.Const.getKey?_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany m l).getKey? k = m.getKey? k

theorem Std.DHashMap.Raw.Const.getKey?_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (insertMany m l).getKey? k' = some k

theorem Std.DHashMap.Raw.Const.getKey_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) {h' : k ∈ insertMany m l} : (insertMany m l).getKey k h' = m.getKey k ⋯

theorem Std.DHashMap.Raw.Const.getKey_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) {h' : k' ∈ insertMany m l} : (insertMany m l).getKey k' h' = k

theorem Std.DHashMap.Raw.Const.getKey!_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany m l).getKey! k = m.getKey! k

theorem Std.DHashMap.Raw.Const.getKey!_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (insertMany m l).getKey! k' = k

theorem Std.DHashMap.Raw.Const.getKeyD_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k fallback : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (insertMany m l).getKeyD k fallback = m.getKeyD k fallback

theorem Std.DHashMap.Raw.Const.getKeyD_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' fallback : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (insertMany m l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.Const.size_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) : (∀ (a : α), a ∈ m → (List.map Prod.fst l).contains a = false) → (insertMany m l).size = m.size + l.length

theorem Std.DHashMap.Raw.Const.size_le_size_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} : m.size ≤ (insertMany m l).size

theorem Std.DHashMap.Raw.Const.size_insertMany_list_le {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} : (insertMany m l).size ≤ m.size + l.length

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_insertMany_list {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} : (insertMany m l).isEmpty = (m.isEmpty && l.isEmpty)

theorem Std.DHashMap.Raw.Const.get?_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get? (insertMany m l) k = get? m k

theorem Std.DHashMap.Raw.Const.get?_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : get? (insertMany m l) k' = some v

theorem Std.DHashMap.Raw.Const.get_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) {h' : k ∈ insertMany m l} : get (insertMany m l) k h' = get m k ⋯

theorem Std.DHashMap.Raw.Const.get_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) {h' : k' ∈ insertMany m l} : get (insertMany m l) k' h' = v

theorem Std.DHashMap.Raw.Const.get!_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get! (insertMany m l) k = get! m k

theorem Std.DHashMap.Raw.Const.get!_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited β] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : get! (insertMany m l) k' = v

theorem Std.DHashMap.Raw.Const.getD_insertMany_list_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : getD (insertMany m l) k fallback = getD m k fallback

theorem Std.DHashMap.Raw.Const.getD_insertMany_list_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v fallback : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : getD (insertMany m l) k' fallback = v

@[simp]

theorem Std.DHashMap.Raw.Const.insertManyIfNewUnit_nil {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} (h : m.WF) : insertManyIfNewUnit m [] = m

@[simp]

theorem Std.DHashMap.Raw.Const.insertManyIfNewUnit_list_singleton {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} {k : α} (h : m.WF) : insertManyIfNewUnit m [k] = m.insertIfNew k ()

theorem Std.DHashMap.Raw.Const.insertManyIfNewUnit_cons {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} (h : m.WF) {l : List α} {k : α} : insertManyIfNewUnit m (k :: l) = insertManyIfNewUnit (m.insertIfNew k ()) l

@[simp]

theorem Std.DHashMap.Raw.Const.contains_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} : (insertManyIfNewUnit m l).contains k = (m.contains k || l.contains k)

@[simp]

theorem Std.DHashMap.Raw.Const.mem_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} : k ∈ insertManyIfNewUnit m l ↔ k ∈ m ∨ l.contains k = true

theorem Std.DHashMap.Raw.Const.mem_of_mem_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} (contains_eq_false : l.contains k = false) : k ∈ insertManyIfNewUnit m l → k ∈ m

theorem Std.DHashMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} : ¬k ∈ m → l.contains k = false → (insertManyIfNewUnit m l).getKey? k = none

theorem Std.DHashMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k k' : α} (k_beq : (k == k') = true) : ¬k ∈ m → List.Pairwise (fun (a b : α) => (a == b) = false) l → k ∈ l → (insertManyIfNewUnit m l).getKey? k' = some k

theorem Std.DHashMap.Raw.Const.getKey?_insertManyIfNewUnit_list_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} : k ∈ m → (insertManyIfNewUnit m l).getKey? k = m.getKey? k

theorem Std.DHashMap.Raw.Const.getKey_insertManyIfNewUnit_list_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} {h' : k ∈ insertManyIfNewUnit m l} (mem : k ∈ m) : (insertManyIfNewUnit m l).getKey k h' = m.getKey k mem

theorem Std.DHashMap.Raw.Const.getKey_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k k' : α} (k_beq : (k == k') = true) {h' : k' ∈ insertManyIfNewUnit m l} : ¬k ∈ m → List.Pairwise (fun (a b : α) => (a == b) = false) l → k ∈ l → (insertManyIfNewUnit m l).getKey k' h' = k

theorem Std.DHashMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List α} {k : α} : ¬k ∈ m → l.contains k = false → (insertManyIfNewUnit m l).getKey! k = default

theorem Std.DHashMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List α} {k k' : α} (k_beq : (k == k') = true) : ¬k ∈ m → List.Pairwise (fun (a b : α) => (a == b) = false) l → k ∈ l → (insertManyIfNewUnit m l).getKey! k' = k

theorem Std.DHashMap.Raw.Const.getKey!_insertManyIfNewUnit_list_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] [Inhabited α] (h : m.WF) {l : List α} {k : α} : k ∈ m → (insertManyIfNewUnit m l).getKey! k = m.getKey! k

theorem Std.DHashMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_not_mem_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k fallback : α} : ¬k ∈ m → l.contains k = false → (insertManyIfNewUnit m l).getKeyD k fallback = fallback

theorem Std.DHashMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_not_mem_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k k' fallback : α} (k_beq : (k == k') = true) : ¬k ∈ m → List.Pairwise (fun (a b : α) => (a == b) = false) l → k ∈ l → (insertManyIfNewUnit m l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.Const.getKeyD_insertManyIfNewUnit_list_of_mem {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k fallback : α} : k ∈ m → (insertManyIfNewUnit m l).getKeyD k fallback = m.getKeyD k fallback

theorem Std.DHashMap.Raw.Const.size_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) : (∀ (a : α), a ∈ m → l.contains a = false) → (insertManyIfNewUnit m l).size = m.size + l.length

theorem Std.DHashMap.Raw.Const.size_le_size_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} : m.size ≤ (insertManyIfNewUnit m l).size

theorem Std.DHashMap.Raw.Const.size_insertManyIfNewUnit_list_le {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} : (insertManyIfNewUnit m l).size ≤ m.size + l.length

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} : (insertManyIfNewUnit m l).isEmpty = (m.isEmpty && l.isEmpty)

@[simp]

theorem Std.DHashMap.Raw.Const.get?_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} [EquivBEq α] [LawfulHashable α] (h : m.WF) {l : List α} {k : α} : get? (insertManyIfNewUnit m l) k = if k ∈ m ∨ l.contains k = true then some () else none

@[simp]

theorem Std.DHashMap.Raw.Const.get_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} {l : List α} {k : α} {h : k ∈ insertManyIfNewUnit m l} : get (insertManyIfNewUnit m l) k h = ()

@[simp]

theorem Std.DHashMap.Raw.Const.get!_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} {l : List α} {k : α} : get! (insertManyIfNewUnit m l) k = ()

@[simp]

theorem Std.DHashMap.Raw.Const.getD_insertManyIfNewUnit_list {α : Type u} [BEq α] [Hashable α] {m : Raw α fun (x : α) => Unit} {l : List α} {k : α} {fallback : Unit} : getD (insertManyIfNewUnit m l) k fallback = ()

@[simp]

theorem Std.DHashMap.Raw.ofList_nil {α : Type u} {β : α → Type v} [BEq α] [Hashable α] : ofList [] = ∅

@[simp]

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

theorem Std.DHashMap.Raw.ofList_cons {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {k : α} {v : β k} {tl : List ((a : α) × β a)} : ofList (⟨k, v⟩ :: tl) = (∅.insert k v).insertMany tl

@[simp]

theorem Std.DHashMap.Raw.contains_ofList {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k : α} : (ofList l).contains k = (List.map Sigma.fst l).contains k

@[simp]

theorem Std.DHashMap.Raw.mem_ofList {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k : α} : k ∈ ofList l ↔ (List.map Sigma.fst l).contains k = true

theorem Std.DHashMap.Raw.get?_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l).get? k = none

theorem Std.DHashMap.Raw.get?_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l).get? k' = some (cast ⋯ v)

theorem Std.DHashMap.Raw.get_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) {h : k' ∈ ofList l} : (ofList l).get k' h = cast ⋯ v

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

theorem Std.DHashMap.Raw.get!_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} [Inhabited (β k')] (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l).get! k' = cast ⋯ v

theorem Std.DHashMap.Raw.getD_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k : α} {fallback : β k} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l).getD k fallback = fallback

theorem Std.DHashMap.Raw.getD_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [LawfulBEq α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) {v : β k} {fallback : β k'} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : ⟨k, v⟩ ∈ l) : (ofList l).getD k' fallback = cast ⋯ v

theorem Std.DHashMap.Raw.getKey?_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l).getKey? k = none

theorem Std.DHashMap.Raw.getKey?_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l).getKey? k' = some k

theorem Std.DHashMap.Raw.getKey_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) {h' : k' ∈ ofList l} : (ofList l).getKey k' h' = k

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

theorem Std.DHashMap.Raw.getKey!_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] {l : List ((a : α) × β a)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l).getKey! k' = k

theorem Std.DHashMap.Raw.getKeyD_ofList_of_contains_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k fallback : α} (contains_eq_false : (List.map Sigma.fst l).contains k = false) : (ofList l).getKeyD k fallback = fallback

theorem Std.DHashMap.Raw.getKeyD_ofList_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} {k k' fallback : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Sigma.fst l) : (ofList l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.size_ofList {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} (distinct : List.Pairwise (fun (a b : (a : α) × β a) => (a.fst == b.fst) = false) l) : (ofList l).size = l.length

theorem Std.DHashMap.Raw.size_ofList_le {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} : (ofList l).size ≤ l.length

@[simp]

theorem Std.DHashMap.Raw.isEmpty_ofList {α : Type u} {β : α → Type v} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List ((a : α) × β a)} : (ofList l).isEmpty = l.isEmpty

@[simp]

theorem Std.DHashMap.Raw.Const.ofList_nil {α : Type u} [BEq α] [Hashable α] {β : Type v} : ofList [] = ∅

@[simp]

theorem Std.DHashMap.Raw.Const.ofList_singleton {α : Type u} [BEq α] [Hashable α] {β : Type v} {k : α} {v : β} : ofList [(k, v)] = ∅.insert k v

theorem Std.DHashMap.Raw.Const.ofList_cons {α : Type u} [BEq α] [Hashable α] {β : Type v} {k : α} {v : β} {tl : List (α × β)} : ofList ((k, v) :: tl) = insertMany (∅.insert k v) tl

@[simp]

theorem Std.DHashMap.Raw.Const.contains_ofList {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k : α} : (ofList l).contains k = (List.map Prod.fst l).contains k

@[simp]

theorem Std.DHashMap.Raw.Const.mem_ofList {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k : α} : k ∈ ofList l ↔ (List.map Prod.fst l).contains k = true

theorem Std.DHashMap.Raw.Const.get?_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : get? (ofList l) k = none

theorem Std.DHashMap.Raw.Const.get?_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : get? (ofList l) k' = some v

theorem Std.DHashMap.Raw.Const.get_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) {h : k' ∈ ofList l} : get (ofList l) k' h = v

theorem Std.DHashMap.Raw.Const.get!_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k : α} [Inhabited β] (contains_eq_false : (List.map Prod.fst l).contains k = false) : get! (ofList l) k = default

theorem Std.DHashMap.Raw.Const.get!_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v : β} [Inhabited β] (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : get! (ofList l) k' = v

theorem Std.DHashMap.Raw.Const.getD_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k : α} {fallback : β} (contains_eq_false : (List.map Prod.fst l).contains k = false) : getD (ofList l) k fallback = fallback

theorem Std.DHashMap.Raw.Const.getD_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [LawfulBEq α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) {v fallback : β} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : (k, v) ∈ l) : getD (ofList l) k' fallback = v

theorem Std.DHashMap.Raw.Const.getKey?_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l).getKey? k = none

theorem Std.DHashMap.Raw.Const.getKey?_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (ofList l).getKey? k' = some k

theorem Std.DHashMap.Raw.Const.getKey_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) {h' : k' ∈ ofList l} : (ofList l).getKey k' h' = k

theorem Std.DHashMap.Raw.Const.getKey!_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] [Inhabited α] {l : List (α × β)} {k : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l).getKey! k = default

theorem Std.DHashMap.Raw.Const.getKey!_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] [Inhabited α] {l : List (α × β)} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (ofList l).getKey! k' = k

theorem Std.DHashMap.Raw.Const.getKeyD_ofList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k fallback : α} (contains_eq_false : (List.map Prod.fst l).contains k = false) : (ofList l).getKeyD k fallback = fallback

theorem Std.DHashMap.Raw.Const.getKeyD_ofList_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} {k k' fallback : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) (mem : k ∈ List.map Prod.fst l) : (ofList l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.Const.size_ofList {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} (distinct : List.Pairwise (fun (a b : α × β) => (a.fst == b.fst) = false) l) : (ofList l).size = l.length

theorem Std.DHashMap.Raw.Const.size_ofList_le {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} : (ofList l).size ≤ l.length

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_ofList {α : Type u} [BEq α] [Hashable α] {β : Type v} [EquivBEq α] [LawfulHashable α] {l : List (α × β)} : (ofList l).isEmpty = l.isEmpty

@[simp]

theorem Std.DHashMap.Raw.Const.unitOfList_nil {α : Type u} [BEq α] [Hashable α] : unitOfList [] = ∅

@[simp]

theorem Std.DHashMap.Raw.Const.unitOfList_singleton {α : Type u} [BEq α] [Hashable α] {k : α} : unitOfList [k] = ∅.insertIfNew k ()

theorem Std.DHashMap.Raw.Const.unitOfList_cons {α : Type u} [BEq α] [Hashable α] {hd : α} {tl : List α} : unitOfList (hd :: tl) = insertManyIfNewUnit (∅.insertIfNew hd ()) tl

@[simp]

theorem Std.DHashMap.Raw.Const.contains_unitOfList {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k : α} : (unitOfList l).contains k = l.contains k

@[simp]

theorem Std.DHashMap.Raw.Const.mem_unitOfList {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k : α} : k ∈ unitOfList l ↔ l.contains k = true

theorem Std.DHashMap.Raw.Const.getKey?_unitOfList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k : α} (contains_eq_false : l.contains k = false) : (unitOfList l).getKey? k = none

theorem Std.DHashMap.Raw.Const.getKey?_unitOfList_of_mem {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) (mem : k ∈ l) : (unitOfList l).getKey? k' = some k

theorem Std.DHashMap.Raw.Const.getKey_unitOfList_of_mem {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) (mem : k ∈ l) {h' : k' ∈ unitOfList l} : (unitOfList l).getKey k' h' = k

theorem Std.DHashMap.Raw.Const.getKey!_unitOfList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] {l : List α} {k : α} (contains_eq_false : l.contains k = false) : (unitOfList l).getKey! k = default

theorem Std.DHashMap.Raw.Const.getKey!_unitOfList_of_mem {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] [Inhabited α] {l : List α} {k k' : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) (mem : k ∈ l) : (unitOfList l).getKey! k' = k

theorem Std.DHashMap.Raw.Const.getKeyD_unitOfList_of_contains_eq_false {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k fallback : α} (contains_eq_false : l.contains k = false) : (unitOfList l).getKeyD k fallback = fallback

theorem Std.DHashMap.Raw.Const.getKeyD_unitOfList_of_mem {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k k' fallback : α} (k_beq : (k == k') = true) (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) (mem : k ∈ l) : (unitOfList l).getKeyD k' fallback = k

theorem Std.DHashMap.Raw.Const.size_unitOfList {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} (distinct : List.Pairwise (fun (a b : α) => (a == b) = false) l) : (unitOfList l).size = l.length

theorem Std.DHashMap.Raw.Const.size_unitOfList_le {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} : (unitOfList l).size ≤ l.length

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_unitOfList {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} : (unitOfList l).isEmpty = l.isEmpty

@[simp]

theorem Std.DHashMap.Raw.Const.get?_unitOfList {α : Type u} [BEq α] [Hashable α] [EquivBEq α] [LawfulHashable α] {l : List α} {k : α} : get? (unitOfList l) k = if l.contains k = true then some () else none

@[simp]

theorem Std.DHashMap.Raw.Const.get_unitOfList {α : Type u} [BEq α] [Hashable α] {l : List α} {k : α} {h : k ∈ unitOfList l} : get (unitOfList l) k h = ()

@[simp]

theorem Std.DHashMap.Raw.Const.get!_unitOfList {α : Type u} [BEq α] [Hashable α] {l : List α} {k : α} : get! (unitOfList l) k = ()

@[simp]

theorem Std.DHashMap.Raw.Const.getD_unitOfList {α : Type u} [BEq α] [Hashable α] {l : List α} {k : α} {fallback : Unit} : getD (unitOfList l) k fallback = ()

theorem Std.DHashMap.Raw.isEmpty_alter_eq_isEmpty_erase {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).isEmpty = ((m.erase k).isEmpty && (f (m.get? k)).isNone)

@[simp]

theorem Std.DHashMap.Raw.isEmpty_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).isEmpty = ((m.isEmpty || m.size == 1 && m.contains k) && (f (m.get? k)).isNone)

theorem Std.DHashMap.Raw.contains_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).contains k' = if (k == k') = true then (f (m.get? k)).isSome else m.contains k'

theorem Std.DHashMap.Raw.mem_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) : k' ∈ m.alter k f ↔ if (k == k') = true then (f (m.get? k)).isSome = true else k' ∈ m

theorem Std.DHashMap.Raw.mem_alter_of_beq {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) (he : (k == k') = true) : k' ∈ m.alter k f ↔ (f (m.get? k)).isSome = true

@[simp]

theorem Std.DHashMap.Raw.contains_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).contains k = (f (m.get? k)).isSome

@[simp]

theorem Std.DHashMap.Raw.mem_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : k ∈ m.alter k f ↔ (f (m.get? k)).isSome = true

theorem Std.DHashMap.Raw.contains_alter_of_beq_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) (he : (k == k') = false) : (m.alter k f).contains k' = m.contains k'

theorem Std.DHashMap.Raw.mem_alter_of_beq_eq_false {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) (he : (k == k') = false) : k' ∈ m.alter k f ↔ k' ∈ m

theorem Std.DHashMap.Raw.size_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).size = if (m.contains k && (f (m.get? k)).isNone) = true then m.size - 1 else if (!m.contains k && (f (m.get? k)).isSome) = true then m.size + 1 else m.size

theorem Std.DHashMap.Raw.size_alter_eq_add_one {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) (h₁ : ¬k ∈ m) (h₂ : (f (m.get? k)).isSome = true) : (m.alter k f).size = m.size + 1

theorem Std.DHashMap.Raw.size_alter_eq_sub_one {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) (h₁ : k ∈ m) (h₂ : (f (m.get? k)).isNone = true) : (m.alter k f).size = m.size - 1

theorem Std.DHashMap.Raw.size_alter_eq_self_of_not_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) (h₁ : ¬k ∈ m) (h₂ : (f (m.get? k)).isNone = true) : (m.alter k f).size = m.size

theorem Std.DHashMap.Raw.size_alter_eq_self_of_mem {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) (h₁ : k ∈ m) (h₂ : (f (m.get? k)).isSome = true) : (m.alter k f).size = m.size

theorem Std.DHashMap.Raw.size_alter_le_size {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).size ≤ m.size + 1

theorem Std.DHashMap.Raw.size_le_size_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : m.size - 1 ≤ (m.alter k f).size

theorem Std.DHashMap.Raw.get?_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).get? k' = if h : (k == k') = true then cast ⋯ (f (m.get? k)) else m.get? k'

@[simp]

theorem Std.DHashMap.Raw.get?_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).get? k = f (m.get? k)

theorem Std.DHashMap.Raw.get_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) {hc : k' ∈ m.alter k f} : (m.alter k f).get k' hc = if heq : (k == k') = true then cast ⋯ ((f (m.get? k)).get ⋯) else m.get k' ⋯

@[simp]

theorem Std.DHashMap.Raw.get_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) {hc : k ∈ m.alter k f} : (m.alter k f).get k hc = (f (m.get? k)).get ⋯

theorem Std.DHashMap.Raw.get!_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} [hi : Inhabited (β k')] {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).get! k' = if heq : (k == k') = true then (Option.map (cast ⋯) (f (m.get? k))).get! else m.get! k'

@[simp]

theorem Std.DHashMap.Raw.get!_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} [Inhabited (β k)] {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).get! k = (f (m.get? k)).get!

theorem Std.DHashMap.Raw.getD_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {fallback : β k'} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getD k' fallback = if heq : (k == k') = true then (Option.map (cast ⋯) (f (m.get? k))).getD fallback else m.getD k' fallback

@[simp]

theorem Std.DHashMap.Raw.getD_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {fallback : β k} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getD k fallback = (f (m.get? k)).getD fallback

theorem Std.DHashMap.Raw.getKey?_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKey? k' = if (k == k') = true then if (f (m.get? k)).isSome = true then some k else none else m.getKey? k'

theorem Std.DHashMap.Raw.getKey?_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKey? k = if (f (m.get? k)).isSome = true then some k else none

theorem Std.DHashMap.Raw.getKey!_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKey! k' = if (k == k') = true then if (f (m.get? k)).isSome = true then k else default else m.getKey! k'

theorem Std.DHashMap.Raw.getKey!_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKey! k = if (f (m.get? k)).isSome = true then k else default

theorem Std.DHashMap.Raw.getKey_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k k' : α} {f : Option (β k) → Option (β k)} (h : m.WF) {hc : k' ∈ m.alter k f} : (m.alter k f).getKey k' hc = if heq : (k == k') = true then k else m.getKey k' ⋯

@[simp]

theorem Std.DHashMap.Raw.getKey_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k : α} {f : Option (β k) → Option (β k)} (h : m.WF) {hc : k ∈ m.alter k f} : (m.alter k f).getKey k hc = k

theorem Std.DHashMap.Raw.getKeyD_alter {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' fallback : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKeyD k' fallback = if (k == k') = true then if (f (m.get? k)).isSome = true then k else fallback else m.getKeyD k' fallback

@[simp]

theorem Std.DHashMap.Raw.getKeyD_alter_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k fallback : α} {f : Option (β k) → Option (β k)} (h : m.WF) : (m.alter k f).getKeyD k fallback = if (f (m.get? k)).isSome = true then k else fallback

theorem Std.DHashMap.Raw.Const.isEmpty_alter_eq_isEmpty_erase {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).isEmpty = ((m.erase k).isEmpty && (f (get? m k)).isNone)

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).isEmpty = ((m.isEmpty || m.size == 1 && m.contains k) && (f (get? m k)).isNone)

theorem Std.DHashMap.Raw.Const.contains_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).contains k' = if (k == k') = true then (f (get? m k)).isSome else m.contains k'

theorem Std.DHashMap.Raw.Const.mem_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) : k' ∈ alter m k f ↔ if (k == k') = true then (f (get? m k)).isSome = true else k' ∈ m

theorem Std.DHashMap.Raw.Const.mem_alter_of_beq {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) (he : (k == k') = true) : k' ∈ alter m k f ↔ (f (get? m k)).isSome = true

@[simp]

theorem Std.DHashMap.Raw.Const.contains_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).contains k = (f (get? m k)).isSome

@[simp]

theorem Std.DHashMap.Raw.Const.mem_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : k ∈ alter m k f ↔ (f (get? m k)).isSome = true

theorem Std.DHashMap.Raw.Const.contains_alter_of_beq_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) (he : (k == k') = false) : (alter m k f).contains k' = m.contains k'

theorem Std.DHashMap.Raw.Const.mem_alter_of_beq_eq_false {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) (he : (k == k') = false) : k' ∈ alter m k f ↔ k' ∈ m

theorem Std.DHashMap.Raw.Const.size_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).size = if (m.contains k && (f (get? m k)).isNone) = true then m.size - 1 else if (!m.contains k && (f (get? m k)).isSome) = true then m.size + 1 else m.size

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

theorem Std.DHashMap.Raw.Const.size_alter_eq_sub_one {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) (h₁ : k ∈ m) (h₂ : (f (get? m k)).isNone = true) : (alter m k f).size = m.size - 1

theorem Std.DHashMap.Raw.Const.size_alter_eq_self_of_not_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) (h₁ : ¬k ∈ m) (h₂ : (f (get? m k)).isNone = true) : (alter m k f).size = m.size

theorem Std.DHashMap.Raw.Const.size_alter_eq_self_of_mem {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) (h₁ : k ∈ m) (h₂ : (f (get? m k)).isSome = true) : (alter m k f).size = m.size

theorem Std.DHashMap.Raw.Const.size_alter_le_size {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).size ≤ m.size + 1

theorem Std.DHashMap.Raw.Const.size_le_size_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [LawfulBEq α] {k : α} {f : Option β → Option β} (h : m.WF) : m.size - 1 ≤ (alter m k f).size

theorem Std.DHashMap.Raw.Const.get?_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) : get? (alter m k f) k' = if (k == k') = true then f (get? m k) else get? m k'

@[simp]

theorem Std.DHashMap.Raw.Const.get?_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : get? (alter m k f) k = f (get? m k)

theorem Std.DHashMap.Raw.Const.get_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) {hc : k' ∈ alter m k f} : get (alter m k f) k' hc = if heq : (k == k') = true then (f (get? m k)).get ⋯ else get m k' ⋯

@[simp]

theorem Std.DHashMap.Raw.Const.get_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) {hc : k ∈ alter m k f} : get (alter m k f) k hc = (f (get? m k)).get ⋯

theorem Std.DHashMap.Raw.Const.get!_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} [Inhabited β] {f : Option β → Option β} (h : m.WF) : get! (alter m k f) k' = if (k == k') = true then (f (get? m k)).get! else get! m k'

@[simp]

theorem Std.DHashMap.Raw.Const.get!_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} [Inhabited β] {f : Option β → Option β} (h : m.WF) : get! (alter m k f) k = (f (get? m k)).get!

theorem Std.DHashMap.Raw.Const.getD_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {fallback : β} {f : Option β → Option β} (h : m.WF) : getD (alter m k f) k' fallback = if (k == k') = true then (f (get? m k)).getD fallback else getD m k' fallback

@[simp]

theorem Std.DHashMap.Raw.Const.getD_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {fallback : β} {f : Option β → Option β} (h : m.WF) : getD (alter m k f) k fallback = (f (get? m k)).getD fallback

theorem Std.DHashMap.Raw.Const.getKey?_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKey? k' = if (k == k') = true then if (f (get? m k)).isSome = true then some k else none else m.getKey? k'

theorem Std.DHashMap.Raw.Const.getKey?_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKey? k = if (f (get? m k)).isSome = true then some k else none

theorem Std.DHashMap.Raw.Const.getKey!_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k k' : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKey! k' = if (k == k') = true then if (f (get? m k)).isSome = true then k else default else m.getKey! k'

theorem Std.DHashMap.Raw.Const.getKey!_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKey! k = if (f (get? m k)).isSome = true then k else default

theorem Std.DHashMap.Raw.Const.getKey_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k k' : α} {f : Option β → Option β} (h : m.WF) {hc : k' ∈ alter m k f} : (alter m k f).getKey k' hc = if heq : (k == k') = true then k else m.getKey k' ⋯

@[simp]

theorem Std.DHashMap.Raw.Const.getKey_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k : α} {f : Option β → Option β} (h : m.WF) {hc : k ∈ alter m k f} : (alter m k f).getKey k hc = k

theorem Std.DHashMap.Raw.Const.getKeyD_alter {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' fallback : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKeyD k' fallback = if (k == k') = true then if (f (get? m k)).isSome = true then k else fallback else m.getKeyD k' fallback

theorem Std.DHashMap.Raw.Const.getKeyD_alter_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k fallback : α} {f : Option β → Option β} (h : m.WF) : (alter m k f).getKeyD k fallback = if (f (get? m k)).isSome = true then k else fallback

@[simp]

theorem Std.DHashMap.Raw.isEmpty_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : β k → β k} (h : m.WF) : (m.modify k f).isEmpty = m.isEmpty

@[simp]

theorem Std.DHashMap.Raw.contains_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : β k → β k} (h : m.WF) : (m.modify k f).contains k' = m.contains k'

@[simp]

theorem Std.DHashMap.Raw.mem_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : β k → β k} (h : m.WF) : k' ∈ m.modify k f ↔ k' ∈ m

@[simp]

theorem Std.DHashMap.Raw.size_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : β k → β k} (h : m.WF) : (m.modify k f).size = m.size

theorem Std.DHashMap.Raw.get?_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : β k → β k} (h : m.WF) : (m.modify k f).get? k' = if h : (k == k') = true then cast ⋯ (Option.map f (m.get? k)) else m.get? k'

@[simp]

theorem Std.DHashMap.Raw.get?_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : β k → β k} (h : m.WF) : (m.modify k f).get? k = Option.map f (m.get? k)

theorem Std.DHashMap.Raw.get_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : β k → β k} (h : m.WF) {hc : k' ∈ m.modify k f} : (m.modify k f).get k' hc = if heq : (k == k') = true then cast ⋯ (f (m.get k ⋯)) else m.get k' ⋯

@[simp]

theorem Std.DHashMap.Raw.get_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : β k → β k} (h : m.WF) {hc : k ∈ m.modify k f} : (m.modify k f).get k hc = f (m.get k ⋯)

theorem Std.DHashMap.Raw.get!_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} [hi : Inhabited (β k')] {f : β k → β k} (h : m.WF) : (m.modify k f).get! k' = if heq : (k == k') = true then (Option.map (cast ⋯) (Option.map f (m.get? k))).get! else m.get! k'

@[simp]

theorem Std.DHashMap.Raw.get!_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} [Inhabited (β k)] {f : β k → β k} (h : m.WF) : (m.modify k f).get! k = (Option.map f (m.get? k)).get!

theorem Std.DHashMap.Raw.getD_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {fallback : β k'} {f : β k → β k} (h : m.WF) : (m.modify k f).getD k' fallback = if heq : (k == k') = true then (Option.map (cast ⋯) (Option.map f (m.get? k))).getD fallback else m.getD k' fallback

@[simp]

theorem Std.DHashMap.Raw.getD_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {fallback : β k} {f : β k → β k} (h : m.WF) : (m.modify k f).getD k fallback = (Option.map f (m.get? k)).getD fallback

theorem Std.DHashMap.Raw.getKey?_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKey? k' = if (k == k') = true then if k ∈ m then some k else none else m.getKey? k'

theorem Std.DHashMap.Raw.getKey?_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKey? k = if k ∈ m then some k else none

theorem Std.DHashMap.Raw.getKey!_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k k' : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKey! k' = if (k == k') = true then if k ∈ m then k else default else m.getKey! k'

theorem Std.DHashMap.Raw.getKey!_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKey! k = if k ∈ m then k else default

theorem Std.DHashMap.Raw.getKey_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k k' : α} {f : β k → β k} (h : m.WF) {hc : k' ∈ m.modify k f} : (m.modify k f).getKey k' hc = if (k == k') = true then k else m.getKey k' ⋯

@[simp]

theorem Std.DHashMap.Raw.getKey_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k : α} {f : β k → β k} (h : m.WF) {hc : k ∈ m.modify k f} : (m.modify k f).getKey k hc = k

theorem Std.DHashMap.Raw.getKeyD_modify {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] {k k' fallback : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKeyD k' fallback = if (k == k') = true then if k ∈ m then k else fallback else m.getKeyD k' fallback

theorem Std.DHashMap.Raw.getKeyD_modify_self {α : Type u} {β : α → Type v} [BEq α] [Hashable α] {m : Raw α β} [LawfulBEq α] [Inhabited α] {k fallback : α} {f : β k → β k} (h : m.WF) : (m.modify k f).getKeyD k fallback = if k ∈ m then k else fallback

@[simp]

theorem Std.DHashMap.Raw.Const.isEmpty_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : β → β} (h : m.WF) : (modify m k f).isEmpty = m.isEmpty

@[simp]

theorem Std.DHashMap.Raw.Const.contains_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : β → β} (h : m.WF) : (modify m k f).contains k' = m.contains k'

@[simp]

theorem Std.DHashMap.Raw.Const.mem_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : β → β} (h : m.WF) : k' ∈ modify m k f ↔ k' ∈ m

@[simp]

theorem Std.DHashMap.Raw.Const.size_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : β → β} (h : m.WF) : (modify m k f).size = m.size

theorem Std.DHashMap.Raw.Const.get?_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : β → β} (h : m.WF) : get? (modify m k f) k' = if (k == k') = true then Option.map f (get? m k) else get? m k'

@[simp]

theorem Std.DHashMap.Raw.Const.get?_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : β → β} (h : m.WF) : get? (modify m k f) k = Option.map f (get? m k)

theorem Std.DHashMap.Raw.Const.get_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : β → β} (h : m.WF) {hc : k' ∈ modify m k f} : get (modify m k f) k' hc = if heq : (k == k') = true then f (get m k ⋯) else get m k' ⋯

@[simp]

theorem Std.DHashMap.Raw.Const.get_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : β → β} (h : m.WF) {hc : k ∈ modify m k f} : get (modify m k f) k hc = f (get m k ⋯)

theorem Std.DHashMap.Raw.Const.get!_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} [Inhabited β] {f : β → β} (h : m.WF) : get! (modify m k f) k' = if (k == k') = true then (Option.map f (get? m k)).get! else get! m k'

@[simp]

theorem Std.DHashMap.Raw.Const.get!_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} [Inhabited β] {f : β → β} (h : m.WF) : get! (modify m k f) k = (Option.map f (get? m k)).get!

theorem Std.DHashMap.Raw.Const.getD_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {fallback : β} {f : β → β} (h : m.WF) : getD (modify m k f) k' fallback = if (k == k') = true then (Option.map f (get? m k)).getD fallback else getD m k' fallback

@[simp]

theorem Std.DHashMap.Raw.Const.getD_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {fallback : β} {f : β → β} (h : m.WF) : getD (modify m k f) k fallback = (Option.map f (get? m k)).getD fallback

theorem Std.DHashMap.Raw.Const.getKey?_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' : α} {f : β → β} (h : m.WF) : (modify m k f).getKey? k' = if (k == k') = true then if k ∈ m then some k else none else m.getKey? k'

theorem Std.DHashMap.Raw.Const.getKey?_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k : α} {f : β → β} (h : m.WF) : (modify m k f).getKey? k = if k ∈ m then some k else none

theorem Std.DHashMap.Raw.Const.getKey!_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k k' : α} {f : β → β} (h : m.WF) : (modify m k f).getKey! k' = if (k == k') = true then if k ∈ m then k else default else m.getKey! k'

theorem Std.DHashMap.Raw.Const.getKey!_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k : α} {f : β → β} (h : m.WF) : (modify m k f).getKey! k = if k ∈ m then k else default

theorem Std.DHashMap.Raw.Const.getKey_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k k' : α} {f : β → β} (h : m.WF) {hc : k' ∈ modify m k f} : (modify m k f).getKey k' hc = if (k == k') = true then k else m.getKey k' ⋯

@[simp]

theorem Std.DHashMap.Raw.Const.getKey_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k : α} {f : β → β} (h : m.WF) {hc : k ∈ modify m k f} : (modify m k f).getKey k hc = k

theorem Std.DHashMap.Raw.Const.getKeyD_modify {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] {k k' fallback : α} {f : β → β} (h : m.WF) : (modify m k f).getKeyD k' fallback = if (k == k') = true then if k ∈ m then k else fallback else m.getKeyD k' fallback

theorem Std.DHashMap.Raw.Const.getKeyD_modify_self {α : Type u} [BEq α] [Hashable α] {β : Type v} {m : Raw α fun (x : α) => β} [EquivBEq α] [LawfulHashable α] [Inhabited α] {k fallback : α} {f : β → β} (h : m.WF) : (modify m k f).getKeyD k fallback = if k ∈ m then k else fallback