Theorems · Theorem · order theory

Finset.fold_max_add

∀ {ι : Type u_1} {M : Type u_3} [inst : LinearOrder M] [inst_1 : Add M] [AddRightMono M] (s : Finset ι) (a : WithBot M)
  (f : ι → M), Finset.fold max ⊥ (fun i => ↑(f i) + a) s = Finset.fold max ⊥ (WithBot.some ∘ f) s + a

Defined in

Mathlib.Algebra.Order.Group.Finset

Cited by

0 results in Mathlib

Foundations

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

Assumes

LinearOrderAddAddRightMono