Theorems · Definition
BinaryTree.toOrdNode
{α : Type u_1} → BinaryTree α → Ordnode αConvert to an OrdNode by pre-computing the sizes.
- Defined in
- Mathlib.Data.Ordmap.Ordnode
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Ordnodestatement · cited by 185
- BinaryTreestatement and proof · cited by 41
- BinaryTree.brecOnproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- Ordnode.size_toOrdNodestatement and proof · cited by 0
- Ordnode.toBinaryTree_toOrdNodestatement and proof · cited by 0
- BinaryTree.toOrdNode.eq_defstatement and proof · cited by 0