Proof of `Unary types preserving explicit choices` (1st statement)
groundedproofs/Lax369799Proofs/ChoicePreservingUnary.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
Push each eligible unary prefix through choices. The accepting set tests a choice by testing both summands, leaving precisely the finite paths.