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 carry relation contains actual quotient columns and carry bits, not the desired valuation. The theorem includes all finite lists and zero parts. It uses sequential binary-column carries; a separate simultaneous-grid or permutation-invariance theorem is not asserted.
Exact theorem in conservative defined notation
∀ p. ∀ b. ∀ c. ∀ vb. ∀ vc. ∀ l. ∀ a. ∀ e. BetaValuationPrefix(p,b,c,vb,vc,S l) → BetaAt(b,c,l,a) → BetaAt(vb,vc,l,e) → BoundedPowerValuation(p,a,a,e)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 49 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay 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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro he
03Establish hpointL12–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply h.
- L12
have hpoint : ∃ mkm_value_last_point. ∃ mkm_exponent_last_point. BetaAt(b,c,l,mkm_value_last_point) ∧ (BetaAt(vb,vc,l,mkm_exponent_last_point) ∧ BoundedPowerValuation(p,mkm_value_last_point,mkm_value_last_point,mkm_exponent_last_point))Definitions: BetaAt(b,c,l,mkm_value_last_point)BetaAt(vb,vc,l,mkm_exponent_last_point)BoundedPowerValuation(p,mkm_value_last_point,mkm_value_last_point,mkm_exponent_last_point)Original native command in the exact edition - L13
specialize h l - L14
apply h - L15
specialize le_refl (S l) - L16
apply le_refl
04Separate the logical casesL17–20
05Establish hvalueL21–29
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
06Establish hexponentL30–39
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
- L30
have hexponent : x1 = e - L31
specialize beta_at_unique vb - L32
specialize beta_at_unique vc - L33
specialize beta_at_unique l - L34
specialize beta_at_unique x1 - L35
specialize beta_at_unique e - L36
apply beta_at_unique - L37
exact hpoint_witness_witness_right_left - L38
exact he - L39
rewrite hvalue at hpoint_witness_witness_right_right
07Calculate and transport equalitiesL40–48
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L40
rewrite hvalue at hpoint_witness_witness_right_right - L41
rewrite hvalue at hpoint_witness_witness_right_right - L42
rewrite hvalue at hpoint_witness_witness_right_right - L43
rewrite hexponent at hpoint_witness_witness_right_right - L44
rewrite hexponent at hpoint_witness_witness_right_right - L45
rewrite hexponent at hpoint_witness_witness_right_right - L46
rewrite hexponent at hpoint_witness_witness_right_right - L47
rewrite hexponent at hpoint_witness_witness_right_right - L48
rewrite hexponent at hpoint_witness_witness_right_right
08Use earlier factsL49–49
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L49
exact hpoint_witness_witness_right_right
Original defined command ledger · 49 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro vb - 0005
intro vc - 0006
intro l - 0007
intro a - 0008
intro e - 0009
intro h - 0010
intro ha - 0011
intro he - 0012
have hpoint : ∃ mkm_value_last_point. ∃ mkm_exponent_last_point. BetaAt(b,c,l,mkm_value_last_point) ∧ (BetaAt(vb,vc,l,mkm_exponent_last_point) ∧ BoundedPowerValuation(p,mkm_value_last_point,mkm_value_last_point,mkm_exponent_last_point)) - 0013
specialize h l - 0014
apply h - 0015
specialize le_refl (S l) - 0016
apply le_refl - 0017
cases hpoint - 0018
cases hpoint_witness - 0019
cases hpoint_witness_witness - 0020
cases hpoint_witness_witness_right - 0021
have hvalue : x = a - 0022
specialize beta_at_unique b - 0023
specialize beta_at_unique c - 0024
specialize beta_at_unique l - 0025
specialize beta_at_unique x - 0026
specialize beta_at_unique a - 0027
apply beta_at_unique - 0028
exact hpoint_witness_witness_left - 0029
exact ha - 0030
have hexponent : x1 = e - 0031
specialize beta_at_unique vb - 0032
specialize beta_at_unique vc - 0033
specialize beta_at_unique l - 0034
specialize beta_at_unique x1 - 0035
specialize beta_at_unique e - 0036
apply beta_at_unique - 0037
exact hpoint_witness_witness_right_left - 0038
exact he - 0039
rewrite hvalue at hpoint_witness_witness_right_right - 0040
rewrite hvalue at hpoint_witness_witness_right_right - 0041
rewrite hvalue at hpoint_witness_witness_right_right - 0042
rewrite hvalue at hpoint_witness_witness_right_right - 0043
rewrite hexponent at hpoint_witness_witness_right_right - 0044
rewrite hexponent at hpoint_witness_witness_right_right - 0045
rewrite hexponent at hpoint_witness_witness_right_right - 0046
rewrite hexponent at hpoint_witness_witness_right_right - 0047
rewrite hexponent at hpoint_witness_witness_right_right - 0048
rewrite hexponent at hpoint_witness_witness_right_right - 0049
exact hpoint_witness_witness_right_right