Inequalities · medium

Statement, exactly as the model and Lean see it

theorem lg_target {α : Type u_1} {ι : Type u_2} [SemilatticeSup α] [AddGroup α] [Preorder ι] [LocallyFiniteOrderBot ι] [AddRightMono α] (f : ι → α) (c : α) (i : ι) : (partialSups fun x => f x + c) i = (partialSups f) i + c := by

Mathlib declaration: partialSups_add_const
Held-out module: Mathlib.Algebra.Order.Group.PartialSups
Banned modules (itself + downstream): 1
Reference proof premises (reachable / held-out): 3 / 0

Traces

Each configuration's full record: what was retrieved, what the model wrote, what Lean said back.

No configuration has attempted this theorem yet.

Reference proof

Mathlib's own source for this declaration, shown for comparison. It may use lemmas the prover is not allowed to use.

@[to_additive]