Proof of `Explicit thin matrix preprocessing bounds` (1st statement)
groundedproofs/Lax350013Proofs/Certificates.lean · lax-350013
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
The corresponding upstream theorem about programs of the word RAM. Direct uses of other exposed machine-level statements appear as proof-network dependencies.