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
∀ a. ∀ e. ∀ n. e = 1 → Pow(a,e,n) → n = aEvery purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.
Definitions used by this theorem
In the theorem statement
1 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall a e n. e = 1 -> (exists ff_b_one ff_c_one. ((forall ff_i_one_repeat. (exists ff_lt_one_repeat_bound. ff_lt_one_repeat_bound + S ff_i_one_repeat = e) -> (((exists ff_h_one_repeat_decoded. ff_h_one_repeat_decoded + S (a) = S ((S (ff_i_one_repeat)) * ff_c_one)) /\ exists ff_q_one_repeat_decoded. ff_b_one = ff_q_one_repeat_decoded * S ((S (ff_i_one_repeat)) * ff_c_one) + (a)))) /\ (exists ff_u_one_product ff_v_one_product. ((((exists ff_h_one_product_start. ff_h_one_product_start + S (1) = S ((S (0)) * ff_v_one_product)) /\ exists ff_q_one_product_start. ff_u_one_product = ff_q_one_product_start * S ((S (0)) * ff_v_one_product) + (1))) /\ ((((exists ff_h_one_product_terminal. ff_h_one_product_terminal + S (n) = S ((S (e)) * ff_v_one_product)) /\ exists ff_q_one_product_terminal. ff_u_one_product = ff_q_one_product_terminal * S ((S (e)) * ff_v_one_product) + (n))) /\ forall ff_i_one_product. (exists ff_lt_one_product_bound. ff_lt_one_product_bound + S ff_i_one_product = e) -> exists ff_p_one_product ff_r_one_product ff_s_one_product. ((((exists ff_h_one_product_factor. ff_h_one_product_factor + S (ff_p_one_product) = S ((S (ff_i_one_product)) * ff_c_one)) /\ exists ff_q_one_product_factor. ff_b_one = ff_q_one_product_factor * S ((S (ff_i_one_product)) * ff_c_one) + (ff_p_one_product))) /\ ((((exists ff_h_one_product_partial. ff_h_one_product_partial + S (ff_r_one_product) = S ((S (ff_i_one_product)) * ff_v_one_product)) /\ exists ff_q_one_product_partial. ff_u_one_product = ff_q_one_product_partial * S ((S (ff_i_one_product)) * ff_v_one_product) + (ff_r_one_product))) /\ ((((exists ff_h_one_product_successor. ff_h_one_product_successor + S (ff_s_one_product) = S ((S (S ff_i_one_product)) * ff_v_one_product)) /\ exists ff_q_one_product_successor. ff_u_one_product = ff_q_one_product_successor * S ((S (S ff_i_one_product)) * ff_v_one_product) + (ff_s_one_product))) /\ ff_s_one_product = ff_r_one_product * ff_p_one_product)))))))) -> n = aProof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic script.
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–5
02Use earlier factsL6–10
03Calculate and transport equalitiesL11–11
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L11
refl
Original defined command ledger · 13 lines
- 0001
intro a - 0002
intro e - 0003
intro n - 0004
intro he - 0005
intro hpow - 0006
specialize pow_one_from_zero_successor a - 0007
specialize pow_one_from_zero_successor 0 - 0008
specialize pow_one_from_zero_successor e - 0009
specialize pow_one_from_zero_successor n - 0010
apply pow_one_from_zero_successor - 0011
refl - 0012
exact he - 0013
exact hpow