Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
These are actual signed-table and finite-sum foundations. Equality compares represented signed values, not arbitrary encodings. MatrixMinorFourCode is reused solely as generic nested pairing, without a matrix hypothesis. Full finite signed G007 is established separately in the Möbius-inversion family.
Exact theorem in conservative defined notation
∀ N. ∀ F. ∀ r. ∀ s. ∀ l. ArithTable(N,F) → ∃ x. ArithTable(l,x) ∧ ArithReindex(F,x,r,s,l)
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 (4)
01Fix variables and assumptionsL1–6
02Establish hrepL7–11
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table components.
- L7
have hrep : ∃ pb. ∃ pc. ∃ nb. ∃ nc. MatrixMinorFourCode(F,pb,pc,nb,nc)Definitions: MatrixMinorFourCode(F,pb,pc,nb,nc)Original native command in the exact edition - L8
specialize divisor_signed_table_components (N) - L9
specialize divisor_signed_table_components (F) - L10
apply divisor_signed_table_components - L11
exact ht
03Separate the logical casesL12–15
04Establish hdataL16–24
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table reindex data exists.
- L16
have hdata : ∃ qb. ∃ qc. ∃ mb. ∃ mc. (∀ y. ∀ z. ∀ n. Lt(y,l) → BetaAt(r,s,y,z) → BetaAt(x,x1,z,n) → BetaAt(qb,qc,y,n)) ∧ (∀ y. ∀ z. ∀ n. Lt(y,l) → BetaAt(r,s,y,z) → BetaAt(x2,x3,z,n) → BetaAt(mb,mc,y,n))Definitions: Lt(y,l)BetaAt(r,s,y,z)BetaAt(x,x1,z,n)BetaAt(qb,qc,y,n)BetaAt(x2,x3,z,n)BetaAt(mb,mc,y,n)Original native command in the exact edition - L17
specialize divisor_signed_table_reindex_data_exists (x) - L18
specialize divisor_signed_table_reindex_data_exists (x1) - L19
specialize divisor_signed_table_reindex_data_exists (x2) - L20
specialize divisor_signed_table_reindex_data_exists (x3) - L21
specialize divisor_signed_table_reindex_data_exists (r) - L22
specialize divisor_signed_table_reindex_data_exists (s) - L23
specialize divisor_signed_table_reindex_data_exists (l) - L24
apply divisor_signed_table_reindex_data_exists
05Separate the logical casesL25–28
06Construct an explicit witnessL29–29
Supply the displayed value, then prove that it has the required property.
- L29
exists ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))))
07Separate the logical casesL30–30
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L30
split
08Use earlier factsL31–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L31
specialize divisor_signed_table_from_components (l) - L32
specialize divisor_signed_table_from_components (((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))))) - L33
specialize divisor_signed_table_from_components (x4) - L34
specialize divisor_signed_table_from_components (x5) - L35
specialize divisor_signed_table_from_components (x6) - L36
specialize divisor_signed_table_from_components (x7) - L37
apply divisor_signed_table_from_components
09Calculate and transport equalitiesL38–38
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L38
refl
10Use earlier factsL39–48
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L39
specialize divisor_signed_table_reindex_from_components (F) - L40
specialize divisor_signed_table_reindex_from_components (((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))))) - L41
specialize divisor_signed_table_reindex_from_components (x) - L42
specialize divisor_signed_table_reindex_from_components (x1) - L43
specialize divisor_signed_table_reindex_from_components (x2) - L44
specialize divisor_signed_table_reindex_from_components (x3) - L45
specialize divisor_signed_table_reindex_from_components (x4) - L46
specialize divisor_signed_table_reindex_from_components (x5) - L47
specialize divisor_signed_table_reindex_from_components (x6) - L48
specialize divisor_signed_table_reindex_from_components (x7)
11Use earlier factsL49–53
Instantiate or apply named facts and discharge the corresponding proof obligations.
12Calculate and transport equalitiesL54–54
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L54
refl
13Use earlier factsL55–55
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L55
exact hdata_witness_witness_witness_witness
Original defined command ledger · 55 lines
- 0001
intro N - 0002
intro F - 0003
intro r - 0004
intro s - 0005
intro l - 0006
intro ht - 0007
have hrep : ∃ pb. ∃ pc. ∃ nb. ∃ nc. MatrixMinorFourCode(F,pb,pc,nb,nc) - 0008
specialize divisor_signed_table_components (N) - 0009
specialize divisor_signed_table_components (F) - 0010
apply divisor_signed_table_components - 0011
exact ht - 0012
cases hrep - 0013
cases hrep_witness - 0014
cases hrep_witness_witness - 0015
cases hrep_witness_witness_witness - 0016
have hdata : ∃ qb. ∃ qc. ∃ mb. ∃ mc. (∀ y. ∀ z. ∀ n. Lt(y,l) → BetaAt(r,s,y,z) → BetaAt(x,x1,z,n) → BetaAt(qb,qc,y,n)) ∧ (∀ y. ∀ z. ∀ n. Lt(y,l) → BetaAt(r,s,y,z) → BetaAt(x2,x3,z,n) → BetaAt(mb,mc,y,n)) - 0017
specialize divisor_signed_table_reindex_data_exists (x) - 0018
specialize divisor_signed_table_reindex_data_exists (x1) - 0019
specialize divisor_signed_table_reindex_data_exists (x2) - 0020
specialize divisor_signed_table_reindex_data_exists (x3) - 0021
specialize divisor_signed_table_reindex_data_exists (r) - 0022
specialize divisor_signed_table_reindex_data_exists (s) - 0023
specialize divisor_signed_table_reindex_data_exists (l) - 0024
apply divisor_signed_table_reindex_data_exists - 0025
cases hdata - 0026
cases hdata_witness - 0027
cases hdata_witness_witness - 0028
cases hdata_witness_witness_witness - 0029
exists ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) - 0030
split - 0031
specialize divisor_signed_table_from_components (l) - 0032
specialize divisor_signed_table_from_components (((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))))) - 0033
specialize divisor_signed_table_from_components (x4) - 0034
specialize divisor_signed_table_from_components (x5) - 0035
specialize divisor_signed_table_from_components (x6) - 0036
specialize divisor_signed_table_from_components (x7) - 0037
apply divisor_signed_table_from_components - 0038
refl - 0039
specialize divisor_signed_table_reindex_from_components (F) - 0040
specialize divisor_signed_table_reindex_from_components (((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) * S ((((x4) + (x5)) * S ((x4) + (x5)) + ((x5) + (x5))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7)))) + ((((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))) + (((x6) + (x7)) * S ((x6) + (x7)) + ((x7) + (x7))))) - 0041
specialize divisor_signed_table_reindex_from_components (x) - 0042
specialize divisor_signed_table_reindex_from_components (x1) - 0043
specialize divisor_signed_table_reindex_from_components (x2) - 0044
specialize divisor_signed_table_reindex_from_components (x3) - 0045
specialize divisor_signed_table_reindex_from_components (x4) - 0046
specialize divisor_signed_table_reindex_from_components (x5) - 0047
specialize divisor_signed_table_reindex_from_components (x6) - 0048
specialize divisor_signed_table_reindex_from_components (x7) - 0049
specialize divisor_signed_table_reindex_from_components (r) - 0050
specialize divisor_signed_table_reindex_from_components (s) - 0051
specialize divisor_signed_table_reindex_from_components (l) - 0052
apply divisor_signed_table_reindex_from_components - 0053
exact hrep_witness_witness_witness_witness - 0054
refl - 0055
exact hdata_witness_witness_witness_witness