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 expanded first-order arithmetic statement
forall p a r. (~((p) = 1) /\ forall pfa_factor_left_scalar_equal_prime pfa_factor_right_scalar_equal_prime. (p) = pfa_factor_left_scalar_equal_prime * pfa_factor_right_scalar_equal_prime -> pfa_factor_left_scalar_equal_prime = 1 \/ pfa_factor_right_scalar_equal_prime = 1) -> (((exists pfa_gap_scalar_equal_sumleft. pfa_gap_scalar_equal_sumleft + S (a) = (p)) /\ (((exists pfa_gap_scalar_equal_sumright. pfa_gap_scalar_equal_sumright + S (r) = (p)) /\ ((((exists pfa_gap_scalar_equal_sumresultbound. pfa_gap_scalar_equal_sumresultbound + S (a) = (p)) /\ ((exists pfa_offset_left_scalar_equal_sumresultcongruence pfa_offset_right_scalar_equal_sumresultcongruence. ((a) + (r)) + (p) * pfa_offset_left_scalar_equal_sumresultcongruence = (a) + (p) * pfa_offset_right_scalar_equal_sumresultcongruence))))))))) -> r=0Constructive proof overview
Generated structural guide
The genuine bounded difference of a canonical coefficient from itself is natural zero.
The unchanged tactic script uses 2 declared prerequisites and contains 18 exact native proof lines.
Alpha v34 checked-use · first admitted v32 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
prime_field_add_cancel_left Alpha theorem; checked-use authorized prime_field_add_zero_right Alpha theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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.
01Fix variables and assumptionsL1–5
02Use earlier factsL6–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L6
specialize prime_field_add_cancel_left (p) - L7
specialize prime_field_add_cancel_left (a) - L8
specialize prime_field_add_cancel_left (r) - L9
specialize prime_field_add_cancel_left (0) - L10
specialize prime_field_add_cancel_left (a) - L11
apply prime_field_add_cancel_left - L12
exact h - L13
specialize prime_field_add_zero_right (p) - L14
specialize prime_field_add_zero_right (a) - L15
apply prime_field_add_zero_right
03Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
exact hp
04Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases h
05Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
exact h_left
Original exact command ledger · 18 lines
- 0001
intro p - 0002
intro a - 0003
intro r - 0004
intro hp - 0005
intro h - 0006
specialize prime_field_add_cancel_left (p) - 0007
specialize prime_field_add_cancel_left (a) - 0008
specialize prime_field_add_cancel_left (r) - 0009
specialize prime_field_add_cancel_left (0) - 0010
specialize prime_field_add_cancel_left (a) - 0011
apply prime_field_add_cancel_left - 0012
exact h - 0013
specialize prime_field_add_zero_right (p) - 0014
specialize prime_field_add_zero_right (a) - 0015
apply prime_field_add_zero_right - 0016
exact hp - 0017
cases h - 0018
exact h_left