Proof of `Contextual equivalence of deterministic systems` (2nd 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
Test the equivalence in the context consisting of a single hole. Plugging into this context preserves unfolding, and hence language membership.