Theorems · Theorem · order theory
LowerSet.ext
∀ {α : Type u_1} [inst : LE α] {s t : LowerSet α}, ↑s = ↑t → s = t- Defined in
- Mathlib.Order.UpperLower.CompleteLattice
- Cited by
- 29 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SetLike.coestatement · cited by 8,199
- LowerSetstatement and proof · cited by 230
- SetLike.ext'proof · cited by 60
Cited by29
Results whose statement or proof uses this declaration.
- lowerClosure_singletonproof · cited by 8
- lowerClosure_imageproof · cited by 3
- LowerSet.symm_mapproof · cited by 2
- lowerClosure_infsproof · cited by 1
- UpperSet.compl_iInfproof · cited by 1
- UpperSet.compl_iSupproof · cited by 1
- LowerSet.prod_inf_prodproof · cited by 1
- LowerSet.ext_iffproof · cited by 1
- LowerSet.map_Iicproof · cited by 0
- LowerSet.map_Iioproof · cited by 0
- LowerSet.map_mapproof · cited by 0
- LowerSet.map_reflproof · cited by 0