Theorems · Theorem · order theory

Finset.sup_map

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

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

7 results in Mathlib

Foundations

Depth 28 from the axioms · uses propext, Quot.sound

Assumes

SemilatticeSupOrderBot