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 psc_odd_odd_sum. m + n = 2 * psc_odd_odd_sum + 1) -> ((((exists psc_even_even_m. m = 2 * psc_even_even_m) /\ (exists psc_odd_odd_n. n = 2 * psc_odd_odd_n + 1)) \/ ((exists psc_odd_odd_m. m = 2 * psc_odd_odd_m + 1) /\ (exists psc_even_even_n. n = 2 * psc_even_even_n))))) /\ (((((exists psc_even_even_m. m = 2 * psc_even_even_m) /\ (exists psc_odd_odd_n. n = 2 * psc_odd_odd_n + 1)) \/ ((exists psc_odd_odd_m. m = 2 * psc_odd_odd_m + 1) /\ (exists psc_even_even_n. n = 2 * psc_even_even_n)))) -> (exists psc_odd_odd_sum. m + n = 2 * psc_odd_odd_sum + 1)))Structural proof guide
Generated structural guide
A sum is odd exactly when its summands have opposite parity.
Use the direct prerequisites odd_sum_parity_cases, even_add_odd, odd_add_even as previously established PA formulas.
The proof proceeds by case analysis (3).
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 Alpha-v25 checked-use theorem is independently kernel-checked when replayed; it is not a Stable theorem.
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 (3)
01Fix variables and assumptionsL1–2
02Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
split
03Fix variables and assumptionsL4–4
Work with arbitrary variables or the premises of the current implication.
- L4
intro hsum
04Use earlier factsL5–8
05Fix variables and assumptionsL9–9
Work with arbitrary variables or the premises of the current implication.
- L9
intro hopposite
06Separate the logical casesL10–11
07Use earlier factsL12–16
08Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hopposite_right
Original exact command ledger · 22 lines
- 0001
intro m - 0002
intro n - 0003
split - 0004
intro hsum - 0005
specialize odd_sum_parity_cases m - 0006
specialize odd_sum_parity_cases n - 0007
apply odd_sum_parity_cases - 0008
exact hsum - 0009
intro hopposite - 0010
cases hopposite - 0011
cases hopposite_left - 0012
specialize even_add_odd m - 0013
specialize even_add_odd n - 0014
apply even_add_odd - 0015
exact hopposite_left_left - 0016
exact hopposite_left_right - 0017
cases hopposite_right - 0018
specialize odd_add_even m - 0019
specialize odd_add_even n - 0020
apply odd_add_even - 0021
exact hopposite_right_left - 0022
exact hopposite_right_right