Proof of `Contextual equivalence of deterministic systems` (4th statement)
groundedproofs/Lax369799Proofs/DeterministicSyntacticOrder.lean · lax-369799
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Unfold-equivalence is preserved by context substitution. The language is constant on that equivalence, so every deterministic contextual test agrees.