Theorems · Theorem · combinatorics

Finset.pairwiseDisjoint_piAntidiag_map_addRightEmbedding

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

Defined in

Mathlib.Algebra.Order.Antidiag.Pi

Cited by

3 results in Mathlib

Foundations

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

Assumes

DecidableEqAddCancelCommMonoidFinset.HasAntidiagonalDecidableEq