Exact expanded PA statement
forall c a b d xp yp xn yn. (exists u. a = c * u) -> (exists v. b = c * v) -> a * xp + b * yp = d + (a * xn + b * yn) -> exists w. d = c * wStructural proof guide
Every common divisor of two inputs divides the result of a balanced natural combination.
Direct prerequisites: mul_assoc, mul_add, add_comm, factor_difference. The authored body proceeds by case analysis (2), equality transport (4).
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 c - 0002
intro a - 0003
intro b - 0004
intro d - 0005
intro xp - 0006
intro yp - 0007
intro xn - 0008
intro yn - 0009
intro ha - 0010
intro hb - 0011
intro h - 0012
cases ha - 0013
cases hb - 0014
specialize factor_difference c - 0015
specialize factor_difference (x * xp + x1 * yp) - 0016
specialize factor_difference (x * xn + x1 * yn) - 0017
specialize factor_difference d - 0018
apply factor_difference - 0019
trans c * (x * xp) + c * (x1 * yp) - 0020
apply mul_add - 0021
trans (c * x) * xp + (c * x1) * yp - 0022
congr - 0023
symm - 0024
apply mul_assoc - 0025
symm - 0026
apply mul_assoc - 0027
trans a * xp + b * yp - 0028
rewrite ha_witness - 0029
rewrite hb_witness - 0030
refl - 0031
trans d + (a * xn + b * yn) - 0032
exact h - 0033
trans (a * xn + b * yn) + d - 0034
apply add_comm - 0035
trans ((c * x) * xn + (c * x1) * yn) + d - 0036
rewrite ha_witness - 0037
rewrite hb_witness - 0038
refl - 0039
trans (c * (x * xn) + c * (x1 * yn)) + d - 0040
congr - 0041
congr - 0042
apply mul_assoc - 0043
apply mul_assoc - 0044
refl - 0045
congr - 0046
symm - 0047
apply mul_add - 0048
refl