Theorems · Theorem · combinatorics

Finset.piAntidiag_cons

∀ {ι : Type u_1} {μ : Type u_2} [inst : DecidableEq ι] [inst_1 : AddCancelCommMonoid μ]
  [inst_2 : Finset.HasAntidiagonal μ] [inst_3 : DecidableEq μ] {i : ι} {s : Finset ι} (hi : i ∉ s) (n : μ),
  (Finset.cons i s hi).piAntidiag n =
    (Finset.HasAntidiagonal.antidiagonal n).disjiUnion
      (fun p => Finset.map (addRightEmbedding fun t => if t = i then p.1 else 0) (s.piAntidiag p.2)) ⋯

Defined in

Mathlib.Algebra.Order.Antidiag.Pi

Cited by

2 results in Mathlib

Foundations

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

Assumes

DecidableEqAddCancelCommMonoidFinset.HasAntidiagonalDecidableEq