AFTD Auto-Formalizing Theoretical Domains

instPartialOrderColoredRootedTree

instance

The ancestorship relation on the vertices of a colored rooted tree forms a partial order.

Statement

instance instPartialOrderColoredRootedTree (T : ColoredRootedTree) : PartialOrder 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 3
  • nearest_ancestor_of_colorVertex u is the nearest proper ancestor of vertex v having color c if u is an ancestor of v with color c and no intermediate ancestor…
  • 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,…
  • colored_tree_subtreeThe subtree rooted at vertex v consists of all descendants of v in the tree.

Read back from the Lean

For any colored rooted tree $T$, its vertex type $T.V$ is endowed with a partial order, defined to be the partial order bundled in $T$ (T.partialOrder).

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

/-- PartialOrder instance for the vertex type of a ColoredRootedTree. -/
instance instPartialOrderColoredRootedTree (T : ColoredRootedTree) : PartialOrder T.V := T.partialOrder
See it in the graphDiscuss this resultChallenge it