Theorems · Definition · combinatorics
BinaryTree.pairwiseNode
Finset (BinaryTree Unit) → Finset (BinaryTree Unit) → Finset (BinaryTree Unit)
Given two finsets, find all trees that can be formed with
left child in a and right child in b
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- SProd.sprodproof · cited by 1,750
- Finset.mapproof · cited by 747
- BinaryTreestatement and proof · cited by 41
Cited by4
Results whose statement or proof uses this declaration.
- BinaryTree.treesOfNumNodesEqproof · cited by 10
- BinaryTree.treesOfNumNodesEq_succstatement and proof · cited by 2
- BinaryTree.treesOfNumNodesEq_card_eq_catalanproof · cited by 1
- BinaryTree.treesOfNumNodesEq.eq_defstatement and proof · cited by 0