Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Seclib.Compose.Monotonicity

failingCount_mono — 🟢 proved

theorem · source

theorem failingCount_mono (chain : ChainDef) (s t : List ControlId) :
    failingCount chain s ≤ failingCount chain (s ++ t)

chainFires_mono — 🟢 proved

theorem · source

theorem chainFires_mono (chain : ChainDef) (s t : List ControlId)
    (h : chainFires chain s) : chainFires chain (s ++ t)

chainFires_add_one — 🟢 proved

theorem · source

theorem chainFires_add_one (chain : ChainDef) (s : List ControlId) (f : ControlId)
    (h : chainFires chain s) : chainFires chain (s ++ [f])

firingSet_mono — 🟢 proved

theorem · source

Set-level monotonicity: the set of firing chains never shrinks when the failing set grows. Every chain that fires on s also fires on s ++ t. This is the deliverable-4 property from the LEAN4-COMPOSE spec.

theorem firingSet_mono (chains : List ChainDef) (s t : List ControlId) :

failingCount_le_length — 🟢 proved

theorem · source

failingCount is bounded by the chain’s control count.

theorem failingCount_le_length (chain : ChainDef) (failing : List ControlId) :
    failingCount chain failing ≤ chain.controls.length