95 new Alpha admissions come from 96 source lemmas: tuple equality reflexivity reuses an already-admitted theorem and is not counted twice. All counts use actual finite beta-coded enumerations. G008 multiplicativity is proved; the general prime-power count and distinct-prime product formula are further goals. General prime-power fields (G091) remain open. Stable is unchanged.
Exact theorem in conservative defined notation
∀ k. ∀ n. ∀ c. ∀ T. ∀ B. ∀ C. ∀ D. ∀ E. ∀ j. ¬k = 0 → ¬n = 0 → JordanTupleRepresentatives(k,n,c,T) → JordanTupleScan(k,n,c,T,B,C,D,E,j) → JordanTotient(k,n,j)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 33 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–13
03Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
split
04Use earlier factsL15–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
exact hk
05Separate the logical casesL16–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L16
split
06Use earlier factsL17–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L17
exact hn
07Construct an explicit witnessL18–21
08Use earlier factsL22–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
specialize jordan_tuple_scan_complete (k) - L23
specialize jordan_tuple_scan_complete (n) - L24
specialize jordan_tuple_scan_complete (c) - L25
specialize jordan_tuple_scan_complete (T) - L26
specialize jordan_tuple_scan_complete (B) - L27
specialize jordan_tuple_scan_complete (C) - L28
specialize jordan_tuple_scan_complete (D) - L29
specialize jordan_tuple_scan_complete (E) - L30
specialize jordan_tuple_scan_complete (j) - L31
apply jordan_tuple_scan_complete
Original defined command ledger · 33 lines
- 0001
intro k - 0002
intro n - 0003
intro c - 0004
intro T - 0005
intro B - 0006
intro C - 0007
intro D - 0008
intro E - 0009
intro j - 0010
intro hk - 0011
intro hn - 0012
intro hbox - 0013
intro hscan - 0014
split - 0015
exact hk - 0016
split - 0017
exact hn - 0018
exists B - 0019
exists C - 0020
exists D - 0021
exists E - 0022
specialize jordan_tuple_scan_complete (k) - 0023
specialize jordan_tuple_scan_complete (n) - 0024
specialize jordan_tuple_scan_complete (c) - 0025
specialize jordan_tuple_scan_complete (T) - 0026
specialize jordan_tuple_scan_complete (B) - 0027
specialize jordan_tuple_scan_complete (C) - 0028
specialize jordan_tuple_scan_complete (D) - 0029
specialize jordan_tuple_scan_complete (E) - 0030
specialize jordan_tuple_scan_complete (j) - 0031
apply jordan_tuple_scan_complete - 0032
exact hbox - 0033
exact hscan