Theorems · Theorem · order theory
Finset.iInf_singleton
∀ {α : Type u_2} {β : Type u_3} [inst : CompleteLattice β] (a : α) (s : α → β), ⨅ x ∈ {a}, s x = s a- Defined in
- Mathlib.Order.CompleteLattice.Finset
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
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.
- Finsetstatement · cited by 13,712
- iInfstatement and proof · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- iInf_congr_Propproof · cited by 218
- Finset.mem_singletonproof · cited by 103
- iInf_iInf_eq_leftproof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- Finset.set_biInter_singletonproof · cited by 1