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 this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 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