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. ∀ h. p = 2 · h + 1 → (Even(h) → Mod4One(p)) ∧ (Mod4One(p) → Even(h))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
4 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall p h. p = 2 * h + 1 -> ((((exists poh_even_half. h = 2 * poh_even_half) -> (exists poh_one_modulus. p = 4 * poh_one_modulus + 1)) /\ ((exists poh_one_modulus. p = 4 * poh_one_modulus + 1) -> (exists poh_even_half. h = 2 * poh_even_half))))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–3
02Separate the logical casesL4–4
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L4
split
03Fix variables and assumptionsL5–5
Work with arbitrary variables or the premises of the current implication.
- L5
intro heven
04Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
cases heven
05Construct an explicit witnessL7–7
Supply the displayed value, then prove that it has the required property.
- L7
exists x
06Calculate and transport equalitiesL8–11
07Use earlier factsL12–12
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L12
apply four_mul_eq_double_double
08Calculate and transport equalitiesL13–13
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L13
refl
09Fix variables and assumptionsL14–14
Work with arbitrary variables or the premises of the current implication.
- L14
intro hone
10Separate the logical casesL15–15
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L15
cases hone
11Construct an explicit witnessL16–16
Supply the displayed value, then prove that it has the required property.
- L16
exists x
12Use earlier factsL17–22
Original defined command ledger · 22 lines
- 0001
intro p - 0002
intro h - 0003
intro hp - 0004
split - 0005
intro heven - 0006
cases heven - 0007
exists x - 0008
rewrite hp - 0009
rewrite heven_witness - 0010
congr - 0011
symm - 0012
apply four_mul_eq_double_double - 0013
refl - 0014
intro hone - 0015
cases hone - 0016
exists x - 0017
specialize odd_half_of_mod4_one_exact p - 0018
specialize odd_half_of_mod4_one_exact h - 0019
specialize odd_half_of_mod4_one_exact x - 0020
apply odd_half_of_mod4_one_exact - 0021
exact hp - 0022
exact hone_witness