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 b c B C q j r s a. (forall mdr_i_cell_parent mdr_a_cell_parent. (exists mdr_gap_cell_parentb. mdr_gap_cell_parentb + S (mdr_i_cell_parent) = ((S q) * (S q))) -> (((exists ff_h_mdr_cell_parento. ff_h_mdr_cell_parento + S (mdr_a_cell_parent) = S ((S (mdr_i_cell_parent)) * c)) /\ exists ff_q_mdr_cell_parento. b = ff_q_mdr_cell_parento * S ((S (mdr_i_cell_parent)) * c) + (mdr_a_cell_parent))) -> (((exists ff_h_mdr_cell_parentn. ff_h_mdr_cell_parentn + S (mdr_a_cell_parent) = S ((S (mdr_i_cell_parent)) * C)) /\ exists ff_q_mdr_cell_parentn. B = ff_q_mdr_cell_parentn * S ((S (mdr_i_cell_parent)) * C) + (mdr_a_cell_parent)))) -> (exists mdr_gap_cell_row. mdr_gap_cell_row + S (r) = (q)) -> (exists mdr_gap_cell_column. mdr_gap_cell_column + S (s) = (q)) -> (exists ff_row_mdm_cell_mdre_cell_source ff_column_mdm_cell_mdre_cell_source. (((((exists ff_gap_mdm_lt_mdre_cell_source_row_before. ff_gap_mdm_lt_mdre_cell_source_row_before + S (r) = (0)) /\ ff_row_mdm_cell_mdre_cell_source = r) \/ ((exists ff_gap_mdm_le_mdre_cell_source_row_after. ff_gap_mdm_le_mdre_cell_source_row_after + (0) = (r)) /\ ff_row_mdm_cell_mdre_cell_source = S r))) /\ (((((exists ff_gap_mdm_lt_mdre_cell_source_column_before. ff_gap_mdm_lt_mdre_cell_source_column_before + S (s) = (j)) /\ ff_column_mdm_cell_mdre_cell_source = s) \/ ((exists ff_gap_mdm_le_mdre_cell_source_column_after. ff_gap_mdm_le_mdre_cell_source_column_after + (j) = (s)) /\ ff_column_mdm_cell_mdre_cell_source = S s))) /\ (((exists ff_h_mdm_mdre_cell_source_source. ff_h_mdm_mdre_cell_source_source + S (a) = S ((S ((ff_row_mdm_cell_mdre_cell_source) * (S (q)) + (ff_column_mdm_cell_mdre_cell_source))) * c)) /\ exists ff_q_mdm_mdre_cell_source_source. b = ff_q_mdm_mdre_cell_source_source * S ((S ((ff_row_mdm_cell_mdre_cell_source) * (S (q)) + (ff_column_mdm_cell_mdre_cell_source))) * c) + (a)))))) -> (exists ff_row_mdm_cell_mdre_cell_result ff_column_mdm_cell_mdre_cell_result. (((((exists ff_gap_mdm_lt_mdre_cell_result_row_before. ff_gap_mdm_lt_mdre_cell_result_row_before + S (r) = (0)) /\ ff_row_mdm_cell_mdre_cell_result = r) \/ ((exists ff_gap_mdm_le_mdre_cell_result_row_after. ff_gap_mdm_le_mdre_cell_result_row_after + (0) = (r)) /\ ff_row_mdm_cell_mdre_cell_result = S r))) /\ (((((exists ff_gap_mdm_lt_mdre_cell_result_column_before. ff_gap_mdm_lt_mdre_cell_result_column_before + S (s) = (j)) /\ ff_column_mdm_cell_mdre_cell_result = s) \/ ((exists ff_gap_mdm_le_mdre_cell_result_column_after. ff_gap_mdm_le_mdre_cell_result_column_after + (j) = (s)) /\ ff_column_mdm_cell_mdre_cell_result = S s))) /\ (((exists ff_h_mdm_mdre_cell_result_source. ff_h_mdm_mdre_cell_result_source + S (a) = S ((S ((ff_row_mdm_cell_mdre_cell_result) * (S (q)) + (ff_column_mdm_cell_mdre_cell_result))) * C)) /\ exists ff_q_mdm_mdre_cell_result_source. B = ff_q_mdm_mdre_cell_result_source * S ((S ((ff_row_mdm_cell_mdre_cell_result) * (S (q)) + (ff_column_mdm_cell_mdre_cell_result))) * C) + (a))))))Constructive proof overview
Generated structural guide
Every actual first-row minor cell transports across equality of all in-range parent-matrix entries.
The unchanged tactic script uses 2 declared prerequisites and contains 51 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
matrix_skip_index_bounded Alpha theorem; checked-use authorized DL001A matrix_recursive_flattened_index_boundDirect 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
02Fix variables and assumptionsL11–13
03Separate the logical casesL14–17
04Establish hrowL18–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply matrix skip index bounded.
- L18
have hrow : exists mdr_gap_transport_row. mdr_gap_transport_row + S (x) = (S q) - L19
specialize matrix_skip_index_bounded (r) - L20
specialize matrix_skip_index_bounded (0) - L21
specialize matrix_skip_index_bounded (x) - L22
specialize matrix_skip_index_bounded (q) - L23
apply matrix_skip_index_bounded - L24
exact hcell_witness_witness_left - L25
exact hr
05Establish hcolumnL26–33
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply matrix skip index bounded.
- L26
have hcolumn : exists mdr_gap_transport_column. mdr_gap_transport_column + S (x1) = (S q) - L27
specialize matrix_skip_index_bounded (s) - L28
specialize matrix_skip_index_bounded (j) - L29
specialize matrix_skip_index_bounded (x1) - L30
specialize matrix_skip_index_bounded (q) - L31
apply matrix_skip_index_bounded - L32
exact hcell_witness_witness_right_left - L33
exact hs
06Establish hindexL34–40
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply matrix recursive flattened index bound.
- L34
have hindex : exists mdr_gap_transport_index. mdr_gap_transport_index + S (x * (S q) + x1) = ((S q) * (S q)) - L35
specialize matrix_recursive_flattened_index_bound (S q) - L36
specialize matrix_recursive_flattened_index_bound (x) - L37
specialize matrix_recursive_flattened_index_bound (x1) - L38
apply matrix_recursive_flattened_index_bound - L39
exact hrow - L40
exact hcolumn
07Construct an explicit witnessL41–42
08Separate the logical casesL43–43
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L43
split
09Use earlier factsL44–44
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L44
exact hcell_witness_witness_left
10Separate the logical casesL45–45
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L45
split
Original exact command ledger · 51 lines
- 0001
intro b - 0002
intro c - 0003
intro B - 0004
intro C - 0005
intro q - 0006
intro j - 0007
intro r - 0008
intro s - 0009
intro a - 0010
intro hprefix - 0011
intro hr - 0012
intro hs - 0013
intro hcell - 0014
cases hcell - 0015
cases hcell_witness - 0016
cases hcell_witness_witness - 0017
cases hcell_witness_witness_right - 0018
have hrow : exists mdr_gap_transport_row. mdr_gap_transport_row + S (x) = (S q) - 0019
specialize matrix_skip_index_bounded (r) - 0020
specialize matrix_skip_index_bounded (0) - 0021
specialize matrix_skip_index_bounded (x) - 0022
specialize matrix_skip_index_bounded (q) - 0023
apply matrix_skip_index_bounded - 0024
exact hcell_witness_witness_left - 0025
exact hr - 0026
have hcolumn : exists mdr_gap_transport_column. mdr_gap_transport_column + S (x1) = (S q) - 0027
specialize matrix_skip_index_bounded (s) - 0028
specialize matrix_skip_index_bounded (j) - 0029
specialize matrix_skip_index_bounded (x1) - 0030
specialize matrix_skip_index_bounded (q) - 0031
apply matrix_skip_index_bounded - 0032
exact hcell_witness_witness_right_left - 0033
exact hs - 0034
have hindex : exists mdr_gap_transport_index. mdr_gap_transport_index + S (x * (S q) + x1) = ((S q) * (S q)) - 0035
specialize matrix_recursive_flattened_index_bound (S q) - 0036
specialize matrix_recursive_flattened_index_bound (x) - 0037
specialize matrix_recursive_flattened_index_bound (x1) - 0038
apply matrix_recursive_flattened_index_bound - 0039
exact hrow - 0040
exact hcolumn - 0041
exists x - 0042
exists x1 - 0043
split - 0044
exact hcell_witness_witness_left - 0045
split - 0046
exact hcell_witness_witness_right_left - 0047
specialize hprefix (x * (S q) + x1) - 0048
specialize hprefix (a) - 0049
apply hprefix - 0050
exact hindex - 0051
exact hcell_witness_witness_right_right