Exact expanded PA statement
forall a b n. (forall d. (exists x. a = d * x) -> (exists y. n = d * y) -> d = 1) -> (forall d. (exists x. b = d * x) -> (exists y. n = d * y) -> d = 1) -> forall d. (exists x. a * b = d * x) -> (exists y. n = d * y) -> d = 1Structural proof guide
Generated structural guide
Coprimality with a fixed right operand is closed under multiplication on the left.
Use the direct prerequisites multiple_trans, gauss_coprime_cancel as previously established PA formulas.
The proof proceeds by intermediate claims (3).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.
- 0001
intro a - 0002
intro b - 0003
intro n - 0004
intro han - 0005
intro hbn - 0006
intro d - 0007
intro hab - 0008
intro hdn - 0009
have hda : forall e. (exists u. d = e * u) -> (exists v. a = e * v) -> e = 1 - 0010
intro e - 0011
intro hed - 0012
intro hea - 0013
have hen : exists q. n = e * q - 0014
specialize multiple_trans d - 0015
specialize multiple_trans e - 0016
specialize multiple_trans n - 0017
apply multiple_trans - 0018
exact hdn - 0019
exact hed - 0020
specialize han e - 0021
apply han - 0022
exact hea - 0023
exact hen - 0024
have hdb : exists w. b = d * w - 0025
specialize gauss_coprime_cancel d - 0026
specialize gauss_coprime_cancel a - 0027
specialize gauss_coprime_cancel b - 0028
apply gauss_coprime_cancel - 0029
exact hda - 0030
exact hab - 0031
specialize hbn d - 0032
apply hbn - 0033
exact hdb - 0034
exact hdn