Theorems · Definition · logic and foundations
FirstOrder.Language.presburger.sum
{α : Type u_1} →
{β : Type u_2} → Finset β → (β → FirstOrder.Language.presburger.Term α) → FirstOrder.Language.presburger.Term αSummation over a finite set of terms in Presburger arithmetic.
It is defined via choice, so the result only makes sense when the structure satisfies
commutativity (see realize_sum).
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- FirstOrder.Language.Termstatement and proof · cited by 166
- Finset.toListproof · cited by 34
- FirstOrder.Language.presburgerstatement and proof · cited by 21
Cited by2
Results whose statement or proof uses this declaration.
- FirstOrder.Language.presburger.realize_sumstatement · cited by 1
- IsLinearSet.definableproof · cited by 1