[EPIC] Proof reconstruction module with Complex Reductions

Extend Proof Reconstruction implementation to the complex optimizations.

Acceptance Criteria:

- Recursive equivalence, constant folding, match reduction and function propagation are implemented and validated in Lean-blaster.
- Lambda lifting is implemented where feasible, with the feasibility/turnover report completed and progress demonstrated through fortnightly delivery reviews.

Particulars:

- Recursive function equivalence, resumed and hardened from the current work in progress
- Constant folding
- Match reduction and normalization
- Function propagation
- Lambda lifting as a stretch goal (if possible)
- Feasibility / turnover report (end of engagement)

Start by inspecting the existing proof reconstruction work in Lean-blaster, especially the current recursive function equivalence implementation. Map each acceptance criterion to the relevant subsystem, then confirm the scope and validation approach with maintainers; done means the listed reductions are implemented and validated, with the lambda-lifting feasibility report completed if pursued.

Written by the indexing model from the issue text.