Theorems · Theorem · order theory

Finset.sup_image

∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : SemilatticeSup α] [inst_1 : OrderBot α] [inst_2 : DecidableEq β]
  (s : Finset γ) (f : γ → β) (g : β → α), (Finset.image f s).sup g = s.sup (g ∘ f)

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

28 results in Mathlib

Foundations

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

Assumes

SemilatticeSupOrderBotDecidableEq