Theorems · Theorem · order theory
Set.iUnion_comm
∀ {α : Type u_1} {ι : Sort u_5} {ι' : Sort u_6} (s : ι → ι' → Set α), ⋃ i, ⋃ i', s i i' = ⋃ i', ⋃ i, s i i'- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Set.iUnionstatement · cited by 2,483
- iSup_commproof · cited by 17
Cited by6
Results whose statement or proof uses this declaration.
- Set.biUnion_and'proof · cited by 14
- NFA.evalFrom_iUnionproof · cited by 2
- Set.biUnion_iUnionproof · cited by 2
- BoxIntegral.Prepartition.iUnion_ofWithBotproof · cited by 2
- convexJoin_iUnion_leftproof · cited by 1
- Set.biUnion_andproof · cited by 0