Exact expanded PA statement
forall m a b c. (exists u v. a + m * u = b + m * v) -> exists r s. (a * c) + m * r = (b * c) + m * sStructural proof guide
Balanced congruence is preserved by multiplication on the right.
Direct prerequisites: add_mul, mul_assoc. The authored body proceeds by case analysis (2).
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 m - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro h - 0006
cases h - 0007
cases h_witness - 0008
exists x * c - 0009
exists x1 * c - 0010
trans a * c + (m * x) * c - 0011
congr - 0012
refl - 0013
symm - 0014
apply mul_assoc - 0015
trans (a + m * x) * c - 0016
symm - 0017
apply add_mul - 0018
trans (b + m * x1) * c - 0019
congr - 0020
exact h_witness_witness - 0021
refl - 0022
trans b * c + (m * x1) * c - 0023
apply add_mul - 0024
congr - 0025
refl - 0026
apply mul_assoc