Proof of `Contextual equivalence of deterministic systems` (1st 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
Language membership is constant on the closed contextual classes.