Theorems · Theorem · order theory
UpperSet.erase_idem
∀ {α : Type u_1} [inst : Preorder α] (s : UpperSet α) (a : α), (s.erase a).erase a = s.erase a- Defined in
- Mathlib.Order.UpperLower.Closure
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- SetLike.coe_injectiveproof · cited by 374
- UpperSetstatement and proof · cited by 245
- sdiff_idemproof · cited by 12
- UpperSet.erasestatement and proof · cited by 9
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.