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 p b c i a. (forall pff_enumeration_index_enumeration_value_source. (exists pfa_gap_enumeration_value_sourcebound. pfa_gap_enumeration_value_sourcebound + S (pff_enumeration_index_enumeration_value_source) = (p)) -> (((exists ff_h_pft_enumeration_value_sourceentry. ff_h_pft_enumeration_value_sourceentry + S (pff_enumeration_index_enumeration_value_source) = S ((S (pff_enumeration_index_enumeration_value_source)) * c)) /\ exists ff_q_pft_enumeration_value_sourceentry. b = ff_q_pft_enumeration_value_sourceentry * S ((S (pff_enumeration_index_enumeration_value_source)) * c) + (pff_enumeration_index_enumeration_value_source)))) -> (exists pfa_gap_enumeration_value_bound. pfa_gap_enumeration_value_bound + S (i) = (p)) -> (((exists ff_h_pft_enumeration_value_at. ff_h_pft_enumeration_value_at + S (a) = S ((S (i)) * c)) /\ exists ff_q_pft_enumeration_value_at. b = ff_q_pft_enumeration_value_at * S ((S (i)) * c) + (a))) -> a = iConstructive proof overview
Generated structural guide
Every decoded entry of the identity enumeration equals its actual index.
The unchanged tactic script uses 1 declared prerequisite and contains 18 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
beta_at_unique 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–8
02Use earlier factsL9–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 18 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro i - 0005
intro a - 0006
intro henum - 0007
intro hi - 0008
intro hat - 0009
specialize beta_at_unique (b) - 0010
specialize beta_at_unique (c) - 0011
specialize beta_at_unique (i) - 0012
specialize beta_at_unique (a) - 0013
specialize beta_at_unique (i) - 0014
apply beta_at_unique - 0015
exact hat - 0016
specialize henum (i) - 0017
apply henum - 0018
exact hi