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_equiv_left ftcn_right_fssq_zero_equiv_left. (a) + (k) * ftcn_left_fssq_zero_equiv_left = (0) + (k) * ftcn_right_fssq_zero_equiv_left) -> (exists ftcn_left_fssq_zero_equiv_right ftcn_right_fssq_zero_equiv_right. (b) + (k) * ftcn_left_fssq_zero_equiv_right = (0) + (k) * ftcn_right_fssq_zero_equiv_right) -> (exists ftcn_left_fssq_zero_equiv_result ftcn_right_fssq_zero_equiv_result. (a) + (k) * ftcn_left_fssq_zero_equiv_result = (b) + (k) * ftcn_right_fssq_zero_equiv_result)Constructive proof overview
Generated structural guide
Any two natural signed blocks that both vanish modulo the multiplier are congruent.
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_symm Stable theorem; checked-use authorized mod_eq_trans 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 hreverseL6–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mod eq symm.
- L6
have hreverse : exists ftcn_left_fssq_zero_equiv_reverse ftcn_right_fssq_zero_equiv_reverse. (0) + (k) * ftcn_left_fssq_zero_equiv_reverse = (b) + (k) * ftcn_right_fssq_zero_equiv_reverse - L7
specialize mod_eq_symm k - L8
specialize mod_eq_symm b - L9
specialize mod_eq_symm 0 - L10
apply mod_eq_symm - L11
exact hb - L12
specialize mod_eq_trans k - L13
specialize mod_eq_trans a - L14
specialize mod_eq_trans 0 - L15
specialize mod_eq_trans b
Original exact command ledger · 18 lines
- 0001
intro k - 0002
intro a - 0003
intro b - 0004
intro ha - 0005
intro hb - 0006
have hreverse : exists ftcn_left_fssq_zero_equiv_reverse ftcn_right_fssq_zero_equiv_reverse. (0) + (k) * ftcn_left_fssq_zero_equiv_reverse = (b) + (k) * ftcn_right_fssq_zero_equiv_reverse - 0007
specialize mod_eq_symm k - 0008
specialize mod_eq_symm b - 0009
specialize mod_eq_symm 0 - 0010
apply mod_eq_symm - 0011
exact hb - 0012
specialize mod_eq_trans k - 0013
specialize mod_eq_trans a - 0014
specialize mod_eq_trans 0 - 0015
specialize mod_eq_trans b - 0016
apply mod_eq_trans - 0017
exact ha - 0018
exact hreverse