Proof of `Variable exits of unary systems` (2nd statement)
groundedproofs/Lax369799Proofs/UnarySystems.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
Every deterministic resolution uses at most one variable, so it lifts to that variable's copy. If it has no exit, choose any copy. Forgetting the copy index gives the converse, for initial and root resolutions alike.