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. JordanTupleRepresentatives(k,n,c,T) → JordanTupleScan(k,n,c,T,B,C,D,E,j) → JordanTupleEnumeration(k,n,B,C,D,E,j)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 61 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 (3)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hscan
03Separate the logical casesL12–14
04Use earlier factsL15–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
exact hscan_left
05Separate the logical casesL16–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L16
split
06Fix variables and assumptionsL17–20
07Establish hzL21–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hbox.
- L21
have hz : ∃ z. Lt(z,T) ∧ IntegerVectorZero(b,e,z,c,k)Definitions: Lt(z,T)IntegerVectorZero(b,e,z,c,k)Original native command in the exact edition - L22
specialize hbox (b) - L23
specialize hbox (e) - L24
apply hbox - L25
exact hb
08Separate the logical casesL26–27
09Use earlier factsL28–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
specialize jordan_tuple_listed_equal_transport (b) - L29
specialize jordan_tuple_listed_equal_transport (e) - L30
specialize jordan_tuple_listed_equal_transport (x) - L31
specialize jordan_tuple_listed_equal_transport (c) - L32
specialize jordan_tuple_listed_equal_transport (k) - L33
specialize jordan_tuple_listed_equal_transport (B) - L34
specialize jordan_tuple_listed_equal_transport (C) - L35
specialize jordan_tuple_listed_equal_transport (D) - L36
specialize jordan_tuple_listed_equal_transport (E) - L37
specialize jordan_tuple_listed_equal_transport (j)
10Use earlier factsL38–47
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
apply jordan_tuple_listed_equal_transport - L39
exact hz_witness_right - L40
specialize hscan_right_right (x) - L41
apply hscan_right_right - L42
exact hz_witness_left - L43
specialize jordan_tuple_bounded_transport (b) - L44
specialize jordan_tuple_bounded_transport (e) - L45
specialize jordan_tuple_bounded_transport (x) - L46
specialize jordan_tuple_bounded_transport (c) - L47
specialize jordan_tuple_bounded_transport (k)
11Use earlier factsL48–57
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L48
specialize jordan_tuple_bounded_transport (n) - L49
apply jordan_tuple_bounded_transport - L50
exact hz_witness_right - L51
exact hb - L52
specialize jordan_primitive_tuple_transport (n) - L53
specialize jordan_primitive_tuple_transport (b) - L54
specialize jordan_primitive_tuple_transport (e) - L55
specialize jordan_primitive_tuple_transport (x) - L56
specialize jordan_primitive_tuple_transport (c) - L57
specialize jordan_primitive_tuple_transport (k)
Original defined command ledger · 61 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 hbox - 0011
intro hscan - 0012
cases hscan - 0013
cases hscan_right - 0014
split - 0015
exact hscan_left - 0016
split - 0017
intro b - 0018
intro e - 0019
intro hb - 0020
intro hp - 0021
have hz : ∃ z. Lt(z,T) ∧ IntegerVectorZero(b,e,z,c,k) - 0022
specialize hbox (b) - 0023
specialize hbox (e) - 0024
apply hbox - 0025
exact hb - 0026
cases hz - 0027
cases hz_witness - 0028
specialize jordan_tuple_listed_equal_transport (b) - 0029
specialize jordan_tuple_listed_equal_transport (e) - 0030
specialize jordan_tuple_listed_equal_transport (x) - 0031
specialize jordan_tuple_listed_equal_transport (c) - 0032
specialize jordan_tuple_listed_equal_transport (k) - 0033
specialize jordan_tuple_listed_equal_transport (B) - 0034
specialize jordan_tuple_listed_equal_transport (C) - 0035
specialize jordan_tuple_listed_equal_transport (D) - 0036
specialize jordan_tuple_listed_equal_transport (E) - 0037
specialize jordan_tuple_listed_equal_transport (j) - 0038
apply jordan_tuple_listed_equal_transport - 0039
exact hz_witness_right - 0040
specialize hscan_right_right (x) - 0041
apply hscan_right_right - 0042
exact hz_witness_left - 0043
specialize jordan_tuple_bounded_transport (b) - 0044
specialize jordan_tuple_bounded_transport (e) - 0045
specialize jordan_tuple_bounded_transport (x) - 0046
specialize jordan_tuple_bounded_transport (c) - 0047
specialize jordan_tuple_bounded_transport (k) - 0048
specialize jordan_tuple_bounded_transport (n) - 0049
apply jordan_tuple_bounded_transport - 0050
exact hz_witness_right - 0051
exact hb - 0052
specialize jordan_primitive_tuple_transport (n) - 0053
specialize jordan_primitive_tuple_transport (b) - 0054
specialize jordan_primitive_tuple_transport (e) - 0055
specialize jordan_primitive_tuple_transport (x) - 0056
specialize jordan_primitive_tuple_transport (c) - 0057
specialize jordan_primitive_tuple_transport (k) - 0058
apply jordan_primitive_tuple_transport - 0059
exact hz_witness_right - 0060
exact hp - 0061
exact hscan_right_left