Exact expanded first-order arithmetic statement
forall b c k B C D E. ~(exists jt_index_listedempty jt_code_listedempty jt_scale_listedempty. ((exists jt_gap_listedemptyindex. jt_gap_listedemptyindex+S (jt_index_listedempty)=(0)) /\ (((((((exists fs_h_jt_listedemptycode. fs_h_jt_listedemptycode + S (jt_code_listedempty) = S ((S (jt_index_listedempty)) * C)) /\ exists fs_q_jt_listedemptycode. B = fs_q_jt_listedemptycode * S ((S (jt_index_listedempty)) * C) + (jt_code_listedempty))) /\ (((exists fs_h_jt_listedemptyscale. fs_h_jt_listedemptyscale + S (jt_scale_listedempty) = S ((S (jt_index_listedempty)) * E)) /\ exists fs_q_jt_listedemptyscale. D = fs_q_jt_listedemptyscale * S ((S (jt_index_listedempty)) * E) + (jt_scale_listedempty))))) /\ (forall jt_index_listedemptyequal jt_left_listedemptyequal jt_right_listedemptyequal. (exists jt_gap_listedemptyequalindex. jt_gap_listedemptyequalindex+S (jt_index_listedemptyequal)=(k)) -> (((exists fs_h_jt_listedemptyequalleft. fs_h_jt_listedemptyequalleft + S (jt_left_listedemptyequal) = S ((S (jt_index_listedemptyequal)) * c)) /\ exists fs_q_jt_listedemptyequalleft. b = fs_q_jt_listedemptyequalleft * S ((S (jt_index_listedemptyequal)) * c) + (jt_left_listedemptyequal))) -> (((exists fs_h_jt_listedemptyequalright. fs_h_jt_listedemptyequalright + S (jt_right_listedemptyequal) = S ((S (jt_index_listedemptyequal)) * jt_scale_listedempty)) /\ exists fs_q_jt_listedemptyequalright. jt_code_listedempty = fs_q_jt_listedemptyequalright * S ((S (jt_index_listedemptyequal)) * jt_scale_listedempty) + (jt_right_listedemptyequal))) -> jt_left_listedemptyequal=jt_right_listedemptyequal)))))Constructive proof overview
Generated structural guide
An empty actual outer list contains no representative.
The unchanged tactic script uses 2 declared prerequisites 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
lt_not_le Alpha theorem; checked-use authorized zero_le 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–8
02Separate the logical casesL9–13
Original exact command ledger · 19 lines
- 0001
intro b - 0002
intro c - 0003
intro k - 0004
intro B - 0005
intro C - 0006
intro D - 0007
intro E - 0008
intro h - 0009
cases h - 0010
cases h_witness - 0011
cases h_witness_witness - 0012
cases h_witness_witness_witness - 0013
cases h_witness_witness_witness_right - 0014
specialize lt_not_le (x) - 0015
specialize lt_not_le (0) - 0016
apply lt_not_le - 0017
exact h_witness_witness_witness_left - 0018
specialize zero_le (x) - 0019
apply zero_le