Exact expanded PA statement
forall p q. (~(p = 1) /\ forall c e. p = c * e -> c = 1 \/ e = 1) -> (~(q = 1) /\ forall c e. q = c * e -> c = 1 \/ e = 1) -> ~(p = q) -> forall d. (exists x. p = d * x) -> (exists y. q = d * y) -> d = 1Structural proof guide
Distinct primes are coprime in the expanded common-divisor relation.
Direct prerequisites: prime_divisor_eq_one_or_self, prime_not_divides_coprime. The authored body proceeds by case analysis (2), intermediate claims (2).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
intro p - 0002
intro q - 0003
intro hp - 0004
intro hq - 0005
intro hpq - 0006
have hnot : ~(exists k. q = p * k) - 0007
intro hdiv - 0008
specialize prime_divisor_eq_one_or_self q - 0009
specialize prime_divisor_eq_one_or_self p - 0010
have hfactor : p = 1 \/ q = p - 0011
apply prime_divisor_eq_one_or_self - 0012
exact hq - 0013
exact hdiv - 0014
cases hfactor - 0015
cases hp - 0016
apply hp_left - 0017
exact hfactor_left - 0018
apply hpq - 0019
symm - 0020
exact hfactor_right - 0021
specialize prime_not_divides_coprime p - 0022
specialize prime_not_divides_coprime q - 0023
apply prime_not_divides_coprime - 0024
exact hp - 0025
exact hnot