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 b c i a d. a=d -> (((exists ff_h_gprod_value_transport_source. ff_h_gprod_value_transport_source + S (a) = S ((S (i)) * c)) /\ exists ff_q_gprod_value_transport_source. b = ff_q_gprod_value_transport_source * S ((S (i)) * c) + (a))) -> (((exists ff_h_gprod_value_transport_target. ff_h_gprod_value_transport_target + S (d) = S ((S (i)) * c)) /\ exists ff_q_gprod_value_transport_target. b = ff_q_gprod_value_transport_target * S ((S (i)) * c) + (d)))Constructive proof overview
Generated structural guide
Equality of factor codes transports both boundedness and the actual beta remainder equation.
The unchanged tactic script uses 0 declared prerequisites and contains 10 exact native proof lines.
Alpha v34 checked-use · first admitted v30 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
Direct 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–7
02Calculate and transport equalitiesL8–9
03Use earlier factsL10–10
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L10
exact h