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 b c l. (forall fsri_index_bounded_source. (exists fsri_gap_bounded_source_index. fsri_gap_bounded_source_index + S (fsri_index_bounded_source) = (l)) -> exists fsri_quotient_bounded_source fsri_residue_bounded_source. (fsri_index_bounded_source * fsri_index_bounded_source = (p) * fsri_quotient_bounded_source + fsri_residue_bounded_source /\ ((exists fsri_gap_bounded_source_residue. fsri_gap_bounded_source_residue + S (fsri_residue_bounded_source) = (p)) /\ (((exists fsri_height_bounded_source_entry. fsri_height_bounded_source_entry + S (fsri_residue_bounded_source) = S ((S (fsri_index_bounded_source)) * (c))) /\ exists fsri_quotient_bounded_source_entry. (b) = fsri_quotient_bounded_source_entry * S ((S (fsri_index_bounded_source)) * (c)) + (fsri_residue_bounded_source)))))) -> (forall fom_index_fsri_bounded_result. (exists fom_gap_fsri_bounded_result_index_bound. fom_gap_fsri_bounded_result_index_bound + S (fom_index_fsri_bounded_result) = l) -> exists fom_value_fsri_bounded_result. ((((exists fom_beta_height_fsri_bounded_result_entry. fom_beta_height_fsri_bounded_result_entry + S (fom_value_fsri_bounded_result) = S ((S (fom_index_fsri_bounded_result)) * c)) /\ exists fom_beta_quotient_fsri_bounded_result_entry. b = fom_beta_quotient_fsri_bounded_result_entry * S ((S (fom_index_fsri_bounded_result)) * c) + (fom_value_fsri_bounded_result))) /\ (exists fom_gap_fsri_bounded_result_value_bound. fom_gap_fsri_bounded_result_value_bound + S (fom_value_fsri_bounded_result) = p)))Constructive proof overview
Generated structural guide
Every canonical square-residue prefix is pointwise bounded by its modulus.
The unchanged tactic script uses 0 declared prerequisites and contains 19 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
Historical empty-context replay experiment only; that experiment persisted no certificate and granted no release authority. Current checked use follows separately sealed, independently verified proof bundles; there is no Stable promotion.
Proof neighborhood
Direct dependencies
Direct 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–7
02Use earlier factsL8–8
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L8
specialize hprefix i
03Establish hpointL9–11
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hprefix.
- L9
have hpoint : exists q r. (i * i = p * q + r /\ ((exists fsri_gap_bounded_point. fsri_gap_bounded_point + S (r) = (p)) /\ (((exists fsri_height_bounded_entry. fsri_height_bounded_entry + S (r) = S ((S (i)) * (c))) /\ exists fsri_quotient_bounded_entry. (b) = fsri_quotient_bounded_entry * S ((S (i)) * (c)) + (r))))) - L10
apply hprefix - L11
exact hi
04Separate the logical casesL12–15
05Construct an explicit witnessL16–16
Supply the displayed value, then prove that it has the required property.
- L16
exists x1
06Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
split
Original exact command ledger · 19 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro l - 0005
intro hprefix - 0006
intro i - 0007
intro hi - 0008
specialize hprefix i - 0009
have hpoint : exists q r. (i * i = p * q + r /\ ((exists fsri_gap_bounded_point. fsri_gap_bounded_point + S (r) = (p)) /\ (((exists fsri_height_bounded_entry. fsri_height_bounded_entry + S (r) = S ((S (i)) * (c))) /\ exists fsri_quotient_bounded_entry. (b) = fsri_quotient_bounded_entry * S ((S (i)) * (c)) + (r))))) - 0010
apply hprefix - 0011
exact hi - 0012
cases hpoint - 0013
cases hpoint_witness - 0014
cases hpoint_witness_witness - 0015
cases hpoint_witness_witness_right - 0016
exists x1 - 0017
split - 0018
exact hpoint_witness_witness_right_right - 0019
exact hpoint_witness_witness_right_left