Mathlib Map

Theorems · Inductive type · group theory

NPow

Type u → Type u

NPow is an implementation detail of Monoid. It is needed because it is impossible to extend Pow M ℕ and Pow M ℤ at the same time.

Defined in
Mathlib.Algebra.Group.Defs
Cited by
5 results in Mathlib
Foundations
Depth 0 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Monoid.ext · cited by 7Monoid.extMonoid.casesOn · cited by 4Monoid.casesOnNPow.npow · cited by 3NPow.npowMonoid.mk.noConfusion · cited by 2mk.noConfusionNPow.casesOn · cited by 1NPow.casesOnLeftCancelMonoid.toMonoid_injective · cited by 1LeftCancelMonoid.toMonoid…CancelCommMonoid.toCommMonoid_injective · cited by 1CancelCommMonoid.toCommMo…RightCancelMonoid.toMonoid_injective · cited by 1RightCancelMonoid.toMonoi…NPow.ctorIdx · cited by 0NPow.ctorIdxNPow.noConfusion · cited by 0NPow.noConfusionNPow.noConfusionType · cited by 0NPow.noConfusionTypeNPow.mk.noConfusion · cited by 0mk.noConfusionNPow.recOn · cited by 0NPow.recOnMonoid.recOn · cited by 0Monoid.recOnMonoid.mk.congr_simp · cited by 0mk.congr_simpNPowCITED BYCITES

Cites0

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Nothing in Mathlib beyond the foundations.

Cited by17

Results whose statement or proof uses this declaration.