PA002M

mul_le_mul_right

Stable checked-use theorem · independently closed

Right multiplication preserves the witness-defined order.

Exact expanded PA statement

forall a b c. (exists k. k + a = b) -> exists r. r + a * c = b * c

Structural proof guide

Generated structural guide

Right multiplication preserves the witness-defined order.

Use the direct prerequisites add_mul as previously established PA formulas.

The proof proceeds by case analysis (1).

Referenced ingredients

PA0016 add_mul

Proof neighborhood

Direct dependencies

PA0016 add_mul

Direct dependents

PA002N le_scaled_nonzero

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.

  1. 0001intro a
  2. 0002intro b
  3. 0003intro c
  4. 0004intro h
  5. 0005cases h
  6. 0006exists x * c
  7. 0007trans (x + a) * c
  8. 0008symm
  9. 0009apply add_mul
  10. 0010congr
  11. 0011exact h_witness
  12. 0012refl