Theorems · Theorem · order theory
Finset.inf_univ_eq_iInf
∀ {α : Type u_2} {β : Type u_3} [inst : Fintype α] [inst_1 : CompleteLattice β] (f : α → β), Finset.univ.inf f = iInf fA special case of Finset.inf_eq_iInf that omits the useless x ∈ univ binder.
- Defined in
- Mathlib.Data.Fintype.Lattice
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeCompleteLattice
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.
- Fintypestatement and proof · cited by 7,736
- Finset.univstatement · cited by 3,473
- iInfstatement · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- Finset.infstatement · cited by 219
- Finset.sup_univ_eq_iSupproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Ideal.iInf_span_singletonproof · cited by 1