Active-after is active-at the next height
ProvedBitcoinActivation.activeAfter_eqFor every buried deployment and previous height , activeAfter equals activeAt: DeploymentActiveAfter(pindexPrev) is DeploymentActiveAt of the block that follows.
import Definitions.Def_BitcoinActivation
theorem BitcoinActivation.activeAfter_eq (dep : BuriedDeployment) (prevHeight : Nat) :
BitcoinActivation.activeAfter prevHeight dep = BitcoinActivation.activeAt (prevHeight + 1) dep := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinActivation.activeAfter_eq
Binders. The statement is universally quantified over two things: a label drawn from the five-element type , and a natural number (named "previous height"). There are no other hypotheses: every and every , including , is covered.
Conclusion. It asserts an equality of Boolean values (not a logical equivalence of propositions):
Unfolding the two sides. Writing for the tabulated height (, , , , ), and for the Boolean truth value of a decidable inequality :
- the left-hand side is by definition ;
- the right-hand side is by definition , i.e. the activation test evaluated at the height .
So the statement says that, for every label and every natural , the Boolean computed via the first definition equals the Boolean computed via the second definition. Here is natural-number successor; there is no overflow or wrap-around, and always.
What is not said. The statement does not relate to (same height, not shifted), and it does not say anything about the value of either side; it only says the two sides agree.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.