task_id stringlengths 21 23 | challenge_id stringlengths 16 16 | proof_assistant stringclasses 1
value | session stringclasses 1
value | repo stringclasses 57
values | revision stringclasses 57
values | file_path stringlengths 13 92 | theory stringlengths 1 48 | variant int64 0 132 | challenge_type stringclasses 1
value | difficulty null | count null | by_centrality bool 1
class | ablation_prob float64 0.5 0.5 | min_depth int64 1 1 | max_depth int64 1 1 | leaves_only bool 1
class | min_size int64 0 0 | max_size stringclasses 1
value | min_centrality int64 0 0 | max_centrality stringclasses 1
value | seed int64 42 42 | n_proofs int64 1 173 | n_ablated int64 1 60 | holes_filled listlengths 1 60 | deleted_lemmas listlengths 1 1 | corollaries listlengths 1 1 | closure_size int64 1 172 | challenge_file_content stringlengths 133 350k | solution_file_content stringlengths 394 351k | solution_diff stringlengths 243 134k | manifest dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ablate_7858855ec3c3_8 | b0f78bd86cfe74c2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "wf_term_var_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [TermVar.WellFormed]\n intro h₁ h₂\n exact wf_term_type_same_domain h₁ h₂",
"n_chars": 97,
"n_s... | [
{
"name": "wf_term_type_same_domain",
"text": "public theorem wf_term_type_same_domain {εs₁ εs₂ : SymEntities} {ty : TermType} :\n SameDomain εs₁ εs₂ →\n TermType.WellFormed εs₁ ty →\n TermType.WellFormed εs₂ ty\n:= by\n intro h₁ h₂\n induction h₂\n case bool_wf =>\n exact TermType.WellFormed.bool_... | [
{
"name": "wfp_term_app_same_domain",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 727,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -63,11 +63,50 @@
(∀ uid, εs₁.isValidEntityUID uid = εs₂.isValidEntityUID uid) ∧
(∀ ety, εs₁.isValidEntityType ety = εs₂.isValidEntityType ety)
+public theorem wf_term_type_same_domain {εs₁ εs₂ : SymEntities} {ty : TermType} :
+ SameDomain εs₁ εs₂ →
+ TermType.WellFormed εs₁ ty →
+ TermType.WellFormed εs₂ ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7858855ec3c3_9 | c361dcbaf94e555e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "wfl_term_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Term.WellFormedLiteral, and_imp]\n intro h₁ h₂ h₃\n simp only [h₃, and_true]\n exact wf_term_same_domain... | [
{
"name": "wf_term_same_domain",
"text": "public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :\n SameDomain εs₁ εs₂ →\n t.WellFormed εs₁ →\n t.WellFormed εs₂\n:= by\n intro h₁ h₂\n induction h₂\n case prim_wf h₃ =>\n exact Term.WellFormed.prim_wf (wf_term_prim_same_domain h₁ h₃)\... | [
{
"name": "wf_interpretation_same_domain",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 10,
"n_lines": 37,
"n_chars": 1338,
"n_subproofs": 1,
"n_tactics": 31,
"cyclomatic": 4,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 11,
"automation_only": fals... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -173,11 +173,45 @@
case string.like_wt h => exact Op.WellTyped.string.like_wt h
case ext_wt h => exact Op.WellTyped.ext_wt h
+public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :
+ SameDomain εs₁ εs₂ →
+ t.WellFormed εs₁ →
+ t.WellFormed εs₂
+:= by
+ intro h₁ h₂
+ inductio... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7858855ec3c3_10 | f946dafcaaf175cd | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "wf_term_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n induction h₂\n case prim_wf h₃ =>\n exact Term.WellFormed.prim_wf (wf_term_prim_same_domain h₁ h₃)\... | [
{
"name": "wt_op_same_domain",
"text": "public theorem wt_op_same_domain {εs₁ εs₂ : SymEntities} {op : Op} {ts : List Term} {ty : TermType} :\n SameDomain εs₁ εs₂ →\n Op.WellTyped εs₁ op ts ty →\n Op.WellTyped εs₂ op ts ty\n:= by\n intro h₁ h₂\n cases h₂\n case not_wt h => exact Op.WellTyped... | [
{
"name": "wf_ρeq_same_domain",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 486,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nes... | 6 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -123,11 +123,76 @@
intro h₁ h₂ h₃
simp only [wf_term_type_same_domain h₁ h₂, wf_term_type_same_domain h₁ h₃, and_self]
+public theorem wt_op_same_domain {εs₁ εs₂ : SymEntities} {op : Op} {ts : List Term} {ty : TermType} :
+ SameDomain εs₁ εs₂ →
+ Op.WellTyped εs₁ op ts ty →
+ Op.WellTyped εs₂ op ts ty
+:=... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7858855ec3c3_11 | 5e99cfb44fc8f9ef | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "wfl_term_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Term.WellFormedLiteral, and_imp]\n intro h₁ h₂ h₃\n simp only [h₃, and_true]\n exact wf_term_same_domain... | [
{
"name": "wf_term_same_domain",
"text": "public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :\n SameDomain εs₁ εs₂ →\n t.WellFormed εs₁ →\n t.WellFormed εs₂\n:= by\n intro h₁ h₂\n induction h₂\n case prim_wf h₃ =>\n exact Term.WellFormed.prim_wf (wf_term_prim_same_domain h₁ h₃)\... | [
{
"name": "wf_uf_same_domain",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 355,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nest... | 8 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -164,11 +164,45 @@
case string.like_wt h => exact Op.WellTyped.string.like_wt h
case ext_wt h => exact Op.WellTyped.ext_wt h
+public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :
+ SameDomain εs₁ εs₂ →
+ t.WellFormed εs₁ →
+ t.WellFormed εs₂
+:= by
+ intro h₁ h₂
+ inductio... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7858855ec3c3_12 | fdf79cc86bf5bec7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "wfl_term_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Term.WellFormedLiteral, and_imp]\n intro h₁ h₂ h₃\n simp only [h₃, and_true]\n exact wf_term_same_domain... | [
{
"name": "wf_term_same_domain",
"text": "public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :\n SameDomain εs₁ εs₂ →\n t.WellFormed εs₁ →\n t.WellFormed εs₂\n:= by\n intro h₁ h₂\n induction h₂\n case prim_wf h₃ =>\n exact Term.WellFormed.prim_wf (wf_term_prim_same_domain h₁ h₃)\... | [
{
"name": "wf_εdata_same_domain",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 24,
"n_chars": 835,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": false,
"max... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -164,11 +164,45 @@
case string.like_wt h => exact Op.WellTyped.string.like_wt h
case ext_wt h => exact Op.WellTyped.ext_wt h
+public theorem wf_term_same_domain {εs₁ εs₂ : SymEntities} {t : Term} :
+ SameDomain εs₁ εs₂ →
+ t.WellFormed εs₁ →
+ t.WellFormed εs₂
+:= by
+ intro h₁ h₂
+ inductio... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7858855ec3c3_13 | 8c7ac3e78d7a42d9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/WF.lean | WF | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "expr_valid_refs_same_domain",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n induction h₂\n case lit_valid h =>\n exact Expr.ValidRefs.lit_valid (prim_valid_refs_same_d... | [
{
"name": "prim_valid_refs_same_domain",
"text": "public theorem prim_valid_refs_same_domain {εs₁ εs₂ : SymEntities} {p : Prim} :\n SameDomain εs₁ εs₂ →\n p.ValidRef (εs₁.isValidEntityUID · = true) →\n p.ValidRef (εs₂.isValidEntityUID · = true)\n:= by\n intro h₁ h₂\n cases p <;> simp only [Prim.ValidRe... | [
{
"name": "expr_valid_refs_same_domain",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1186,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 14,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -63,11 +63,48 @@
(∀ uid, εs₁.isValidEntityUID uid = εs₂.isValidEntityUID uid) ∧
(∀ ety, εs₁.isValidEntityType ety = εs₂.isValidEntityType ety)
+public theorem prim_valid_refs_same_domain {εs₁ εs₂ : SymEntities} {p : Prim} :
+ SameDomain εs₁ εs₂ →
+ p.ValidRef (εs₁.isValidEntityUID · = true) →
+ p.ValidRef... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_0 | e03f4e46d1051ea7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "satisfiedPolicies_filterMapM_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction ps\n case nil => simp\n case cons p ps ih =>\n simp only [List.filterMapM_cons, bind_pure_c... | [
{
"name": "compileWithEffect_none_implies",
"text": "theorem compileWithEffect_none_implies {effect : Effect} {p : Policy} {εnv : SymEnv} :\n compileWithEffect effect p εnv = .ok .none →\n p.effect ≠ effect\n:= by\n intro h₁\n simp only [compileWithEffect, beq_iff_eq, bind_pure_comp, ite_eq_right_iff] a... | [
{
"name": "satisfiedPolicies_filterMapM_eq",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 31,
"n_chars": 1314,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 4,
"n_automation": 11,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": fal... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,6 +43,16 @@
exact h₃
· simp only [reduceCtorEq] at h₁
+theorem compileWithEffect_none_implies {effect : Effect} {p : Policy} {εnv : SymEnv} :
+ compileWithEffect effect p εnv = .ok .none →
+ p.effect ≠ effect
+:= by
+ intro h₁
+ simp only [compileWithEffect, beq_iff_eq, bind_pure_comp, ite_eq_right... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_1 | 0077a069b2a13d8a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "compile_policy_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hwε hok\n simp only [Policy.toExpr] at hwε hok\n exact compile_and_wf_option_bool hwε hok",
"n_chars": 104,
... | [
{
"name": "compile_and_wf_option_bool",
"text": "private theorem compile_and_wf_option_bool {x₁ x₂ : Expr} {εnv : SymEnv} {t : Term} :\n εnv.WellFormedFor (Expr.and x₁ x₂) →\n compile (Expr.and x₁ x₂) εnv = .ok t →\n (t.WellFormed εnv.entities ∧ t.typeOf = .option .bool)\n:= by\n intro hwε hok\n simp o... | [
{
"name": "compile_policy_wf",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 306,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nest... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,11 +27,36 @@
open Data Spec SymCC Factory
+private theorem compile_and_wf_option_bool {x₁ x₂ : Expr} {εnv : SymEnv} {t : Term} :
+ εnv.WellFormedFor (Expr.and x₁ x₂) →
+ compile (Expr.and x₁ x₂) εnv = .ok t →
+ (t.WellFormed εnv.entities ∧ t.typeOf = .option .bool)
+:= by
+ intro hwε hok
+ simp only [c... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_2 | 647b6f9bebf6ac35 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "satisfiedPolicies_filterMapM_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction ps\n case nil => simp\n case cons p ps ih =>\n simp only [List.filterMapM_cons, bind_pure_c... | [
{
"name": "compileWithEffect_some_implies",
"text": "theorem compileWithEffect_some_implies {effect : Effect} {p : Policy} {εnv : SymEnv} {t : Term} :\n compileWithEffect effect p εnv = Except.ok (some t) →\n p.effect = effect ∧ compile p.toExpr εnv = .ok t\n:= by\n intro h₁\n simp [compileWithEffect] a... | [
{
"name": "satisfiedPolicies_ok_implies",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 590,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -53,10 +53,49 @@
simp only [hc, Functor.map, Except.map, forall_const] at h₁
split at h₁ <;> simp at h₁
+theorem compileWithEffect_some_implies {effect : Effect} {p : Policy} {εnv : SymEnv} {t : Term} :
+ compileWithEffect effect p εnv = Except.ok (some t) →
+ p.effect = effect ∧ compile p.toExpr εnv = .ok... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_3 | 49e9fee8ba82de46 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "mapM_compile_ok_implies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n replace ⟨p, hf, hok⟩ := List.mapM_ok_implies_all_from_ok hok t hin\n exact compile_policy_wf (wf... | [
{
"name": "compile_policy_wf",
"text": "theorem compile_policy_wf {p : Policy} {εnv : SymEnv} {t : Term} :\n εnv.WellFormedFor p.toExpr →\n compile p.toExpr εnv = .ok t →\n (t.WellFormed εnv.entities ∧ t.typeOf = .option .bool)\n:= by\n intro hwε hok\n simp only [Policy.toExpr] at hwε hok\n exact comp... | [
{
"name": "mapM_compile_ok_implies_wf",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 451,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -49,11 +49,23 @@
rw [hty₂] at h₃
simp only [wf_ifSome_option hw₁ h₃.left h₃.right]
+theorem compile_policy_wf {p : Policy} {εnv : SymEnv} {t : Term} :
+ εnv.WellFormedFor p.toExpr →
+ compile p.toExpr εnv = .ok t →
+ (t.WellFormed εnv.entities ∧ t.typeOf = .option .bool)
+:= by
+ intro hwε hok
+ simp on... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_4 | e5e58967dd547fa7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n have hwf := mapM_compile_ok_implies_wf hwε hok t hin\n apply wf_eq hwf.left (Term.Wel... | [
{
"name": "mapM_compile_ok_implies_wf",
"text": "private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, t.WellFormed εnv.entities ∧ t.typeOf = .op... | [
{
"name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 497,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": ... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -58,13 +58,26 @@
simp only [Policy.toExpr] at hwε hok
exact compile_and_wf_option_bool hwε hok
+private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_5 | dc0abbaa3cdcc46a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "satisfiedPolicies_ok_implies",
"text": "theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :\n satisfiedPolicies effect ps εnv = .ok t →\n ∃ ts,\n t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧\n List.mapM (λ p => compile p.toExpr εnv) (... | [
{
"name": "satisfiedPolicies_wf",
"fan_in": 4,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 13,
"n_chars": 583,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -128,6 +128,21 @@
simp only [Policy.toExpr] at hwε hok
exact compile_and_wf_option_bool hwε hok
+theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :
+ satisfiedPolicies effect ps εnv = .ok t →
+ ∃ ts,
+ t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧
+... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_6 | 58fc8ff2f5d3fdd6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n have hwf := mapM_compile_ok_implies_wf hwε hok t hin\n apply wf_eq hwf.left (Term.Wel... | [
{
"name": "mapM_compile_ok_implies_wf",
"text": "private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, t.WellFormed εnv.entities ∧ t.typeOf = .op... | [
{
"name": "mapM_compile_ok_implies_interpret_eqSomeTrue",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 635,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -58,6 +58,15 @@
simp only [Policy.toExpr] at hwε hok
exact compile_and_wf_option_bool hwε hok
+private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ t... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_7 | afdad080f4c2a57d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "satisfiedPolicies_ok_implies",
"text": "theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :\n satisfiedPolicies effect ps εnv = .ok t →\n ∃ ts,\n t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧\n List.mapM (λ p => compile p.toExpr εnv) (... | [
{
"name": "satisfiedPolicies_interpret",
"fan_in": 3,
"n_deps_direct": 5,
"n_deps_transitive": 11,
"n_lines": 16,
"n_chars": 867,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 11 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -128,6 +128,21 @@
simp only [Policy.toExpr] at hwε hok
exact compile_and_wf_option_bool hwε hok
+theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :
+ satisfiedPolicies effect ps εnv = .ok t →
+ ∃ ts,
+ t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧
+... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_8 | 8ea7ec73ba340663 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "satisfiedPolicies_ok_implies",
"text": "theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :\n satisfiedPolicies effect ps εnv = .ok t →\n ∃ ts,\n t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧\n List.mapM (λ p => compile p.toExpr εnv) (... | [
{
"name": "satisfiedPolicies_eq",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 53,
"n_chars": 2702,
"n_subproofs": 5,
"n_tactics": 47,
"cyclomatic": 6,
"n_automation": 12,
"n_rewrites": 7,
"n_structural": 8,
"automation_only": false,
"ma... | 8 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -128,6 +128,21 @@
simp only [Policy.toExpr] at hwε hok
exact compile_and_wf_option_bool hwε hok
+theorem satisfiedPolicies_ok_implies {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term} :
+ satisfiedPolicies effect ps εnv = .ok t →
+ ∃ ts,
+ t = anyTrue (eq · (Term.some (Term.bool true))) ts ∧
+... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_9 | 485c004d12e2e745 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n have hwf := mapM_compile_ok_implies_wf hwε hok t hin\n apply wf_eq hwf.left (Term.Wel... | [
{
"name": "mapM_compile_ok_implies_wf",
"text": "private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, t.WellFormed εnv.entities ∧ t.typeOf = .op... | [
{
"name": "satisfiedPolicies_bisimulation",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 13,
"n_chars": 621,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,... | 13 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -143,20 +143,39 @@
rw [satisfiedPolicies_filterMapM_eq] at hok
exists ts
+private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, t.WellFormed εnv.e... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_10 | 07ce80be2220a74d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n have hwf := mapM_compile_ok_implies_wf hwε hok t hin\n apply wf_eq hwf.left (Term.Wel... | [
{
"name": "mapM_compile_ok_implies_wf",
"text": "private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, t.WellFormed εnv.entities ∧ t.typeOf = .op... | [
{
"name": "satisfiedPolicies_interpret_eq_when_interpret_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 29,
"n_chars": 1577,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 4,
"auto... | 12 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -143,20 +143,39 @@
rw [satisfiedPolicies_filterMapM_eq] at hok
exists ts
+private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, t.WellFormed εnv.e... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_11 | dd89388dcfaaf598 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "same_decision_and_response_implies_same_decision",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n rw [same_responses_iff_same_decisions] at h₂\n rw [same_decisions_iff_all... | [
{
"name": "same_responses_iff_same_decisions",
"text": "theorem same_responses_iff_same_decisions {r : Response} {t : Term} :\n r ∼ t ↔ r.decision ∼ t\n:= by\n simp only [Same.same, SameResponses]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "same_decision_and_response_implies_same_decision",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 614,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 5,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automa... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -46,10 +46,25 @@
assumption
}
+theorem same_responses_iff_same_decisions {r : Response} {t : Term} :
+ r ∼ t ↔ r.decision ∼ t
+:= by
+ simp only [Same.same, SameResponses]
+
theorem same_decision_and_response_implies_same_decision
{decision : Spec.Decision} {resp : Response} {t : Term} :
decis... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_12 | c87250ff730c0644 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t hin\n have hwf := mapM_compile_ok_implies_wf hwε hok t hin\n apply wf_eq hwf.left (Term.Wel... | [
{
"name": "mapM_compile_ok_implies_wf",
"text": "private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, t.WellFormed εnv.entities ∧ t.typeOf = .op... | [
{
"name": "isAuthorized_wf",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 510,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesti... | 11 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -143,19 +143,38 @@
rw [satisfiedPolicies_filterMapM_eq] at hok
exists ts
+private theorem mapM_compile_ok_implies_wf {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, t.WellFormed εnv.e... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_13 | e8f7f6aa6dc19d53 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"text": "private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, (eqSomeTrue t).WellF... | [
{
"name": "isAuthorized_interpret_eq_when_interpret_eq",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 15,
"n_lines": 19,
"n_chars": 1004,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automatio... | 15 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -154,11 +154,27 @@
abbrev eqSomeTrue := (eq · (Term.some (Term.bool true)))
+private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, (eqSome... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_14 | 792c904efe3bdc36 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"text": "private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, (eqSomeTrue t).WellF... | [
{
"name": "isAuthorized_interpret",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 14,
"n_lines": 18,
"n_chars": 780,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"m... | 14 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -154,11 +154,27 @@
abbrev eqSomeTrue := (eq · (Term.some (Term.bool true)))
+private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, (eqSome... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_15 | f7a953b09525e058 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "satisfiedPolicies_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ts, ht, hok⟩ := satisfiedPolicies_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_policies_implies_wf... | [
{
"name": "mapM_compile_ok_implies_wf_eqSomeTrue",
"text": "private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :\n ∀ t ∈ ts, (eqSomeTrue t).WellF... | [
{
"name": "isAuthorized_same",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 14,
"n_lines": 28,
"n_chars": 1599,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_n... | 14 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -154,11 +154,27 @@
abbrev eqSomeTrue := (eq · (Term.some (Term.bool true)))
+private theorem mapM_compile_ok_implies_wf_eqSomeTrue {ps : Policies} {εnv : SymEnv} {ts : List Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : List.mapM (fun p => compile p.toExpr εnv) ps = Except.ok ts) :
+ ∀ t ∈ ts, (eqSome... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2614823ec130_16 | 6f739a793f973c1d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Authorizer.lean | Authorizer | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "isAuthorized_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hwε hok\n replace ⟨tp, tf, hokp, hokf, hok⟩ := isAuthorized_ok_implies hok\n subst hok\n replace hokp := satisfied... | [
{
"name": "satisfiedPolicies_wf",
"text": "theorem satisfiedPolicies_wf {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term}\n (hwε : εnv.WellFormedForPolicies ps)\n (hok : Cedar.SymCC.satisfiedPolicies effect ps εnv = .ok t) :\n t.WellFormed εnv.entities ∧ t.typeOf = .bool\n := by\n replace ⟨ts,... | [
{
"name": "isAuthorized_bisimulation",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 19,
"n_lines": 14,
"n_chars": 556,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 19 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -164,6 +164,18 @@
apply wf_eq hwf.left (Term.WellFormed.some_wf wf_bool)
simp only [hwf.right, typeOf_term_some, typeOf_bool]
+theorem satisfiedPolicies_wf {effect : Effect} {ps : Policies} {εnv : SymEnv} {t : Term}
+ (hwε : εnv.WellFormedForPolicies ps)
+ (hok : Cedar.SymCC.satisfiedPolicies effect ps εnv... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_0 | f53d8b7a812d6c86 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_error_implies_ifSome_error",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro he hty\n have ⟨_, ty₁, ht⟩ := same_error_implies he\n subst ht\n simp only [pe_ifSome_none hty]\n ... | [
{
"name": "same_error_implies",
"text": "public theorem same_error_implies {e : Spec.Error} {t : Term} :\n (Except.error e : Spec.Result Value) ∼ t →\n (¬ e = .entityDoesNotExist) ∧\n (∃ ty, t = Term.none ty)\n:= by\n intro h₁\n simp only [Same.same, SameResults, ne_eq] at h₁\n split at h₁ <;> try { s... | [
{
"name": "same_error_implies_ifSome_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 427,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,11 +37,30 @@
open Batteries Data Spec SymCC Factory
+public theorem same_error_implies {e : Spec.Error} {t : Term} :
+ (Except.error e : Spec.Result Value) ∼ t →
+ (¬ e = .entityDoesNotExist) ∧
+ (∃ ty, t = Term.none ty)
+:= by
+ intro h₁
+ simp only [Same.same, SameResults, ne_eq] at h₁
+ split at h₁... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_1 | 7dd4e805d40100cf | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_error_implies_ifSome_error",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro he hty\n have ⟨_, ty₁, ht⟩ := same_error_implies he\n subst ht\n simp only [pe_ifSome_none hty]\n ... | [
{
"name": "same_error_implies",
"text": "public theorem same_error_implies {e : Spec.Error} {t : Term} :\n (Except.error e : Spec.Result Value) ∼ t →\n (¬ e = .entityDoesNotExist) ∧\n (∃ ty, t = Term.none ty)\n:= by\n intro h₁\n simp only [Same.same, SameResults, ne_eq] at h₁\n split at h₁ <;> try { s... | [
{
"name": "same_error_implies_ifAllSome_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 480,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,12 +37,30 @@
open Batteries Data Spec SymCC Factory
+public theorem same_error_implies {e : Spec.Error} {t : Term} :
+ (Except.error e : Spec.Result Value) ∼ t →
+ (¬ e = .entityDoesNotExist) ∧
+ (∃ ty, t = Term.none ty)
+:= by
+ intro h₁
+ simp only [Same.same, SameResults, ne_eq] at h₁
+ split at h₁... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_2 | b4805ae325fbcb27 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_ok_some_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n replace ⟨t', heq, h⟩ := same_ok_implies h\n simp only [Term.some.injEq] at heq\n subst heq\n exact h",
... | [
{
"name": "same_ok_implies",
"text": "public theorem same_ok_implies {v : Value} {t : Term} :\n (Except.ok v : Spec.Result Value) ∼ t →\n ∃ t', t = .some t' ∧ v ∼ t'\n:= by\n intro h\n simp only [Same.same, SameResults] at h\n split at h <;> try (contradiction)\n rename_i t' heq\n simp only [Except.o... | [
{
"name": "same_ok_some_implies",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,9 +37,26 @@
open Batteries Data Spec SymCC Factory
+public theorem same_ok_implies {v : Value} {t : Term} :
+ (Except.ok v : Spec.Result Value) ∼ t →
+ ∃ t', t = .some t' ∧ v ∼ t'
+:= by
+ intro h
+ simp only [Same.same, SameResults] at h
+ split at h <;> try (contradiction)
+ rename_i t' heq
+ simp ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_3 | 700193d689b1701c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_ok_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · exact same_ok_some_implies\n · intro h\n simp only [Same.same, SameResults]\n exact h",
"n_cha... | [
{
"name": "same_ok_some_implies",
"text": "public theorem same_ok_some_implies {v : Value} {t : Term} :\n (Except.ok v : Spec.Result Value) ∼ (Term.some t) → v ∼ t\n:= by\n intro h\n replace ⟨t', heq, h⟩ := same_ok_implies h\n simp only [Term.some.injEq] at heq\n subst heq\n exact h\n\n",
"fan_in"... | [
{
"name": "same_ok_some_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 240,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -49,11 +49,20 @@
subst heq
exists t'
+public theorem same_ok_some_implies {v : Value} {t : Term} :
+ (Except.ok v : Spec.Result Value) ∼ (Term.some t) → v ∼ t
+:= by
+ intro h
+ replace ⟨t', heq, h⟩ := same_ok_implies h
+ simp only [Term.some.injEq] at heq
+ subst heq
+ exact h
+
public theorem same_o... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_4 | 6f4d57bd314f084d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_value_implies_lit",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n simp only [Same.same, SameValues] at h₁\n match t with\n | .var _\n | .none _\n | .some _\n | .app... | [
{
"name": "same_value_implies_same",
"text": "public theorem same_value_implies_same {v : Value} {t : Term} :\n SameValues v t → v ∼ t\n:= by\n intro h₁\n simp only [Same.same, h₁]\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "same_value_implies_lit",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 1904,
"n_subproofs": 2,
"n_tactics": 51,
"cyclomatic": 4,
"n_automation": 12,
"n_rewrites": 11,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,6 +37,12 @@
open Batteries Data Spec SymCC Factory
+public theorem same_value_implies_same {v : Value} {t : Term} :
+ SameValues v t → v ∼ t
+:= by
+ intro h₁
+ simp only [Same.same, h₁]
+
public theorem same_value_implies_lit {v : Value} {t : Term} :
v ∼ t → t.isLiteral
:= by
@@ -48,8 +54,38 @@
... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_5 | b49a6564689d162f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_ok_value_implies_lit",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n simp only [Same.same, SameResults, ne_eq] at h₁\n split at h₁ <;>\n simp only [Except.ok.injEq, fal... | [
{
"name": "same_value_implies_lit",
"text": "public theorem same_value_implies_lit {v : Value} {t : Term} :\n v ∼ t → t.isLiteral\n:= by\n intro h₁\n simp only [Same.same, SameValues] at h₁\n match t with\n | .var _\n | .none _\n | .some _\n | .app _ _ _ => simp [Term.value?] at h₁\n | .prim p =... | [
{
"name": "same_ok_value_implies_lit",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 426,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,9 +43,62 @@
intro h₁
simp only [Same.same, h₁]
+public theorem same_value_implies_lit {v : Value} {t : Term} :
+ v ∼ t → t.isLiteral
+:= by
+ intro h₁
+ simp only [Same.same, SameValues] at h₁
+ match t with
+ | .var _
+ | .none _
+ | .some _
+ | .app _ _ _ => simp [Term.value?] at h₁
+ | .prim ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_6 | 24164ac926e072c2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_ok_bool_term_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n simp only [Same.same, SameResults] at h₁\n exact same_bool_term_implies h₁",
"n_chars": 97,
... | [
{
"name": "same_bool_term_implies",
"text": "public theorem same_bool_term_implies {v : Value} {b : Bool} :\n v ∼ (Term.prim (TermPrim.bool b)) →\n v = .prim (.bool b)\n:= by\n intro h₁\n simp only [Same.same, SameValues, Term.value?, TermPrim.value?, Option.some.injEq] at h₁\n simp [h₁]\n\n",
"fan... | [
{
"name": "same_ok_bool_term_implies",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 275,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,10 +37,21 @@
open Batteries Data Spec SymCC Factory
+public theorem same_bool_term_implies {v : Value} {b : Bool} :
+ v ∼ (Term.prim (TermPrim.bool b)) →
+ v = .prim (.bool b)
+:= by
+ intro h₁
+ simp only [Same.same, SameValues, Term.value?, TermPrim.value?, Option.some.injEq] at h₁
+ simp [h₁]
+
pub... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_7 | 28068d68f59fa98d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_ok_bool_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n simp only [Same.same, SameResults, ne_eq] at h₁\n split at h₁ <;> simp at *\n rename_i heq ; subst heq\n... | [
{
"name": "same_bool_implies",
"text": "public theorem same_bool_implies {b : Bool} {t : Term} :\n Value.prim (Prim.bool b) ∼ t →\n t = .prim (.bool b)\n:= by simp_same_prim_implies Prim.bool.injEq\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "same_ok_bool_implies",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -54,10 +54,20 @@
}
))
+public theorem same_bool_implies {b : Bool} {t : Term} :
+ Value.prim (Prim.bool b) ∼ t →
+ t = .prim (.bool b)
+:= by simp_same_prim_implies Prim.bool.injEq
+
public theorem same_ok_bool_implies {b : Bool} {t : Term} :
(Except.ok (Value.prim (Prim.bool b)) : Spec.Result Value)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_8 | 824c94cc8f052b46 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_ok_bool_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n subst h\n exact same_ok_bool\n · intro h\n simp only [Same.same, SameResults, SameVal... | [
{
"name": "same_ok_bool",
"text": "public theorem same_ok_bool {b : Bool} :\n (Except.ok (Value.prim (Prim.bool b)) : Spec.Result Value) ∼ Term.some (Term.prim (TermPrim.bool b))\n:= by\n simp only [Same.same, SameResults, SameValues, Term.value?, TermPrim.value?]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "same_ok_bool_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 428,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -54,13 +54,20 @@
}
))
+public theorem same_ok_bool {b : Bool} :
+ (Except.ok (Value.prim (Prim.bool b)) : Spec.Result Value) ∼ Term.some (Term.prim (TermPrim.bool b))
+:= by
+ simp only [Same.same, SameResults, SameValues, Term.value?, TermPrim.value?]
+
public theorem same_ok_bool_iff {b₁ b₂ : Bool} :
... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_9 | e36c909e3366c3c5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 2 | [
{
"theorem_name": "same_bitvec64_term_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n replace ⟨i, h⟩ := same_bitvec_term_implies h\n simp only [and_true] at h\n exists i",
"n_chars"... | [
{
"name": "same_bitvec_term_implies",
"text": "public theorem same_bitvec_term_implies {v : Value} {n : Nat} {bv : BitVec n} :\n v ∼ Term.prim (TermPrim.bitvec bv) →\n ∃ i, v = Value.prim (.int i) ∧ bv.toInt = i ∧ n = 64\n:= by\n simp only [Same.same, SameValues, Term.value?, TermPrim.value?, Option.pure... | [
{
"name": "same_bitvec64_term_implies",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 273,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -64,10 +64,32 @@
(Term.prim (TermPrim.entity uid)).value? = some (Value.prim (.entityUID uid))
:= by simp only [Term.value?, TermPrim.value?]
+public theorem same_bitvec_term_implies {v : Value} {n : Nat} {bv : BitVec n} :
+ v ∼ Term.prim (TermPrim.bitvec bv) →
+ ∃ i, v = Value.prim (.int i) ∧ bv.toInt = i ∧... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_10 | 0edef70abf4b8488 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_ext",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [same_values_def, Term.value?, TermPrim.value?]",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "same_values_def",
"text": "public theorem same_values_def {v : Value} {t : Term} :\n v ∼ t ↔ t.value? = .some v\n:= by simp only [Same.same, SameValues]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 130,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "same_ext",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 148,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
}... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,6 +37,10 @@
open Batteries Data Spec SymCC Factory
+public theorem same_values_def {v : Value} {t : Term} :
+ v ∼ t ↔ t.value? = .some v
+:= by simp only [Same.same, SameValues]
+
local macro "simp_same_prim_implies" prim_injEq:ident : tactic => do
`(tactic | (
intro h₁
@@ -66,7 +70,8 @@
public... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_11 | d6d492baa91cb4a6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 6 | [
{
"theorem_name": "filterMap_attrValue?'_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Map.wf_iff_sorted] at hw\n replace hw : (List.filterMap attrValue?' rt.toList).SortedBy Prod.fst := by\n a... | [
{
"name": "value?_attrValue?_fst",
"text": "public theorem value?_attrValue?_fst {a : Attr} {t : Term} {av : Attr × Option Value} :\n Term.value?.attrValue? a t = some av → a = av.fst\n:= by\n intro hv\n unfold Term.value?.attrValue? at hv\n split at hv <;>\n simp only [Option.bind_eq_bind, Option.bind... | [
{
"name": "filterMap_attrValue?'_wf",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 523,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"m... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -64,6 +64,18 @@
(Term.prim (TermPrim.entity uid)).value? = some (Value.prim (.entityUID uid))
:= by simp only [Term.value?, TermPrim.value?]
+public theorem value?_attrValue?_fst {a : Attr} {t : Term} {av : Attr × Option Value} :
+ Term.value?.attrValue? a t = some av → a = av.fst
+:= by
+ intro hv
+ unfold... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_12 | 31cd100328f298f6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 6 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value?_mapM'",
"text": "public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}\n (hr : Term.value? (Term.record rt) = some (Value.record rv)) :\n ∃ avs,\n rt.toList.mapM' (fun x => Term.value?.attrValue? x.fst x.snd) = some avs ∧\n Map.mk (List.filterMap (fun... | [
{
"name": "record_value?_find?_required",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 33,
"n_chars": 1419,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
... | 6 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -117,6 +117,19 @@
simp only [← hfx'.right, value?_attrValue?_fst hfx]
exact Map.mk_wf hw
+public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}
+ (hr : Term.value? (Term.record rt) = some (Value.record rv)) :
+ ∃ avs,
+ rt.toList.mapM' (fun x => Term.value?.attrValue? x.fst x.s... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_13 | 5381fb9346921e97 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "record_value?_find?_optional_some",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 29,
"n_chars": 1266,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": fa... | 5 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -116,12 +116,43 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_14 | f5da21d0fb302367 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "record_value?_find?_optional_none",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 37,
"n_chars": 1354,
"n_subproofs": 2,
"n_tactics": 32,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 1,
"automation_only": fa... | 4 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -102,12 +102,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_15 | 179d3e5d1f41e99d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 6 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value?_mapM'",
"text": "public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}\n (hr : Term.value? (Term.record rt) = some (Value.record rv)) :\n ∃ avs,\n rt.toList.mapM' (fun x => Term.value?.attrValue? x.fst x.snd) = some avs ∧\n Map.mk (List.filterMap (fun... | [
{
"name": "record_value?_find?_none",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1036,
"n_subproofs": 1,
"n_tactics": 26,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -81,12 +81,47 @@
Option.bind (Term.value?.attrValue? x.fst x.snd)
fun x => Option.map (Prod.mk x.fst) x.snd)
+public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}
+ (hr : Term.value? (Term.record rt) = some (Value.record rv)) :
+ ∃ avs,
+ rt.toList.mapM' (fun x => Term.val... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_16 | 965d39abfdfe9a34 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "same_prim_value_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n cases p\n case bool b =>\n replace h₁ := same_bool_term_implies h₁\n subst h₁\n simp only [sa... | [
{
"name": "same_int_implies",
"text": "public theorem same_int_implies {t : Term} {bv : BitVec 64} {i : Int64} :\n BitVec.toInt bv = i.toInt →\n Value.prim (Prim.int i) ∼ t →\n t = Term.prim (TermPrim.bitvec bv)\n:= by\n intro h₁ h₂\n simp only [Same.same, SameValues] at h₂\n cases t\n case prim p =>... | [
{
"name": "same_prim_value_inj",
"fan_in": 1,
"n_deps_direct": 10,
"n_deps_transitive": 11,
"n_lines": 27,
"n_chars": 808,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"max... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -121,6 +121,32 @@
congr
simp only [BitVec.toInt_ofInt64_toBitVec]
+public theorem same_int_implies {t : Term} {bv : BitVec 64} {i : Int64} :
+ BitVec.toInt bv = i.toInt →
+ Value.prim (Prim.int i) ∼ t →
+ t = Term.prim (TermPrim.bitvec bv)
+:= by
+ intro h₁ h₂
+ simp only [Same.same, SameValues] at h₂
+... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_17 | dd926a8a4edacfef | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "set_value?_eq_implies_subseteq",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Set.subset_def]\n intro t₁ ht₁\n have ⟨v, h₁⟩ := set_value?_implies_in_value hv₁ t₁ ht₁\n have ⟨t₂, h... | [
{
"name": "set_value?_implies_in_term",
"text": "public theorem set_value?_implies_in_term {vs : Set Value} {ts : Set Term} {ty : TermType} :\n Term.value? (Term.set ts ty) = some (Value.set vs) →\n ∀ v, v ∈ vs → ∃ t, t ∈ ts ∧ t.value? = some v\n:= by\n intro hv v ht\n rw [Term.value?] at hv\n simp onl... | [
{
"name": "set_value?_eq_implies_subseteq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 727,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -84,12 +84,34 @@
exists v
simp only [Set.mem_make, hv, and_self]
+public theorem set_value?_implies_in_term {vs : Set Value} {ts : Set Term} {ty : TermType} :
+ Term.value? (Term.set ts ty) = some (Value.set vs) →
+ ∀ v, v ∈ vs → ∃ t, t ∈ ts ∧ t.value? = some v
+:= by
+ intro hv v ht
+ rw [Term.value?] a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_18 | d2e586d4d6b3e63b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "record_value?_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hv\n replace ⟨ats', hv⟩ := record_value?_some_implies hv\n simp only [List.mapM_cons, Option.pure_def, Option.b... | [
{
"name": "record_value?_some_implies",
"text": "public theorem record_value?_some_implies {ats : List (Attr × Term)} {avs : List (Attr × Value)} :\n (Term.record (Map.mk ats)).value? = some (Value.record (Map.mk avs)) →\n ∃ (avs' : List (Attr × Option Value)),\n List.mapM (λ (x : Attr × Term) => Term.... | [
{
"name": "record_value?_cons",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 28,
"n_chars": 1241,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_n... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -81,6 +81,20 @@
Option.bind (Term.value?.attrValue? x.fst x.snd)
fun x => Option.map (Prod.mk x.fst) x.snd)
+public theorem record_value?_some_implies {ats : List (Attr × Term)} {avs : List (Attr × Value)} :
+ (Term.record (Map.mk ats)).value? = some (Value.record (Map.mk avs)) →
+ ∃ (avs' : List (At... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_19 | 2af1d110237fa191 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "record_value?_head_none",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 730,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"ma... | 6 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -113,12 +113,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_20 | 5ea7db5a72ed8008 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 6 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value?_mapM'",
"text": "public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}\n (hr : Term.value? (Term.record rt) = some (Value.record rv)) :\n ∃ avs,\n rt.toList.mapM' (fun x => Term.value?.attrValue? x.fst x.snd) = some avs ∧\n Map.mk (List.filterMap (fun... | [
{
"name": "record_value?_find?_none_rev",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 44,
"n_chars": 1719,
"n_subproofs": 8,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 7,
"automation_only": false,
... | 5 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -105,6 +105,19 @@
simp only [← hfx'.right, value?_attrValue?_fst hfx]
exact Map.mk_wf hw
+public theorem record_value?_mapM' {rt : Map Attr Term} {rv : Map Attr Value}
+ (hr : Term.value? (Term.record rt) = some (Value.record rv)) :
+ ∃ avs,
+ rt.toList.mapM' (fun x => Term.value?.attrValue? x.fst x.s... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_21 | c914907d2720563f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "record_value?_find?_some_rev",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 7,
"n_lines": 47,
"n_chars": 1877,
"n_subproofs": 9,
"n_tactics": 36,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 9,
"n_structural": 7,
"automation_only": false,
... | 7 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -126,12 +126,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_22 | d157e38fdb7b0da8 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "record_value?_eq",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 10,
"n_lines": 57,
"n_chars": 2823,
"n_subproofs": 7,
"n_tactics": 45,
"cyclomatic": 5,
"n_automation": 12,
"n_rewrites": 4,
"n_structural": 8,
"automation_only": false,
"max_n... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -162,12 +162,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_23 | ad30c935fa36a05a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "same_value_inj'",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 30,
"n_lines": 82,
"n_chars": 4140,
"n_subproofs": 17,
"n_tactics": 78,
"cyclomatic": 2,
"n_automation": 17,
"n_rewrites": 8,
"n_structural": 11,
"automation_only": false,
"max_... | 29 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -331,12 +331,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_24 | f585afb5b6e17a03 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 5 | [
{
"theorem_name": "record_value?_find?_required",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨avs, hr, hv⟩ := record_value?_mapM' hr\n replace ⟨av, hmem, hr'⟩ := record_value_find? hf hr\n rep... | [
{
"name": "record_value_find?",
"text": "public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}\n (hf : Map.find? rt a = some tₐ)\n (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :\n ∃ av, av ∈ avs ∧ Term.value?.attr... | [
{
"name": "same_value_inj",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 31,
"n_lines": 9,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 30 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -331,12 +331,51 @@
rw [← List.mapM'_eq_mapM] at hr
exists avs
+public theorem record_value_find? {a : Attr} {tₐ : Term} {rt : Map Attr Term} {avs : List (Attr × Option Value)}
+ (hf : Map.find? rt a = some tₐ)
+ (hr : rt.toList.mapM' (λ x => Term.value?.attrValue? x.fst x.snd) = some avs) :
+ ∃ av, av ∈ a... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa6677f20277_25 | 308aa408c6703b02 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/Same.lean | Same | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "term_value?_exists",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hwfl hcty\n have ⟨hwf, hlit⟩ := hwfl\n unfold Term.value?\n cases t <;>\n simp only [Option.bind_eq_bind, Opt... | [
{
"name": "wfl_isCedarRecordType_implies_attr_wfl_cedarType?",
"text": "private theorem wfl_isCedarRecordType_implies_attr_wfl_cedarType? {a : Attr} {t : Term} {r : Map Attr Term} {ty : Validation.CedarType} :\n Term.WellFormed εs (Term.record r) →\n (Term.record r).isLiteral →\n (Term.record r).typeOf.c... | [
{
"name": "term_value?_exists",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 78,
"n_chars": 3205,
"n_subproofs": 13,
"n_tactics": 78,
"cyclomatic": 13,
"n_automation": 24,
"n_rewrites": 3,
"n_structural": 18,
"automation_only": false,
"m... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -80,11 +80,121 @@
Option.bind (Term.value?.attrValue? x.fst x.snd)
fun x => Option.map (Prod.mk x.fst) x.snd)
+private theorem wfl_isCedarRecordType_implies_attr_wfl_cedarType? {a : Attr} {t : Term} {r : Map Attr Term} {ty : Validation.CedarType} :
+ Term.WellFormed εs (Term.record r) →
+ (Term.recor... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b7c5c5337572_0 | 6349ea51a34f4ab3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluatePair.lean | VerifyEvaluatePair | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "verifyEvaluatePair_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ⟨hwφ, hiφ, hφf⟩ hwε₁ hwε₂ hok hsat env ⟨I, hwI, heq⟩ hwe₁ hwe₂\n rw [asserts_unsatisfiable_def] at hsat... | [
{
"name": "interpret_not_wbepq",
"text": "private theorem interpret_not_wbepq {φ : Term → Term → Term} {t₁ t₂ : Term} {I : Interpretation} {εs : SymEntities} :\n I.WellFormed εs →\n WellBehavedEvaluatePairQuery.WellFormedInput t₁ t₂ εs →\n WellBehavedEvaluatePairQuery.WellFormedOutput φ →\n WellBehavedE... | [
{
"name": "verifyEvaluatePair_is_sound",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 40,
"n_chars": 2236,
"n_subproofs": 4,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -71,6 +71,18 @@
rw [hwt.2.2.2] at hwt₂_ty
exact hφf (t₁.interpret I) (t₂.interpret I) εs r₁ r₂ ⟨hwt₁_wf, hwt₁_ty, hwt₂_wf, hwt₂_ty⟩ heq₁ heq₂
+private theorem interpret_not_wbepq {φ : Term → Term → Term} {t₁ t₂ : Term} {I : Interpretation} {εs : SymEntities} :
+ I.WellFormed εs →
+ WellBehavedEvaluatePairQ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b7c5c5337572_1 | 8718d004fbb314fa | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluatePair.lean | VerifyEvaluatePair | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "verifyEvaluatePair_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ⟨hwφ, hiφ, hφf⟩ hwε₁ hwε₂ hok hsat env ⟨I, hwI, heq⟩ hwe₁ hwe₂\n rw [asserts_unsatisfiable_def] at hsat... | [
{
"name": "interpret_not_wbepq",
"text": "private theorem interpret_not_wbepq {φ : Term → Term → Term} {t₁ t₂ : Term} {I : Interpretation} {εs : SymEntities} :\n I.WellFormed εs →\n WellBehavedEvaluatePairQuery.WellFormedInput t₁ t₂ εs →\n WellBehavedEvaluatePairQuery.WellFormedOutput φ →\n WellBehavedE... | [
{
"name": "verifyEvaluatePair_is_complete",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 51,
"n_chars": 2617,
"n_subproofs": 10,
"n_tactics": 37,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": fals... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -71,6 +71,18 @@
rw [hwt.2.2.2] at hwt₂_ty
exact hφf (t₁.interpret I) (t₂.interpret I) εs r₁ r₂ ⟨hwt₁_wf, hwt₁_ty, hwt₂_wf, hwt₂_ty⟩ heq₁ heq₂
+private theorem interpret_not_wbepq {φ : Term → Term → Term} {t₁ t₂ : Term} {I : Interpretation} {εs : SymEntities} :
+ I.WellFormed εs →
+ WellBehavedEvaluatePairQ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c424dd2fa04d_0 | e66ab402dc0695a9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/HasTag.lean | HasTag | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "no_tags_type_implies_no_tags",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Entities.tagsOrEmpty]\n split\n · rename_i d hf\n cases h₁.1 uid d hf with\n | inl h₁ =>\n... | [
{
"name": "map_empty_contains_instance_of_ff",
"text": "private theorem map_empty_contains_instance_of_ff [DecidableEq α] [DecidableEq β] {k : α} {env : TypeEnv} :\n InstanceOfType env (Value.prim (Prim.bool ((Map.empty : Map α β).contains k))) (CedarType.bool BoolType.ff)\n:= by\n simp only [Map.not_cont... | [
{
"name": "no_tags_type_implies_no_tags",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1170,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -26,6 +26,11 @@
open Cedar.Spec
open Cedar.Validation
+private theorem map_empty_contains_instance_of_ff [DecidableEq α] [DecidableEq β] {k : α} {env : TypeEnv} :
+ InstanceOfType env (Value.prim (Prim.bool ((Map.empty : Map α β).contains k))) (CedarType.bool BoolType.ff)
+:= by
+ simp only [Map.not_contains_o... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c424dd2fa04d_1 | 9691c30953c84a4f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/HasTag.lean | HasTag | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "no_tags_type_implies_no_tags",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Entities.tagsOrEmpty]\n split\n · rename_i d hf\n cases h₁.1 uid d hf with\n | inl h₁ =>\n... | [
{
"name": "map_empty_contains_instance_of_ff",
"text": "private theorem map_empty_contains_instance_of_ff [DecidableEq α] [DecidableEq β] {k : α} {env : TypeEnv} :\n InstanceOfType env (Value.prim (Prim.bool ((Map.empty : Map α β).contains k))) (CedarType.bool BoolType.ff)\n:= by\n simp only [Map.not_cont... | [
{
"name": "no_type_implies_no_tags",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 816,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 5,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"m... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -26,6 +26,11 @@
open Cedar.Spec
open Cedar.Validation
+private theorem map_empty_contains_instance_of_ff [DecidableEq α] [DecidableEq β] {k : α} {env : TypeEnv} :
+ InstanceOfType env (Value.prim (Prim.bool ((Map.empty : Map α β).contains k))) (CedarType.bool BoolType.ff)
+:= by
+ simp only [Map.not_contains_o... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c424dd2fa04d_2 | 18943469bdd77a69 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/HasTag.lean | HasTag | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "type_of_hasTag_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 46,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hok := h₃\n replace ⟨ety, c₁', c₂', h₄, h₅, h₃⟩ := type_of_hasTag_inversion h₃\n split_type_of h₄ ; rename_... | [
{
"name": "mem_capabilities_implies_mem_tags",
"text": "private theorem mem_capabilities_implies_mem_tags {env : TypeEnv} {x₁ x₂ : Expr} {c₁ : Capabilities} {request : Request} {entities : Entities} {uid : EntityUID} {s : String}\n (h₁ : CapabilitiesInvariant c₁ request entities)\n (ih₁ : evaluate x₁ requ... | [
{
"name": "type_of_hasTag_is_sound",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 57,
"n_chars": 3063,
"n_subproofs": 3,
"n_tactics": 54,
"cyclomatic": 12,
"n_automation": 14,
"n_rewrites": 4,
"n_structural": 9,
"automation_only": false,
... | 6 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -103,6 +103,18 @@
constructor
· exact map_empty_contains_instance_of_ff
+private theorem mem_capabilities_implies_mem_tags {env : TypeEnv} {x₁ x₂ : Expr} {c₁ : Capabilities} {request : Request} {entities : Entities} {uid : EntityUID} {s : String}
+ (h₁ : CapabilitiesInvariant c₁ request entities)
+ (ih... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0c802cec8944_0 | 64b01d58a0590527 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Record.lean | Record | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "compile_interpret_record_ifAllSome",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwi := interpret_attr_terms_wfls hI hwφ\n rcases (pe_wfls_of_type_option hwi) with ⟨_, hn⟩ | ⟨ts, ... | [
{
"name": "interpret_attr_terms_wfls",
"text": "theorem interpret_attr_terms_wfls {ats : List (Attr × Term)} {I : Interpretation} {εs : SymEntities}\n (hI : Interpretation.WellFormed I εs)\n (hwφ : ∀ a t, (a, t) ∈ ats → Term.WellFormed εs t ∧ ∃ ty, Term.typeOf t = TermType.option ty) :\n ∀ t ∈ ats.map (... | [
{
"name": "compile_interpret_record_ifAllSome",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 984,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fal... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -65,6 +65,21 @@
simp only [Function.comp_apply] at hs
simp only [hs, pe_option_get_some, interpret_option_get I hwφ hty, pe_option_get'_some]
+theorem interpret_attr_terms_wfls {ats : List (Attr × Term)} {I : Interpretation} {εs : SymEntities}
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ : ∀ a t, (a, t)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0c802cec8944_1 | 5a98ced915564084 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Record.lean | Record | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "compile_interpret_record_ifAllSome",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwi := interpret_attr_terms_wfls hI hwφ\n rcases (pe_wfls_of_type_option hwi) with ⟨_, hn⟩ | ⟨ts, ... | [
{
"name": "compile_interpret_record_ifAllSome_none",
"text": "private theorem compile_interpret_record_ifAllSome_none {εs : SymEntities} {I : Interpretation} {ats : List (Attr × Term)}\n (hI : Interpretation.WellFormed I εs)\n (hwφ : ∀ a t, (a, t) ∈ ats → Term.WellFormed εs t ∧ ∃ ty, Term.typeOf t = Term... | [
{
"name": "compile_interpret_record",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 9,
"n_lines": 31,
"n_chars": 1660,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -98,6 +98,26 @@
apply funext
simp only [Function.comp_apply, implies_true]
+private theorem compile_interpret_record_ifAllSome_none {εs : SymEntities} {I : Interpretation} {ats : List (Attr × Term)}
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ : ∀ a t, (a, t) ∈ ats → Term.WellFormed εs t ∧ ∃ ty, Term.ty... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0c802cec8944_2 | 11a6b40373dabd47 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Record.lean | Record | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "compile_evaluate_record",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ats, hok, ht⟩ := compile_record_ok_implies hok\n subst ht\n replace hwε := wf_εnv_for_record_implies hw... | [
{
"name": "compile_evaluate_ihs",
"text": "private theorem compile_evaluate_ihs {axs : List (Attr × Expr)} {ats : List (Attr × Term)} {env : Env} {εnv : SymEnv}\n (heq : env ∼ εnv)\n (hwe : ∀ (ax : Attr × Expr), ax ∈ axs → env.WellFormedFor ax.snd)\n (hwε : ∀ (ax : Attr × Expr), ax ∈ axs → εnv.WellFormed... | [
{
"name": "compile_evaluate_record",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 45,
"n_chars": 2035,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 6,
"n_structural": 6,
"automation_only": false,
"... | 5 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -41,6 +41,31 @@
apply funext
simp only [Function.comp_apply, implies_true]
+private theorem compile_evaluate_ihs {axs : List (Attr × Expr)} {ats : List (Attr × Term)} {env : Env} {εnv : SymEnv}
+ (heq : env ∼ εnv)
+ (hwe : ∀ (ax : Attr × Expr), ax ∈ axs → env.WellFormedFor ax.snd)
+ (hwε : ∀ (ax : Attr × ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fc3f7442637f_0 | 7da89dc3b43b955d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/Applicative.lean | Applicative | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "applicative_step",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply applicative_some\n repeat rfl",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
... | [
{
"name": "applicative_some",
"text": "public theorem applicative_some {α β : Type} (f' : α → β) (v : α) :\n (some f') <*> (some v) = some (f' v)\n := by\n unfold_applicative\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "applicative_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 158,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -28,7 +28,14 @@
simp
))
+public theorem applicative_some {α β : Type} (f' : α → β) (v : α) :
+ (some f') <*> (some v) = some (f' v)
+ := by
+ unfold_applicative
+
public theorem applicative_step {α β : Type} (f : α → β) (x : α) :
(some f) <*> (some x) = some (f x)
- := sorry
+ := by
+ apply applic... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8ceffb56033a_0 | befd3d375bebdb7c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/ValidRefs.lean | ValidRefs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "typeOf_preserves_valid_refs",
"depth": 1,
"n_commands": 0,
"n_lines": 56,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases expr with\n | lit p => exact typeOf_preserves_valid_refs_lit entities hty hrefs\n | var v => exact typ... | [
{
"name": "typeOf_preserves_valid_refs_var",
"text": "theorem typeOf_preserves_valid_refs_var\n {Γ : TypeEnv} (entities : Entities)\n {var : Var} {tx : TypedExpr} {c₁ c₂ : Capabilities}\n (hty : typeOf (Expr.var var) c₁ Γ = Except.ok (tx, c₂))\n (hrefs : entities.ValidRefsFor (Expr.var var)) :\n entiti... | [
{
"name": "typeOf_preserves_valid_refs",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 12,
"n_lines": 74,
"n_chars": 2709,
"n_subproofs": 3,
"n_tactics": 69,
"cyclomatic": 3,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 44,
"automation_only": false... | 12 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -71,6 +71,24 @@
assumption
· contradiction
+theorem typeOf_preserves_valid_refs_var
+ {Γ : TypeEnv} (entities : Entities)
+ {var : Var} {tx : TypedExpr} {c₁ c₂ : Capabilities}
+ (hty : typeOf (Expr.var var) c₁ Γ = Except.ok (tx, c₂))
+ (hrefs : entities.ValidRefsFor (Expr.var var)) :
+ entitie... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d29117d45509_0 | 4b12d007cd5adc60 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable/BinaryApp.lean | BinaryApp | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "checked_eval_entity_reachable_get_tag",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evaluate] at he\n simp_do_let (evaluate e₁ request entities) as he₁ at he\n simp_do_let... | [
{
"name": "reachable_tag_step",
"text": "theorem reachable_tag_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {tag : Tag} {path : List Attr}\n (hr : ReachableIn entities start euid n)\n (he₁ : entities.find? euid = some ed)\n (he₂ : ed.tags.find? t... | [
{
"name": "checked_eval_entity_reachable_get_tag",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1421,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 7,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 2,
"automation_only"... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -31,6 +31,29 @@
open Cedar.Spec
open Cedar.Validation
+theorem reachable_tag_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {tag : Tag} {path : List Attr}
+ (hr : ReachableIn entities start euid n)
+ (he₁ : entities.find? euid = some ed)
+ (he₂ : ed.tag... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d29117d45509_1 | 255ae958403b8494 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable/BinaryApp.lean | BinaryApp | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "checked_eval_entity_reachable_get_tag",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evaluate] at he\n simp_do_let (evaluate e₁ request entities) as he₁ at he\n simp_do_let... | [
{
"name": "reachable_tag_step",
"text": "theorem reachable_tag_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {tag : Tag} {path : List Attr}\n (hr : ReachableIn entities start euid n)\n (he₁ : entities.find? euid = some ed)\n (he₂ : ed.tags.find? t... | [
{
"name": "checked_eval_entity_reachable_binary",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 853,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": f... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -31,6 +31,29 @@
open Cedar.Spec
open Cedar.Validation
+theorem reachable_tag_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {tag : Tag} {path : List Attr}
+ (hr : ReachableIn entities start euid n)
+ (he₁ : entities.find? euid = some ed)
+ (he₂ : ed.tag... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_0 | a65954a76b7555b4 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hweq := compileInₑ.isEq_wf hwφ₁ hwφ₂\n have hwin := compileInₑ.isIn_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp only ... | [
{
"name": "interpret_compileInₑ.isIn",
"text": "private theorem interpret_compileInₑ.isIn {t₁ t₂: Term} {ety₁ ety₂ : EntityType} {εs : SymEntities} {I : Interpretation}\n (hwε : SymEntities.WellFormed εs)\n (hI : Interpretation.WellFormed I εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed ... | [
{
"name": "interpret_compileInₑ.isEq",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 830,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,6 +43,33 @@
case isFalse heq =>
simp only [hwl₁, hwl₂, heq, interpret_term_prim, ite_false]
+private theorem interpret_compileInₑ.isIn {t₁ t₂: Term} {ety₁ ety₂ : EntityType} {εs : SymEntities} {I : Interpretation}
+ (hwε : SymEntities.WellFormed εs)
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ₁ : ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_1 | 26c161d8daa7d59f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hweq := compileInₑ.isEq_wf hwφ₁ hwφ₂\n have hwin := compileInₑ.isIn_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp only ... | [
{
"name": "interpret_compileInₑ.isEq",
"text": "private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}\n (hI : Interpretation.WellFormed I εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (hwl₁ : Term.WellFormed εs (Term.interpret I t₁) ∧ T... | [
{
"name": "interpret_compileInₑ.isIn",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 28,
"n_chars": 1297,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,6 +27,22 @@
open Batteries Data Spec SymCC Factory
+private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed εs t₂)
+ (hwl₁ : Term.WellFormed εs (Term.interpret I t₁)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_2 | a305660f4b0dfd47 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₛ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwin₁ := compileInₛ.isIn₁_wf hwφ₁ hwφ₂\n have hwin₂ := compileInₛ.isIn₂_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp o... | [
{
"name": "interpret_compileInₛ.isIn₂",
"text": "private theorem interpret_compileInₛ.isIn₂ {t₁ t₂: Term} {ety₁ ety₂ : EntityType} {εs : SymEntities} {I : Interpretation}\n (hwε : SymEntities.WellFormed εs)\n (hI : Interpretation.WellFormed I εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellForme... | [
{
"name": "interpret_compileInₛ.isIn₁",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 806,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -42,6 +42,35 @@
case isFalse heq =>
simp only [hwl₁, hwl₂, heq, interpret_term_prim, ite_false]
+private theorem interpret_compileInₛ.isIn₂ {t₁ t₂: Term} {ety₁ ety₂ : EntityType} {εs : SymEntities} {I : Interpretation}
+ (hwε : SymEntities.WellFormed εs)
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ₁ :... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_3 | fb0d9fee158ca90e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₛ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwin₁ := compileInₛ.isIn₁_wf hwφ₁ hwφ₂\n have hwin₂ := compileInₛ.isIn₂_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp o... | [
{
"name": "interpret_compileInₛ.isIn₁",
"text": "private theorem interpret_compileInₛ.isIn₁ {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (hwl₁ : Term.WellFormed εs (Term.interpret I t₁) ∧ Term.typeOf (Term.interpret I t₁) = Term... | [
{
"name": "interpret_compileInₛ.isIn₂",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1418,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,6 +27,21 @@
open Batteries Data Spec SymCC Factory
+private theorem interpret_compileInₛ.isIn₁ {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed εs t₂)
+ (hwl₁ : Term.WellFormed εs (Term.interpret I t₁) ∧ Term.typeOf (Term.interpret I t₁) = T... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_4 | 2ba21bb4c862be4b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_getTag",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hhas := wf_tags_hasTag hwτ hwφ₁ hwφ₂ hty₁ hty₂\n have hget := wf_tags_getTag! hwτ hwφ₁ hwφ₂ hty₁ hty₂\n simp only ... | [
{
"name": "interpret_hasTag",
"text": "theorem interpret_hasTag {t₁ t₂ : Term} {ety : EntityType} {εs : SymEntities} {τs : SymTags} {I : Interpretation}\n (hwτ : τs.WellFormed εs ety)\n (hI : I.WellFormed εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (hty₁ : t₁.typeOf = TermTy... | [
{
"name": "interpret_getTag",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 978,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,6 +27,20 @@
open Batteries Data Spec SymCC Factory
+theorem interpret_hasTag {t₁ t₂ : Term} {ety : EntityType} {εs : SymEntities} {τs : SymTags} {I : Interpretation}
+ (hwτ : τs.WellFormed εs ety)
+ (hI : I.WellFormed εs)
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed εs t₂)
+ (hty₁ : t₁.ty... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_5 | 93e5c93a3c8ab672 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hweq := compileInₑ.isEq_wf hwφ₁ hwφ₂\n have hwin := compileInₑ.isIn_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp only ... | [
{
"name": "interpret_compileInₑ.isEq",
"text": "private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}\n (hI : Interpretation.WellFormed I εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (hwl₁ : Term.WellFormed εs (Term.interpret I t₁) ∧ T... | [
{
"name": "interpret_compileApp₂",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 80,
"n_chars": 4771,
"n_subproofs": 8,
"n_tactics": 75,
"cyclomatic": 11,
"n_automation": 15,
"n_rewrites": 2,
"n_structural": 6,
"automation_only": false,
"... | 6 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,6 +27,22 @@
open Batteries Data Spec SymCC Factory
+private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed εs t₂)
+ (hwl₁ : Term.WellFormed εs (Term.interpret I t₁)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_6 | 5e5f51294917cd80 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "interpret_compileInₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hweq := compileInₑ.isEq_wf hwφ₁ hwφ₂\n have hwin := compileInₑ.isIn_wf hwε hwφ₁ hty₁ hwφ₂ hty₂ rfl\n simp only ... | [
{
"name": "interpret_compileInₑ.isEq",
"text": "private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}\n (hI : Interpretation.WellFormed I εs)\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (hwl₁ : Term.WellFormed εs (Term.interpret I t₁) ∧ T... | [
{
"name": "compile_interpret_binaryApp",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 11,
"n_lines": 59,
"n_chars": 3264,
"n_subproofs": 14,
"n_tactics": 48,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -27,6 +27,22 @@
open Batteries Data Spec SymCC Factory
+private theorem interpret_compileInₑ.isEq {t₁ t₂: Term} {εs : SymEntities} {I : Interpretation}
+ (hI : Interpretation.WellFormed I εs)
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed εs t₂)
+ (hwl₁ : Term.WellFormed εs (Term.interpret I t₁)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_7 | 2b635e3620a1041b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "same_set_contains",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hm := same_set_mem hwφ₁ hwφ₂ ih₁ ih₂\n simp only [← Set.contains_prop_bool_equiv] at hm\n rw [Bool.eq_iff_iff, hm]... | [
{
"name": "same_set_mem",
"text": "private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}\n (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))\n (hwφ₂ : Term.WellFormed εs t)\n (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs))\... | [
{
"name": "same_set_contains",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 524,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,13 +39,42 @@
subst hv₁ hv₂
))
+private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}
+ (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))
+ (hwφ₂ : Term.WellFormed εs t)
+ (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_8 | 9bbf695a5c1c7d94 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "same_set_contains",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hm := same_set_mem hwφ₁ hwφ₂ ih₁ ih₂\n simp only [← Set.contains_prop_bool_equiv] at hm\n rw [Bool.eq_iff_iff, hm]... | [
{
"name": "same_set_mem",
"text": "private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}\n (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))\n (hwφ₂ : Term.WellFormed εs t)\n (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs))\... | [
{
"name": "compileApp₂_contains_implies_apply₂",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 826,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": f... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,13 +39,42 @@
subst hv₁ hv₂
))
+private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}
+ (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))
+ (hwφ₂ : Term.WellFormed εs t)
+ (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_9 | 0f3a0a2c2e19fe9e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "same_set_contains",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hm := same_set_mem hwφ₁ hwφ₂ ih₁ ih₂\n simp only [← Set.contains_prop_bool_equiv] at hm\n rw [Bool.eq_iff_iff, hm]... | [
{
"name": "same_set_mem",
"text": "private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}\n (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))\n (hwφ₂ : Term.WellFormed εs t)\n (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs))\... | [
{
"name": "same_set_subset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1560,
"n_subproofs": 9,
"n_tactics": 32,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 6,
"automation_only": false,
"max_nest... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,13 +39,70 @@
subst hv₁ hv₂
))
+private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}
+ (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))
+ (hwφ₂ : Term.WellFormed εs t)
+ (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_10 | 365528be0eae7798 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "same_set_contains",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hm := same_set_mem hwφ₁ hwφ₂ ih₁ ih₂\n simp only [← Set.contains_prop_bool_equiv] at hm\n rw [Bool.eq_iff_iff, hm]... | [
{
"name": "same_set_mem",
"text": "private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}\n (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))\n (hwφ₂ : Term.WellFormed εs t)\n (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs))\... | [
{
"name": "compileApp₂_containsAll_implies_apply₂",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1022,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,13 +39,70 @@
subst hv₁ hv₂
))
+private theorem same_set_mem {εs : SymEntities} {ts : Set Term} {vs : Set Value} {t : Term} {v : Value}
+ (hwφ₁ : Term.WellFormed εs (Term.set ts (Term.typeOf t)))
+ (hwφ₂ : Term.WellFormed εs t)
+ (hs₁ : Term.value? (Term.set ts (Term.typeOf t)) = some (Value.set vs... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_11 | 50af61f6654b1a98 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "compileApp₂_containsAny_implies_apply₂",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ty, hty₁, hty₂, hok⟩ := compileApp₂_containsAny_ok_implies hok\n subst hok\n have hlit₁ ... | [
{
"name": "same_set_intersects",
"text": "private theorem same_set_intersects {εs : SymEntities} {s₁ s₂ : Set Term} {ty : TermType} {vs₁ vs₂ : Set Value}\n (hwφ₁ : Term.WellFormed εs (Term.set s₁ ty))\n (hwφ₂ : Term.WellFormed εs (Term.set s₂ ty))\n (ih₁ : Term.value? (Term.set s₁ ty) = some (Value.set ... | [
{
"name": "compileApp₂_containsAny_implies_apply₂",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1030,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,6 +39,40 @@
subst hv₁ hv₂
))
+private theorem same_set_intersects {εs : SymEntities} {s₁ s₂ : Set Term} {ty : TermType} {vs₁ vs₂ : Set Value}
+ (hwφ₁ : Term.WellFormed εs (Term.set s₁ ty))
+ (hwφ₂ : Term.WellFormed εs (Term.set s₂ ty))
+ (ih₁ : Term.value? (Term.set s₁ ty) = some (Value.set vs₁))... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_12 | bd735b162484a6f6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "compileInₑ_eq_inₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [compileInₑ_def]\n by_cases h : e₁ = e₂\n case pos =>\n subst h\n simp only [compileInₑ.isEq, ↓reduceIte, pe_... | [
{
"name": "same_entities_ancestors_none_of_type",
"text": "theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}\n (heq : es ∼ εs)\n (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :\n ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁\n:= by\n simp only [Same... | [
{
"name": "compileInₑ_eq_inₑ",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1934,
"n_subproofs": 1,
"n_tactics": 32,
"cyclomatic": 4,
"n_automation": 8,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
"max_ne... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -103,6 +103,27 @@
subst hv₁ hv₂
))
+theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}
+ (heq : es ∼ εs)
+ (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :
+ ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁
+:= by
+ simp only [Same.same, SameEntities]... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_13 | f6091d874d36661b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "term_entity_set_wfl_implies_value?",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Term.value?, Option.bind_eq_bind, Option.bind_eq_some_iff, Option.some.injEq,\n Value.set... | [
{
"name": "term_entities_filterMap_value?_eq",
"text": "private theorem term_entities_filterMap_value?_eq (uids : List EntityUID) :\n List.filterMap Term.value? (List.map (fun uid => Term.prim (TermPrim.entity uid)) uids) =\n List.map (fun uid => Value.prim (Prim.entityUID uid)) uids\n:= by\n induction u... | [
{
"name": "term_entity_set_wfl_implies_value?",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 879,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": fa... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,6 +39,16 @@
subst hv₁ hv₂
))
+private theorem term_entities_filterMap_value?_eq (uids : List EntityUID) :
+ List.filterMap Term.value? (List.map (fun uid => Term.prim (TermPrim.entity uid)) uids) =
+ List.map (fun uid => Value.prim (Prim.entityUID uid)) uids
+:= by
+ induction uids
+ case nil =>
... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_14 | a385e1cbad417b14 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "entity_set_mapOrErr_asEntityUID_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Set.mapOrErr, Set.elts, hvs, ← List.mapM'_eq_mapM, entities_mapM'_asEntityUID_map_eq, Except.... | [
{
"name": "entities_mapM'_asEntityUID_map_eq",
"text": "private theorem entities_mapM'_asEntityUID_map_eq {uids : List EntityUID} :\n List.mapM' Value.asEntityUID (List.map (fun uid => Value.prim (Prim.entityUID uid)) uids) =\n .ok uids\n:= by\n induction uids\n case nil =>\n simp only [List.map_nil,... | [
{
"name": "entity_set_mapOrErr_asEntityUID_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,11 +39,25 @@
subst hv₁ hv₂
))
+private theorem entities_mapM'_asEntityUID_map_eq {uids : List EntityUID} :
+ List.mapM' Value.asEntityUID (List.map (fun uid => Value.prim (Prim.entityUID uid)) uids) =
+ .ok uids
+:= by
+ induction uids
+ case nil =>
+ simp only [List.map_nil, List.mapM'_nil, p... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_15 | 3cc71659576c14ae | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "compileInₑ_eq_inₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [compileInₑ_def]\n by_cases h : e₁ = e₂\n case pos =>\n subst h\n simp only [compileInₑ.isEq, ↓reduceIte, pe_... | [
{
"name": "same_entities_ancestors_none_of_type",
"text": "theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}\n (heq : es ∼ εs)\n (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :\n ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁\n:= by\n simp only [Same... | [
{
"name": "compileInₛ_eq_any_inₑ_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 634,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,12 +39,41 @@
subst hv₁ hv₂
))
+theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}
+ (heq : es ∼ εs)
+ (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :
+ ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁
+:= by
+ simp only [Same.same, SameEntities] ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_16 | d597c88fd2f1ffa5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "compileInₑ_eq_inₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [compileInₑ_def]\n by_cases h : e₁ = e₂\n case pos =>\n subst h\n simp only [compileInₑ.isEq, ↓reduceIte, pe_... | [
{
"name": "same_entities_ancestors_some_of_type",
"text": "theorem same_entities_ancestors_some_of_type {es : Entities} {εs : SymEntities} {e₁ : EntityUID} {ety₂ : EntityType} {ancs : UnaryFunction}\n (heq : es ∼ εs)\n (hwf : Value.WellFormed es (Value.prim (Prim.entityUID e₁)))\n (hso : SymEntities.ance... | [
{
"name": "compileInₛ_eq_any_inₑ_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2050,
"n_subproofs": 2,
"n_tactics": 30,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -39,6 +39,53 @@
subst hv₁ hv₂
))
+theorem same_entities_ancestors_some_of_type {es : Entities} {εs : SymEntities} {e₁ : EntityUID} {ety₂ : EntityType} {ancs : UnaryFunction}
+ (heq : es ∼ εs)
+ (hwf : Value.WellFormed es (Value.prim (Prim.entityUID e₁)))
+ (hso : SymEntities.ancestorsOfType εs e₁.ty e... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_17 | 42c704fa52849ec5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "compileInₑ_eq_inₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [compileInₑ_def]\n by_cases h : e₁ = e₂\n case pos =>\n subst h\n simp only [compileInₑ.isEq, ↓reduceIte, pe_... | [
{
"name": "same_entities_ancestors_none_of_type",
"text": "theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}\n (heq : es ∼ εs)\n (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :\n ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁\n:= by\n simp only [Same... | [
{
"name": "compileInₛ_eq_any_inₑ",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 60,
"n_chars": 2949,
"n_subproofs": 6,
"n_tactics": 49,
"cyclomatic": 4,
"n_automation": 12,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": false,
"m... | 5 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -104,6 +104,27 @@
subst hv₁ hv₂
))
+theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}
+ (heq : es ∼ εs)
+ (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :
+ ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁
+:= by
+ simp only [Same.same, SameEntities]... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_18 | 1c7684950238e21c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "compileInₑ_eq_inₑ",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [compileInₑ_def]\n by_cases h : e₁ = e₂\n case pos =>\n subst h\n simp only [compileInₑ.isEq, ↓reduceIte, pe_... | [
{
"name": "same_entities_ancestors_none_of_type",
"text": "theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}\n (heq : es ∼ εs)\n (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :\n ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁\n:= by\n simp only [Same... | [
{
"name": "compileApp₂_mem_implies_apply₂",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 41,
"n_chars": 1826,
"n_subproofs": 4,
"n_tactics": 34,
"cyclomatic": 5,
"n_automation": 2,
"n_rewrites": 8,
"n_structural": 3,
"automation_only": fals... | 13 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -168,6 +168,27 @@
subst hv₁ hv₂
))
+theorem same_entities_ancestors_none_of_type {es : Entities} {εs : SymEntities} {e₁ e₂ : EntityUID}
+ (heq : es ∼ εs)
+ (hno : SymEntities.ancestorsOfType εs e₁.ty e₂.ty = none) :
+ ¬ e₂ ∈ Entities.ancestorsOrEmpty es e₁
+:= by
+ simp only [Same.same, SameEntities]... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_19 | 5ce01befa93ed2d6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "compileApp₂_implies_apply₂",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases op₂\n case eq => exact compileApp₂_eq_implies_apply₂ hwφ₁ hwφ₂ ih₁ ih₂ hok\n case less ... | [
{
"name": "compileApp₂_sub_implies_apply₂",
"text": "private theorem compileApp₂_sub_implies_apply₂ {t₁ t₂ t₃ : Term} {v₁ v₂ : Value}\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (ih₁ : v₁ ∼ t₁)\n (ih₂ : v₂ ∼ t₂)\n (hok : compileApp₂ .sub t₁ t₂ εs = Except.ok t₃) :\n apply₂ .s... | [
{
"name": "compileApp₂_implies_apply₂",
"fan_in": 1,
"n_deps_direct": 12,
"n_deps_transitive": 29,
"n_lines": 25,
"n_chars": 1664,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 13,
"automation_only": false,... | 29 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -312,6 +312,27 @@
simp only [Same.same, SameResults, intOrErr, ih₁, ih₂, BitVec.overflows_true_64.mp h,
pe_ifFalse_true, ne_eq, not_false_eq_true, reduceCtorEq]
+private theorem compileApp₂_sub_implies_apply₂ {t₁ t₂ t₃ : Term} {v₁ v₂ : Value}
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c04a7f5fa354_20 | 87305e7bd2bea00d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Binary.lean | Binary | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "compileApp₂_implies_apply₂",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases op₂\n case eq => exact compileApp₂_eq_implies_apply₂ hwφ₁ hwφ₂ ih₁ ih₂ hok\n case less ... | [
{
"name": "compileApp₂_sub_implies_apply₂",
"text": "private theorem compileApp₂_sub_implies_apply₂ {t₁ t₂ t₃ : Term} {v₁ v₂ : Value}\n (hwφ₁ : Term.WellFormed εs t₁)\n (hwφ₂ : Term.WellFormed εs t₂)\n (ih₁ : v₁ ∼ t₁)\n (ih₂ : v₂ ∼ t₂)\n (hok : compileApp₂ .sub t₁ t₂ εs = Except.ok t₃) :\n apply₂ .s... | [
{
"name": "compile_evaluate_binaryApp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 30,
"n_lines": 50,
"n_chars": 2115,
"n_subproofs": 6,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 8,
"n_structural": 3,
"automation_only": false,
... | 30 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -312,6 +312,27 @@
simp only [Same.same, SameResults, intOrErr, ih₁, ih₂, BitVec.overflows_true_64.mp h,
pe_ifFalse_true, ne_eq, not_false_eq_true, reduceCtorEq]
+private theorem compileApp₂_sub_implies_apply₂ {t₁ t₂ t₃ : Term} {v₁ v₂ : Value}
+ (hwφ₁ : Term.WellFormed εs t₁)
+ (hwφ₂ : Term.WellFormed... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8d608365de03_0 | 981171cc8412bd2c | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "toBits_fromBits",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " (toBits_fromBits_aux bits h_bits).right",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"... | [
{
"name": "toBits_fromBits_aux",
"text": "/--\n Main lemma which establishes the behaviour of `fromBits`\n and `toBits` by induction\n-/\nlemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n (fromBits bits) < 2^n ∧ toBits n (fromBits ... | [
{
"name": "toBits_fromBits",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -20,10 +20,51 @@
def fromBits {n : ℕ} (bits : Vector ℕ n) : ℕ :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * 2^i) 0
+/--
+ Main lemma which establishes the behaviour of `fromBits`
+ and `toBits` by induction
+-/
+lemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)
+ (h_bits : ∀ (i : ℕ) (hi : i < n), bi... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_1 | d3c8b5c3a49d0b27 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "toBits_fromBits",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " (toBits_fromBits_aux bits h_bits).right",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"... | [
{
"name": "toBits_fromBits_aux",
"text": "/--\n Main lemma which establishes the behaviour of `fromBits`\n and `toBits` by induction\n-/\nlemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n (fromBits bits) < 2^n ∧ toBits n (fromBits ... | [
{
"name": "fromBits_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 241,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1... | 1 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -20,10 +20,51 @@
def fromBits {n : ℕ} (bits : Vector ℕ n) : ℕ :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * 2^i) 0
+/--
+ Main lemma which establishes the behaviour of `fromBits`
+ and `toBits` by induction
+-/
+lemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)
+ (h_bits : ∀ (i : ℕ) (hi : i < n), bi... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_2 | fdcfc54d4e443e97 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "fromBits_toBits",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_bits : ∀ i (hi : i < n), (toBits n x)[i] = 0 ∨ (toBits n x)[i] = 1 := by\n intro i hi; simp [toBits, Vector.getEl... | [
{
"name": "fromBits_lt",
"text": "/-- The result of `fromBits` is less than 2^n -/\ntheorem fromBits_lt {n : ℕ} (bits : Vector ℕ n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n (fromBits bits) < 2^n := (toBits_fromBits_aux bits h_bits).left\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "fromBits_toBits",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 401,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 4 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -66,6 +66,11 @@
(h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :
toBits n (fromBits bits) = bits := (toBits_fromBits_aux bits h_bits).right
+/-- The result of `fromBits` is less than 2^n -/
+theorem fromBits_lt {n : ℕ} (bits : Vector ℕ n)
+ (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bit... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_3 | 7b19fb849a23fb18 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "toBits_fromBits",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " (toBits_fromBits_aux bits h_bits).right",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"... | [
{
"name": "toBits_fromBits_aux",
"text": "/--\n Main lemma which establishes the behaviour of `fromBits`\n and `toBits` by induction\n-/\nlemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n (fromBits bits) < 2^n ∧ toBits n (fromBits ... | [
{
"name": "fieldToBits_fieldFromBits_aux",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1115,
"n_subproofs": 3,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 2,
"n_structural": 12,
"automation_only": false... | 1 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -20,6 +20,47 @@
def fromBits {n : ℕ} (bits : Vector ℕ n) : ℕ :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * 2^i) 0
+/--
+ Main lemma which establishes the behaviour of `fromBits`
+ and `toBits` by induction
+-/
+lemma toBits_fromBits_aux {n : ℕ} (bits : Vector ℕ n)
+ (h_bits : ∀ (i : ℕ) (hi : i < n), bit... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_4 | ea573951611affe6 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "fieldFromBits_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hn : 2^n < p\n · exact (fieldToBits_fieldFromBits_aux hn bits h_bits).left\n have : p ≤ 2^n := Nat.le_of_not_lt... | [
{
"name": "fieldToBits_fieldFromBits_aux",
"text": "/--\nDefine the behaviour of `fieldFromBits` and `fieldToBits` by\nlifting `toBits_fromBits_aux`\n-/\nlemma fieldToBits_fieldFromBits_aux {n : ℕ} (hn : 2^n < p) (bits : Vector (F p) n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n ... | [
{
"name": "fieldFromBits_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 421,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -78,12 +78,42 @@
def fieldFromBitsExpr {n : ℕ} (bits : Vector (Expression (F p)) n) : Expression (F p) :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * (2^i : F p)) 0
+/--
+Define the behaviour of `fieldFromBits` and `fieldToBits` by
+lifting `toBits_fromBits_aux`
+-/
+lemma fieldToBits_fieldFromBits_aux {n :... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_5 | f9e498731bb296bb | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "fieldFromBits_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hn : 2^n < p\n · exact (fieldToBits_fieldFromBits_aux hn bits h_bits).left\n have : p ≤ 2^n := Nat.le_of_not_lt... | [
{
"name": "fieldToBits_fieldFromBits_aux",
"text": "/--\nDefine the behaviour of `fieldFromBits` and `fieldToBits` by\nlifting `toBits_fromBits_aux`\n-/\nlemma fieldToBits_fieldFromBits_aux {n : ℕ} (hn : 2^n < p) (bits : Vector (F p) n)\n (h_bits : ∀ (i : ℕ) (hi : i < n), bits[i] = 0 ∨ bits[i] = 1) :\n ... | [
{
"name": "fieldToBits_fieldFromBits",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 315,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -78,10 +78,40 @@
def fieldFromBitsExpr {n : ℕ} (bits : Vector (Expression (F p)) n) : Expression (F p) :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * (2^i : F p)) 0
+/--
+Define the behaviour of `fieldFromBits` and `fieldToBits` by
+lifting `toBits_fromBits_aux`
+-/
+lemma fieldToBits_fieldFromBits_aux {n :... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_6 | 4be135f47efae24d | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "fieldFromBits_fieldToBits",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [fieldToBits, fieldFromBits]\n rw [Vector.map_map, val_natCast_toBits, fromBits_toBits hx, ZMod.natCas... | [
{
"name": "fromBits_toBits",
"text": "/-- On numbers less than `2^n`, `toBits` is a right-inverse of `fromBits` -/\ntheorem fromBits_toBits {n : ℕ} {x : ℕ} (hx : x < 2^n) :\n fromBits (toBits n x) = x := by\n have h_bits : ∀ i (hi : i < n), (toBits n x)[i] = 0 ∨ (toBits n x)[i] = 1 := by\n intro i hi... | [
{
"name": "fieldFromBits_fieldToBits",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 342,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 6 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -93,6 +93,14 @@
replace hy : y < 2^i := by linarith
rw [Nat.testBit_lt_two_pow hx, Nat.testBit_lt_two_pow hy]
+/-- On numbers less than `2^n`, `toBits` is a right-inverse of `fromBits` -/
+theorem fromBits_toBits {n : ℕ} {x : ℕ} (hx : x < 2^n) :
+ fromBits (toBits n x) = x := by
+ have h_bits : ∀ i (... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_7 | 634d8ae8991e99df | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "fieldFromBits_fieldToBits",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [fieldToBits, fieldFromBits]\n rw [Vector.map_map, val_natCast_toBits, fromBits_toBits hx, ZMod.natCas... | [
{
"name": "val_natCast_toBits",
"text": "lemma val_natCast_toBits {n} {x : ℕ} :\n Vector.map (ZMod.val ∘ Nat.cast (R:=F p)) (toBits n x) = toBits n x := by\n rw [Vector.ext_iff]\n intro i hi\n simp only [Vector.getElem_map, Function.comp_apply]\n rw [ZMod.val_natCast, Nat.mod_eq_of_lt]\n simp only [... | [
{
"name": "fieldFromBits_fieldToBits_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 580,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
... | 2 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -64,6 +64,17 @@
def fieldFromBitsExpr {n : ℕ} (bits : Vector (Expression (F p)) n) : Expression (F p) :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * (2^i : F p)) 0
+lemma val_natCast_toBits {n} {x : ℕ} :
+ Vector.map (ZMod.val ∘ Nat.cast (R:=F p)) (toBits n x) = toBits n x := by
+ rw [Vector.ext_iff]
+ ... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8d608365de03_8 | 4cd8d0be518f5872 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Utils/Bits.lean | Bits | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "fieldFromBits_as_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero => simp [fieldFromBits, fromBits, Fin.foldl_zero]\n | succ n ih => simp [fieldFromBits_suc... | [
{
"name": "fieldFromBits_succ",
"text": "/-- fieldFromBits decomposes as sum of first n bits + bit_n * 2^n -/\nlemma fieldFromBits_succ (n : ℕ) (bits : Vector (F p) (n + 1)) :\n fieldFromBits bits = fieldFromBits bits.pop + bits[n] * (2^n : F p) := by\n simp only [fieldFromBits, fromBits, Vector.getElem... | [
{
"name": "fieldFromBits_as_sum",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | /-
This file defines a conversion between a field element and its bit representation.
The bits are themselves typed as field elements, with values in { 0, 1 }.
-/
import Clean.Utils.Field
import Clean.Utils.Vector
import Clean.Circuit.Expression
import Clean.Utils.Fin
namespace Utils.Bits
/--
Convert a natural numbe... | @@ -37,13 +37,21 @@
def fieldFromBitsExpr {n : ℕ} (bits : Vector (Expression (F p)) n) : Expression (F p) :=
Fin.foldl n (fun acc ⟨i, _⟩ => acc + bits[i] * (2^i : F p)) 0
+/-- fieldFromBits decomposes as sum of first n bits + bit_n * 2^n -/
+lemma fieldFromBits_succ (n : ℕ) (bits : Vector (F p) (n + 1)) :
+ fi... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_0 | 6f843d6d90059405 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "eval_eq_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro env x\n rw [CircuitType.eval_expression]\n symm\n simp only [eval, ProvableType.eval, fromElements, toElements, size... | [
{
"name": "fromElements_eval_toElements",
"text": "/-- `eval` is the normal form. This is needed to simplify lookup constraints. -/\n@[circuit_norm]\ntheorem fromElements_eval_toElements {α : TypeMap} [ProvableType α] {env : Environment F}\n (x : α (Expression F)) :\n fromElements (Vector.map (Express... | [
{
"name": "eval_eq_eval",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1284,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max_nesting... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -173,6 +173,14 @@
namespace ProvableType
+/-- `eval` is the normal form. This is needed to simplify lookup constraints. -/
+@[circuit_norm]
+theorem fromElements_eval_toElements {α : TypeMap} [ProvableType α] {env : Environment F}
+ (x : α (Expression F)) :
+ fromElements (Vector.map (Expression.eval env)... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_1 | 7c047ad07f06888c | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "eval_varFromOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [CircuitType.eval_expression]\n simp only [explicit_provable_type, varFromOffset]\n rw [toElements_fromElements]\n ... | [
{
"name": "ext_iff",
"text": "theorem ext_iff {F} (x y : α F) :\n x = y ↔ ∀ i (hi : i < size α), (toElements x)[i] = (toElements y)[i] := by\n rw [←Vector.ext_iff]\n constructor\n · intro h; rw [h]\n intro h\n have h' := congrArg fromElements h\n simp only [fromElements_toElements] at h'\n exact h... | [
{
"name": "eval_varFromOffset",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 455,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nes... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -635,8 +635,25 @@
theorem eval_varFromOffset (env : Environment F) (offset : ℕ) :
(Eval.eval env (varFromOffset α offset : α (Expression F)) : α F) =
- fromElements (.mapRange (size α) fun i => env.get (offset + i)) := sorry
+ fromElements (.mapRange (size α) fun i => env.get (offset + i)) := by
+ ... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_2 | 0d1d2761b15f74ab | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "eval_varFromOffset_prover",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact (CircuitType.eval_expression_prover env (varFromOffset α offset)).trans (by\n simpa only [CircuitType.ev... | [
{
"name": "eval_varFromOffset",
"text": "theorem eval_varFromOffset (env : Environment F) (offset : ℕ) :\n (Eval.eval env (varFromOffset α offset : α (Expression F)) : α F) =\n fromElements (.mapRange (size α) fun i => env.get (offset + i)) := by\n rw [CircuitType.eval_expression]\n simp only [exp... | [
{
"name": "eval_varFromOffset_prover",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 455,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 2 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -633,9 +633,22 @@
exact (CircuitType.eval_expression_prover env (const x)).trans (by
simpa only [CircuitType.eval_expression] using eval_const (env:=env.toEnvironment) (x:=x))
+theorem eval_varFromOffset (env : Environment F) (offset : ℕ) :
+ (Eval.eval env (varFromOffset α offset : α (Expression F)) : ... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_3 | 4218be2a65474620 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "getElem_eval_vector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := congrArg (fun xs : Vector (α F) n => xs[i]) (eval_vector env x)\n simpa only [Vector.getElem_map] using h'.... | [
{
"name": "eval_vector",
"text": "theorem eval_vector (env : Environment F)\n (x : ProvableVector α n (Expression F)) :\n eval env x = x.map (eval env) := by\n rw [CircuitType.eval_expression]\n have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by\n ext i hi\n simp only... | [
{
"name": "getElem_eval_vector",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 284,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -659,8 +659,23 @@
end CircuitType
+theorem eval_vector (env : Environment F)
+ (x : ProvableVector α n (Expression F)) :
+ eval env x = x.map (eval env) := by
+ rw [CircuitType.eval_expression]
+ have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by
+ ext i hi
+ simp only [V... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_4 | 9044f8a2bce0b9cb | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "getElem_eval_vector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := congrArg (fun xs : Vector (α F) n => xs[i]) (eval_vector env x)\n simpa only [Vector.getElem_map] using h'.... | [
{
"name": "eval_vector",
"text": "theorem eval_vector (env : Environment F)\n (x : ProvableVector α n (Expression F)) :\n eval env x = x.map (eval env) := by\n rw [CircuitType.eval_expression]\n have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by\n ext i hi\n simp only... | [
{
"name": "eval_vector_eq_get",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 276,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -659,8 +659,23 @@
end CircuitType
+theorem eval_vector (env : Environment F)
+ (x : ProvableVector α n (Expression F)) :
+ eval env x = x.map (eval env) := by
+ rw [CircuitType.eval_expression]
+ have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by
+ ext i hi
+ simp only [V... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_5 | 407f5952a6a9dc69 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "getElem_eval_vector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := congrArg (fun xs : Vector (α F) n => xs[i]) (eval_vector env x)\n simpa only [Vector.getElem_map] using h'.... | [
{
"name": "eval_vector",
"text": "theorem eval_vector (env : Environment F)\n (x : ProvableVector α n (Expression F)) :\n eval env x = x.map (eval env) := by\n rw [CircuitType.eval_expression]\n have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by\n ext i hi\n simp only... | [
{
"name": "eval_vector_take",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 380,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -659,12 +659,26 @@
end CircuitType
+theorem eval_vector (env : Environment F)
+ (x : ProvableVector α n (Expression F)) :
+ eval env x = x.map (eval env) := by
+ rw [CircuitType.eval_expression]
+ have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by
+ ext i hi
+ simp only [... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_6 | ed1128605661eb1c | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "getElem_eval_vector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := congrArg (fun xs : Vector (α F) n => xs[i]) (eval_vector env x)\n simpa only [Vector.getElem_map] using h'.... | [
{
"name": "eval_vector",
"text": "theorem eval_vector (env : Environment F)\n (x : ProvableVector α n (Expression F)) :\n eval env x = x.map (eval env) := by\n rw [CircuitType.eval_expression]\n have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by\n ext i hi\n simp only... | [
{
"name": "eval_vector_takeShort",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 483,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -659,12 +659,29 @@
end CircuitType
+theorem eval_vector (env : Environment F)
+ (x : ProvableVector α n (Expression F)) :
+ eval env x = x.map (eval env) := by
+ rw [CircuitType.eval_expression]
+ have h_map : x.map (eval env) = x.map (fun y => ProvableType.eval env y) := by
+ ext i hi
+ simp only [... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_7c9ebc029202_7 | c824344696b97c88 | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Circuit/Provable.lean | Provable | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "eval_varFromOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [CircuitType.eval_expression]\n simp only [explicit_provable_type, varFromOffset]\n rw [toElements_fromElements]\n ... | [
{
"name": "ext_iff",
"text": "theorem ext_iff {F} (x y : α F) :\n x = y ↔ ∀ i (hi : i < size α), (toElements x)[i] = (toElements y)[i] := by\n rw [←Vector.ext_iff]\n constructor\n · intro h; rw [h]\n intro h\n have h' := congrArg fromElements h\n simp only [fromElements_toElements] at h'\n exact h... | [
{
"name": "varFromOffset_vector",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 912,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 11,
"n_structural": 3,
"automation_only": false,
"max... | 1 | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | import Mathlib.Data.ZMod.Basic
import Clean.Utils.Vector
import Clean.Circuit.CircuitType
import Clean.Circuit.SimpGadget
variable {F : Type} [FiniteField F]
/--
Class of types that can be used inside a circuit,
because they can be flattened into a vector of (field) elements.
-/
class ProvableType (M : TypeMap) where... | @@ -633,6 +633,16 @@
exact (CircuitType.eval_expression_prover env (const x)).trans (by
simpa only [CircuitType.eval_expression] using eval_const (env:=env.toEnvironment) (x:=x))
+theorem ext_iff {F} (x y : α F) :
+ x = y ↔ ∀ i (hi : i < size α), (toElements x)[i] = (toElements y)[i] := by
+ rw [←Vector.e... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_2f837cb619eb_0 | 1341183d490a0efc | lean | lean | github.com/Verified-zkEVM/clean | 1e563b9c27991b3795eb440c1ee0757edb4ce8b1 | Clean/Gadgets/Not/Not64.lean | Not64 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "not_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [←not_zify n hx, Int.ofNat_lt]\n exact Nat.sub_one_sub_lt_of_lt hx",
"n_chars": 77,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "not_zify",
"text": "theorem not_zify (n : ℕ) {x : ℕ} (hx : x < n) : ((n - 1 - x : ℕ) : ℤ) = ↑n - 1 - ↑x := by\n have n_ge_1 : 1 ≤ n := by linarith\n have x_le : x ≤ n - 1 := Nat.le_pred_of_lt hx\n rw [Nat.cast_sub x_le, Nat.cast_sub n_ge_1]\n rfl\n\n",
"fan_in": 2,
"n_lines": 7,
"... | [
{
"name": "not_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 153,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}
... | 1 | import Clean.Utils.Primes
import Clean.Circuit.Basic
import Clean.Utils.Field
import Clean.Types.U64
section
variable {p : ℕ} [Fact p.Prime] [p_large_enough: Fact (p > 512)]
namespace Gadgets.Not
def not64_bytewise (x : U64 (Expression (F p))) : U64 (Expression (F p)) := U64.map x (fun x => 255 - x)
def not64_bytew... | import Clean.Utils.Primes
import Clean.Circuit.Basic
import Clean.Utils.Field
import Clean.Types.U64
section
variable {p : ℕ} [Fact p.Prime] [p_large_enough: Fact (p > 512)]
namespace Gadgets.Not
def not64_bytewise (x : U64 (Expression (F p))) : U64 (Expression (F p)) := U64.map x (fun x => 255 - x)
def not64_bytew... | @@ -18,12 +18,39 @@
rw [not64_bytewise, not64_bytewise_value, U64.map, U64.map]
simp only [circuit_norm, explicit_provable_type]
-theorem not_lt (n : ℕ) {x : ℕ} (hx : x < n) : n - 1 - (x : ℤ) < n := sorry
+theorem not_zify (n : ℕ) {x : ℕ} (hx : x < n) : ((n - 1 - x : ℕ) : ℤ) = ↑n - 1 - ↑x := by
+ have n_ge_1 :... | {
"repo": "clean",
"git_repo": "github.com/Verified-zkEVM/clean",
"revision": "1e563b9c27991b3795eb440c1ee0757edb4ce8b1",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.