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 expanded first-order arithmetic statement
forall n d q. ~(n=0) -> (exists pvs_le_gap_bounded_input. pvs_le_gap_bounded_input + (d) = (n)) -> ((((~((d)=0)) /\ ((n)=(d)*(q)))) \/ ((((d)=0 \/ ~(exists pvs_factor_bounded_graphnondivisor. (n) = (d) * pvs_factor_bounded_graphnondivisor)) /\ ((q)=(d))))) -> (exists pvs_le_gap_bounded_result. pvs_le_gap_bounded_result + (q) = (n))Constructive proof overview
Generated structural guide
Divisor complementation stays in the exact inclusive interval 0..n, including its explicitly fixed omitted indices.
The unchanged tactic script uses 2 declared prerequisites and contains 19 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
divisor_le_nonzero Stable theorem; checked-use authorized mul_comm Stable theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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–8
03Use earlier factsL9–12
04Construct an explicit witnessL13–13
Supply the displayed value, then prove that it has the required property.
- L13
exists d
05Calculate and transport equalitiesL14–14
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L14
trans d*q
06Use earlier factsL15–16
07Separate the logical casesL17–17
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L17
cases hq_right
08Calculate and transport equalitiesL18–18
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L18
rewrite hq_right_right
09Use earlier factsL19–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
exact hd
Original exact command ledger · 19 lines
- 0001
intro n - 0002
intro d - 0003
intro q - 0004
intro hn - 0005
intro hd - 0006
intro hq - 0007
cases hq - 0008
cases hq_left - 0009
specialize divisor_le_nonzero (q) - 0010
specialize divisor_le_nonzero (n) - 0011
apply divisor_le_nonzero - 0012
exact hn - 0013
exists d - 0014
trans d*q - 0015
exact hq_left_right - 0016
apply mul_comm - 0017
cases hq_right - 0018
rewrite hq_right_right - 0019
exact hd