Proof of `Executable modal compilation from finite Boolean tables`
groundedproofs/Lax369799Proofs/FiniteModalData.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
Encode the word condition, leaf tests and realized supports as finite Boolean tables. The executable modal compiler has the same one-step semantics as the original automaton, so priority compilation proves correctness on every finite transition system.