Exact expanded first-order arithmetic statement
forall b c d e k n. (forall jt_index_boundequal jt_left_boundequal jt_right_boundequal. (exists jt_gap_boundequalindex. jt_gap_boundequalindex+S (jt_index_boundequal)=(k)) -> (((exists fs_h_jt_boundequalleft. fs_h_jt_boundequalleft + S (jt_left_boundequal) = S ((S (jt_index_boundequal)) * c)) /\ exists fs_q_jt_boundequalleft. b = fs_q_jt_boundequalleft * S ((S (jt_index_boundequal)) * c) + (jt_left_boundequal))) -> (((exists fs_h_jt_boundequalright. fs_h_jt_boundequalright + S (jt_right_boundequal) = S ((S (jt_index_boundequal)) * e)) /\ exists fs_q_jt_boundequalright. d = fs_q_jt_boundequalright * S ((S (jt_index_boundequal)) * e) + (jt_right_boundequal))) -> jt_left_boundequal=jt_right_boundequal) -> (forall jt_index_boundsource. (exists jt_gap_boundsourceindex. jt_gap_boundsourceindex+S (jt_index_boundsource)=(k)) -> exists jt_value_boundsource. ((((exists fs_h_jt_boundsourceat. fs_h_jt_boundsourceat + S (jt_value_boundsource) = S ((S (jt_index_boundsource)) * c)) /\ exists fs_q_jt_boundsourceat. b = fs_q_jt_boundsourceat * S ((S (jt_index_boundsource)) * c) + (jt_value_boundsource))) /\ (exists jt_gap_boundsourcevalue. jt_gap_boundsourcevalue+S (jt_value_boundsource)=(n)))) -> (forall jt_index_boundtarget. (exists jt_gap_boundtargetindex. jt_gap_boundtargetindex+S (jt_index_boundtarget)=(k)) -> exists jt_value_boundtarget. ((((exists fs_h_jt_boundtargetat. fs_h_jt_boundtargetat + S (jt_value_boundtarget) = S ((S (jt_index_boundtarget)) * e)) /\ exists fs_q_jt_boundtargetat. d = fs_q_jt_boundtargetat * S ((S (jt_index_boundtarget)) * e) + (jt_value_boundtarget))) /\ (exists jt_gap_boundtargetvalue. jt_gap_boundtargetvalue+S (jt_value_boundtarget)=(n))))Constructive proof overview
Generated structural guide
The canonical coordinate bound is independent of tuple encoding.
The unchanged tactic script uses 1 declared prerequisite and contains 30 exact native proof lines.
Alpha v35 checked-use · first admitted v35 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
Direct 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.
Named ingredients (1)
01Fix variables and assumptionsL1–10
02Establish haL11–14
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hb.
03Separate the logical casesL15–16
04Construct an explicit witnessL17–17
Supply the displayed value, then prove that it has the required property.
- L17
exists x
05Separate the logical casesL18–18
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L18
split
06Use earlier factsL19–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
specialize jordan_tuple_equal_entry (b) - L20
specialize jordan_tuple_equal_entry (c) - L21
specialize jordan_tuple_equal_entry (d) - L22
specialize jordan_tuple_equal_entry (e) - L23
specialize jordan_tuple_equal_entry (k) - L24
specialize jordan_tuple_equal_entry (i) - L25
specialize jordan_tuple_equal_entry (x) - L26
apply jordan_tuple_equal_entry - L27
exact heq - L28
exact hi
Original exact command ledger · 30 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
intro k - 0006
intro n - 0007
intro heq - 0008
intro hb - 0009
intro i - 0010
intro hi - 0011
have ha : exists a. ((((exists fs_h_jt_boundtransport. fs_h_jt_boundtransport + S (a) = S ((S (i)) * c)) /\ exists fs_q_jt_boundtransport. b = fs_q_jt_boundtransport * S ((S (i)) * c) + (a))) /\ (exists jt_gap_boundvalue. jt_gap_boundvalue+S (a)=(n))) - 0012
specialize hb (i) - 0013
apply hb - 0014
exact hi - 0015
cases ha - 0016
cases ha_witness - 0017
exists x - 0018
split - 0019
specialize jordan_tuple_equal_entry (b) - 0020
specialize jordan_tuple_equal_entry (c) - 0021
specialize jordan_tuple_equal_entry (d) - 0022
specialize jordan_tuple_equal_entry (e) - 0023
specialize jordan_tuple_equal_entry (k) - 0024
specialize jordan_tuple_equal_entry (i) - 0025
specialize jordan_tuple_equal_entry (x) - 0026
apply jordan_tuple_equal_entry - 0027
exact heq - 0028
exact hi - 0029
exact ha_witness_left - 0030
exact ha_witness_right