Theorems · Theorem · order theory
Disjoint.le_symmDiff_sup_symmDiff_left
∀ {α : Type u_2} [inst : BooleanAlgebra α] {a b c : α}, Disjoint a b → c ≤ symmDiff a c ⊔ symmDiff b c- Defined in
- Mathlib.Order.SymmDiff
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Disjointstatement and proof · cited by 2,201
- le_reflproof · cited by 2,061
- BooleanAlgebrastatement and proof · cited by 300
- le_sup_rightproof · cited by 242
- symmDiffstatement and proof · cited by 236
- Disjoint.eq_botproof · cited by 52
- sup_le_supproof · cited by 48
- sdiff_botproof · cited by 13
- sdiff_infproof · cited by 5
Cited by3
Results whose statement or proof uses this declaration.
- Disjoint.le_symmDiff_sup_symmDiff_rightproof · cited by 2
- Set.subset_symmDiff_union_symmDiff_leftproof · cited by 0
- Codisjoint.bihimp_inf_bihimp_le_leftproof · cited by 0