Verify Matches Disjoint is sound
Cedar.Thm.verifyMatchesDisjoint_is_sound
Plain-language statement
The verifyMatchesDisjoint analysis is sound: if the assertions verifyMatchesDisjoint p₁ p₂ εnv are unsatisfiable for the policies p₁ and p₂ and the strongly well-formed symbolic environment εnv, then the policies cannot both match in any strongly well-formed concrete environment env ∈ᵢ εnv.
Exact Lean statement
theorem verifyMatchesDisjoint_is_sound {p₁ p₂ : Policy} {εnv : SymEnv} {asserts : Asserts} :
εnv.StronglyWellFormedForPolicy p₁ →
εnv.StronglyWellFormedForPolicy p₂ →
verifyMatchesDisjoint p₁ p₂ εnv = .ok asserts →
εnv ⊭ asserts →
∀ env,
env ∈ᵢ εnv →
env.StronglyWellFormedForPolicy p₁ →
env.StronglyWellFormedForPolicy p₂ →
¬ (evaluate p₁.toExpr env.request env.entities = .ok true ∧
evaluate p₂.toExpr env.request env.entities = .ok true)Formal artifact
Lean source
theorem verifyMatchesDisjoint_is_sound {p₁ p₂ : Policy} {εnv : SymEnv} {asserts : Asserts} : εnv.StronglyWellFormedForPolicy p₁ → εnv.StronglyWellFormedForPolicy p₂ → verifyMatchesDisjoint p₁ p₂ εnv = .ok asserts → εnv ⊭ asserts → ∀ env, env ∈ᵢ εnv → env.StronglyWellFormedForPolicy p₁ → env.StronglyWellFormedForPolicy p₂ → ¬ (evaluate p₁.toExpr env.request env.entities = .ok true ∧ evaluate p₂.toExpr env.request env.entities = .ok true):= by intro h₁ h₂ h₃ h₄ env h₅ h₆ h₇ have := verifyEvaluatePair_is_sound verifyMatchesDisjoint_wbepq h₁ h₂ h₃ h₄ env h₅ h₆ h₇ simp only [Bool.not_and, Bool.or_eq_true, Bool.not_eq_eq_eq_not, Bool.not_true, beq_eq_false_iff_ne, ne_eq] at this cases this with | inl h => simp [h] | inr h => simp [h]- Project
- Cedar Specification
- License
- Apache-2.0
- Commit
- 3f093947b8ae
- Source
- cedar-lean/Cedar/Thm/Verification.lean:394-412
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.