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
forall m n. ~(m = 0) -> ~(m * m + n * n = 0)Every purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall m n. ~(m = 0) -> ~(m * m + n * n = 0)Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
Read the argument
Proof checkpoints
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–4
02Establish hsquareL5–9
03Establish hsplitL10–12
04Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
cases hsplit
Original defined command ledger · 17 lines
- 0001
intro m - 0002
intro n - 0003
intro hnonzero - 0004
intro hsum - 0005
have hsquare : m * m = 0 - 0006
specialize add_eq_zero_left (m * m) - 0007
specialize add_eq_zero_left (n * n) - 0008
apply add_eq_zero_left - 0009
exact hsum - 0010
have hsplit : m = 0 \/ m = 0 - 0011
apply mul_eq_zero - 0012
exact hsquare - 0013
cases hsplit - 0014
apply hnonzero - 0015
exact hsplit_left - 0016
apply hnonzero - 0017
exact hsplit_right