The median time past is one of the chain's times
ProvedBitcoinHeader.mtp_memFor every non-empty chain of times, . Immediate from window membership, since the window is a prefix of the chain.
import Definitions.Def_BitcoinHeader
theorem BitcoinHeader.mtp_mem (times : List Int) (h : times ≠ []) :
BitcoinHeader.medianTimePast times ∈ times := 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)
For every finite list of integers , under the single hypothesis that is not the empty list (so ), the statement asserts that the integer is a member of the list , i.e. it equals for at least one position . Here is defined by taking the first entries of (so under the hypothesis), sorting them into non-decreasing order , and returning (zero-based position, natural-number division rounding down; this is the unique middle element of the sorted window when is odd and the upper of the two middle elements when is even, e.g. when ). The definition returns the fallback value when the window is empty, but that case is excluded by the hypothesis , so the fallback plays no role here. The conclusion is membership in the whole list (not merely in its first eleven entries): it says the computed value occurs somewhere in , without specifying where. The statement makes no claim about , where the value would be , which need not be a member of anything.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.