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.Schema.Properties

fieldPath_strip_properties_cons — 🟢 proved

theorem · source

Theorem 1: Schema-predicate consistency Every field path in a predicate that starts with “properties.” can be stripped to produce a contract-queryable path. (Full cross-reference is bridge-tested via JSONL.)

theorem fieldPath_strip_properties_cons (rest : List String)
    (h : ("properties" :: rest).length > 0

missing_no_value — 🟢 proved

theorem · source

Theorem 2: Null safety Operators missing, present, and list_empty do not require a comparison value. All other operators do.

theorem missing_no_value : Operator.missing.requiresValue = false

present_no_value — 🟢 proved

theorem · source

theorem present_no_value : Operator.present.requiresValue = false

list_empty_no_value — 🟢 proved

theorem · source

theorem list_empty_no_value : Operator.listEmpty.requiresValue = false

eq_requires_value — 🟢 proved

theorem · source

theorem eq_requires_value : Operator.eq.requiresValue = true

ne_requires_value — 🟢 proved

theorem · source

theorem ne_requires_value : Operator.ne.requiresValue = true

contains_requires_value — 🟢 proved

theorem · source

theorem contains_requires_value : Operator.contains.requiresValue = true

null_safety_complete — 🟢 proved

theorem · source

theorem null_safety_complete :

appliesToAssetType_empty_means_all — 🟢 proved

theorem · source

Theorem 3: Catalog-schema coupling For every control in a catalog, if it declares no applicable asset types, appliesToAssetType returns true for any type. If it declares types, membership determines the result.

theorem appliesToAssetType_empty_means_all
    (c : ControlDef) (at_ : AssetType)
    (h : c.applicableAssetTypes = []) :
    c.appliesToAssetType at_ = true

appliesToAssetType_contains — 🟢 proved

theorem · source

theorem appliesToAssetType_contains
    (c : ControlDef) (at_ : AssetType)
    (h : at_ ∈ c.applicableAssetTypes) :
    c.appliesToAssetType at_ = true

embed_set_equality — 🟢 proved

theorem · source

Theorem 4: Embed invariant If two sorted lists of control IDs are equal, they contain the same elements (set equality from list equality).

theorem embed_set_equality
    {ids₁ ids₂ : List ControlId}
    (h : ids₁ = ids₂) :
    ∀ id, id ∈ ids₁ ↔ id ∈ ids₂

builtin_nonempty — 🟢 proved

theorem · source

Theorem 5: Capability liveness Every capability in the builtin set is a string. The bridge checker verifies each capability is referenced by ≥1 chain via JSONL. Here we prove the vocabulary is non-empty and closed.

theorem builtin_nonempty : builtinCapabilities.length > 0

capability_membership — 🟢 proved

theorem · source

theorem capability_membership (cap : String) :
    isValidCapability cap = true ↔ cap ∈ builtinCapabilities

allOperators — ⚪ definition

def · source

Theorem 6: Coverage bridge — operator set is closed The Lean Operator type has exactly 17 constructors, matching the Go IsSupported switch.

def allOperators : List Operator

operator_count — 🟢 proved

theorem · source

theorem operator_count : allOperators.length = 17

operator_exhaustive — 🟢 proved

theorem · source

theorem operator_exhaustive : ∀ op : Operator, op ∈ allOperators

cel_validation_types — 🟢 proved

theorem · source

CEL validation type coverage requiresCELValidation is true exactly for unsafeState and marker.

theorem cel_validation_types :

severity_total_order — 🟢 proved

theorem · source

Severity ordering is total

theorem severity_total_order :
    ∀ a b : Severity, a.toNat ≤ b.toNat ∨ b.toNat ≤ a.toNat

empty_predicate_no_fields — 🟢 proved

theorem · source

Predicate emptiness An empty predicate yields no field paths.

theorem empty_predicate_no_fields
    (p : UnsafePredicate) (h1 : p.any = []) (h2 : p.all = []) :
    p.fieldPaths = []