Theorems · Theorem · order theory
Finset.sup_id_set_eq_sUnion
∀ {α : Type u_2} (s : Finset (Set α)), s.sup id = ⋃₀ ↑s- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 4 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.
Cites6
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
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement · cited by 8,199
- Finset.supstatement · cited by 530
- Set.sUnionstatement · cited by 392
- Finset.sup_id_eq_sSupproof · cited by 12
Cited by4
Results whose statement or proof uses this declaration.
- measurableSet_generateFrom_of_mem_supClosureproof · cited by 2
- MeasureTheory.IsSetSemiring.disjointOfUnion_subset_of_memproof · cited by 2
- MeasureTheory.IsSetSemiring.mem_supClosure_iffproof · cited by 2
- Finpartition.isPartition_partsproof · cited by 0