Theorems · Inductive type · combinatorics
RootedTree
Type (u_2 + 1)
The type of rooted trees.
- Defined in
- Mathlib.Order.SuccPred.Tree
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by27
Results whose statement or proof uses this declaration.
- SubRootedTreestatement and proof · cited by 10
- RootedTree.αstatement and proof · cited by 10
- SubRootedTree.rootstatement and proof · cited by 8
- RootedTree.subtreesstatement and proof · cited by 4
- SubRootedTree.extstatement and proof · cited by 2
- SubRootedTree.root_ne_bot_of_mem_subtreesstatement and proof · cited by 2
- RootedTree.subtreestatement and proof · cited by 2
- RootedTree.subtreeOfstatement and proof · cited by 2
- SubRootedTree.mem_iffstatement and proof · cited by 1
- RootedTree.mk.injstatement · cited by 1
- RootedTree.mk.noConfusionstatement · cited by 1
- RootedTree.mem_subtrees_disjoint_iffstatement and proof · cited by 1