Theorems · Theorem · order theory
symmDiff_sSup_le
∀ {α : Type u} [inst : CompleteBooleanAlgebra α] {s : Set α},
s.Nonempty → ∀ {a : α}, symmDiff a (sSup s) ≤ sSup ((fun x => symmDiff a x) '' s)- Defined in
- Mathlib.Order.CompleteBooleanAlgebra
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteBooleanAlgebra
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.
- Setstatement and proof · cited by 53,352
- Set.imagestatement · cited by 5,609
- Set.Nonemptystatement and proof · cited by 2,627
- SupSet.sSupstatement and proof · cited by 954
- Set.image_congrproof · cited by 533
- symmDiffstatement · cited by 236
- CompleteBooleanAlgebrastatement and proof · cited by 32
- symmDiff_commproof · cited by 23
- sSup_symmDiff_leproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- sSup_symmDiff_sSup_leproof · cited by 1
- Set.symmDiff_sUnion_subsetproof · cited by 0