Mathlib Map

Theorems · Theorem · order theory

Set.sUnion_iUnion

∀ {α : Type u_1} {ι : Sort u_5} (s : ι → Set (Set α)), ⋃₀ ⋃ i, s i = ⋃ i, ⋃₀ s i
Defined in
Mathlib.Data.Set.Lattice
Cited by
2 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

MeasurableSpace.measurableSet_generateFrom_memPartition_iff · cited by 1MeasurableSpace.measurabl…MeasureTheory.IsSetSemiring.sUnion_disjointOfUnion · cited by 1IsSetSemiring.sUnion_disj…Set · cited by 53352SetSet.iUnion · cited by 2483Set.iUnionSet.sUnion · cited by 392Set.sUnionSet.sUnion_eq_biUnion · cited by 51Set.sUnion_eq_biUnionSet.biUnion_iUnion · cited by 2Set.biUnion_iUnionSet.sUnion_iUnionCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.