All proofs
Project-declaredLean 4.31.0 · null

Verify Never Matches is ok and complete

Cedar.Thm.verifyNeverMatches_is_ok_and_complete

Plain-language statement

Concrete version of verifyNeverMatches_is_complete.

Exact Lean statement

theorem verifyNeverMatches_is_ok_and_complete {p p' : Policy} {Γ : TypeEnv} :
  Γ.WellFormed →
  wellTypedPolicy p Γ = .ok p' →
  ∃ asserts,
    verifyNeverMatches p' (SymEnv.ofEnv Γ) = .ok asserts ∧
    (SymEnv.ofEnv Γ ⊧ asserts →
      ∃ env : Env,
        InstanceOfWellFormedEnvironment env.request env.entities Γ ∧
        env.StronglyWellFormedForPolicy p' ∧
        evaluate p.toExpr env.request env.entities = .ok (.prim (.bool true)))

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem verifyNeverMatches_is_ok_and_complete {p p' : Policy} {Γ : TypeEnv} :  Γ.WellFormed   wellTypedPolicy p Γ = .ok p'    asserts,    verifyNeverMatches p' (SymEnv.ofEnv Γ) = .ok asserts     (SymEnv.ofEnv Γ ⊧ asserts        env : Env,        InstanceOfWellFormedEnvironment env.request env.entities Γ         env.StronglyWellFormedForPolicy p'         evaluate p.toExpr env.request env.entities = .ok (.prim (.bool true))):= by  intros hwf hwt  have hwf_εnv := ofEnv_swf_for_policy hwf hwt  have asserts, hok := verifyNeverMatches_is_ok hwf hwt  exists asserts  simp only [hok, true_and]  intros hsat  have env, hmodel, hswf_env, henum_comp, hres := verifyEvaluate_is_complete verifyNeverMatches_wbeq hwf_εnv hok hsat  have hinst := ofEnv_completeness hwf hswf_env.1 henum_comp hmodel  have := wellTypedPolicy_preserves_evaluation hinst hwt  simp only [wellTypedPolicy_preserves_evaluation hinst hwt] at hres  exists env  simp [this] at hres  simp [*]
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/WellTypedVerification.lean:168-191

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