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 b c l g h. (((forall ppf_index_gcd_unique_firstcommon ppf_entry_gcd_unique_firstcommon. (exists pvs_gap_gcd_unique_firstcommonbound. pvs_gap_gcd_unique_firstcommonbound + S (ppf_index_gcd_unique_firstcommon) = (l)) -> (((exists ff_h_pvs_gcd_unique_firstcommonentry. ff_h_pvs_gcd_unique_firstcommonentry + S (ppf_entry_gcd_unique_firstcommon) = S ((S (ppf_index_gcd_unique_firstcommon)) * c)) /\ exists ff_q_pvs_gcd_unique_firstcommonentry. b = ff_q_pvs_gcd_unique_firstcommonentry * S ((S (ppf_index_gcd_unique_firstcommon)) * c) + (ppf_entry_gcd_unique_firstcommon))) -> (exists pvs_factor_gcd_unique_firstcommondivisor. (ppf_entry_gcd_unique_firstcommon) = (g) * pvs_factor_gcd_unique_firstcommondivisor)) /\ (forall ppf_common_gcd_unique_first. (forall ppf_index_gcd_unique_firstother ppf_entry_gcd_unique_firstother. (exists pvs_gap_gcd_unique_firstotherbound. pvs_gap_gcd_unique_firstotherbound + S (ppf_index_gcd_unique_firstother) = (l)) -> (((exists ff_h_pvs_gcd_unique_firstotherentry. ff_h_pvs_gcd_unique_firstotherentry + S (ppf_entry_gcd_unique_firstother) = S ((S (ppf_index_gcd_unique_firstother)) * c)) /\ exists ff_q_pvs_gcd_unique_firstotherentry. b = ff_q_pvs_gcd_unique_firstotherentry * S ((S (ppf_index_gcd_unique_firstother)) * c) + (ppf_entry_gcd_unique_firstother))) -> (exists pvs_factor_gcd_unique_firstotherdivisor. (ppf_entry_gcd_unique_firstother) = (ppf_common_gcd_unique_first) * pvs_factor_gcd_unique_firstotherdivisor)) -> (exists pvs_factor_gcd_unique_firstgreatest. (g) = (ppf_common_gcd_unique_first) * pvs_factor_gcd_unique_firstgreatest)))) -> (((forall ppf_index_gcd_unique_secondcommon ppf_entry_gcd_unique_secondcommon. (exists pvs_gap_gcd_unique_secondcommonbound. pvs_gap_gcd_unique_secondcommonbound + S (ppf_index_gcd_unique_secondcommon) = (l)) -> (((exists ff_h_pvs_gcd_unique_secondcommonentry. ff_h_pvs_gcd_unique_secondcommonentry + S (ppf_entry_gcd_unique_secondcommon) = S ((S (ppf_index_gcd_unique_secondcommon)) * c)) /\ exists ff_q_pvs_gcd_unique_secondcommonentry. b = ff_q_pvs_gcd_unique_secondcommonentry * S ((S (ppf_index_gcd_unique_secondcommon)) * c) + (ppf_entry_gcd_unique_secondcommon))) -> (exists pvs_factor_gcd_unique_secondcommondivisor. (ppf_entry_gcd_unique_secondcommon) = (h) * pvs_factor_gcd_unique_secondcommondivisor)) /\ (forall ppf_common_gcd_unique_second. (forall ppf_index_gcd_unique_secondother ppf_entry_gcd_unique_secondother. (exists pvs_gap_gcd_unique_secondotherbound. pvs_gap_gcd_unique_secondotherbound + S (ppf_index_gcd_unique_secondother) = (l)) -> (((exists ff_h_pvs_gcd_unique_secondotherentry. ff_h_pvs_gcd_unique_secondotherentry + S (ppf_entry_gcd_unique_secondother) = S ((S (ppf_index_gcd_unique_secondother)) * c)) /\ exists ff_q_pvs_gcd_unique_secondotherentry. b = ff_q_pvs_gcd_unique_secondotherentry * S ((S (ppf_index_gcd_unique_secondother)) * c) + (ppf_entry_gcd_unique_secondother))) -> (exists pvs_factor_gcd_unique_secondotherdivisor. (ppf_entry_gcd_unique_secondother) = (ppf_common_gcd_unique_second) * pvs_factor_gcd_unique_secondotherdivisor)) -> (exists pvs_factor_gcd_unique_secondgreatest. (h) = (ppf_common_gcd_unique_second) * pvs_factor_gcd_unique_secondgreatest)))) -> g = hConstructive proof overview
Generated structural guide
The finite exponent gcd is literally unique by mutual actual divisibility.
The unchanged tactic script uses 1 declared prerequisite and contains 18 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
multiple_antisymm 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–7
02Separate the logical casesL8–9
03Use earlier factsL10–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 18 lines
- 0001
intro b - 0002
intro c - 0003
intro l - 0004
intro g - 0005
intro h - 0006
intro hfirst - 0007
intro hsecond - 0008
cases hfirst - 0009
cases hsecond - 0010
specialize multiple_antisymm (g) - 0011
specialize multiple_antisymm (h) - 0012
apply multiple_antisymm - 0013
specialize hsecond_right (g) - 0014
apply hsecond_right - 0015
exact hfirst_left - 0016
specialize hfirst_right (h) - 0017
apply hfirst_right - 0018
exact hsecond_left