Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Exact expanded PA statement
forall m n. (exists a. m = 2 * a + 1) -> (exists b. n = 2 * b) -> exists c. m + n = 2 * c + 1Structural proof guide
Generated structural guide
An odd natural plus an even natural is odd.
Use the direct prerequisites mul_add, add_succ_left as previously established PA formulas.
The proof proceeds by case analysis (2), equality transport (2), certified simplification (1).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
01Fix variables and assumptionsL1–4
02Separate the logical casesL5–6
03Construct an explicit witnessL7–7
Supply the displayed value, then prove that it has the required property.
- L7
exists x + x1