Exact expanded PA statement
forall a b d xp yp xn yn z. a * xp + b * yp = d + (a * xn + b * yn) -> a * (xp * z) + (b * z) * yp = d * z + (a * (xn * z) + (b * z) * yn)Structural proof guide
Scale a balanced natural combination on the right.
Direct prerequisites: mul_assoc, mul_comm, add_mul. The authored body proceeds by direct introduction and elimination.
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 d - 0004
intro xp - 0005
intro yp - 0006
intro xn - 0007
intro yn - 0008
intro z - 0009
intro h - 0010
trans (a * xp) * z + (b * z) * yp - 0011
congr - 0012
symm - 0013
apply mul_assoc - 0014
refl - 0015
trans (a * xp) * z + (b * yp) * z - 0016
congr - 0017
refl - 0018
trans b * (z * yp) - 0019
apply mul_assoc - 0020
trans b * (yp * z) - 0021
congr - 0022
refl - 0023
apply mul_comm - 0024
symm - 0025
apply mul_assoc - 0026
trans (a * xp + b * yp) * z - 0027
symm - 0028
apply add_mul - 0029
trans (d + (a * xn + b * yn)) * z - 0030
congr - 0031
exact h - 0032
refl - 0033
trans d * z + (a * xn + b * yn) * z - 0034
apply add_mul - 0035
trans d * z + ((a * xn) * z + (b * yn) * z) - 0036
congr - 0037
refl - 0038
apply add_mul - 0039
trans d * z + (a * (xn * z) + (b * yn) * z) - 0040
congr - 0041
refl - 0042
congr - 0043
apply mul_assoc - 0044
refl - 0045
congr - 0046
refl - 0047
congr - 0048
refl - 0049
trans b * (yn * z) - 0050
apply mul_assoc - 0051
trans b * (z * yn) - 0052
congr - 0053
refl - 0054
apply mul_comm - 0055
symm - 0056
apply mul_assoc