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.
Statement with defined notation
∀ p. ∀ q. ∀ r. ∀ n. Odd(p) → n = p · q + r → (Even(n) → Even(q + r)) ∧ (Even(q + r) → Even(n)) ∧ ((Odd(n) → Odd(q + r)) ∧ (Odd(q + r) → Odd(n)))Every purple notation token opens its conservative definition. This is a reading surface; the compiler expands the statement before the unchanged kernel checks it.
Definitions used by this theorem
In the theorem statement
9 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall p q r n. (exists pod_odd_multiplier. p = 2 * pod_odd_multiplier + 1) -> n = p * q + r -> (((((exists pod_even_division_n_even. n = 2 * pod_even_division_n_even) -> (exists pod_even_division_qr_even. q + r = 2 * pod_even_division_qr_even)) /\ ((exists pod_even_division_qr_even. q + r = 2 * pod_even_division_qr_even) -> (exists pod_even_division_n_even. n = 2 * pod_even_division_n_even)))) /\ ((((exists pod_odd_division_n_odd. n = 2 * pod_odd_division_n_odd + 1) -> (exists pod_odd_division_qr_odd. q + r = 2 * pod_odd_division_qr_odd + 1)) /\ ((exists pod_odd_division_qr_odd. q + r = 2 * pod_odd_division_qr_odd + 1) -> (exists pod_odd_division_n_odd. n = 2 * pod_odd_division_n_odd + 1)))))Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only local propositions introduced by have or suffices are compacted. The untrusted compiler re-expands each one before the original tactic script is replayed; defined notation is never accepted by the kernel. Open the exact replay line beneath every changed command.
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 (2)
01Fix variables and assumptionsL1–6
02Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
split
03Use earlier factsL8–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L8
specialize odd_division_even_iff p - L9
specialize odd_division_even_iff q - L10
specialize odd_division_even_iff r - L11
specialize odd_division_even_iff n - L12
apply odd_division_even_iff - L13
exact hp - L14
exact hdivision - L15
specialize odd_division_odd_iff p - L16
specialize odd_division_odd_iff q - L17
specialize odd_division_odd_iff r
Original defined command ledger · 21 lines
- 0001
intro p - 0002
intro q - 0003
intro r - 0004
intro n - 0005
intro hp - 0006
intro hdivision - 0007
split - 0008
specialize odd_division_even_iff p - 0009
specialize odd_division_even_iff q - 0010
specialize odd_division_even_iff r - 0011
specialize odd_division_even_iff n - 0012
apply odd_division_even_iff - 0013
exact hp - 0014
exact hdivision - 0015
specialize odd_division_odd_iff p - 0016
specialize odd_division_odd_iff q - 0017
specialize odd_division_odd_iff r - 0018
specialize odd_division_odd_iff n - 0019
apply odd_division_odd_iff - 0020
exact hp - 0021
exact hdivision