Verify Matches Equivalent is ok and sound
Cedar.Thm.verifyMatchesEquivalent_is_ok_and_sound
Plain-language statement
Concrete version of verifyMatchesEquivalent_is_sound.
Exact Lean statement
theorem verifyMatchesEquivalent_is_ok_and_sound {p₁ p₁' p₂ p₂' : Policy} {Γ : TypeEnv} :
Γ.WellFormed →
wellTypedPolicy p₁ Γ = .ok p₁' →
wellTypedPolicy p₂ Γ = .ok p₂' →
∃ asserts,
verifyMatchesEquivalent 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 verifyMatchesEquivalent_is_ok_and_sound {p₁ p₁' p₂ p₂' : Policy} {Γ : TypeEnv} : Γ.WellFormed → wellTypedPolicy p₁ Γ = .ok p₁' → wellTypedPolicy p₂ Γ = .ok p₂' → ∃ asserts, verifyMatchesEquivalent 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⟩ := verifyMatchesEquivalent_is_ok hwf hwt₁ hwt₂ exists asserts simp only [hok, true_and] intros hunsat env hinst hwf_env₁ hwf_env₂ simp only [ wellTypedPolicy_preserves_evaluation hinst hwt₁, wellTypedPolicy_preserves_evaluation hinst hwt₂, ] apply verifyMatchesEquivalent_is_sound hwf_εnv₁ hwf_εnv₂ hok hunsat env _ hwf_env₁ hwf_env₂ exact ofEnv_soundness hwf_env₁.1 hinst- Project
- Cedar Specification
- License
- Apache-2.0
- Commit
- 3f093947b8ae
- Source
- cedar-lean/Cedar/Thm/WellTypedVerification.lean:194-220
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.