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 expanded first-order arithmetic statement
forall b c L k. exists a. ((exists pfrep_position_power_exists. ((pfrep_position_power_exists+S (k)=(L)) /\ ((((exists ff_h_pfp_power_existsentry. ff_h_pfp_power_existsentry + S (a) = S ((S (pfrep_position_power_exists)) * c)) /\ exists ff_q_pfp_power_existsentry. b = ff_q_pfp_power_existsentry * S ((S (pfrep_position_power_exists)) * c) + (a)))))) \/ (((exists pfrep_gap_power_existsoutside. pfrep_gap_power_existsoutside+(L)=(k)) /\ (((a)=0)))))Constructive proof overview
Generated structural guide
Every natural power has an actual decoded coefficient or the proved exterior zero, for arbitrary beta encodings.
The unchanged tactic script uses 2 declared prerequisites and contains 27 exact native proof lines.
Alpha v34 checked-use · first admitted v33 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
le_or_lt Alpha theorem; checked-use authorized beta_at_exists Alpha 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–4
02Establish hoL5–8
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le or lt.
03Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
cases ho
04Construct an explicit witnessL10–10
Supply the displayed value, then prove that it has the required property.
- L10
exists 0
05Separate the logical casesL11–12
06Use earlier factsL13–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
exact ho_left
07Calculate and transport equalitiesL14–14
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L14
refl
08Separate the logical casesL15–15
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L15
cases ho_right
09Establish hvL16–20
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.
- L16
have hv : exists a. (((exists ff_h_pfp_power_exists_value. ff_h_pfp_power_exists_value + S (a) = S ((S (x)) * c)) /\ exists ff_q_pfp_power_exists_value. b = ff_q_pfp_power_exists_value * S ((S (x)) * c) + (a))) - L17
specialize beta_at_exists (b) - L18
specialize beta_at_exists (c) - L19
specialize beta_at_exists (x) - L20
apply beta_at_exists
10Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
cases hv
11Construct an explicit witnessL22–22
Supply the displayed value, then prove that it has the required property.
- L22
exists x1
12Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
left
13Construct an explicit witnessL24–24
Supply the displayed value, then prove that it has the required property.
- L24
exists x
14Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
split
Original exact command ledger · 27 lines
- 0001
intro b - 0002
intro c - 0003
intro L - 0004
intro k - 0005
have ho : (exists pfrep_gap_power_exists_outside. pfrep_gap_power_exists_outside+(L)=(k)) \/ (exists pfa_gap_power_exists_inside. pfa_gap_power_exists_inside + S (k) = (L)) - 0006
specialize le_or_lt (L) - 0007
specialize le_or_lt (k) - 0008
apply le_or_lt - 0009
cases ho - 0010
exists 0 - 0011
right - 0012
split - 0013
exact ho_left - 0014
refl - 0015
cases ho_right - 0016
have hv : exists a. (((exists ff_h_pfp_power_exists_value. ff_h_pfp_power_exists_value + S (a) = S ((S (x)) * c)) /\ exists ff_q_pfp_power_exists_value. b = ff_q_pfp_power_exists_value * S ((S (x)) * c) + (a))) - 0017
specialize beta_at_exists (b) - 0018
specialize beta_at_exists (c) - 0019
specialize beta_at_exists (x) - 0020
apply beta_at_exists - 0021
cases hv - 0022
exists x1 - 0023
left - 0024
exists x - 0025
split - 0026
exact ho_right_witness - 0027
exact hv_witness