Exact expanded first-order arithmetic statement
forall m n b c d e k. (exists jt_factor_moddivisor. (n)=(m)*jt_factor_moddivisor) -> (forall jt_index_modlarger jt_left_modlarger jt_right_modlarger. (exists jt_gap_modlargerindex. jt_gap_modlargerindex+S (jt_index_modlarger)=(k)) -> (((exists fs_h_jt_modlargerleft. fs_h_jt_modlargerleft + S (jt_left_modlarger) = S ((S (jt_index_modlarger)) * c)) /\ exists fs_q_jt_modlargerleft. b = fs_q_jt_modlargerleft * S ((S (jt_index_modlarger)) * c) + (jt_left_modlarger))) -> (((exists fs_h_jt_modlargerright. fs_h_jt_modlargerright + S (jt_right_modlarger) = S ((S (jt_index_modlarger)) * e)) /\ exists fs_q_jt_modlargerright. d = fs_q_jt_modlargerright * S ((S (jt_index_modlarger)) * e) + (jt_right_modlarger))) -> (exists jt_left_modlargermod jt_right_modlargermod. (jt_left_modlarger)+(n)*jt_left_modlargermod=(jt_right_modlarger)+(n)*jt_right_modlargermod)) -> (forall jt_index_modsmaller jt_left_modsmaller jt_right_modsmaller. (exists jt_gap_modsmallerindex. jt_gap_modsmallerindex+S (jt_index_modsmaller)=(k)) -> (((exists fs_h_jt_modsmallerleft. fs_h_jt_modsmallerleft + S (jt_left_modsmaller) = S ((S (jt_index_modsmaller)) * c)) /\ exists fs_q_jt_modsmallerleft. b = fs_q_jt_modsmallerleft * S ((S (jt_index_modsmaller)) * c) + (jt_left_modsmaller))) -> (((exists fs_h_jt_modsmallerright. fs_h_jt_modsmallerright + S (jt_right_modsmaller) = S ((S (jt_index_modsmaller)) * e)) /\ exists fs_q_jt_modsmallerright. d = fs_q_jt_modsmallerright * S ((S (jt_index_modsmaller)) * e) + (jt_right_modsmaller))) -> (exists jt_left_modsmallermod jt_right_modsmallermod. (jt_left_modsmaller)+(m)*jt_left_modsmallermod=(jt_right_modsmaller)+(m)*jt_right_modsmallermod))Constructive proof overview
Generated structural guide
Coordinate congruence descends along actual divisibility of moduli.
The unchanged tactic script uses 1 declared prerequisite and contains 28 exact native proof lines.
Alpha v35 checked-use · first admitted v35 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
mod_eq_of_mod_eq_multiple 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
02Fix variables and assumptionsL11–15
03Use earlier factsL16–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 28 lines
- 0001
intro m - 0002
intro n - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro e - 0007
intro k - 0008
intro hdiv - 0009
intro hmod - 0010
intro i - 0011
intro a - 0012
intro z - 0013
intro hi - 0014
intro ha - 0015
intro hz - 0016
specialize mod_eq_of_mod_eq_multiple (m) - 0017
specialize mod_eq_of_mod_eq_multiple (n) - 0018
specialize mod_eq_of_mod_eq_multiple (a) - 0019
specialize mod_eq_of_mod_eq_multiple (z) - 0020
apply mod_eq_of_mod_eq_multiple - 0021
exact hdiv - 0022
specialize hmod (i) - 0023
specialize hmod (a) - 0024
specialize hmod (z) - 0025
apply hmod - 0026
exact hi - 0027
exact ha - 0028
exact hz