instDecEqColoredRootedTree
instance
Equality on the vertices of a colored rooted tree is decidable.
Statement
instance instDecEqColoredRootedTree (T : ColoredRootedTree) : DecidableEq T.V- Defined in
- arXiv:2611.03620 Section 2.1
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 1
- ColoredRootedTreeA finite rooted tree properly colored with 4 colors, represented by an ancestorship partial order with a root element below all vertices,…
- Used by 2
- contiguous_interval_family_depth_lower_boundFor all integers R ≥ 1 and d ≥ 0 there is a finite rooted tree, properly colored with the 4 colors 0..3, with at most 11(2R+1)^d vertices,…
- IntervalFamilyAn interval family for a colored tree consists of an injective mapping from vertices to integers and a laminar family of non-empty integer…
Read back from the Lean
For every ColoredRootedTree T, the vertex type T.V has decidable equality (witnessed by the decEq field of T).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- DecidableEq instance for the vertex type of a ColoredRootedTree. -/ instance instDecEqColoredRootedTree (T : ColoredRootedTree) : DecidableEq T.V := T.decEq