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.
G101 was OPEN at this family's Alpha-v22 first admission: its complete anchored trace and actual terminal gcd were proved but its logarithmic bound was not. G101 is now CLOSED in Alpha v23, including the exact first-order bound steps≤2*BitLen(b)+1.
Exact theorem in conservative defined notation
∀ a. ∀ b. ∀ g. ∀ l. EuclideanExecution(a,b,g,l) → ∃ x. ∃ y. ∃ z. ContinuedFractionTrace(a,b,x,y,z,l) ∧ EuclideanStateAt(y,z,0,g,0,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 38 lines are the exact independently kernel-checked original script.
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–5
02Separate the logical casesL6–9
03Construct an explicit witnessL10–12
04Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
split
05Use earlier factsL14–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L14
exact hexecution_witness_witness_witness_left
06Establish hterminalL15–23
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply euclidean trace terminal gcd exists.
- L15
have hterminal : ∃ G. EuclideanStateAt(x1,x2,0,G,0,0) ∧ IsGCD(G,a,b)Definitions: EuclideanStateAtIsGCDOriginal native command in the exact edition - L16
specialize euclidean_trace_terminal_gcd_exists a - L17
specialize euclidean_trace_terminal_gcd_exists b - L18
specialize euclidean_trace_terminal_gcd_exists x - L19
specialize euclidean_trace_terminal_gcd_exists x1 - L20
specialize euclidean_trace_terminal_gcd_exists x2 - L21
specialize euclidean_trace_terminal_gcd_exists l - L22
apply euclidean_trace_terminal_gcd_exists - L23
exact hexecution_witness_witness_witness_left
07Separate the logical casesL24–25
08Establish hequalL26–35
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply is gcd unique.
- L26
have hequal : x3 = g - L27
specialize is_gcd_unique x3 - L28
specialize is_gcd_unique g - L29
specialize is_gcd_unique a - L30
specialize is_gcd_unique b - L31
apply is_gcd_unique - L32
exact hterminal_witness_right - L33
exact hexecution_witness_witness_witness_right - L34
rewrite hequal at hterminal_witness_left - L35
rewrite hequal at hterminal_witness_left
09Calculate and transport equalitiesL36–37
10Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
exact hterminal_witness_left
Original defined command ledger · 38 lines
- 0001
intro a - 0002
intro b - 0003
intro g - 0004
intro l - 0005
intro hexecution - 0006
cases hexecution - 0007
cases hexecution_witness - 0008
cases hexecution_witness_witness - 0009
cases hexecution_witness_witness_witness - 0010
exists x - 0011
exists x1 - 0012
exists x2 - 0013
split - 0014
exact hexecution_witness_witness_witness_left - 0015
have hterminal : exists G. ((((exists ff_h_cf_egt_identified_terminal_state. ff_h_cf_egt_identified_terminal_state + S (((G) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0)))) * S ((G) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0)))) + ((((0) + (0)) * S ((0) + (0)) + ((0) + (0))) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0))))) = S ((S (0)) * x2)) /\ exists ff_q_cf_egt_identified_terminal_state. x1 = ff_q_cf_egt_identified_terminal_state * S ((S (0)) * x2) + (((G) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0)))) * S ((G) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0)))) + ((((0) + (0)) * S ((0) + (0)) + ((0) + (0))) + (((0) + (0)) * S ((0) + (0)) + ((0) + (0))))))) /\ ((((exists hag_left_factor_egt_identified_terminal. a = G * hag_left_factor_egt_identified_terminal) /\ (exists hag_right_factor_egt_identified_terminal. b = G * hag_right_factor_egt_identified_terminal)) /\ forall hag_divisor_egt_identified_terminal. (exists hag_common_left_egt_identified_terminal. a = hag_divisor_egt_identified_terminal * hag_common_left_egt_identified_terminal) -> (exists hag_common_right_egt_identified_terminal. b = hag_divisor_egt_identified_terminal * hag_common_right_egt_identified_terminal) -> exists hag_greatest_factor_egt_identified_terminal. G = hag_divisor_egt_identified_terminal * hag_greatest_factor_egt_identified_terminal))) - 0016
specialize euclidean_trace_terminal_gcd_exists a - 0017
specialize euclidean_trace_terminal_gcd_exists b - 0018
specialize euclidean_trace_terminal_gcd_exists x - 0019
specialize euclidean_trace_terminal_gcd_exists x1 - 0020
specialize euclidean_trace_terminal_gcd_exists x2 - 0021
specialize euclidean_trace_terminal_gcd_exists l - 0022
apply euclidean_trace_terminal_gcd_exists - 0023
exact hexecution_witness_witness_witness_left - 0024
cases hterminal - 0025
cases hterminal_witness - 0026
have hequal : x3 = g - 0027
specialize is_gcd_unique x3 - 0028
specialize is_gcd_unique g - 0029
specialize is_gcd_unique a - 0030
specialize is_gcd_unique b - 0031
apply is_gcd_unique - 0032
exact hterminal_witness_right - 0033
exact hexecution_witness_witness_witness_right - 0034
rewrite hequal at hterminal_witness_left - 0035
rewrite hequal at hterminal_witness_left - 0036
rewrite hequal at hterminal_witness_left - 0037
rewrite hequal at hterminal_witness_left - 0038
exact hterminal_witness_left