Theorems · Theorem · order theory

Finset.sup_ite

∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : OrderBot α] {s : Finset β} {f g : β → α}
  (p : β → Prop) [inst_2 : DecidablePred p],
  (s.sup fun i => if p i then f i else g i) = (Finset.filter p s).sup f ⊔ {i ∈ s | ¬p i}.sup g

Defined in

Mathlib.Data.Finset.Lattice.Fold

Cited by

1 results in Mathlib

Foundations

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

Assumes

SemilatticeSupOrderBotDecidablePred