Theorems · Definition
AList.insert
{α : Type u} → {β : α → Type v} → [DecidableEq α] → (a : α) → β a → AList β → AList βInsert a key-value pair into an association list and erase any existing pair with the same key.
- Defined in
- Mathlib.Data.List.AList
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AListstatement and proof · cited by 122
- AList.entriesproof · cited by 44
- List.kinsertproof · cited by 9
Cited by29
Results whose statement or proof uses this declaration.
- Finmap.insertproof · cited by 10
- Finmap.insert_toFinmapstatement and proof · cited by 7
- AList.insertRecstatement and proof · cited by 4
- AList.lookup_insert_nestatement · cited by 3
- AList.lookup_insertstatement · cited by 3
- AList.entries_insert_of_notMemstatement · cited by 2
- AList.mem_insertstatement · cited by 1
- AList.entries_insertstatement · cited by 1
- AList.mk_cons_eq_insertstatement · cited by 1
- AList.insertRec_insertstatement and proof · cited by 1
- AList.insert_insertstatement · cited by 1
- AList.insert_insert_of_nestatement · cited by 1