Theorems · Theorem · combinatorics

Finset.finsuppAntidiag_insert

∀ {ι : Type u_1} {μ : Type u_2} [inst : DecidableEq ι] [inst_1 : AddCommMonoid μ] [inst_2 : Finset.HasAntidiagonal μ]
  [inst_3 : DecidableEq μ] {a : ι} {s : Finset ι} (h : a ∉ s) (n : μ),
  (insert a s).finsuppAntidiag n =
    (Finset.HasAntidiagonal.antidiagonal n).biUnion fun p =>
      Finset.map { toFun := fun f => (↑f).update a p.1, inj' := ⋯ } (s.finsuppAntidiag p.2).attach

Defined in

Mathlib.Algebra.Order.Antidiag.Finsupp

Cited by

1 results in Mathlib

Foundations

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

Assumes

DecidableEqAddCommMonoidFinset.HasAntidiagonalDecidableEq