Exact expanded PA statement
forall N C B. (forall t. (exists h. S t + S h = S N) -> exists q. C = S t * q) -> forall t. (exists h. S t + S h = S N) -> exists q. C * B = S t * qStructural proof guide
A right multiple of a bounded common multiple remains such a common multiple.
Direct prerequisites: multiple_mul_right. The authored body proceeds by intermediate claims (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 N - 0002
intro C - 0003
intro B - 0004
intro hcm - 0005
intro t - 0006
intro ht - 0007
have htC : exists q. C = S t * q - 0008
specialize hcm t - 0009
apply hcm - 0010
exact ht - 0011
specialize multiple_mul_right (S t) - 0012
specialize multiple_mul_right C - 0013
specialize multiple_mul_right B - 0014
apply multiple_mul_right - 0015
exact htC