Theorems · Theorem · order theory
Set.symmDiff_iUnion_subset
∀ {α : Type u_1} {ι : Sort u_5} {s : Set α} [Nonempty ι] {f : ι → Set α}, symmDiff s (⋃ n, f n) ⊆ ⋃ n, symmDiff s (f n)- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
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 and proof · cited by 53,352
- Set.iUnionstatement · cited by 2,483
- symmDiffstatement · cited by 236
- symmDiff_iSup_leproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.