FTH0277canonicalv1yoneda_faithful_id (theorem)
/-- [II.T36] Formal proof: the pre-Yoneda embedding of the identity is faithful — Code extraction recovers the function. code_extract(fun a => preyoneda(id, a, k), k, x) = (reduce(x, k) : Int). Unfolding: code_extract f k x = f(reduce(x, k)) where f(a) = preyoneda(reduce(·, k), a, k) = reduce(reduce(a, k), k). So the full expression is reduce(reduce(reduce(x, k), k), k) which collapses to reduce(x, k) by triple application of mod idempotence. -/
Formalization
Identifiers
Aliases & legacy IDs
yoneda_faithful_idyoneda-faithful-idTauLib.BookII.Enrichment.YonedaTheorem::yoneda_faithful_idRelease lines
corpus_v2corpus_v3_workingVersion & 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.