Theorems · Theorem · combinatorics
Finmap.keys_erase_toFinset
∀ {α : Type u} {β : α → Type v} [inst : DecidableEq α] (a : α) (s : AList β),
(AList.erase a s).toFinmap.keys = s.toFinmap.keys.erase a- Defined in
- Mathlib.Data.Finmap
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 28 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.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Finset.erasestatement · cited by 455
- Multiset.ofListproof · cited by 290
- AListstatement and proof · cited by 122
- List.keysproof · cited by 46
- AList.entriesproof · cited by 44
- AList.toFinmapstatement and proof · cited by 33
- Finmap.entriesproof · cited by 14
- Finmap.keysstatement and proof · cited by 12
- AList.erasestatement and proof · cited by 12
- Multiset.keysproof · cited by 9
- Finset.mk.congr_simpproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- Finmap.keys_eraseproof · cited by 0