All proofs
Project-declaredLean 4.31.0 · null

Verify Always Matches is complete

Cedar.Thm.verifyAlwaysMatches_is_complete

Plain-language statement

The verifyAlwaysMatches analysis is complete: if the assertions verifyAlwaysMatches p εnv are satisfiable for the policy p and the strongly well-formed symbolic environment εnv, then there exists a strongly well-formed concrete environment env ∈ᵢ εnv such that the evaluator will not return .ok true when applied to p and env.

Exact Lean statement

theorem verifyAlwaysMatches_is_complete {p : Policy} {εnv : SymEnv} {asserts : Asserts} :
  εnv.StronglyWellFormedForPolicy p →
  verifyAlwaysMatches p εnv = .ok asserts →
  εnv ⊧ asserts →
  ∃ env,
    env ∈ᵢ εnv ∧
    env.StronglyWellFormedForPolicy p ∧
    Env.EnumCompleteFor env εnv ∧
    evaluate p.toExpr env.request env.entities ≠ .ok true

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem verifyAlwaysMatches_is_complete {p : Policy} {εnv : SymEnv} {asserts : Asserts} :  εnv.StronglyWellFormedForPolicy p   verifyAlwaysMatches p εnv = .ok asserts   εnv ⊧ asserts    env,    env ᵢ εnv     env.StronglyWellFormedForPolicy p     Env.EnumCompleteFor env εnv     evaluate p.toExpr env.request env.entities  .ok true:= by  intro h₁ h₂ h₃  unfold verifyAlwaysMatches at h₂  have env, h₄, h₅, h₆, h₇ := verifyEvaluate_is_complete verifyAlwaysMatches_wbeq h₁ h₂ h₃  exists env  rw [beq_eq_false_iff_ne, ne_eq] at h₇  exact h₄, h₅, h₆, h₇
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/Verification.lean:127-142

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.31.0

Find? ext

Cedar.Data.Map.find?_ext

Plain-language statement

Two well-formed maps are equal if they have the same find? for every key.

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Find? notmem keys

Cedar.Data.Map.find?_notmem_keys

Plain-language statement

Inverse of find?_mem_toList, except that this requires wf

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Find? some iff in values

Cedar.Data.Map.find?_some_iff_in_values

Plain-language statement

The mp direction of this does not need the wf precondition and, in fact, is available separately as find?_some_implies_in_values above

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record