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.
Historical partial components only: this chapter proves arbitrary signed cofactor minors and exact signed determinants through dimension four. T13 is now closed by the separate Alpha-v27 integer-linear-algebra branch: arbitrary determinant data, rank, and integer column spans, without a claim of lattice index or normal forms. Full T13 proof · Alpha v27
Exact theorem in conservative defined notation
∀ ap. ∀ an. ∀ bp. ∀ bn. ∀ cp. ∀ cn. ∀ dp. ∀ dn. ∀ up. ∀ un. ∀ vp. ∀ vn. ∀ wp. ∀ wn. ∀ xp. ∀ xn. ∀ p. ∀ n. ∀ q. ∀ m. p = ap · up + an · un + (bp · vn + bn · vp) + (cp · wp + cn · wn) + (dp · xn + dn · xp) ∧ n = ap · un + an · up + (bp · vp + bn · vn) + (cp · wn + cn · wp) + (dp · xp + dn · xn) → q = ap · up + an · un + (bp · vn + bn · vp) + (cp · wp + cn · wn) + (dp · xn + dn · xp) ∧ m = ap · un + an · up + (bp · vp + bn · vn) + (cp · wn + cn · wp) + (dp · xp + dn · xn) → p = q ∧ n = m
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 33 lines are the exact independently kernel-checked original script.
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–10
02Fix variables and assumptionsL11–20
03Fix variables and assumptionsL21–22
04Separate the logical casesL23–25
05Calculate and transport equalitiesL26–26
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L26
trans ((((((((ap) * (up) + (an) * (un))) + (((bp) * (vn) + (bn) * (vp))))) + (((cp) * (wp) + (cn) * (wn))))) + (((dp) * (xn) + (dn) * (xp))))
06Use earlier factsL27–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L27
exact hfirst_left
07Calculate and transport equalitiesL28–28
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L28
symm
08Use earlier factsL29–29
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L29
exact hsecond_left
09Calculate and transport equalitiesL30–30
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L30
trans ((((((((ap) * (un) + (an) * (up))) + (((bp) * (vp) + (bn) * (vn))))) + (((cp) * (wn) + (cn) * (wp))))) + (((dp) * (xp) + (dn) * (xn))))
10Use earlier factsL31–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L31
exact hfirst_right
11Calculate and transport equalitiesL32–32
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L32
symm
12Use earlier factsL33–33
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L33
exact hsecond_right
Original defined command ledger · 33 lines
- 0001
intro ap - 0002
intro an - 0003
intro bp - 0004
intro bn - 0005
intro cp - 0006
intro cn - 0007
intro dp - 0008
intro dn - 0009
intro up - 0010
intro un - 0011
intro vp - 0012
intro vn - 0013
intro wp - 0014
intro wn - 0015
intro xp - 0016
intro xn - 0017
intro p - 0018
intro n - 0019
intro q - 0020
intro m - 0021
intro hfirst - 0022
intro hsecond - 0023
cases hfirst - 0024
cases hsecond - 0025
split - 0026
trans ((((((((ap) * (up) + (an) * (un))) + (((bp) * (vn) + (bn) * (vp))))) + (((cp) * (wp) + (cn) * (wn))))) + (((dp) * (xn) + (dn) * (xp)))) - 0027
exact hfirst_left - 0028
symm - 0029
exact hsecond_left - 0030
trans ((((((((ap) * (un) + (an) * (up))) + (((bp) * (vp) + (bn) * (vn))))) + (((cp) * (wn) + (cn) * (wp))))) + (((dp) * (xp) + (dn) * (xn)))) - 0031
exact hfirst_right - 0032
symm - 0033
exact hsecond_right