Theorems · Definition · general algebraic systems

finsuppLequivDFinsupp

{ι : Type u_1} →
  (R : Type u_2) →
    {M : Type u_3} →
      [DecidableEq ι] →
        [inst : Semiring R] →
          [inst_1 : AddCommMonoid M] →
            [(m : M) → Decidable (m ≠ 0)] → [inst_3 : Module R M] → (ι →₀ M) ≃ₗ[R] Π₀ (x : ι), M

The additive version of Finsupp.toFinsupp. Note that this is noncomputable because Finsupp.add is noncomputable.

Defined in

Mathlib.Data.Finsupp.ToDFinsupp

Cited by

11 results in Mathlib

Foundations

Depth 84 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidableEqSemiringAddCommMonoidDecidableModule