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.
The original division, gcd, cancellation, and factor-existence foundations are exposed through checked wrappers. Unordered uniqueness adds an actual bounded, injective, surjective index map matching repeated prime occurrences. The empty factor list represents one, not zero.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ d. ∀ e. ∀ u. ∀ v. ∀ l. ∀ p. PermutationPrefix(u,v,l) ∧ FactorListMatching(b,c,d,e,u,v,l) → BetaAt(b,c,l,p) → BetaAt(d,e,l,p) → ∃ x. ∃ y. PermutationPrefix(x,y,S l) ∧ FactorListMatching(b,c,d,e,x,y,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 30 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–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hright
03Establish hexL12–21
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor permutation matched append.
- L12
have hex : ∃ U. ∃ V. PermutationPrefix(U,V,S l) ∧ FactorListMatching(b,c,d,e,U,V,S l) ∧ (BetaAt(U,V,l,l) ∧ (∀ x. ∀ y. Lt(x,l) → BetaAt(u,v,x,y) → BetaAt(U,V,x,y)))Definitions: PermutationPrefix(U,V,S l)FactorListMatching(b,c,d,e,U,V,S l)BetaAt(U,V,l,l)Lt(x,l)BetaAt(u,v,x,y)BetaAt(U,V,x,y)Original native command in the exact edition - L13
specialize factor_permutation_matched_append (b) - L14
specialize factor_permutation_matched_append (c) - L15
specialize factor_permutation_matched_append (d) - L16
specialize factor_permutation_matched_append (e) - L17
specialize factor_permutation_matched_append (u) - L18
specialize factor_permutation_matched_append (v) - L19
specialize factor_permutation_matched_append (l) - L20
specialize factor_permutation_matched_append (p) - L21
apply factor_permutation_matched_append
04Use earlier factsL22–24
05Separate the logical casesL25–27
06Construct an explicit witnessL28–29
07Use earlier factsL30–30
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L30
exact hex_witness_witness_left
Original defined command ledger · 30 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
intro u - 0006
intro v - 0007
intro l - 0008
intro p - 0009
intro hm - 0010
intro hleft - 0011
intro hright - 0012
have hex : ∃ U. ∃ V. PermutationPrefix(U,V,S l) ∧ FactorListMatching(b,c,d,e,U,V,S l) ∧ (BetaAt(U,V,l,l) ∧ (∀ x. ∀ y. Lt(x,l) → BetaAt(u,v,x,y) → BetaAt(U,V,x,y))) - 0013
specialize factor_permutation_matched_append (b) - 0014
specialize factor_permutation_matched_append (c) - 0015
specialize factor_permutation_matched_append (d) - 0016
specialize factor_permutation_matched_append (e) - 0017
specialize factor_permutation_matched_append (u) - 0018
specialize factor_permutation_matched_append (v) - 0019
specialize factor_permutation_matched_append (l) - 0020
specialize factor_permutation_matched_append (p) - 0021
apply factor_permutation_matched_append - 0022
exact hm - 0023
exact hleft - 0024
exact hright - 0025
cases hex - 0026
cases hex_witness - 0027
cases hex_witness_witness - 0028
exists x - 0029
exists x1 - 0030
exact hex_witness_witness_left