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 r s b c l i a d m n g. (forall gcomp_left_index_gcomp_last_source gcomp_right_index_gcomp_last_source gcomp_left_residue_gcomp_last_source gcomp_right_residue_gcomp_last_source gcomp_left_modulus_gcomp_last_source gcomp_right_modulus_gcomp_last_source gcomp_pair_gcd_gcomp_last_source. (exists ff_lt_gcrt_gcomp_last_source_left_bound. ff_lt_gcrt_gcomp_last_source_left_bound + S gcomp_left_index_gcomp_last_source = S l) -> (exists ff_lt_gcrt_gcomp_last_source_right_bound. ff_lt_gcrt_gcomp_last_source_right_bound + S gcomp_right_index_gcomp_last_source = S l) -> (((exists ff_h_gcrt_gcomp_last_source_left_residue. ff_h_gcrt_gcomp_last_source_left_residue + S (gcomp_left_residue_gcomp_last_source) = S ((S (gcomp_left_index_gcomp_last_source)) * s)) /\ exists ff_q_gcrt_gcomp_last_source_left_residue. r = ff_q_gcrt_gcomp_last_source_left_residue * S ((S (gcomp_left_index_gcomp_last_source)) * s) + (gcomp_left_residue_gcomp_last_source))) -> (((exists ff_h_gcrt_gcomp_last_source_right_residue. ff_h_gcrt_gcomp_last_source_right_residue + S (gcomp_right_residue_gcomp_last_source) = S ((S (gcomp_right_index_gcomp_last_source)) * s)) /\ exists ff_q_gcrt_gcomp_last_source_right_residue. r = ff_q_gcrt_gcomp_last_source_right_residue * S ((S (gcomp_right_index_gcomp_last_source)) * s) + (gcomp_right_residue_gcomp_last_source))) -> (((exists ff_h_gcrt_gcomp_last_source_left_modulus. ff_h_gcrt_gcomp_last_source_left_modulus + S (gcomp_left_modulus_gcomp_last_source) = S ((S (gcomp_left_index_gcomp_last_source)) * c)) /\ exists ff_q_gcrt_gcomp_last_source_left_modulus. b = ff_q_gcrt_gcomp_last_source_left_modulus * S ((S (gcomp_left_index_gcomp_last_source)) * c) + (gcomp_left_modulus_gcomp_last_source))) -> (((exists ff_h_gcrt_gcomp_last_source_right_modulus. ff_h_gcrt_gcomp_last_source_right_modulus + S (gcomp_right_modulus_gcomp_last_source) = S ((S (gcomp_right_index_gcomp_last_source)) * c)) /\ exists ff_q_gcrt_gcomp_last_source_right_modulus. b = ff_q_gcrt_gcomp_last_source_right_modulus * S ((S (gcomp_right_index_gcomp_last_source)) * c) + (gcomp_right_modulus_gcomp_last_source))) -> ((((exists hag_left_factor_gcomp_gcomp_last_source_gcd. gcomp_left_modulus_gcomp_last_source = gcomp_pair_gcd_gcomp_last_source * hag_left_factor_gcomp_gcomp_last_source_gcd) /\ (exists hag_right_factor_gcomp_gcomp_last_source_gcd. gcomp_right_modulus_gcomp_last_source = gcomp_pair_gcd_gcomp_last_source * hag_right_factor_gcomp_gcomp_last_source_gcd)) /\ forall hag_divisor_gcomp_gcomp_last_source_gcd. (exists hag_common_left_gcomp_gcomp_last_source_gcd. gcomp_left_modulus_gcomp_last_source = hag_divisor_gcomp_gcomp_last_source_gcd * hag_common_left_gcomp_gcomp_last_source_gcd) -> (exists hag_common_right_gcomp_gcomp_last_source_gcd. gcomp_right_modulus_gcomp_last_source = hag_divisor_gcomp_gcomp_last_source_gcd * hag_common_right_gcomp_gcomp_last_source_gcd) -> exists hag_greatest_factor_gcomp_gcomp_last_source_gcd. gcomp_pair_gcd_gcomp_last_source = hag_divisor_gcomp_gcomp_last_source_gcd * hag_greatest_factor_gcomp_gcomp_last_source_gcd)) -> (exists hgcrt_mod_left_gcrt_gcomp_last_source_result hgcrt_mod_right_gcrt_gcomp_last_source_result. gcomp_left_residue_gcomp_last_source + gcomp_pair_gcd_gcomp_last_source * hgcrt_mod_left_gcrt_gcomp_last_source_result = gcomp_right_residue_gcomp_last_source + gcomp_pair_gcd_gcomp_last_source * hgcrt_mod_right_gcrt_gcomp_last_source_result)) -> (exists ff_lt_gcrt_gcomp_last_old_bound. ff_lt_gcrt_gcomp_last_old_bound + S i = l) -> (((exists ff_h_gcrt_gcomp_last_old_residue. ff_h_gcrt_gcomp_last_old_residue + S (a) = S ((S (i)) * s)) /\ exists ff_q_gcrt_gcomp_last_old_residue. r = ff_q_gcrt_gcomp_last_old_residue * S ((S (i)) * s) + (a))) -> (((exists ff_h_gcrt_gcomp_last_new_residue. ff_h_gcrt_gcomp_last_new_residue + S (d) = S ((S (l)) * s)) /\ exists ff_q_gcrt_gcomp_last_new_residue. r = ff_q_gcrt_gcomp_last_new_residue * S ((S (l)) * s) + (d))) -> (((exists ff_h_gcrt_gcomp_last_old_modulus. ff_h_gcrt_gcomp_last_old_modulus + S (m) = S ((S (i)) * c)) /\ exists ff_q_gcrt_gcomp_last_old_modulus. b = ff_q_gcrt_gcomp_last_old_modulus * S ((S (i)) * c) + (m))) -> (((exists ff_h_gcrt_gcomp_last_new_modulus. ff_h_gcrt_gcomp_last_new_modulus + S (n) = S ((S (l)) * c)) /\ exists ff_q_gcrt_gcomp_last_new_modulus. b = ff_q_gcrt_gcomp_last_new_modulus * S ((S (l)) * c) + (n))) -> ((((exists hag_left_factor_gcomp_last_actual_gcd. m = g * hag_left_factor_gcomp_last_actual_gcd) /\ (exists hag_right_factor_gcomp_last_actual_gcd. n = g * hag_right_factor_gcomp_last_actual_gcd)) /\ forall hag_divisor_gcomp_last_actual_gcd. (exists hag_common_left_gcomp_last_actual_gcd. m = hag_divisor_gcomp_last_actual_gcd * hag_common_left_gcomp_last_actual_gcd) -> (exists hag_common_right_gcomp_last_actual_gcd. n = hag_divisor_gcomp_last_actual_gcd * hag_common_right_gcomp_last_actual_gcd) -> exists hag_greatest_factor_gcomp_last_actual_gcd. g = hag_divisor_gcomp_last_actual_gcd * hag_greatest_factor_gcomp_last_actual_gcd)) -> (exists hgcrt_mod_left_gcrt_gcomp_last_result hgcrt_mod_right_gcrt_gcomp_last_result. a + g * hgcrt_mod_left_gcrt_gcomp_last_result = d + g * hgcrt_mod_right_gcrt_gcomp_last_result)Constructive proof overview
Generated structural guide
The last residue of a compatible successor list is gcd-compatible with each earlier actual decoded pair.
The unchanged tactic script uses 2 declared prerequisites and contains 37 exact native proof lines.
Alpha v34 checked-use · first admitted v25 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
le_succ Stable theorem; checked-use authorized le_refl Stable 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–10
02Fix variables and assumptionsL11–18
03Use earlier factsL19–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 37 lines
- 0001
intro r - 0002
intro s - 0003
intro b - 0004
intro c - 0005
intro l - 0006
intro i - 0007
intro a - 0008
intro d - 0009
intro m - 0010
intro n - 0011
intro g - 0012
intro hpairs - 0013
intro hi - 0014
intro ha - 0015
intro hd - 0016
intro hm - 0017
intro hn - 0018
intro hg - 0019
specialize hpairs i - 0020
specialize hpairs l - 0021
specialize hpairs a - 0022
specialize hpairs d - 0023
specialize hpairs m - 0024
specialize hpairs n - 0025
specialize hpairs g - 0026
apply hpairs - 0027
specialize le_succ (S i) - 0028
specialize le_succ l - 0029
apply le_succ - 0030
exact hi - 0031
specialize le_refl (S l) - 0032
exact le_refl - 0033
exact ha - 0034
exact hd - 0035
exact hm - 0036
exact hn - 0037
exact hg
Separate complete second-wave branches: Full G011 proof · Alpha v27.