Theorems · Theorem · order theory

map_finset_inf

∀ {F : Type u_1} {α : Type u_2} {β : Type u_3} {ι : Type u_5} [inst : SemilatticeInf α] [inst_1 : OrderTop α]
  [inst_2 : SemilatticeInf β] [inst_3 : OrderTop β] [inst_4 : FunLike F α β] [InfTopHomClass F α β] (f : F)
  (s : Finset ι) (g : ι → α), f (s.inf g) = s.inf (⇑f ∘ g)

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

10 results in Mathlib

Foundations

Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

SemilatticeInfOrderTopSemilatticeInfOrderTopFunLikeInfTopHomClass