Theorems · Definition · field theory
Polynomial.casesOn
{R : Type u_1} →
[inst : Semiring R] →
{motive : Polynomial R → Sort u} →
(t : Polynomial R) → ((toFinsupp : AddMonoidAlgebra R ℕ) → motive { toFinsupp := toFinsupp }) → motive t- Defined in
- Mathlib.Algebra.Polynomial.Basic
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
- Assumes
- Semiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Semiringstatement and proof · cited by 13,802
- Polynomialstatement and proof · cited by 5,681
- AddMonoidAlgebrastatement and proof · cited by 649
Cited by17
Results whose statement or proof uses this declaration.
- Polynomial.coeff_addproof · cited by 77
- Polynomial.coeff_C_mulproof · cited by 55
- Polynomial.mem_support_iffproof · cited by 30
- Polynomial.coeff_mulproof · cited by 29
- Polynomial.coeff_mul_Cproof · cited by 20
- Polynomial.X_mulproof · cited by 12
- Polynomial.coeff_reflectproof · cited by 9
- Polynomial.ext_iffproof · cited by 9
- Polynomial.coeff_divXproof · cited by 8
- Polynomial.eval₂_mul_noncommproof · cited by 7
- Polynomial.support_eq_emptyproof · cited by 5
- Polynomial.coeff_eraseproof · cited by 4