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 p n d e. (~((p) = 1) /\ forall pvs_left_preserve_prime pvs_right_preserve_prime. (p) = pvs_left_preserve_prime * pvs_right_preserve_prime -> pvs_left_preserve_prime = 1 \/ pvs_right_preserve_prime = 1) -> (exists pvs_factor_preserve_p. (n) = (p) * pvs_factor_preserve_p) -> (exists pvs_factor_preserve_d. (n) = (d) * pvs_factor_preserve_d) -> ((((~(exists pvs_factor_preserve_graphfresh_input. (d) = (p) * pvs_factor_preserve_graphfresh_input)) /\ ((e)=(p)*(d)))) \/ (((((d)=(p)*(e)) /\ (~(exists pvs_factor_preserve_graphfresh_output. (e) = (p) * pvs_factor_preserve_graphfresh_output)))) \/ (((exists pvs_factor_preserve_graphsquare. (d) = ((p)*(p)) * pvs_factor_preserve_graphsquare) /\ ((e)=(d)))))) -> (exists pvs_factor_preserve_e. (n) = (e) * pvs_factor_preserve_e)Constructive proof overview
Generated structural guide
Every actual prime toggle of a divisor of n is again a divisor, provided p itself is a prime divisor of n.
The unchanged tactic script uses 3 declared prerequisites and contains 33 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
MC0002 prime_toggle_fresh_divisor_product multiple_trans 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.
Named ingredients (1)
01Fix variables and assumptionsL1–8
02Separate the logical casesL9–10
03Calculate and transport equalitiesL11–11
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L11
rewrite he_left_right
04Use earlier factsL12–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
05Separate the logical casesL20–21
06Use earlier factsL22–26
07Construct an explicit witnessL27–27
Supply the displayed value, then prove that it has the required property.
- L27
exists p
08Calculate and transport equalitiesL28–28
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L28
trans p*e
09Use earlier factsL29–30
10Separate the logical casesL31–31
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L31
cases he_right_right
11Calculate and transport equalitiesL32–32
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L32
rewrite he_right_right_right
12Use earlier factsL33–33
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L33
exact hdn
Original exact command ledger · 33 lines
- 0001
intro p - 0002
intro n - 0003
intro d - 0004
intro e - 0005
intro hp - 0006
intro hpn - 0007
intro hdn - 0008
intro he - 0009
cases he - 0010
cases he_left - 0011
rewrite he_left_right - 0012
specialize prime_toggle_fresh_divisor_product (p) - 0013
specialize prime_toggle_fresh_divisor_product (n) - 0014
specialize prime_toggle_fresh_divisor_product (d) - 0015
apply prime_toggle_fresh_divisor_product - 0016
exact hp - 0017
exact hpn - 0018
exact hdn - 0019
exact he_left_left - 0020
cases he_right - 0021
cases he_right_left - 0022
specialize multiple_trans (d) - 0023
specialize multiple_trans (e) - 0024
specialize multiple_trans (n) - 0025
apply multiple_trans - 0026
exact hdn - 0027
exists p - 0028
trans p*e - 0029
exact he_right_left_left - 0030
apply mul_comm - 0031
cases he_right_right - 0032
rewrite he_right_right_right - 0033
exact hdn