Exact expanded PA statement
forall c a b. ~(c = 0) -> (exists k. k + c * a = c * b) -> exists k. k + a = bStructural proof guide
Witness order cancels a common nonzero left multiplier.
Direct prerequisites: add_comm, factor_difference, mul_left_cancel_nonzero, mul_add. The authored body proceeds by case analysis (2), 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 c - 0002
intro a - 0003
intro b - 0004
intro hc - 0005
intro hle - 0006
cases hle - 0007
have heq : c * b = c * a + x - 0008
trans x + c * a - 0009
symm - 0010
exact hle_witness - 0011
apply add_comm - 0012
have hfactor : exists w. x = c * w - 0013
specialize factor_difference c - 0014
specialize factor_difference b - 0015
specialize factor_difference a - 0016
specialize factor_difference x - 0017
apply factor_difference - 0018
exact heq - 0019
cases hfactor - 0020
exists x1 - 0021
specialize mul_left_cancel_nonzero c - 0022
specialize mul_left_cancel_nonzero (x1 + a) - 0023
specialize mul_left_cancel_nonzero b - 0024
apply mul_left_cancel_nonzero - 0025
exact hc - 0026
trans c * x1 + c * a - 0027
apply mul_add - 0028
rewrite <- hfactor_witness - 0029
exact hle_witness