proofs
Provednlightninglightningpr-14deep-formalization

A compatible liquidity request implies a valid advertised interval

For all minimum,maximum,requested∈N\htmlData{mx=1}{\mathit{minimum}, \mathit{maximum}, \mathit{requested} \in \htmlData{mx=0}{\mathbb{N}}}, if minimum≤requested∧requested≤maximum\htmlData{mx=0}{\mathit{minimum}} \mathrel{\htmlData{mx=2}{\leq}} \htmlData{mx=1}{\mathit{requested}} \mathbin{\htmlData{mx=6}{\land}} \htmlData{mx=3}{\mathit{requested}} \mathrel{\htmlData{mx=5}{\leq}} \htmlData{mx=4}{\mathit{maximum}}, then

minimum≤maximum\htmlData{mx=0}{\mathit{minimum}} \mathrel{\htmlData{mx=2}{\leq}} \htmlData{mx=1}{\mathit{maximum}}
What the notation means · or point at any symbol
NNatural numbers
The natural numbers 0, 1, 2, …. In Lean they start at 0. (Nat)
x ∈ TVariables
minimum, maximum, requested range over natural numbers: the statement must hold for every choice. ((minimum maximum requested : Nat))
≤At most
minimum is less than or equal to requested. (minimum ≤ requested)
∧And
Both hold: minimum ≤ requested, and requested ≤ maximum. (minimum ≤ requested ∧ requested ≤ maxim…)

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