Mathlib Map

Theorems · Definition · combinatorics

BinaryTree.below

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

Around this declaration

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

BinaryTree.brecOn.go · cited by 8brecOn.goBinaryTree.brecOn.eq · cited by 7brecOn.eqBinaryTree.brecOn · cited by 3BinaryTree.brecOnBinaryTree.traverse.eq_def · cited by 0traverse.eq_defBinaryTree.numLeaves.eq_def · cited by 0numLeaves.eq_defDyckWord.ofTree.eq_def · cited by 0ofTree.eq_defBinaryTree.height.eq_def · cited by 0height.eq_defBinaryTree.numNodes.eq_def · cited by 0numNodes.eq_defBinaryTree.toOrdNode.eq_def · cited by 0toOrdNode.eq_defBinaryTree.map.eq_def · cited by 0map.eq_defBinaryTree · cited by 41BinaryTreeBinaryTree.belowCITED BYCITES

Cites1

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

Cited by10

Results whose statement or proof uses this declaration.