Theorems · Theorem
List.keys_kerase
∀ {α : Type u} {β : α → Type v} [inst : DecidableEq α] {a : α} {l : List (Sigma β)},
(List.kerase a l).keys = l.keys.erase a- Defined in
- Mathlib.Data.List.Sigma
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.keysstatement · cited by 46
- List.kerasestatement and proof · cited by 41
Cited by4
Results whose statement or proof uses this declaration.
- Finmap.keys_erase_toFinsetproof · cited by 1
- AList.keys_eraseproof · cited by 1
- List.nodupKeys_dedupKeysproof · cited by 1
- AList.keys_insertproof · cited by 0