Theorems · Theorem · order theory
Finset.inf_top
∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeInf α] [inst_1 : OrderTop α] (s : Finset β), (s.inf fun x => ⊤) = ⊤- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeInfOrderTop
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- Finset.Nonemptyproof · cited by 1,001
- SemilatticeInfstatement and proof · cited by 634
- OrderTopstatement and proof · cited by 493
- Finset.infstatement · cited by 219
- Finset.eq_empty_or_nonemptyproof · cited by 104
- Finset.inf_emptyproof · cited by 15
- Finset.inf_constproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Submodule.IsMinimalPrimaryDecomposition.comap_localized₀_eq_iInfproof · cited by 0