Theorems · Theorem · order theory
le_sdiff_right
∀ {α : Type u} {x y : α} [inst : GeneralizedBooleanAlgebra α], x ≤ y \ x ↔ x = ⊥- Defined in
- Mathlib.Order.BooleanAlgebra.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 53 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- GeneralizedBooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- LE.le.transproof · cited by 3,151
- Eq.leproof · cited by 605
- bot_leproof · cited by 306
- GeneralizedBooleanAlgebrastatement and proof · cited by 204
- Disjoint.mono_rightproof · cited by 64
- disjoint_selfproof · cited by 28
- disjoint_sdiff_self_rightproof · cited by 22
Cited by4
Results whose statement or proof uses this declaration.
- Finpartition.equitabilise_auxproof · cited by 3
- UV.compress_idemproof · cited by 3
- le_symmDiff_iff_leftproof · cited by 2
- UV.mem_of_mem_compressionproof · cited by 1