Verify Matches Implies is ok and complete
Cedar.Thm.verifyMatchesImplies_is_ok_and_complete
Plain-language statement
Concrete version of verifyMatchesImplies_is_complete.
Exact Lean statement
theorem verifyMatchesImplies_is_ok_and_complete {p₁ p₁' p₂ p₂' : Policy} {Γ : TypeEnv} :
Γ.WellFormed →
wellTypedPolicy p₁ Γ = .ok p₁' →
wellTypedPolicy p₂ Γ = .ok p₂' →
∃ asserts,
verifyMatchesImplies p₁' p₂' (SymEnv.ofEnv Γ) = .ok asserts ∧
(SymEnv.ofEnv Γ ⊧ asserts →
∃ env : Env,
InstanceOfWellFormedEnvironment env.request env.entities Γ ∧
env.StronglyWellFormedForPolicy p₁' ∧
env.StronglyWellFormedForPolicy p₂' ∧
evaluate p₁.toExpr env.request env.entities = .ok (.prim (.bool true)) ∧
evaluate p₂.toExpr env.request env.entities ≠ .ok (.prim (.bool true)))Formal artifact
Lean source
theorem verifyMatchesImplies_is_ok_and_complete {p₁ p₁' p₂ p₂' : Policy} {Γ : TypeEnv} : Γ.WellFormed → wellTypedPolicy p₁ Γ = .ok p₁' → wellTypedPolicy p₂ Γ = .ok p₂' → ∃ asserts, verifyMatchesImplies p₁' p₂' (SymEnv.ofEnv Γ) = .ok asserts ∧ (SymEnv.ofEnv Γ ⊧ asserts → ∃ env : Env, InstanceOfWellFormedEnvironment env.request env.entities Γ ∧ env.StronglyWellFormedForPolicy p₁' ∧ env.StronglyWellFormedForPolicy p₂' ∧ evaluate p₁.toExpr env.request env.entities = .ok (.prim (.bool true)) ∧ evaluate p₂.toExpr env.request env.entities ≠ .ok (.prim (.bool true))):= by intros hwf hwt₁ hwt₂ have hwf_εnv₁ := ofEnv_swf_for_policy hwf hwt₁ have hwf_εnv₂ := ofEnv_swf_for_policy hwf hwt₂ have ⟨asserts, hok⟩ := verifyMatchesImplies_is_ok hwf hwt₁ hwt₂ exists asserts simp only [hok, true_and] intros hsat have ⟨env, hmodel, hswf_env₁, hswf_env₂, henum_comp, hres⟩ := verifyMatchesImplies_is_complete hwf_εnv₁ hwf_εnv₂ hok hsat have hinst := ofEnv_completeness hwf hswf_env₁.1 henum_comp hmodel simp only [ ←wellTypedPolicy_preserves_evaluation hinst hwt₁, ←wellTypedPolicy_preserves_evaluation hinst hwt₂, ] at hres exists env- Project
- Cedar Specification
- License
- Apache-2.0
- Commit
- 3f093947b8ae
- Source
- cedar-lean/Cedar/Thm/WellTypedVerification.lean:282-309
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
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.
Source project: Cedar Specification
Person-level attribution pending.
Find? notmem keys
Cedar.Data.Map.find?_notmem_keys
Plain-language statement
Inverse of find?_mem_toList, except that this requires wf
Source project: Cedar Specification
Person-level attribution pending.
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
Source project: Cedar Specification
Person-level attribution pending.