All proofs
Project-declaredLean 4.31.0 · null

Always Matches Opt? eqv always Matches?

Cedar.Thm.alwaysMatchesOpt?_eqv_alwaysMatches?

Plain-language statement

Full equivalence for alwaysMatches? and alwaysMatchesOpt?, including both the .ok and .error cases

Exact Lean statement

theorem alwaysMatchesOpt?_eqv_alwaysMatches? {p : Policy} {Γ : Validation.TypeEnv} :
  Γ.WellFormed →
  (do
    let cp ← CompiledPolicy.compile p Γ
    pure $ alwaysMatchesOpt? cp
  ) =
  (do
    let wp ← wellTypedPolicy p Γ |>.mapError .validationError
    pure $ alwaysMatches? wp (SymEnv.ofTypeEnv Γ)
  )

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem alwaysMatchesOpt?_eqv_alwaysMatches? {p : Policy} {Γ : Validation.TypeEnv} :  Γ.WellFormed   (do    let cp  CompiledPolicy.compile p Γ    pure $ alwaysMatchesOpt? cp  ) =  (do    let wp  wellTypedPolicy p Γ |>.mapError .validationError    pure $ alwaysMatches? wp (SymEnv.ofTypeEnv Γ)  ):= by  cases hcp : CompiledPolicy.compile p Γ  case ok cp =>    intro hwf    have wp, hwp, h := alwaysMatchesOpt?_eqv_alwaysMatches?_ok hwf hcp    simp [Except.mapError, hwp, h]  case error e =>    simp [Except.mapError]    cases hwp : wellTypedPolicy p Γ    case error e' =>      simp [CompiledPolicy.compile, Except.mapError, hwp] at hcp      simp [hcp]    case ok wp =>      intro hwf      have h := compile_ok_iff_welltypedpolicy_ok hwf (p := p)      simp [hcp, hwp, Except.isOk, Except.toBool] at h
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/SymCC/Opt.lean:497-522

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