Theorems · Theorem · order theory

Finset.sup_cons

∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : OrderBot α] {s : Finset β} {f : β → α} {b : β}
  (h : b ∉ s), (Finset.cons b s h).sup f = f b ⊔ s.sup f

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

30 results in Mathlib

Foundations

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

Assumes

SemilatticeSupOrderBot