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. ∀ w. ∀ rb. ∀ rc. ∀ cb. ∀ cc. ∀ q. ∀ Rb. ∀ Rc. ∀ Cb. ∀ Cc. ∀ i. ∀ a. (∀ x. ∀ y. Lt(x,q) → BetaAt(rb,rc,x,y) → BetaAt(Rb,Rc,x,y)) → (∀ x. ∀ y. Lt(x,q) → BetaAt(cb,cc,x,y) → BetaAt(Cb,Cc,x,y)) → Lt(i,q · q) → (∃ x. ∃ y. ∃ z. ∃ n. i = q · x + y ∧ (Lt(y,q) ∧ (BetaAt(rb,rc,x,z) ∧ (BetaAt(cb,cc,y,n) ∧ BetaAt(b,c,z · w + n,a))))) → ∃ x. ∃ y. ∃ z. ∃ n. i = q · x + y ∧ (Lt(y,q) ∧ (BetaAt(Rb,Rc,x,z) ∧ (BetaAt(Cb,Cc,y,n) ∧ BetaAt(b,c,z · w + n,a))))
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 55 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–18
03Separate the logical casesL19–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hpoint - L20
cases hpoint_witness - L21
cases hpoint_witness_witness - L22
cases hpoint_witness_witness_witness - L23
cases hpoint_witness_witness_witness_witness - L24
cases hpoint_witness_witness_witness_witness_right - L25
cases hpoint_witness_witness_witness_witness_right_right - L26
cases hpoint_witness_witness_witness_witness_right_right_right
04Establish hrL27–34
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply matrix recursive quotient row bound.
- L27
- L28
specialize matrix_recursive_quotient_row_bound (q) - L29
specialize matrix_recursive_quotient_row_bound (i) - L30
specialize matrix_recursive_quotient_row_bound (x) - L31
specialize matrix_recursive_quotient_row_bound (x1) - L32
apply matrix_recursive_quotient_row_bound - L33
exact hpoint_witness_witness_witness_witness_left - L34
exact hi
05Construct an explicit witnessL35–38
06Separate the logical casesL39–39
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L39
split
07Use earlier factsL40–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L40
exact hpoint_witness_witness_witness_witness_left
08Separate the logical casesL41–41
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L41
split
09Use earlier factsL42–42
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L42
exact hpoint_witness_witness_witness_witness_right_left
10Separate the logical casesL43–43
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L43
split
11Use earlier factsL44–48
12Separate the logical casesL49–49
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L49
split
13Use earlier factsL50–55
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 55 lines
- 0001
intro b - 0002
intro c - 0003
intro w - 0004
intro rb - 0005
intro rc - 0006
intro cb - 0007
intro cc - 0008
intro q - 0009
intro Rb - 0010
intro Rc - 0011
intro Cb - 0012
intro Cc - 0013
intro i - 0014
intro a - 0015
intro hrows - 0016
intro hcolumns - 0017
intro hi - 0018
intro hpoint - 0019
cases hpoint - 0020
cases hpoint_witness - 0021
cases hpoint_witness_witness - 0022
cases hpoint_witness_witness_witness - 0023
cases hpoint_witness_witness_witness_witness - 0024
cases hpoint_witness_witness_witness_witness_right - 0025
cases hpoint_witness_witness_witness_witness_right_right - 0026
cases hpoint_witness_witness_witness_witness_right_right_right - 0027
have hr : Lt(x,q) - 0028
specialize matrix_recursive_quotient_row_bound (q) - 0029
specialize matrix_recursive_quotient_row_bound (i) - 0030
specialize matrix_recursive_quotient_row_bound (x) - 0031
specialize matrix_recursive_quotient_row_bound (x1) - 0032
apply matrix_recursive_quotient_row_bound - 0033
exact hpoint_witness_witness_witness_witness_left - 0034
exact hi - 0035
exists x - 0036
exists x1 - 0037
exists x2 - 0038
exists x3 - 0039
split - 0040
exact hpoint_witness_witness_witness_witness_left - 0041
split - 0042
exact hpoint_witness_witness_witness_witness_right_left - 0043
split - 0044
specialize hrows (x) - 0045
specialize hrows (x2) - 0046
apply hrows - 0047
exact hr - 0048
exact hpoint_witness_witness_witness_witness_right_right_left - 0049
split - 0050
specialize hcolumns (x1) - 0051
specialize hcolumns (x3) - 0052
apply hcolumns - 0053
exact hpoint_witness_witness_witness_witness_right_left - 0054
exact hpoint_witness_witness_witness_witness_right_right_right_left - 0055
exact hpoint_witness_witness_witness_witness_right_right_right_right