PA006R

four_mul_eq_double_double

Stable checked-use theorem · independently closed

Multiplication by four is iterated doubling.

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.

Exact expanded PA statement

forall a. 4 * a = 2 * (2 * a)

Structural proof guide

Generated structural guide

Multiplication by four is iterated doubling.

Use the direct prerequisites mul_assoc as previously established PA formulas.

The proof proceeds by closed numeral normalization (1).

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.

Read the argument

Proof checkpoints

6 script commands · 3 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.

Named ingredients (1)
01Fix variables and assumptionsL1–1

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

  1. L1
    intro a
02Calculate and transport equalitiesL2–5

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

  1. L2
    trans (2 * 2) * a
  2. L3
    congr
  3. L4
    norm_num
  4. L5
    refl
03Use earlier factsL6–6

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

  1. L6
    apply mul_assoc

Library-wide reading audit

Original exact command ledger · 6 lines
  1. 0001intro a
  2. 0002trans (2 * 2) * a
  3. 0003congr
  4. 0004norm_num
  5. 0005refl
  6. 0006apply mul_assoc