Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
The complementary quotient is witnessed by n=d*q at positive divisors. The actual permutation covers indices zero through n, fixing zero and nondivisors. This is the involution foundation for the separate cancellation and full G007 inversion proofs, not an assumed divisor bijection.
Exact theorem in conservative defined notation
∀ n. ∀ d. ∀ q. ∀ r. DivisorComplement(n,d,q) → DivisorComplement(n,d,r) → q = r
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 42 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–6
02Separate the logical casesL7–10
03Use earlier factsL11–15
04Calculate and transport equalitiesL16–17
05Use earlier factsL18–19
06Separate the logical casesL20–22
07Use earlier factsL23–25
08Construct an explicit witnessL26–26
Supply the displayed value, then prove that it has the required property.
- L26
exists q
09Use earlier factsL27–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L27
exact hq_left_right
10Separate the logical casesL28–32
11Use earlier factsL33–35
12Construct an explicit witnessL36–36
Supply the displayed value, then prove that it has the required property.
- L36
exists r
13Use earlier factsL37–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L37
exact hr_left_right
14Separate the logical casesL38–38
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L38
cases hr_right
15Calculate and transport equalitiesL39–39
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L39
trans d
16Use earlier factsL40–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L40
exact hq_right_right
17Calculate and transport equalitiesL41–41
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L41
symm
18Use earlier factsL42–42
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L42
exact hr_right_right
Original defined command ledger · 42 lines
- 0001
intro n - 0002
intro d - 0003
intro q - 0004
intro r - 0005
intro hq - 0006
intro hr - 0007
cases hq - 0008
cases hq_left - 0009
cases hr - 0010
cases hr_left - 0011
specialize mul_left_cancel_nonzero (d) - 0012
specialize mul_left_cancel_nonzero (q) - 0013
specialize mul_left_cancel_nonzero (r) - 0014
apply mul_left_cancel_nonzero - 0015
exact hq_left_left - 0016
trans n - 0017
symm - 0018
exact hq_left_right - 0019
exact hr_left_right - 0020
cases hr_right - 0021
exfalso - 0022
cases hr_right_left - 0023
apply hq_left_left - 0024
exact hr_right_left_left - 0025
apply hr_right_left_right - 0026
exists q - 0027
exact hq_left_right - 0028
cases hq_right - 0029
cases hr - 0030
cases hr_left - 0031
exfalso - 0032
cases hq_right_left - 0033
apply hr_left_left - 0034
exact hq_right_left_left - 0035
apply hq_right_left_right - 0036
exists r - 0037
exact hr_left_right - 0038
cases hr_right - 0039
trans d - 0040
exact hq_right_right - 0041
symm - 0042
exact hr_right_right