Exact expanded PA statement
forall p a. (~(p = 1) /\ forall c e. p = c * e -> c = 1 \/ e = 1) -> ~(exists k. a = p * k) -> forall d. (exists x. p = d * x) -> (exists y. a = d * y) -> d = 1Structural proof guide
A prime not dividing a natural is coprime to that natural.
Direct prerequisites: prime_coprime_or_divides. The authored body proceeds by case analysis (1), intermediate claims (1).
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 a - 0003
intro hp - 0004
intro hnot - 0005
specialize prime_coprime_or_divides p - 0006
specialize prime_coprime_or_divides a - 0007
have hsplit : (forall d. (exists x. p = d * x) -> (exists y. a = d * y) -> d = 1) \/ exists k. a = p * k - 0008
apply prime_coprime_or_divides - 0009
exact hp - 0010
cases hsplit - 0011
exact hsplit_left - 0012
exfalso - 0013
apply hnot - 0014
exact hsplit_right