PA003C · theorem

remainder_decomposition_to_mod_eq

Stable checked-use theorem · independently closed

A directed quotient/remainder equation gives balanced congruence to its remainder.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

Statement with defined notation

∀ m. ∀ b. ∀ q. ∀ x. b = q · m + x → ModEq(m,b,x)

Every purple notation token opens its conservative definition. This is a reading surface; the compiler expands the statement before the unchanged kernel checks it.

Definitions used by this theorem

In the theorem statement

1 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall m b q x. b = q * m + x -> exists u v. b + m * u = x + m * v

Proof neighborhood

Direct theorem prerequisites

Direct theorem dependents

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. The untrusted compiler re-expands each one before the original tactic script is replayed; defined notation is never accepted by the kernel. Open the exact replay line beneath every changed command.

Read the argument

Proof checkpoints

16 script commands · 8 reading checkpoints · 0 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (2)
01Fix variables and assumptionsL1–5

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro m
  2. L2
    intro b
  3. L3
    intro q
  4. L4
    intro x
  5. L5
    intro h
02Construct an explicit witnessL6–7

Supply the displayed value, then prove that it has the required property.

  1. L6
    exists 0
  2. L7
    exists q
03Calculate and transport equalitiesL8–10

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L8
    rewrite PA5
  2. L9
    rewrite PA3
  3. L10
    trans q * m + x
04Use earlier factsL11–11

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L11
    exact h
05Calculate and transport equalitiesL12–12

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L12
    trans x + q * m
06Use earlier factsL13–13

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L13
    apply add_comm
07Calculate and transport equalitiesL14–15

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L14
    congr
  2. L15
    refl
08Use earlier factsL16–16

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L16
    apply mul_comm

Library-wide reading audit

Original defined command ledger · 16 lines
  1. 0001intro m
  2. 0002intro b
  3. 0003intro q
  4. 0004intro x
  5. 0005intro h
  6. 0006exists 0
  7. 0007exists q
  8. 0008rewrite PA5
  9. 0009rewrite PA3
  10. 0010trans q * m + x
  11. 0011exact h
  12. 0012trans x + q * m
  13. 0013apply add_comm
  14. 0014congr
  15. 0015refl
  16. 0016apply mul_comm