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. ∀ i. ∀ d. ∀ pb. ∀ pc. ∀ nb. ∀ nc. ∀ p. ∀ n. (∀ x. ∀ y. Lt(x,i) → BetaAt(b,c,x,y) → BetaAt(u,v,x,y)) → SignedDeterminantLocalStep(b,c,i,d,pb,pc,nb,nc,p,n) → SignedDeterminantLocalStep(u,v,i,d,pb,pc,nb,nc,p,n)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 54 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–14
03Separate the logical casesL15–16
04Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
exact hstep_left
05Separate the logical casesL18–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L18
right - L19
cases hstep_right - L20
cases hstep_right_witness - L21
cases hstep_right_witness_witness - L22
cases hstep_right_witness_witness_witness - L23
cases hstep_right_witness_witness_witness_witness - L24
cases hstep_right_witness_witness_witness_witness_witness - L25
cases hstep_right_witness_witness_witness_witness_witness_right
06Construct an explicit witnessL26–30
07Separate the logical casesL31–31
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L31
split
08Use earlier factsL32–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
exact hstep_right_witness_witness_witness_witness_witness_left
09Separate the logical casesL33–33
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L33
split
10Use earlier factsL34–43
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L34
specialize matrix_recursive_children_transport (b) - L35
specialize matrix_recursive_children_transport (c) - L36
specialize matrix_recursive_children_transport (u) - L37
specialize matrix_recursive_children_transport (v) - L38
specialize matrix_recursive_children_transport (i) - L39
specialize matrix_recursive_children_transport (i) - L40
specialize matrix_recursive_children_transport (pb) - L41
specialize matrix_recursive_children_transport (pc) - L42
specialize matrix_recursive_children_transport (nb) - L43
specialize matrix_recursive_children_transport (nc)
11Use earlier factsL44–53
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L44
specialize matrix_recursive_children_transport (x) - L45
specialize matrix_recursive_children_transport (x1) - L46
specialize matrix_recursive_children_transport (x2) - L47
specialize matrix_recursive_children_transport (x3) - L48
specialize matrix_recursive_children_transport (x4) - L49
specialize matrix_recursive_children_transport (S x) - L50
apply matrix_recursive_children_transport - L51
exact hprefix - L52
apply le_refl - L53
exact hstep_right_witness_witness_witness_witness_witness_right_left
12Use earlier factsL54–54
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L54
exact hstep_right_witness_witness_witness_witness_witness_right_right
Original defined command ledger · 54 lines
- 0001
intro b - 0002
intro c - 0003
intro u - 0004
intro v - 0005
intro i - 0006
intro d - 0007
intro pb - 0008
intro pc - 0009
intro nb - 0010
intro nc - 0011
intro p - 0012
intro n - 0013
intro hprefix - 0014
intro hstep - 0015
cases hstep - 0016
left - 0017
exact hstep_left - 0018
right - 0019
cases hstep_right - 0020
cases hstep_right_witness - 0021
cases hstep_right_witness_witness - 0022
cases hstep_right_witness_witness_witness - 0023
cases hstep_right_witness_witness_witness_witness - 0024
cases hstep_right_witness_witness_witness_witness_witness - 0025
cases hstep_right_witness_witness_witness_witness_witness_right - 0026
exists x - 0027
exists x1 - 0028
exists x2 - 0029
exists x3 - 0030
exists x4 - 0031
split - 0032
exact hstep_right_witness_witness_witness_witness_witness_left - 0033
split - 0034
specialize matrix_recursive_children_transport (b) - 0035
specialize matrix_recursive_children_transport (c) - 0036
specialize matrix_recursive_children_transport (u) - 0037
specialize matrix_recursive_children_transport (v) - 0038
specialize matrix_recursive_children_transport (i) - 0039
specialize matrix_recursive_children_transport (i) - 0040
specialize matrix_recursive_children_transport (pb) - 0041
specialize matrix_recursive_children_transport (pc) - 0042
specialize matrix_recursive_children_transport (nb) - 0043
specialize matrix_recursive_children_transport (nc) - 0044
specialize matrix_recursive_children_transport (x) - 0045
specialize matrix_recursive_children_transport (x1) - 0046
specialize matrix_recursive_children_transport (x2) - 0047
specialize matrix_recursive_children_transport (x3) - 0048
specialize matrix_recursive_children_transport (x4) - 0049
specialize matrix_recursive_children_transport (S x) - 0050
apply matrix_recursive_children_transport - 0051
exact hprefix - 0052
apply le_refl - 0053
exact hstep_right_witness_witness_witness_witness_witness_right_left - 0054
exact hstep_right_witness_witness_witness_witness_witness_right_right