Theorems · Theorem · order theory

map_partialSups

∀ {α : Type u_1} {β : Type u_2} {ι : Type u_3} [inst : SemilatticeSup α] [inst_1 : SemilatticeSup β]
  [inst_2 : Preorder ι] [inst_3 : LocallyFiniteOrderBot ι] {F : Type u_4} [inst_4 : FunLike F α β] [SupHomClass F α β]
  (f : F) (g : ι → α) (i : ι), (partialSups fun j => f (g j)) i = f ((partialSups g) i)

Defined in

Mathlib.Order.PartialSups

Cited by

4 results in Mathlib

Foundations

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

Assumes

SemilatticeSupSemilatticeSupPreorderLocallyFiniteOrderBotFunLikeSupHomClass