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

Proof of `Contextual equivalence of deterministic systems` (5th statement)

groundedproofs/Lax369799Proofs/DeterministicSyntacticOrder.lean · lax-369799

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

Equal recognizing values remain equal in a deterministic context by associativity. Membership then agrees by the recognizing accepting set.