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 first-order arithmetic statement
forall p s r l. l = S s * S s -> ((~(p = 1) /\ forall frm_prime_left_ftrg_prime frm_prime_right_ftrg_prime. p = frm_prime_left_ftrg_prime * frm_prime_right_ftrg_prime -> frm_prime_left_ftrg_prime = 1 \/ frm_prime_right_ftrg_prime = 1)) -> exists b c. (forall ftrg_index_square_grid. (exists ftrg_gap_square_grid_index. ftrg_gap_square_grid_index + S (ftrg_index_square_grid) = (l)) -> exists ftrg_row_square_grid ftrg_column_square_grid ftrg_quotient_square_grid ftrg_remainder_square_grid. ((ftrg_index_square_grid) = (S s) * ftrg_row_square_grid + ftrg_column_square_grid /\ ((exists ftrg_gap_square_grid_column. ftrg_gap_square_grid_column + S (ftrg_column_square_grid) = (S s)) /\ ((r * ftrg_row_square_grid + ftrg_column_square_grid = (p) * ftrg_quotient_square_grid + ftrg_remainder_square_grid) /\ ((exists ftrg_gap_square_grid_residue. ftrg_gap_square_grid_residue + S (ftrg_remainder_square_grid) = (p)) /\ (((exists ff_h_ftrg_square_grid_entry. ff_h_ftrg_square_grid_entry + S (ftrg_remainder_square_grid) = S ((S (ftrg_index_square_grid)) * c)) /\ exists ff_q_ftrg_square_grid_entry. b = ff_q_ftrg_square_grid_entry * S ((S (ftrg_index_square_grid)) * c) + (ftrg_remainder_square_grid))))))))Constructive proof overview
Generated structural guide
A prime floor-square grid admits a canonical beta-coded affine residue map on all successor-square points.
The unchanged tactic script uses 3 declared prerequisites and contains 18 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
prime_nonzero Stable theorem; checked-use authorized succ_ne_zero Stable theorem; checked-use authorized TS000W beta_affine_residue_grid_existsDirect 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.
Named ingredients (1)
01Fix variables and assumptionsL1–6
02Use earlier factsL7–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
03Fix variables and assumptionsL12–12
Work with arbitrary variables or the premises of the current implication.
- L12
intro hpzero
Original exact command ledger · 18 lines
- 0001
intro p - 0002
intro s - 0003
intro r - 0004
intro l - 0005
intro hlength - 0006
intro hprime - 0007
specialize beta_affine_residue_grid_exists p - 0008
specialize beta_affine_residue_grid_exists (S s) - 0009
specialize beta_affine_residue_grid_exists r - 0010
specialize beta_affine_residue_grid_exists l - 0011
apply beta_affine_residue_grid_exists - 0012
intro hpzero - 0013
specialize prime_nonzero p - 0014
apply prime_nonzero - 0015
exact hprime - 0016
exact hpzero - 0017
specialize succ_ne_zero s - 0018
exact succ_ne_zero