All proofs
Project-declaredLean 4.31.0 · null

Sound bound analysis produces sound slices

Cedar.Thm.sound_bound_analysis_produces_sound_slices

Plain-language statement

A sound bound analysis produces sound policy slices.

Exact Lean statement

theorem sound_bound_analysis_produces_sound_slices (ba : BoundAnalysis) (request : Request) (entities : Entities) (policies : Policies) :
  IsSoundBoundAnalysis ba →
  IsSoundPolicySlice request entities (ba.slice request entities policies) policies

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem sound_bound_analysis_produces_sound_slices (ba : BoundAnalysis) (request : Request) (entities : Entities) (policies : Policies) :  IsSoundBoundAnalysis ba   IsSoundPolicySlice request entities (ba.slice request entities policies) policies:= by  unfold IsSoundBoundAnalysis  unfold IsSoundPolicySlice  intro h₁  unfold BoundAnalysis.slice  apply And.intro  case left =>    intro p _    simp_all only [List.mem_filter]  case right =>    intro policy    specialize h₁ policy    intro h₂ h₃    rw [List.mem_filter] at h₃    simp only [h₂, true_and, Bool.not_eq_true] at h₃    by_contra h₄    simp only [Bool.not_eq_true, not_and, Bool.not_eq_false] at h₄    unfold IsSoundPolicyBound at h₁    specialize h₁ request entities    have h₅, h₆ := h₁; clear h₁    simp only [h₃, Bool.false_eq_true, imp_false, Bool.not_eq_true] at h₅ h₆    specialize h₄ h₅    simp only [h₄, Bool.true_eq_false] at h₆
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/PolicySlice.lean:60-85

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