Theorems · Theorem · combinatorics
YoungDiagram.exists_notMem_row
∀ (μ : YoungDiagram) (i : ℕ), ∃ j, (i, j) ∉ μ
- Defined in
- Mathlib.Combinatorics.Young.YoungDiagram
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLike.coeproof · cited by 8,199
- Set.preimageproof · cited by 4,946
- Finset.preimageproof · cited by 108
- YoungDiagramstatement and proof · cited by 72
- YoungDiagram.cellsproof · cited by 16
- Finset.mem_preimageproof · cited by 12
- Infinite.exists_notMem_finsetproof · cited by 3
Cited by6
Results whose statement or proof uses this declaration.
- YoungDiagram.rowLenproof · cited by 13
- YoungDiagram.mem_iff_lt_rowLenproof · cited by 3
- YoungDiagram.exists_notMem_colproof · cited by 3
- YoungDiagram.rowLen_transposeproof · cited by 2
- YoungDiagram.rowLen_ofRowLensproof · cited by 1
- YoungDiagram.colLen_transposeproof · cited by 0