Exact expanded first-order arithmetic statement
forall n m b c k. (exists jt_factor_smalldivisor. (m)=(n)*jt_factor_smalldivisor) -> (forall jt_divisor_largemod. (exists jt_factor_largemodmodulus. (m)=(jt_divisor_largemod)*jt_factor_largemodmodulus) -> (forall jt_index_largemodcoordinates jt_value_largemodcoordinates. (exists jt_gap_largemodcoordinatesindex. jt_gap_largemodcoordinatesindex+S (jt_index_largemodcoordinates)=(k)) -> (((exists fs_h_jt_largemodcoordinatesat. fs_h_jt_largemodcoordinatesat + S (jt_value_largemodcoordinates) = S ((S (jt_index_largemodcoordinates)) * c)) /\ exists fs_q_jt_largemodcoordinatesat. b = fs_q_jt_largemodcoordinatesat * S ((S (jt_index_largemodcoordinates)) * c) + (jt_value_largemodcoordinates))) -> (exists jt_factor_largemodcoordinatesdivides. (jt_value_largemodcoordinates)=(jt_divisor_largemod)*jt_factor_largemodcoordinatesdivides)) -> jt_divisor_largemod=1) -> (forall jt_divisor_smallmod. (exists jt_factor_smallmodmodulus. (n)=(jt_divisor_smallmod)*jt_factor_smallmodmodulus) -> (forall jt_index_smallmodcoordinates jt_value_smallmodcoordinates. (exists jt_gap_smallmodcoordinatesindex. jt_gap_smallmodcoordinatesindex+S (jt_index_smallmodcoordinates)=(k)) -> (((exists fs_h_jt_smallmodcoordinatesat. fs_h_jt_smallmodcoordinatesat + S (jt_value_smallmodcoordinates) = S ((S (jt_index_smallmodcoordinates)) * c)) /\ exists fs_q_jt_smallmodcoordinatesat. b = fs_q_jt_smallmodcoordinatesat * S ((S (jt_index_smallmodcoordinates)) * c) + (jt_value_smallmodcoordinates))) -> (exists jt_factor_smallmodcoordinatesdivides. (jt_value_smallmodcoordinates)=(jt_divisor_smallmod)*jt_factor_smallmodcoordinatesdivides)) -> jt_divisor_smallmod=1)Constructive proof overview
Generated structural guide
Primitivity descends from a modulus to a genuine divisor of it.
The unchanged tactic script uses 1 declared prerequisite and contains 19 exact native proof lines.
Alpha v35 checked-use · first admitted v35 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
multiple_trans 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–10
Original exact command ledger · 19 lines
- 0001
intro n - 0002
intro m - 0003
intro b - 0004
intro c - 0005
intro k - 0006
intro hnm - 0007
intro hp - 0008
intro q - 0009
intro hqn - 0010
intro hall - 0011
specialize hp (q) - 0012
apply hp - 0013
specialize multiple_trans (n) - 0014
specialize multiple_trans (q) - 0015
specialize multiple_trans (m) - 0016
apply multiple_trans - 0017
exact hnm - 0018
exact hqn - 0019
exact hall