BT000A

mul_one

Stable checked-use theorem · independently kernel verified

One is a right identity for multiplication.

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 n. n * 1 = n

Structural proof guide

One is a right identity for multiplication.

Direct prerequisites: zero_add. The authored body proceeds by direct introduction and elimination.

Proof neighborhood

Direct dependencies

Direct dependents

Formal native tactic body

Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing Stable membership.

Read the argument

Proof checkpoints

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

01Fix variables and assumptionsL1–1

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

  1. L1
    intro n
02Calculate and transport equalitiesL2–2

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

  1. L2
    simp [zero_add]

Library-wide reading audit

Original exact command ledger · 2 lines
  1. 0001intro n
  2. 0002simp [zero_add]