Theorems · Theorem · logic and foundations
IsLinearSet.definable
∀ {α : Type u_1} {s : Set (α → ℕ)} {A : Set ℕ} [Finite α], IsLinearSet s → A.Definable FirstOrder.Language.presburger s- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
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
- Finsetproof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Finset.sumproof · cited by 5,195
- Finset.univproof · cited by 3,473
- Finitestatement and proof · cited by 3,029
- Finset.sum_congrproof · cited by 2,323
- Set.extproof · cited by 2,266
- mul_commproof · cited by 2,262
- HVAdd.hVAddproof · cited by 1,820
- nsmul_eq_mulproof · cited by 369
- Finset.sum_applyproof · cited by 234
Cited by1
Results whose statement or proof uses this declaration.
- IsSemilinearSet.definableproof · cited by 1