All proofs
Project-declaredLean 4.31.0 · null

Opt compile correctness get Attr

Cedar.Thm.Opt.compile.correctness.getAttr

Project documentation

Correctness theorem for Opt.compile -- getAttr case

Exact Lean statement

theorem Opt.compile.correctness.getAttr (expr : Expr) (attr : Attr) (εnv : SymEnv) :
  Opt.compile (.getAttr expr attr) εnv = (do
    let term ← SymCC.compile (.getAttr expr attr) εnv
    let footprint := footprint (.getAttr expr attr) εnv
    .ok { term, footprint }
  )

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem Opt.compile.correctness.getAttr (expr : Expr) (attr : Attr) (εnv : SymEnv) :  Opt.compile (.getAttr expr attr) εnv = (do    let term  SymCC.compile (.getAttr expr attr) εnv    let footprint := footprint (.getAttr expr attr) εnv    .ok { term, footprint }  ):= by  simp [Opt.compile, SymCC.compile, footprint]  rw [Opt.compile.correctness expr εnv]  cases h₁ : SymCC.compile expr εnv <;> simp  case ok t =>    rw [Opt.compileGetAttr.correctness]    simp only [Opt.CompileResult.mapTerm, bind_assoc, Except.bind_ok]    simp_do_let compileGetAttr (Factory.option.get t) attr εnv.entities ; rename_i t' h₂    simp only [Except.ok.injEq, Opt.CompileResult.mk.injEq, true_and]    rw [Opt.directFootprint.correctness (t := Factory.ifSome t t') (x := .getAttr expr attr) (εnv := εnv)]    · apply Data.Set.union_comm    · -- here we have to show that the `t` and `x` arguments we chose for `Opt.directFootprint.correctness` in the `rw` above correspond to each other correctly      simp [SymCC.compile, h₁, h₂]
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/SymCC/Opt/Compiler.lean:906-924

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