Exact expanded PA statement
forall a b. (forall d. (exists x. a = d * x) -> (exists y. b = d * y) -> d = 1) -> exists xp yp xn yn. a * xp + b * yp = 1 + (a * xn + b * yn)Structural proof guide
Coprime inputs admit balanced natural Bezout coefficients with result one.
Direct prerequisites: gcd_balanced_bezout_exists. The authored body proceeds by case analysis (8), intermediate claims (2), equality transport (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 a - 0002
intro b - 0003
intro hcop - 0004
have hgb : exists d. ((((exists x. a = d * x) /\ (exists y. b = d * y)) /\ forall c. (exists u. a = c * u) -> (exists v. b = c * v) -> exists w. d = c * w) /\ exists xp yp xn yn. a * xp + b * yp = d + (a * xn + b * yn)) - 0005
apply gcd_balanced_bezout_exists - 0006
cases hgb - 0007
cases hgb_witness - 0008
cases hgb_witness_left - 0009
cases hgb_witness_left_left - 0010
have hd : x = 1 - 0011
specialize hcop x - 0012
apply hcop - 0013
exact hgb_witness_left_left_left - 0014
exact hgb_witness_left_left_right - 0015
cases hgb_witness_right - 0016
cases hgb_witness_right_witness - 0017
cases hgb_witness_right_witness_witness - 0018
cases hgb_witness_right_witness_witness_witness - 0019
exists x1 - 0020
exists x2 - 0021
exists x3 - 0022
exists x4 - 0023
rewrite hd at hgb_witness_right_witness_witness_witness_witness - 0024
exact hgb_witness_right_witness_witness_witness_witness