Exact expanded PA statement
forall m a b c d. (exists u v. a + m * u = b + m * v) -> (exists r s. c + m * r = d + m * s) -> exists x y. (a * c) + m * x = (b * d) + m * yStructural proof guide
Generated structural guide
Balanced natural congruence respects multiplication.
Use the direct prerequisites mod_eq_mul_right, mod_eq_mul_left, mod_eq_trans as previously established PA formulas.
The proof proceeds by intermediate claims (2).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.
- 0001
intro m - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro hab - 0007
intro hcd - 0008
have hacbc : exists r s. (a * c) + m * r = (b * c) + m * s - 0009
specialize mod_eq_mul_right m - 0010
specialize mod_eq_mul_right a - 0011
specialize mod_eq_mul_right b - 0012
specialize mod_eq_mul_right c - 0013
apply mod_eq_mul_right - 0014
exact hab - 0015
have hbcbd : exists r s. (b * c) + m * r = (b * d) + m * s - 0016
specialize mod_eq_mul_left m - 0017
specialize mod_eq_mul_left c - 0018
specialize mod_eq_mul_left d - 0019
specialize mod_eq_mul_left b - 0020
apply mod_eq_mul_left - 0021
exact hcd - 0022
specialize mod_eq_trans m - 0023
specialize mod_eq_trans (a * c) - 0024
specialize mod_eq_trans (b * c) - 0025
specialize mod_eq_trans (b * d) - 0026
apply mod_eq_trans - 0027
exact hacbc - 0028
exact hbcbd