Theorems · Theorem · logic and foundations
FirstOrder.Language.presburger.term_realize_eq_add_dotProduct
∀ {α : Type u_1} {A : Set ℕ} [inst : Fintype α] (t : (FirstOrder.Language.presburger.withConstants ↑A).Term α),
∃ k u, ∀ (v : α → ℕ), FirstOrder.Language.Term.realize v t = k + u ⬝ᵥ v- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites25
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- one_mulproof · cited by 2,841
- add_zeroproof · cited by 2,707
- zero_addproof · cited by 2,366
- add_assocproof · cited by 746
- Pi.singleproof · cited by 518
- dotProductstatement and proof · cited by 194
- FirstOrder.Language.Termstatement and proof · cited by 166
- FirstOrder.Language.Functionsproof · cited by 153
- FirstOrder.Language.withConstantsstatement and proof · cited by 108
Cited by1
Results whose statement or proof uses this declaration.
- FirstOrder.Language.presburger.isSemilinearSet_boundedFormula_realizeproof · cited by 1