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.
This branch proves the finite determinant/rank/span substrate. It does not claim Smith or Hermite normal form, lattice index equals determinant, determinant multiplicativity, lattice reduction, or geometry-of-numbers theorems.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ u. ∀ v. ∀ l. ∀ m. ∀ pb. ∀ pc. ∀ nb. ∀ nc. ∀ q. ∀ eb. ∀ ec. ∀ fb. ∀ fc. ∀ k. (∀ x. ∀ y. Lt(x,l) → BetaAt(b,c,x,y) → BetaAt(u,v,x,y)) → Le(l,m) → SignedDeterminantChildPrefix(b,c,l,pb,pc,nb,nc,q,eb,ec,fb,fc,k) → SignedDeterminantChildPrefix(u,v,m,pb,pc,nb,nc,q,eb,ec,fb,fc,k)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 73 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay 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.
Named ingredients (1)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–20
03Fix variables and assumptionsL21–21
Work with arbitrary variables or the premises of the current implication.
- L21
intro hj
04Establish hentryL22–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hchildren.
- L22
have hentry : ∃ i. ∃ up. ∃ us. ∃ un. ∃ ut. ∃ a. ∃ z. Lt(i,l) ∧ (SignedDeterminantNodeAt(b,c,i,q,up,us,un,ut,a,z) ∧ (SignedMatrixMinor(pb,pc,nb,nc,S q,0,j,q,up,us,un,ut) ∧ (BetaAt(eb,ec,j,a) ∧ BetaAt(fb,fc,j,z))))Definitions: Lt(i,l)SignedDeterminantNodeAt(b,c,i,q,up,us,un,ut,a,z)SignedMatrixMinor(pb,pc,nb,nc,S q,0,j,q,up,us,un,ut)BetaAt(eb,ec,j,a)BetaAt(fb,fc,j,z)Original native command in the exact edition - L23
specialize hchildren (j) - L24
apply hchildren - L25
exact hj
05Separate the logical casesL26–35
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L26
cases hentry - L27
cases hentry_witness - L28
cases hentry_witness_witness - L29
cases hentry_witness_witness_witness - L30
cases hentry_witness_witness_witness_witness - L31
cases hentry_witness_witness_witness_witness_witness - L32
cases hentry_witness_witness_witness_witness_witness_witness - L33
cases hentry_witness_witness_witness_witness_witness_witness_witness - L34
cases hentry_witness_witness_witness_witness_witness_witness_witness_right - L35
cases hentry_witness_witness_witness_witness_witness_witness_witness_right_right
06Separate the logical casesL36–36
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L36
cases hentry_witness_witness_witness_witness_witness_witness_witness_right_right_right
07Construct an explicit witnessL37–43
08Separate the logical casesL44–44
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L44
split
09Use earlier factsL45–50
10Separate the logical casesL51–51
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L51
split
11Use earlier factsL52–61
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L52
specialize matrix_recursive_record_transport (b) - L53
specialize matrix_recursive_record_transport (c) - L54
specialize matrix_recursive_record_transport (u) - L55
specialize matrix_recursive_record_transport (v) - L56
specialize matrix_recursive_record_transport (l) - L57
specialize matrix_recursive_record_transport (x) - L58
specialize matrix_recursive_record_transport (q) - L59
specialize matrix_recursive_record_transport (x1) - L60
specialize matrix_recursive_record_transport (x2) - L61
specialize matrix_recursive_record_transport (x3)
12Use earlier factsL62–68
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L62
specialize matrix_recursive_record_transport (x4) - L63
specialize matrix_recursive_record_transport (x5) - L64
specialize matrix_recursive_record_transport (x6) - L65
apply matrix_recursive_record_transport - L66
exact hprefix - L67
exact hentry_witness_witness_witness_witness_witness_witness_witness_left - L68
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_left
13Separate the logical casesL69–69
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L69
split
14Use earlier factsL70–70
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L70
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_right_left
15Separate the logical casesL71–71
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L71
split
Original defined command ledger · 73 lines
- 0001
intro b - 0002
intro c - 0003
intro u - 0004
intro v - 0005
intro l - 0006
intro m - 0007
intro pb - 0008
intro pc - 0009
intro nb - 0010
intro nc - 0011
intro q - 0012
intro eb - 0013
intro ec - 0014
intro fb - 0015
intro fc - 0016
intro k - 0017
intro hprefix - 0018
intro hlm - 0019
intro hchildren - 0020
intro j - 0021
intro hj - 0022
have hentry : ∃ i. ∃ up. ∃ us. ∃ un. ∃ ut. ∃ a. ∃ z. Lt(i,l) ∧ (SignedDeterminantNodeAt(b,c,i,q,up,us,un,ut,a,z) ∧ (SignedMatrixMinor(pb,pc,nb,nc,S q,0,j,q,up,us,un,ut) ∧ (BetaAt(eb,ec,j,a) ∧ BetaAt(fb,fc,j,z)))) - 0023
specialize hchildren (j) - 0024
apply hchildren - 0025
exact hj - 0026
cases hentry - 0027
cases hentry_witness - 0028
cases hentry_witness_witness - 0029
cases hentry_witness_witness_witness - 0030
cases hentry_witness_witness_witness_witness - 0031
cases hentry_witness_witness_witness_witness_witness - 0032
cases hentry_witness_witness_witness_witness_witness_witness - 0033
cases hentry_witness_witness_witness_witness_witness_witness_witness - 0034
cases hentry_witness_witness_witness_witness_witness_witness_witness_right - 0035
cases hentry_witness_witness_witness_witness_witness_witness_witness_right_right - 0036
cases hentry_witness_witness_witness_witness_witness_witness_witness_right_right_right - 0037
exists x - 0038
exists x1 - 0039
exists x2 - 0040
exists x3 - 0041
exists x4 - 0042
exists x5 - 0043
exists x6 - 0044
split - 0045
specialize lt_of_lt_of_le (x) - 0046
specialize lt_of_lt_of_le (l) - 0047
specialize lt_of_lt_of_le (m) - 0048
apply lt_of_lt_of_le - 0049
exact hentry_witness_witness_witness_witness_witness_witness_witness_left - 0050
exact hlm - 0051
split - 0052
specialize matrix_recursive_record_transport (b) - 0053
specialize matrix_recursive_record_transport (c) - 0054
specialize matrix_recursive_record_transport (u) - 0055
specialize matrix_recursive_record_transport (v) - 0056
specialize matrix_recursive_record_transport (l) - 0057
specialize matrix_recursive_record_transport (x) - 0058
specialize matrix_recursive_record_transport (q) - 0059
specialize matrix_recursive_record_transport (x1) - 0060
specialize matrix_recursive_record_transport (x2) - 0061
specialize matrix_recursive_record_transport (x3) - 0062
specialize matrix_recursive_record_transport (x4) - 0063
specialize matrix_recursive_record_transport (x5) - 0064
specialize matrix_recursive_record_transport (x6) - 0065
apply matrix_recursive_record_transport - 0066
exact hprefix - 0067
exact hentry_witness_witness_witness_witness_witness_witness_witness_left - 0068
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_left - 0069
split - 0070
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_right_left - 0071
split - 0072
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_right_right_left - 0073
exact hentry_witness_witness_witness_witness_witness_witness_witness_right_right_right_right