Theorems · Definition
List.kinsert
{α : Type u} → {β : α → Type v} → [DecidableEq α] → (a : α) → β a → List (Sigma β) → List (Sigma β)Insert the pair ⟨a, b⟩ and erase the first pair with the key a.
- Defined in
- Mathlib.Data.List.Sigma
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.keraseproof · cited by 41
Cited by11
Results whose statement or proof uses this declaration.
- AList.insertproof · cited by 27
- List.dedupKeysproof · cited by 6
- List.dlookup_kinsertstatement · cited by 2
- List.dlookup_kinsert_nestatement · cited by 2
- List.dedupKeys_consstatement · cited by 1
- List.Perm.kinsertstatement · cited by 1
- AList.mk_cons_eq_insertproof · cited by 1
- List.mem_keys_kinsertstatement · cited by 1
- List.nodupKeys_dedupKeysproof · cited by 1
- List.kinsert_defstatement · cited by 0
- List.kinsert_nodupKeysstatement · cited by 0