While this submission is a draft, it cannot be used by other submissions.

Proof of `Aperiodic completeness`

groundedproofs/Lax149335Proofs/Results/GeneralCompleteness.lean · lax-149335

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Reduce to binary string outputs with the encoding of Lemma 5.6 and Lemma 5.5. Factorise the two terms as a common lift followed by drops (Lemmas 7.4 and 7.2). The two drops have the same denotation, so they are provably equivalent by Lemma 7.3 and Lemma 6.1, and the common lift is cancelled with Lemma 5.5.