Theorems · Definition · combinatorics
BinaryTree.map
{α : Type u} → {β : Type u_1} → (α → β) → BinaryTree α → BinaryTree βApply a function to each value in the BinaryTree.
This is the map function for the BinaryTree functor.
- Defined in
- Mathlib.Data.Tree.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- BinaryTreestatement and proof · cited by 41
- BinaryTree.brecOnproof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- BinaryTree.comp_mapstatement and proof · cited by 0
- BinaryTree.traverse_eq_map_idstatement and proof · cited by 0
- BinaryTree.id_mapstatement and proof · cited by 0
- Tree.mapproof · cited by 0
- BinaryTree.map.eq_defstatement and proof · cited by 0