Theorems · Theorem · combinatorics
Finmap.keys_erase
∀ {α : Type u} {β : α → Type v} [inst : DecidableEq α] (a : α) (s : Finmap β), (Finmap.erase a s).keys = s.keys.erase a- Defined in
- Mathlib.Data.Finmap
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 36 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.
Cites10
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 and proof · cited by 455
- AListproof · cited by 122
- Finmapstatement and proof · cited by 81
- AList.toFinmapproof · cited by 33
- Finmap.induction_onproof · cited by 22
- Finmap.keysstatement and proof · cited by 12
- Finmap.erasestatement · cited by 9
- Finmap.erase_toFinmapproof · cited by 4
- Finmap.keys_erase_toFinsetproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.