primitiveOrderList_nodup
plain-language theorem explainer
The lemma establishes that the canonical list of primitive virtues contains no duplicate entries. Researchers formalizing normal forms for micro-move coefficient tables in the DREAM scaffolding would cite this result to guarantee unique ordering in summation operations. The proof is a one-line wrapper that unfolds the list definition and invokes a decision procedure to confirm the absence of duplicates.
Claim. The canonical list of primitive virtues $[Love, Justice, Forgiveness, Wisdom, Courage, Temperance, Prudence, Compassion, Gratitude, Patience, Humility, Hope, Creativity, Sacrifice]$ contains no repeated elements.
background
In the module on Micro-Move Normal Forms, which supplies canonical normal forms for micro-move coefficient tables supporting DREAM scaffolding, the primitive list is fixed as the explicit sequence of 14 virtues given above. This sequence serves as the reference order for indexing coefficients and moves in normal forms. The upstream definition supplies this concrete enumeration, which the lemma verifies satisfies the nodup property.
proof idea
The proof unfolds the definition of the canonical primitive list and applies the decide tactic to verify the nodup property directly from the concrete list.
why it matters
This result feeds into the auxiliary theorem on aggregation of coefficients over row moves, which performs summation over filtered moves by relying on the unique ordering to ensure each primitive appears at most once. It supports the canonical normal form construction in the ethics module, aligning with the Recognition Science emphasis on unique representations.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.