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 a b c d. (((exists pfa_gap_addfirstleft. pfa_gap_addfirstleft + S (a) = (p)) /\ (((exists pfa_gap_addfirstright. pfa_gap_addfirstright + S (b) = (p)) /\ ((((exists pfa_gap_addfirstresultbound. pfa_gap_addfirstresultbound + S (c) = (p)) /\ ((exists pfa_offset_left_addfirstresultcongruence pfa_offset_right_addfirstresultcongruence. ((a) + (b)) + (p) * pfa_offset_left_addfirstresultcongruence = (c) + (p) * pfa_offset_right_addfirstresultcongruence))))))))) -> (((exists pfa_gap_addsecondleft. pfa_gap_addsecondleft + S (a) = (p)) /\ (((exists pfa_gap_addsecondright. pfa_gap_addsecondright + S (b) = (p)) /\ ((((exists pfa_gap_addsecondresultbound. pfa_gap_addsecondresultbound + S (d) = (p)) /\ ((exists pfa_offset_left_addsecondresultcongruence pfa_offset_right_addsecondresultcongruence. ((a) + (b)) + (p) * pfa_offset_left_addsecondresultcongruence = (d) + (p) * pfa_offset_right_addsecondresultcongruence))))))))) -> c = dConstructive proof overview
Generated structural guide
The actual bounded add graph is functional without any field-law premise.
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
binary_canonical_residue_functional 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–7
02Separate the logical casesL8–11
03Use earlier factsL12–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L12
specialize binary_canonical_residue_functional (p) - L13
specialize binary_canonical_residue_functional (a + b) - L14
specialize binary_canonical_residue_functional (c) - L15
specialize binary_canonical_residue_functional (d) - L16
apply binary_canonical_residue_functional - L17
exact hc_right_right - L18
exact hd_right_right
Original exact command ledger · 18 lines
- 0001
intro p - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro hc - 0007
intro hd - 0008
cases hc - 0009
cases hc_right - 0010
cases hd - 0011
cases hd_right - 0012
specialize binary_canonical_residue_functional (p) - 0013
specialize binary_canonical_residue_functional (a + b) - 0014
specialize binary_canonical_residue_functional (c) - 0015
specialize binary_canonical_residue_functional (d) - 0016
apply binary_canonical_residue_functional - 0017
exact hc_right_right - 0018
exact hd_right_right