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. (((forall gcrt_common_index_empty_lcm_own gcrt_common_modulus_empty_lcm_own. (exists ff_lt_gcrt_empty_lcm_own_bound. ff_lt_gcrt_empty_lcm_own_bound + S gcrt_common_index_empty_lcm_own = 0) -> (((exists ff_h_gcrt_empty_lcm_own_entry. ff_h_gcrt_empty_lcm_own_entry + S (gcrt_common_modulus_empty_lcm_own) = S ((S (gcrt_common_index_empty_lcm_own)) * c)) /\ exists ff_q_gcrt_empty_lcm_own_entry. b = ff_q_gcrt_empty_lcm_own_entry * S ((S (gcrt_common_index_empty_lcm_own)) * c) + (gcrt_common_modulus_empty_lcm_own))) -> exists gcrt_common_quotient_empty_lcm_own. 1 = gcrt_common_modulus_empty_lcm_own * gcrt_common_quotient_empty_lcm_own) /\ forall gcrt_lcm_common_empty_lcm. (forall gcrt_common_index_empty_lcm_other gcrt_common_modulus_empty_lcm_other. (exists ff_lt_gcrt_empty_lcm_other_bound. ff_lt_gcrt_empty_lcm_other_bound + S gcrt_common_index_empty_lcm_other = 0) -> (((exists ff_h_gcrt_empty_lcm_other_entry. ff_h_gcrt_empty_lcm_other_entry + S (gcrt_common_modulus_empty_lcm_other) = S ((S (gcrt_common_index_empty_lcm_other)) * c)) /\ exists ff_q_gcrt_empty_lcm_other_entry. b = ff_q_gcrt_empty_lcm_other_entry * S ((S (gcrt_common_index_empty_lcm_other)) * c) + (gcrt_common_modulus_empty_lcm_other))) -> exists gcrt_common_quotient_empty_lcm_other. gcrt_lcm_common_empty_lcm = gcrt_common_modulus_empty_lcm_other * gcrt_common_quotient_empty_lcm_other) -> exists gcrt_lcm_quotient_empty_lcm. gcrt_lcm_common_empty_lcm = 1 * gcrt_lcm_quotient_empty_lcm))Constructive proof overview
Generated structural guide
The universal-property lcm of the empty decoded modulus list is exactly one.
The unchanged tactic script uses 3 declared prerequisites and contains 19 exact native proof lines.
Alpha v34 checked-use · first admitted v24 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
le_zero Stable theorem; checked-use authorized succ_ne_zero Stable theorem; checked-use authorized one_multiple 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–2
02Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
split
03Fix variables and assumptionsL4–7
04Separate the logical casesL8–8
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L8
exfalso
05Establish hbadL9–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le zero.
06Use earlier factsL19–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
exact one_multiple
Original exact command ledger · 19 lines
- 0001
intro b - 0002
intro c - 0003
split - 0004
intro i - 0005
intro m - 0006
intro hi - 0007
intro hm - 0008
exfalso - 0009
have hbad : S i = 0 - 0010
specialize le_zero (S i) - 0011
apply le_zero - 0012
exact hi - 0013
specialize succ_ne_zero i - 0014
apply succ_ne_zero - 0015
exact hbad - 0016
intro z - 0017
intro hz - 0018
specialize one_multiple z - 0019
exact one_multiple
Separate complete second-wave branches: Full G011 proof · Alpha v27.