Theorems · Definition · commutative algebra
AddMonoidWithOne.casesOn
{R : Type u_2} →
{motive : AddMonoidWithOne R → Sort u} →
(t : AddMonoidWithOne R) →
([toNatCast : NatCast R] →
[toAddMonoid : AddMonoid R] →
[toOne : One R] →
(natCast_zero : ↑0 = 0) →
(natCast_succ : ∀ (n : ℕ), ↑(n + 1) = ↑n + 1) →
motive
{ toNatCast := toNatCast, toAddMonoid := toAddMonoid, toOne := toOne, natCast_zero := natCast_zero,
natCast_succ := natCast_succ }) →
motive t- Defined in
- Mathlib.Data.Nat.Cast.Defs
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
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.
- AddMonoidstatement and proof · cited by 2,864
- AddMonoid.toZerostatement · cited by 325
- AddMonoidWithOnestatement and proof · cited by 313
Cited by3
Results whose statement or proof uses this declaration.
- AddMonoidWithOne.extproof · cited by 3
- AddMonoidWithOne.noConfusionproof · cited by 0
- AddMonoidWithOne.noConfusionTypeproof · cited by 0