Corpus formal_theorem canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Formal theorem cid005655FTH0393canonicalv1

decode_code_roundtrip (theorem)

/-- [II.T35] Formal proof: Code . Decode = id for any table. This follows from reduce(reduce(a, k), k) = reduce(a, k). -/

Formalization

lean_axiom_freesorries: 0project axioms: 0
  • ModuleTauLib.BookII.Regularity.CodeDecode
  • Declarationdecode_code_roundtrip
  • Lean toolchainleanprover/lean4:v4.x.x

Identifiers

  • Corpus ID cid005655
  • Primary alias FTH0393
  • Type Formal theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

decode_code_roundtripdecode-code-roundtripTauLib.BookII.Regularity.CodeDecode::decode_code_roundtrip

Release lines

corpus_v2corpus_v3_working

Version & History

  • v1 · 2026-05-10 imported from v2 taulib declarations

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.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert