PRF0005canonicalv1Lean-Formalized Proof of FTA on τ-Idx
Lean-formalized proof of the Fundamental Theorem of Arithmetic on τ-Idx (THM0010). Backed by an axiom-free Lean theorem in TauLib v2; the prose proof shadows the Lean development and pins to its commit hash.
Payload
Lean-formalized proof. The complete proof is at
TauLib.BookI.PrimePolarity.fundamental_theorem_arithmetic_tau_idx.
The prose above shadows the Lean development; consult the formal
theorem for the axiom-free verification.
Proof
Proof steps
- Definitions imported.
Import the definitions of τ-Idx and the prime-polarity machinery (DEF0001 earned-boundary-constants anchor).
Uses:
prrp://def0001@v1(uses definition) - Hyperfactorization theorem applied.
Apply THM0005 (hyperfactorization theorem) to decompose each τ-Idx element into the canonical generator system.
Uses:
prrp://thm0005@v1(uses theorem) - Uniqueness from prime polarity.
Uniqueness of the factorization follows from prime polarity (THM0006). The complete formalization is in TauLib
BookI.PrimePolarity.fundamental_theorem_arithmetic_tau_idx.Uses:
prrp://thm0006@v1(uses theorem)
Formalization
#print axioms
propext, Classical.choice, Quot.sound
Identifiers
Aliases & legacy IDs
proof-fta-tau-idx-leanRelease lines
corpus_v3_workingRelations
Upstream dependencies (3)
Version & History
Status disclaimer
A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.