Corpus v3 · Formal theorem
cid005671
FTH0409canonicalv1preyoneda_id_tower_coherent (theorem)
/-- [II.D50] Formal proof: the pre-Yoneda embedding of the identity function is tower-coherent. preyoneda(id, x, k) = reduce(x, k), so tower coherence reduces to reduce(reduce(x, k+1), k) = reduce(x, k), which is reduction_compat. -/
Formalization
lean_axiom_freesorries: 0project axioms: 0
Identifiers
Aliases & legacy IDs
preyoneda_id_tower_coherentpreyoneda-id-tower-coherentTauLib.BookII.Regularity.PreYoneda::preyoneda_id_tower_coherentRelease 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.