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 + 1) -> exists c. m * n = 2 * c + 1Structural proof guide
Generated structural guide
The product of two odd naturals is odd.
Use the direct prerequisites mul_add, add_mul, add_assoc, add_succ_left, mul_double_right 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.
Named ingredients (1)
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 (2 * x + 1) * x1 + x
04Calculate and transport equalitiesL8–12
05Use earlier factsL13–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
apply mul_double_right
06Calculate and transport equalitiesL14–14
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L14
refl