Theorems · Definition · combinatorics
BinaryTree.treesOfNumNodesEq
ℕ → Finset (BinaryTree Unit)
A Finset of all trees with n nodes. See mem_treesOfNodesEq
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.HasAntidiagonal.antidiagonalproof · cited by 218
- Finset.biUnionproof · cited by 217
- Finset.attachproof · cited by 168
- BinaryTreestatement and proof · cited by 41
- BinaryTree.pairwiseNodeproof · cited by 3
Cited by12
Results whose statement or proof uses this declaration.
- DyckWord.equivTreesOfNumNodesEqstatement · cited by 3
- BinaryTree.treesOfNumNodesEq_succstatement and proof · cited by 2
- BinaryTree.treesOfNumNodesEq_zerostatement · cited by 2
- BinaryTree.treesOfNumNodesEq_card_eq_catalanstatement and proof · cited by 1
- BinaryTree.mem_treesOfNumNodesEqstatement and proof · cited by 1
- Tree.treesOfNumNodesEqproof · cited by 0
- DyckWord.card_dyckWord_semilength_eq_catalanproof · cited by 0
- BinaryTree.coe_treesOfNumNodesEqstatement · cited by 0
- BinaryTree.treesOfNumNodesEq.eq_defstatement and proof · cited by 0
- DyckWord.equivTreesOfNumNodesEq_apply_coestatement · cited by 0
- DyckWord.equivTreesOfNumNodesEq_symm_apply_coestatement and proof · cited by 0
- BinaryTree.mem_treesOfNumNodesEq_numNodesstatement · cited by 0