Theorems · Theorem · combinatorics

Finset.mapRange_finsuppAntidiag_eq

∀ {ι : Type u_1} {μ : Type u_2} {μ' : Type u_3} [inst : DecidableEq ι] [inst_1 : AddCommMonoid μ]
  [inst_2 : Finset.HasAntidiagonal μ] [inst_3 : DecidableEq μ] [inst_4 : AddCommMonoid μ']
  [inst_5 : Finset.HasAntidiagonal μ'] [inst_6 : DecidableEq μ'] {e : μ ≃+ μ'} {s : Finset ι} {n : μ},
  Finset.map (Finsupp.mapRange.addEquiv e).toEmbedding (s.finsuppAntidiag n) = s.finsuppAntidiag (e n)

Defined in

Mathlib.Algebra.Order.Antidiag.Finsupp

Cited by

1 results in Mathlib

Foundations

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

Assumes

DecidableEqAddCommMonoidFinset.HasAntidiagonalDecidableEqAddCommMonoidFinset.HasAntidiagonalDecidableEq