Proof of `Substitution in modal fixed-point formulas` (1st statement)
groundedproofs/Lax369799Proofs/MuSubstitution.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
Induction on syntax; under either binder, the newly bound variable is fixed and the remaining environment is composed with the renaming.