The fixed compiled program first reads and materializes the distinguished structural arena and then runs the verified bottom-up evaluator. Its checked embedding into $Lax808846$ also charges the terminal instruction. Lax560851's reusable predicate packages the program and the three sufficient-width premises; the underlying expanded theorem above remains inspectable.