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 k a b. (exists ftcn_left_fssq_zero_add_left ftcn_right_fssq_zero_add_left. (a) + (k) * ftcn_left_fssq_zero_add_left = (0) + (k) * ftcn_right_fssq_zero_add_left) -> (exists ftcn_left_fssq_zero_add_right ftcn_right_fssq_zero_add_right. (b) + (k) * ftcn_left_fssq_zero_add_right = (0) + (k) * ftcn_right_fssq_zero_add_right) -> (exists ftcn_left_fssq_zero_add_result ftcn_right_fssq_zero_add_result. (a + b) + (k) * ftcn_left_fssq_zero_add_result = (0) + (k) * ftcn_right_fssq_zero_add_result)Constructive proof overview
Generated structural guide
Two independently vanishing signed blocks have vanishing sum modulo the multiplier.
The unchanged tactic script uses 2 declared prerequisites and contains 18 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Historical empty-context replay experiment only; that experiment persisted no certificate and granted no release authority. Current checked use follows separately sealed, independently verified proof bundles; there is no Stable promotion.
Proof neighborhood
Direct dependencies
mod_eq_add 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–5
02Establish hsumL6–14
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mod eq add.
- L6
have hsum : exists ftcn_left_fssq_zero_add_sum ftcn_right_fssq_zero_add_sum. (a + b) + (k) * ftcn_left_fssq_zero_add_sum = (0 + 0) + (k) * ftcn_right_fssq_zero_add_sum - L7
specialize mod_eq_add k - L8
specialize mod_eq_add a - L9
specialize mod_eq_add 0 - L10
specialize mod_eq_add b - L11
specialize mod_eq_add 0 - L12
apply mod_eq_add - L13
exact ha - L14
exact hb
Original exact command ledger · 18 lines
- 0001
intro k - 0002
intro a - 0003
intro b - 0004
intro ha - 0005
intro hb - 0006
have hsum : exists ftcn_left_fssq_zero_add_sum ftcn_right_fssq_zero_add_sum. (a + b) + (k) * ftcn_left_fssq_zero_add_sum = (0 + 0) + (k) * ftcn_right_fssq_zero_add_sum - 0007
specialize mod_eq_add k - 0008
specialize mod_eq_add a - 0009
specialize mod_eq_add 0 - 0010
specialize mod_eq_add b - 0011
specialize mod_eq_add 0 - 0012
apply mod_eq_add - 0013
exact ha - 0014
exact hb - 0015
have hzero : 0 + 0 = 0 - 0016
apply zero_add - 0017
rewrite hzero at hsum - 0018
exact hsum