Proof of `Correctness and complexity of the reduction` (1st statement)
groundedproofs/Lax689614Proofs/FalseSimulation.lean · lax-689614
What this proof establishes
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
False responds to each regular move by following a winning CNF strategy. An exhausted clause supplies a zero-valued exceptional reply. Nonregular moves are losing deviations, including the exceptional move at odd parity.