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. (forall mdr_i_square_prefix mdr_a_square_prefix. (exists mdr_gap_square_prefixb. mdr_gap_square_prefixb + S (mdr_i_square_prefix) = ((S q) * (S q))) -> (((exists ff_h_mdr_square_prefixo. ff_h_mdr_square_prefixo + S (mdr_a_square_prefix) = S ((S (mdr_i_square_prefix)) * c)) /\ exists ff_q_mdr_square_prefixo. b = ff_q_mdr_square_prefixo * S ((S (mdr_i_square_prefix)) * c) + (mdr_a_square_prefix))) -> (((exists ff_h_mdr_square_prefixn. ff_h_mdr_square_prefixn + S (mdr_a_square_prefix) = S ((S (mdr_i_square_prefix)) * C)) /\ exists ff_q_mdr_square_prefixn. B = ff_q_mdr_square_prefixn * S ((S (mdr_i_square_prefix)) * C) + (mdr_a_square_prefix)))) -> (forall mdr_i_row_prefix mdr_a_row_prefix. (exists mdr_gap_row_prefixb. mdr_gap_row_prefixb + S (mdr_i_row_prefix) = (S q)) -> (((exists ff_h_mdr_row_prefixo. ff_h_mdr_row_prefixo + S (mdr_a_row_prefix) = S ((S (mdr_i_row_prefix)) * c)) /\ exists ff_q_mdr_row_prefixo. b = ff_q_mdr_row_prefixo * S ((S (mdr_i_row_prefix)) * c) + (mdr_a_row_prefix))) -> (((exists ff_h_mdr_row_prefixn. ff_h_mdr_row_prefixn + S (mdr_a_row_prefix) = S ((S (mdr_i_row_prefix)) * C)) /\ exists ff_q_mdr_row_prefixn. B = ff_q_mdr_row_prefixn * S ((S (mdr_i_row_prefix)) * C) + (mdr_a_row_prefix))))Constructive proof overview
Generated structural guide
Equality of all cells of a nonempty square matrix includes every actual first-row entry.
The unchanged tactic script uses 3 declared prerequisites and contains 19 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
succ_ne_zero Stable theorem; checked-use authorized le_scaled_nonzero Stable theorem; checked-use authorized DL0004 matrix_recursive_prefix_restrictDirect 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–6
02Use earlier factsL7–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
specialize matrix_recursive_prefix_restrict (b) - L8
specialize matrix_recursive_prefix_restrict (c) - L9
specialize matrix_recursive_prefix_restrict (B) - L10
specialize matrix_recursive_prefix_restrict (C) - L11
specialize matrix_recursive_prefix_restrict ((S q) * (S q)) - L12
specialize matrix_recursive_prefix_restrict (S q) - L13
apply matrix_recursive_prefix_restrict - L14
specialize le_scaled_nonzero (S q) - L15
specialize le_scaled_nonzero (S q) - L16
apply le_scaled_nonzero
Original exact command ledger · 19 lines
- 0001
intro b - 0002
intro c - 0003
intro B - 0004
intro C - 0005
intro q - 0006
intro hprefix - 0007
specialize matrix_recursive_prefix_restrict (b) - 0008
specialize matrix_recursive_prefix_restrict (c) - 0009
specialize matrix_recursive_prefix_restrict (B) - 0010
specialize matrix_recursive_prefix_restrict (C) - 0011
specialize matrix_recursive_prefix_restrict ((S q) * (S q)) - 0012
specialize matrix_recursive_prefix_restrict (S q) - 0013
apply matrix_recursive_prefix_restrict - 0014
specialize le_scaled_nonzero (S q) - 0015
specialize le_scaled_nonzero (S q) - 0016
apply le_scaled_nonzero - 0017
specialize succ_ne_zero (q) - 0018
apply succ_ne_zero - 0019
exact hprefix