Theorems · Theorem · order theory
Fintype.sup_disjointed
∀ {α : Type u_1} {ι : Type u_2} [inst : GeneralizedBooleanAlgebra α] [inst_1 : PartialOrder ι]
[inst_2 : LocallyFiniteOrderBot ι] [inst_3 : Fintype ι] (f : ι → α),
Finset.univ.sup (disjointed f) = Finset.univ.sup f- Defined in
- Mathlib.Order.Disjointed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- PartialOrderstatement and proof · cited by 6,410
- Finset.univstatement and proof · cited by 3,473
- le_rflproof · cited by 1,558
- OrderHomproof · cited by 934
- Finset.extproof · cited by 565
- Finset.supstatement and proof · cited by 530
- LocallyFiniteOrderBotstatement and proof · cited by 286
- Finset.Iicproof · cited by 280
- Finset.biUnionproof · cited by 217
Cited by1
Results whose statement or proof uses this declaration.
- Fintype.exists_disjointed_leproof · cited by 1