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. (∀ x. ∀ y. Lt(x,l) → BetaAt(b,c,x,y) → BetaAt(u,v,x,y)) → SignedDeterminantHistory(b,c,l) → SignedDeterminantHistory(u,v,l)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 74 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 (2)
01Fix variables and assumptionsL1–9
02Establish hentryL10–13
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hhistory.
- L10
have hentry : ∃ d. ∃ pb. ∃ pc. ∃ nb. ∃ nc. ∃ p. ∃ n. SignedDeterminantNodeAt(b,c,i,d,pb,pc,nb,nc,p,n) ∧ SignedDeterminantLocalStep(b,c,i,d,pb,pc,nb,nc,p,n)Definitions: SignedDeterminantNodeAt(b,c,i,d,pb,pc,nb,nc,p,n)SignedDeterminantLocalStep(b,c,i,d,pb,pc,nb,nc,p,n)Original native command in the exact edition - L11
specialize hhistory (i) - L12
apply hhistory - L13
exact hi
03Separate the logical casesL14–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
cases hentry - L15
cases hentry_witness - L16
cases hentry_witness_witness - L17
cases hentry_witness_witness_witness - L18
cases hentry_witness_witness_witness_witness - L19
cases hentry_witness_witness_witness_witness_witness - L20
cases hentry_witness_witness_witness_witness_witness_witness - L21
cases hentry_witness_witness_witness_witness_witness_witness_witness
04Construct an explicit witnessL22–28
05Separate the logical casesL29–29
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L29
split
06Use earlier factsL30–39
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L30
specialize matrix_recursive_record_transport (b) - L31
specialize matrix_recursive_record_transport (c) - L32
specialize matrix_recursive_record_transport (u) - L33
specialize matrix_recursive_record_transport (v) - L34
specialize matrix_recursive_record_transport (l) - L35
specialize matrix_recursive_record_transport (i) - L36
specialize matrix_recursive_record_transport (x) - L37
specialize matrix_recursive_record_transport (x1) - L38
specialize matrix_recursive_record_transport (x2) - L39
specialize matrix_recursive_record_transport (x3)
07Use earlier factsL40–49
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L40
specialize matrix_recursive_record_transport (x4) - L41
specialize matrix_recursive_record_transport (x5) - L42
specialize matrix_recursive_record_transport (x6) - L43
apply matrix_recursive_record_transport - L44
exact hprefix - L45
exact hi - L46
exact hentry_witness_witness_witness_witness_witness_witness_witness_left - L47
specialize matrix_recursive_step_transport (b) - L48
specialize matrix_recursive_step_transport (c) - L49
specialize matrix_recursive_step_transport (u)
08Use earlier factsL50–59
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L50
specialize matrix_recursive_step_transport (v) - L51
specialize matrix_recursive_step_transport (i) - L52
specialize matrix_recursive_step_transport (x) - L53
specialize matrix_recursive_step_transport (x1) - L54
specialize matrix_recursive_step_transport (x2) - L55
specialize matrix_recursive_step_transport (x3) - L56
specialize matrix_recursive_step_transport (x4) - L57
specialize matrix_recursive_step_transport (x5) - L58
specialize matrix_recursive_step_transport (x6) - L59
apply matrix_recursive_step_transport
09Fix variables and assumptionsL60–63
10Use earlier factsL64–73
11Use earlier factsL74–74
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L74
exact hentry_witness_witness_witness_witness_witness_witness_witness_right
Original defined command ledger · 74 lines
- 0001
intro b - 0002
intro c - 0003
intro u - 0004
intro v - 0005
intro l - 0006
intro hprefix - 0007
intro hhistory - 0008
intro i - 0009
intro hi - 0010
have hentry : ∃ d. ∃ pb. ∃ pc. ∃ nb. ∃ nc. ∃ p. ∃ n. SignedDeterminantNodeAt(b,c,i,d,pb,pc,nb,nc,p,n) ∧ SignedDeterminantLocalStep(b,c,i,d,pb,pc,nb,nc,p,n) - 0011
specialize hhistory (i) - 0012
apply hhistory - 0013
exact hi - 0014
cases hentry - 0015
cases hentry_witness - 0016
cases hentry_witness_witness - 0017
cases hentry_witness_witness_witness - 0018
cases hentry_witness_witness_witness_witness - 0019
cases hentry_witness_witness_witness_witness_witness - 0020
cases hentry_witness_witness_witness_witness_witness_witness - 0021
cases hentry_witness_witness_witness_witness_witness_witness_witness - 0022
exists x - 0023
exists x1 - 0024
exists x2 - 0025
exists x3 - 0026
exists x4 - 0027
exists x5 - 0028
exists x6 - 0029
split - 0030
specialize matrix_recursive_record_transport (b) - 0031
specialize matrix_recursive_record_transport (c) - 0032
specialize matrix_recursive_record_transport (u) - 0033
specialize matrix_recursive_record_transport (v) - 0034
specialize matrix_recursive_record_transport (l) - 0035
specialize matrix_recursive_record_transport (i) - 0036
specialize matrix_recursive_record_transport (x) - 0037
specialize matrix_recursive_record_transport (x1) - 0038
specialize matrix_recursive_record_transport (x2) - 0039
specialize matrix_recursive_record_transport (x3) - 0040
specialize matrix_recursive_record_transport (x4) - 0041
specialize matrix_recursive_record_transport (x5) - 0042
specialize matrix_recursive_record_transport (x6) - 0043
apply matrix_recursive_record_transport - 0044
exact hprefix - 0045
exact hi - 0046
exact hentry_witness_witness_witness_witness_witness_witness_witness_left - 0047
specialize matrix_recursive_step_transport (b) - 0048
specialize matrix_recursive_step_transport (c) - 0049
specialize matrix_recursive_step_transport (u) - 0050
specialize matrix_recursive_step_transport (v) - 0051
specialize matrix_recursive_step_transport (i) - 0052
specialize matrix_recursive_step_transport (x) - 0053
specialize matrix_recursive_step_transport (x1) - 0054
specialize matrix_recursive_step_transport (x2) - 0055
specialize matrix_recursive_step_transport (x3) - 0056
specialize matrix_recursive_step_transport (x4) - 0057
specialize matrix_recursive_step_transport (x5) - 0058
specialize matrix_recursive_step_transport (x6) - 0059
apply matrix_recursive_step_transport - 0060
intro j - 0061
intro a - 0062
intro hj - 0063
intro ha - 0064
specialize hprefix (j) - 0065
specialize hprefix (a) - 0066
apply hprefix - 0067
specialize lt_trans (j) - 0068
specialize lt_trans (i) - 0069
specialize lt_trans (l) - 0070
apply lt_trans - 0071
exact hj - 0072
exact hi - 0073
exact ha - 0074
exact hentry_witness_witness_witness_witness_witness_witness_witness_right