Theorems · Theorem · commutative algebra
PolynomialLaw.toFun_zero
∀ {R : Type u} [inst : CommSemiring R] {M : Type u_3} [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {N : Type u_4}
[inst_3 : AddCommMonoid N] [inst_4 : Module R N] {S : Type u_5} [inst_5 : CommSemiring S] [inst_6 : Algebra R S],
PolynomialLaw.toFun S 0 = 0Extension of PolynomialLaw.zero_def
- Defined in
- Mathlib.RingTheory.PolynomialLaw.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 105 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement and proof · cited by 20,661
- Finsetproof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Algebrastatement and proof · cited by 11,388
- CommSemiringstatement and proof · cited by 10,911
- TensorProductstatement and proof · cited by 2,545
- Finset.cardproof · cited by 2,327
- MvPolynomialproof · cited by 2,140
- map_zeroproof · cited by 1,614
- LinearMap.rTensorproof · cited by 266
- AlgHom.toLinearMapproof · cited by 254
- PolynomialLawstatement and proof · cited by 37
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.