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.
Exact expanded PA statement
forall n a b. (forall d. (exists x. n = d * x) -> (exists y. a = d * y) -> d = 1) -> (forall d. (exists x. n = d * x) -> (exists y. b = d * y) -> d = 1) -> forall d. (exists x. n = d * x) -> (exists y. a * b = d * y) -> d = 1Structural proof guide
Coprimality with a fixed left operand is closed under multiplication on the right.
Direct prerequisites: coprime_mul_left, coprime_symm. The authored body proceeds by intermediate claims (3).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing 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 (2)
01Fix variables and assumptionsL1–5
02Establish hanL6–10
03Establish hbnL11–15
04Establish habnL16–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply coprime mul left.
- L16
have habn : forall d. (exists x. a * b = d * x) -> (exists y. n = d * y) -> d = 1 - L17
specialize coprime_mul_left a - L18
specialize coprime_mul_left b - L19
specialize coprime_mul_left n - L20
apply coprime_mul_left - L21
exact han - L22
exact hbn - L23
specialize coprime_symm (a * b) - L24
specialize coprime_symm n - L25
apply coprime_symm
05Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact habn
Original exact command ledger · 26 lines
- 0001
intro n - 0002
intro a - 0003
intro b - 0004
intro hna - 0005
intro hnb - 0006
have han : forall d. (exists x. a = d * x) -> (exists y. n = d * y) -> d = 1 - 0007
specialize coprime_symm n - 0008
specialize coprime_symm a - 0009
apply coprime_symm - 0010
exact hna - 0011
have hbn : forall d. (exists x. b = d * x) -> (exists y. n = d * y) -> d = 1 - 0012
specialize coprime_symm n - 0013
specialize coprime_symm b - 0014
apply coprime_symm - 0015
exact hnb - 0016
have habn : forall d. (exists x. a * b = d * x) -> (exists y. n = d * y) -> d = 1 - 0017
specialize coprime_mul_left a - 0018
specialize coprime_mul_left b - 0019
specialize coprime_mul_left n - 0020
apply coprime_mul_left - 0021
exact han - 0022
exact hbn - 0023
specialize coprime_symm (a * b) - 0024
specialize coprime_symm n - 0025
apply coprime_symm - 0026
exact habn