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 pb pc nb nc d. (((forall mdr_i_matrix_reflp mdr_a_matrix_reflp. (exists mdr_gap_matrix_reflpb. mdr_gap_matrix_reflpb + S (mdr_i_matrix_reflp) = ((d) * (d))) -> (((exists ff_h_mdr_matrix_reflpo. ff_h_mdr_matrix_reflpo + S (mdr_a_matrix_reflp) = S ((S (mdr_i_matrix_reflp)) * pc)) /\ exists ff_q_mdr_matrix_reflpo. pb = ff_q_mdr_matrix_reflpo * S ((S (mdr_i_matrix_reflp)) * pc) + (mdr_a_matrix_reflp))) -> (((exists ff_h_mdr_matrix_reflpn. ff_h_mdr_matrix_reflpn + S (mdr_a_matrix_reflp) = S ((S (mdr_i_matrix_reflp)) * pc)) /\ exists ff_q_mdr_matrix_reflpn. pb = ff_q_mdr_matrix_reflpn * S ((S (mdr_i_matrix_reflp)) * pc) + (mdr_a_matrix_reflp)))) /\ (forall mdr_i_matrix_refln mdr_a_matrix_refln. (exists mdr_gap_matrix_reflnb. mdr_gap_matrix_reflnb + S (mdr_i_matrix_refln) = ((d) * (d))) -> (((exists ff_h_mdr_matrix_reflno. ff_h_mdr_matrix_reflno + S (mdr_a_matrix_refln) = S ((S (mdr_i_matrix_refln)) * nc)) /\ exists ff_q_mdr_matrix_reflno. nb = ff_q_mdr_matrix_reflno * S ((S (mdr_i_matrix_refln)) * nc) + (mdr_a_matrix_refln))) -> (((exists ff_h_mdr_matrix_reflnn. ff_h_mdr_matrix_reflnn + S (mdr_a_matrix_refln) = S ((S (mdr_i_matrix_refln)) * nc)) /\ exists ff_q_mdr_matrix_reflnn. nb = ff_q_mdr_matrix_reflnn * S ((S (mdr_i_matrix_refln)) * nc) + (mdr_a_matrix_refln))))))Constructive proof overview
Generated structural guide
Every actual finite signed matrix is pointwise equal to itself.
The unchanged tactic script uses 1 declared prerequisite and contains 14 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · 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–5
02Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
split
03Use earlier factsL7–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L7
specialize matrix_recursive_prefix_refl (pb) - L8
specialize matrix_recursive_prefix_refl (pc) - L9
specialize matrix_recursive_prefix_refl (d * d) - L10
apply matrix_recursive_prefix_refl - L11
specialize matrix_recursive_prefix_refl (nb) - L12
specialize matrix_recursive_prefix_refl (nc) - L13
specialize matrix_recursive_prefix_refl (d * d) - L14
apply matrix_recursive_prefix_refl
Original exact command ledger · 14 lines
- 0001
intro pb - 0002
intro pc - 0003
intro nb - 0004
intro nc - 0005
intro d - 0006
split - 0007
specialize matrix_recursive_prefix_refl (pb) - 0008
specialize matrix_recursive_prefix_refl (pc) - 0009
specialize matrix_recursive_prefix_refl (d * d) - 0010
apply matrix_recursive_prefix_refl - 0011
specialize matrix_recursive_prefix_refl (nb) - 0012
specialize matrix_recursive_prefix_refl (nc) - 0013
specialize matrix_recursive_prefix_refl (d * d) - 0014
apply matrix_recursive_prefix_refl