Theorems · Theorem · combinatorics
YoungDiagram.rowLen_transpose
∀ (μ : YoungDiagram) (i : ℕ), μ.transpose.rowLen i = μ.colLen i
- Defined in
- Mathlib.Combinatorics.Young.YoungDiagram
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Nat.findproof · cited by 139
- YoungDiagramstatement and proof · cited by 72
- YoungDiagram.rowLenstatement · cited by 13
- YoungDiagram.transposestatement and proof · cited by 13
- Nat.find.congr_simpproof · cited by 11
- YoungDiagram.colLenstatement · cited by 10
- YoungDiagram.exists_notMem_rowproof · cited by 5
- YoungDiagram.exists_notMem_colproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- YoungDiagram.mem_iff_lt_colLenproof · cited by 1
- YoungDiagram.colLen_antiproof · cited by 0