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
∀ q. ∀ r. ∀ b. ∀ c. ∀ k. Dvd(q,r) → JordanTupleAllDivisible(r,b,c,k) → JordanTupleAllDivisible(q,b,c,k)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 21 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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro ha
03Use earlier factsL12–21
Original defined command ledger · 21 lines
- 0001
intro q - 0002
intro r - 0003
intro b - 0004
intro c - 0005
intro k - 0006
intro hqr - 0007
intro hall - 0008
intro i - 0009
intro a - 0010
intro hi - 0011
intro ha - 0012
specialize multiple_trans (r) - 0013
specialize multiple_trans (q) - 0014
specialize multiple_trans (a) - 0015
apply multiple_trans - 0016
specialize hall (i) - 0017
specialize hall (a) - 0018
apply hall - 0019
exact hi - 0020
exact ha - 0021
exact hqr