Mathlib Map

Theorems · Theorem · order theory

OrderHom.sInf_apply

∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] [inst_1 : CompleteLattice β] (s : Set (α →o β)) (x : α),
  (sInf s) x = ⨅ f ∈ s, f x
Defined in
Mathlib.Order.Hom.Order
Cited by
1 results in Mathlib
Foundations
Depth 16 from the axioms · uses no axioms
Assumes
PreorderCompleteLattice
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

OrderHom.iInf_apply · cited by 1OrderHom.iInf_applyDFunLike.coe · cited by 62936DFunLike.coeSet · cited by 53352SetPreorder · cited by 7952PreorderiInf · cited by 1690iInfCompleteLattice · cited by 1048CompleteLatticeInfSet.sInf · cited by 935InfSet.sInfOrderHom · cited by 934OrderHomOrderHom.sInf_applyCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.