Exact named statement
0 = 0 ∧ (0 = 0 ∧ 0 = 0) ∧ (0 = 0 · 1 ∧ (2 · S (2 · (2 · (2 · S (2 · (2 · S (2 · 1)))))) = 0 · 0 + 2 · S (2 · (2 · (2 · S (2 · (2 · S (2 · 1)))))) · 1 ∧ 0 = 0 · 0 + (2 · S (2 · (2 · (2 · S (2 · (2 · S (2 · 1)))))) · 0 + 0 · 1)))No displayed named abbreviation.
Complete certificate and independent checks
18 actual local proof nodes. Each node carries its complete ordinary HA proof body.
Full canonical proof bundle · Original HA receipt · Independent Lean receipt
Target SHA-256: 7e47828bf09996d16a8b6b4df1f9e4294d21df0390eaed4f546bc186ee88a535
Bundle SHA-256: d0c7066cbbdf46a1c1e5cda65e8e6a6fcba3eab567a2b795f0345c61f9fa743f
Checked statement containment
These exact targets occur inside this certificate. These links summarize containment, not direct dependency arrows; the downloadable bundle records every private lemma and ordered edge.
Scope
complete exact subconjunction child
None of these finite arithmetic statements closes an IR campaign parent. The analytic identification, interpolation and final positive irrationality certificate remain open.