AFTD Auto-Formalizing Theoretical Domains

instDecEqIntervalFamily

instance

Equality on intervals in an interval family is decidable.

Statement

instance instDecEqIntervalFamily {T : ColoredRootedTree} {R : ℕ} (F : IntervalFamily T R) : DecidableEq F.ι
Defined in
arXiv:2611.03620 Definition 2.2
Verified
05 Nov 2026
Axioms
none listed
Built on 2
  • IntervalFamilyAn interval family for a colored tree consists of an injective mapping from vertices to integers and a laminar family of non-empty integer…
  • ColoredRootedTreeA finite rooted tree properly colored with 4 colors, represented by an ancestorship partial order with a root element below all vertices,…
Used by 1

Read back from the Lean

For every colored rooted tree T, natural number R, and interval family F : IntervalFamily T R, equality on the index type F.ι of F is decidable (providing the DecidableEq F.ι instance stored in the field F.decEq).

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 interval index type. -/
instance instDecEqIntervalFamily {T : ColoredRootedTree} {R : ℕ} (F : IntervalFamily T R) : DecidableEq F.ι := F.decEq
See it in the graphDiscuss this resultChallenge it