Theorems · Theorem · order theory
sdiff_le_sdiff_iff_le
∀ {α : Type u} {x y z : α} [inst : GeneralizedBooleanAlgebra α], x ≤ z → y ≤ z → (z \ x ≤ z \ y ↔ y ≤ x)- Defined in
- Mathlib.Order.BooleanAlgebra.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 56 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.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- GeneralizedBooleanAlgebrastatement and proof · cited by 204
- sdiff_le_sdiff_leftproof · cited by 6
- sdiff_sdiff_eq_selfproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- Set.sdiff_subset_sdiff_iff_subsetproof · cited by 1
- Finset.sdiff_subset_sdiff_iff_subsetproof · cited by 0