Proof of `Executable compilation of modal priority equations` (1st statement)
groundedproofs/Lax369799Proofs/PriorityCompilation.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
Induct over the priority binders, using formula substitution and scalar elimination of each finite simultaneous fixed point.