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.
The exact G102 milestone is fully proved for every natural exponent and every modulus greater than one, including actual canonical digits, a beta-coded accumulator execution, modular-power correctness, and the formal bound k≤3·BitLen(e)+2. The independent T13 determinant/rank/integer-span substrate is now closed in the separate Alpha-v27 integer-linear-algebra branch. Full T13 proof · Alpha v27
Exact theorem in conservative defined notation
∀ n. ∀ l. BitLen(n,l) → ∃ x. ∃ y. BinaryExponentDigitCode(n,l,x,y)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 16 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 (2)
01Fix variables and assumptionsL1–3
02Establish hupperL4–8
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply binary length upper power bound.
03Separate the logical casesL9–10
04Use earlier factsL11–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 16 lines
- 0001
intro n - 0002
intro l - 0003
intro hlength - 0004
have hupper : exists p. ((exists pa_b_bl_bd_exact_upper pa_c_bl_bd_exact_upper. ((forall pa_i_bl_bd_exact_upper_repeat. (exists pa_lt_bl_bd_exact_upper_repeat_bound. pa_lt_bl_bd_exact_upper_repeat_bound + S pa_i_bl_bd_exact_upper_repeat = l) -> (((exists pa_h_bl_bd_exact_upper_repeat_decoded. pa_h_bl_bd_exact_upper_repeat_decoded + S (2) = S ((S (pa_i_bl_bd_exact_upper_repeat)) * pa_c_bl_bd_exact_upper)) /\ exists pa_q_bl_bd_exact_upper_repeat_decoded. pa_b_bl_bd_exact_upper = pa_q_bl_bd_exact_upper_repeat_decoded * S ((S (pa_i_bl_bd_exact_upper_repeat)) * pa_c_bl_bd_exact_upper) + (2)))) /\ (exists pa_u_bl_bd_exact_upper_product pa_v_bl_bd_exact_upper_product. ((((exists pa_h_bl_bd_exact_upper_product_start. pa_h_bl_bd_exact_upper_product_start + S (1) = S ((S (0)) * pa_v_bl_bd_exact_upper_product)) /\ exists pa_q_bl_bd_exact_upper_product_start. pa_u_bl_bd_exact_upper_product = pa_q_bl_bd_exact_upper_product_start * S ((S (0)) * pa_v_bl_bd_exact_upper_product) + (1))) /\ ((((exists pa_h_bl_bd_exact_upper_product_terminal. pa_h_bl_bd_exact_upper_product_terminal + S (p) = S ((S (l)) * pa_v_bl_bd_exact_upper_product)) /\ exists pa_q_bl_bd_exact_upper_product_terminal. pa_u_bl_bd_exact_upper_product = pa_q_bl_bd_exact_upper_product_terminal * S ((S (l)) * pa_v_bl_bd_exact_upper_product) + (p))) /\ forall pa_i_bl_bd_exact_upper_product. (exists pa_lt_bl_bd_exact_upper_product_bound. pa_lt_bl_bd_exact_upper_product_bound + S pa_i_bl_bd_exact_upper_product = l) -> exists pa_p_bl_bd_exact_upper_product pa_r_bl_bd_exact_upper_product pa_s_bl_bd_exact_upper_product. ((((exists pa_h_bl_bd_exact_upper_product_factor. pa_h_bl_bd_exact_upper_product_factor + S (pa_p_bl_bd_exact_upper_product) = S ((S (pa_i_bl_bd_exact_upper_product)) * pa_c_bl_bd_exact_upper)) /\ exists pa_q_bl_bd_exact_upper_product_factor. pa_b_bl_bd_exact_upper = pa_q_bl_bd_exact_upper_product_factor * S ((S (pa_i_bl_bd_exact_upper_product)) * pa_c_bl_bd_exact_upper) + (pa_p_bl_bd_exact_upper_product))) /\ ((((exists pa_h_bl_bd_exact_upper_product_partial. pa_h_bl_bd_exact_upper_product_partial + S (pa_r_bl_bd_exact_upper_product) = S ((S (pa_i_bl_bd_exact_upper_product)) * pa_v_bl_bd_exact_upper_product)) /\ exists pa_q_bl_bd_exact_upper_product_partial. pa_u_bl_bd_exact_upper_product = pa_q_bl_bd_exact_upper_product_partial * S ((S (pa_i_bl_bd_exact_upper_product)) * pa_v_bl_bd_exact_upper_product) + (pa_r_bl_bd_exact_upper_product))) /\ ((((exists pa_h_bl_bd_exact_upper_product_successor. pa_h_bl_bd_exact_upper_product_successor + S (pa_s_bl_bd_exact_upper_product) = S ((S (S pa_i_bl_bd_exact_upper_product)) * pa_v_bl_bd_exact_upper_product)) /\ exists pa_q_bl_bd_exact_upper_product_successor. pa_u_bl_bd_exact_upper_product = pa_q_bl_bd_exact_upper_product_successor * S ((S (S pa_i_bl_bd_exact_upper_product)) * pa_v_bl_bd_exact_upper_product) + (pa_s_bl_bd_exact_upper_product))) /\ pa_s_bl_bd_exact_upper_product = pa_r_bl_bd_exact_upper_product * pa_p_bl_bd_exact_upper_product)))))))) /\ (exists gap. gap + S n = p)) - 0005
specialize binary_length_upper_power_bound n - 0006
specialize binary_length_upper_power_bound l - 0007
apply binary_length_upper_power_bound - 0008
exact hlength - 0009
cases hupper - 0010
cases hupper_witness - 0011
specialize binary_digit_bounded_prefix_exists l - 0012
specialize binary_digit_bounded_prefix_exists x - 0013
specialize binary_digit_bounded_prefix_exists n - 0014
apply binary_digit_bounded_prefix_exists - 0015
exact hupper_witness_left - 0016
exact hupper_witness_right