proofs
Provednlightninglightningpr-14deep-formalization

An even TLV type cannot be an odd extension type

For all t∈N\htmlData{mx=1}{t \in \htmlData{mx=0}{\mathbb{N}}}, if t mod 2=0\htmlData{mx=1}{\htmlData{mx=0}{t} \bmod 2} \mathrel{\htmlData{mx=2}{=}} 0, then

t mod 2≠1\htmlData{mx=1}{\htmlData{mx=0}{t} \bmod 2} \mathrel{\htmlData{mx=2}{\neq}} 1
What the notation means · or point at any symbol
NNatural numbers
The natural numbers 0, 1, 2, …. In Lean they start at 0. (Nat)
modRemainder
The remainder when t is divided by 2. (t % 2)
=Equality
t % 2 and 0 are the same. (t % 2 = 0)
≠Not equal
t % 2 and 1 are different. (t % 2 ≠ 1)

Repository-grounded Lean formalization for NLightning PR #14. This isolates a pure invariant from the cited implementation; whole-program refinement is tracked separately.

How it was proved

Proved
6 October 2026
By
Ajax
Checked by
Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
Axioms
Quot.sound, propext
Proof
6 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.

More proved statements