Mathlib Map

Theorems · Definition · combinatorics

BinaryTree.brecOn

{α : Type u} →
  {motive : BinaryTree α → Sort u_1} →
    (t : BinaryTree α) → ((t : BinaryTree α) → BinaryTree.below t → motive t) → motive t
Defined in
Mathlib.Data.Tree.Basic
Cited by
3 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

BinaryTree.numNodes · cited by 11BinaryTree.numNodesBinaryTree.brecOn.eq · cited by 7brecOn.eqBinaryTree.traverse · cited by 5BinaryTree.traverseDyckWord.ofTree · cited by 5DyckWord.ofTreeBinaryTree.map · cited by 4BinaryTree.mapBinaryTree.toOrdNode · cited by 3BinaryTree.toOrdNodeBinaryTree.numLeaves · cited by 3BinaryTree.numLeavesBinaryTree.height · cited by 2BinaryTree.heightDyckWord.toTree_ofTree · cited by 0DyckWord.toTree_ofTreeBinaryTree.height_le_numNodes · cited by 0BinaryTree.height_le_numN…BinaryTree.indexOf · cited by 0BinaryTree.indexOfBinaryTree · cited by 41BinaryTreeBinaryTree.below · cited by 8BinaryTree.belowBinaryTree.brecOn.go · cited by 8brecOn.goBinaryTree.brecOnCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by11

Results whose statement or proof uses this declaration.