Theorems · Theorem
Ordnode.toBinaryTree.eq_def
∀ {α : Type u_1} (x : Ordnode α),
x.toBinaryTree =
match x with
| Ordnode.nil => BinaryTree.nil
| Ordnode.node size l x r => BinaryTree.node x l.toBinaryTree r.toBinaryTree- Defined in
- Mathlib.Data.Ordmap.Ordnode
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
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.
- Ordnodestatement and proof · cited by 185
- BinaryTreestatement and proof · cited by 41
- Ordnode.brecOn.goproof · cited by 18
- Ordnode.belowproof · cited by 18
- Ordnode.brecOn.eqproof · cited by 17
- Ordnode.toBinaryTreestatement and proof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.