Theorems · Theorem · order theory
Set.finite_iUnion
∀ {α : Type u} {ι : Sort w} [Finite ι] {f : ι → Set α}, (∀ (i : ι), (f i).Finite) → (⋃ i, f i).Finite- Defined in
- Mathlib.Data.Set.Finite.Lattice
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- Finitestatement and proof · cited by 3,029
- Set.iUnionstatement and proof · cited by 2,483
- Set.Finitestatement and proof · cited by 1,814
- Set.toFiniteproof · cited by 174
Cited by14
Results whose statement or proof uses this declaration.
- Set.Finite.biUnion'proof · cited by 4
- Filter.totallyBounded_iSupproof · cited by 2
- Algebra.Presentation.finite_coeffsproof · cited by 1
- FormalMultilinearSeries.changeOrigin_eval_of_finiteproof · cited by 1
- NumberField.finite_setOfPred_mulHeight₁_leproof · cited by 1
- Matroid.IsRkFinite.iUnionproof · cited by 0
- Function.HasFiniteMulSupport.iInfproof · cited by 0
- IntermediateField.fg_iSupproof · cited by 0
- Function.HasFiniteMulSupport.iSupproof · cited by 0
- Function.HasFiniteSupport.iInfproof · cited by 0
- Function.HasFiniteSupport.iSupproof · cited by 0
- Function.HasFiniteMulSupport.piproof · cited by 0