gpd-formalize-rung

You can generate Lean 4 formalization scaffolds by automating the creation of explicit hypotheses, parameters, and proof obligations from specified theorem rungs. This streamlines translating complex theorems into Lean-compatible formats.

In formal methods, a theorem rung represents a specific step or proof obligation within a formalized mathematical structure. It serves as the named input basis for generating a corresponding Lean 4 formalization scaffold with associated assumptions.

Yes, formalizing theorem rungs requires both a Rust runtime and Lean 4. The Rust binary executes the scaffold generation commands, while Lean 4 provides the necessary environment for the output formalization.

You specify a theorem obligation by passing its identifier, such as OBL-000, via the command line arguments. The tool then uses this named rung to generate the corresponding Lean 4 formalization structure.

The best way to structure complex Lean 4 proofs is to generate a formalization scaffold first. This approach explicitly defines all necessary hypotheses, parameters, and proof obligations upfront, providing a clear outline before manual verification.