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 d. exists b c. (forall mdr_i_identity_exists. (exists mdr_gap_identity_existsbound. mdr_gap_identity_existsbound + S (mdr_i_identity_exists) = (d)) -> (((exists ff_h_mdr_identity_existsentry. ff_h_mdr_identity_existsentry + S (mdr_i_identity_exists) = S ((S (mdr_i_identity_exists)) * c)) /\ exists ff_q_mdr_identity_existsentry. b = ff_q_mdr_identity_existsentry * S ((S (mdr_i_identity_exists)) * c) + (mdr_i_identity_exists))))Constructive proof overview
Generated structural guide
Construct an actual beta-coded identity selector of every natural length from the checked finite range construction.
The unchanged tactic script uses 2 declared prerequisites and contains 20 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
beta_range_exists Stable theorem; checked-use authorized zero_add 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–1
Work with arbitrary variables or the premises of the current implication.
- L1
intro d
02Establish hrangeL2–5
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta range exists.
- L2
have hrange : exists b c. forall i. (exists mdr_gap_identity_index. mdr_gap_identity_index + S (i) = (d)) -> (((exists ff_h_mdr_identity_range_value. ff_h_mdr_identity_range_value + S (0 + i) = S ((S (i)) * c)) /\ exists ff_q_mdr_identity_range_value. b = ff_q_mdr_identity_range_value * S ((S (i)) * c) + (0 + i))) - L3
specialize beta_range_exists (0) - L4
specialize beta_range_exists (d) - L5
apply beta_range_exists
03Separate the logical casesL6–7
04Construct an explicit witnessL8–9
05Fix variables and assumptionsL10–11
06Establish hentryL12–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hrange witness witness.
Original exact command ledger · 20 lines
- 0001
intro d - 0002
have hrange : exists b c. forall i. (exists mdr_gap_identity_index. mdr_gap_identity_index + S (i) = (d)) -> (((exists ff_h_mdr_identity_range_value. ff_h_mdr_identity_range_value + S (0 + i) = S ((S (i)) * c)) /\ exists ff_q_mdr_identity_range_value. b = ff_q_mdr_identity_range_value * S ((S (i)) * c) + (0 + i))) - 0003
specialize beta_range_exists (0) - 0004
specialize beta_range_exists (d) - 0005
apply beta_range_exists - 0006
cases hrange - 0007
cases hrange_witness - 0008
exists x - 0009
exists x1 - 0010
intro i - 0011
intro hi - 0012
have hentry : ((exists ff_h_mdr_identity_entry. ff_h_mdr_identity_entry + S (0 + i) = S ((S (i)) * x1)) /\ exists ff_q_mdr_identity_entry. x = ff_q_mdr_identity_entry * S ((S (i)) * x1) + (0 + i)) - 0013
specialize hrange_witness_witness (i) - 0014
apply hrange_witness_witness - 0015
exact hi - 0016
have hzero : 0 + i = i - 0017
apply zero_add - 0018
rewrite hzero at hentry - 0019
rewrite hzero at hentry - 0020
exact hentry