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_57785de4755c_27 | 0b2e1cace7a1d35b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/WF.lean | WF | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 47 | 6 | [
{
"theorem_name": "evaluate_and_or_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Result.as] at hok\n simp_do_let (evaluate x₁ env.request env.entities) as hok₁ at hok\n rename_i v₁\n sim... | [
{
"name": "value_bool_wf",
"text": "private theorem value_bool_wf {b : Bool} {es : Entities} :\n Value.WellFormed es (Value.prim (.bool b))\n:= by exact Value.WellFormed.prim_wf (by simp only [Prim.WellFormed])\n\n",
"fan_in": 6,
"n_lines": 5,
"n_chars": 175,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "evaluate_wf",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 18,
"n_lines": 31,
"n_chars": 1315,
"n_subproofs": 3,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 17,
"automation_only": false,
"max_nesti... | 18 | /-
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,10 @@
evaluate x env.request env.entities = .ok v →
v.WellFormed env.entities
+private theorem value_bool_wf {b : Bool} {es : Entities} :
+ Value.WellFormed es (Value.prim (.bool b))
+:= by exact Value.WellFormed.prim_wf (by simp only [Prim.WellFormed])
+
private theorem value_int_wf {i : 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_48e9db424d08_0 | e666efd25d0f6b04 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "equiv_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor <;> intro h\n · simp only [Equiv, nil_subset, and_true] at h\n rw [← List.subset_nil]\n exact h\n · subst h\n... | [
{
"name": "Equiv.refl",
"text": "public theorem Equiv.refl {a : List α} :\n a ≡ a\n:= by unfold List.Equiv; simp only [Subset.refl, and_self]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 112,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": ... | [
{
"name": "equiv_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4
... | 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,10 @@
infix:50 " ≡ " => Equiv
+public theorem Equiv.refl {a : List α} :
+ a ≡ a
+:= by unfold List.Equiv; simp only [Subset.refl, and_self]
+
public theorem equiv_nil (xs : List α) :
xs ≡ [] ↔ xs = []
:= by
@@ -49,7 +53,8 @@
· simp only [Equiv, nil_subset, and_true] at h
rw [← List.subse... | {
"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_48e9db424d08_1 | 61a18505d7f975f1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "sortedBy_equiv_implies_head_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 659,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 6,
"n_automation": 3,
"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... | @@ -52,12 +52,42 @@
public abbrev Sorted [LT α] (xs : List α) := SortedBy id xs
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction... | {
"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_48e9db424d08_2 | a06984271793e831 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "sortedBy_equiv_implies_tail_subset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 594,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": fa... | 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... | @@ -52,12 +52,43 @@
public abbrev Sorted [LT α] (xs : List α) := SortedBy id xs
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction... | {
"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_48e9db424d08_3 | 01d6da5e951df39a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "sortedBy_equiv_implies_tail_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 435,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": fals... | 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... | @@ -52,12 +52,43 @@
public abbrev Sorted [LT α] (xs : List α) := SortedBy id xs
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction... | {
"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_48e9db424d08_4 | a94938be8717a797 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "sortedBy_equiv_implies_eq",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 27,
"n_chars": 787,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 10,
"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... | @@ -63,19 +63,61 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_5 | d2f3f1e3bcb51ba5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "mem_of_sortedBy_unique",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 742,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 8,
"automation_only": false,
"ma... | 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... | @@ -59,11 +59,47 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_6 | 725ddc5da5b079b9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "mem_of_sortedBy_implies_find?",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 860,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 5,
"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... | @@ -59,6 +59,25 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_7 | 8e3d57fca9306116 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "map_eq_implies_sortedBy",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 44,
"n_chars": 1750,
"n_subproofs": 2,
"n_tactics": 47,
"cyclomatic": 18,
"n_automation": 10,
"n_rewrites": 4,
"n_structural": 20,
"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... | @@ -59,10 +59,67 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_8 | a43606a8658c2cdb | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "filter_sortedBy",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 522,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 8,
"automation_only": false,
"max_nesti... | 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... | @@ -59,6 +59,25 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_9 | dd945ea3df8013a6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "filterMap_sortedBy",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 938,
"n_subproofs": 2,
"n_tactics": 22,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 8,
"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... | @@ -59,11 +59,51 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_48e9db424d08_10 | bc5a1262c0a3e66f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Basic.lean | Basic | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 7 | [
{
"theorem_name": "sortedBy_equiv_implies_head_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n unfold List.Equiv; intro h₃\n simp only [cons_subset, mem_cons] at h₃\n replace ⟨⟨h₃, _⟩, ... | [
{
"name": "sortedBy_implies_head_lt_tail",
"text": "public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :\n SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y\n:= by\n intro h₁ y h₂\n induction xs generalizing y\n case nil => contradiction\n case cons hd tl ih... | [
{
"name": "filterMap_key_id_sortedBy_key",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 439,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 3,
"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... | @@ -59,11 +59,51 @@
exact SortedBy.nil
assumption
+public theorem sortedBy_implies_head_lt_tail [LT β] [StrictLT β] {f : α → β} {x : α} {xs : List α} :
+ SortedBy f (x :: xs) → ∀ y, y ∈ xs → f x < f y
+:= by
+ intro h₁ y h₂
+ induction xs generalizing y
+ case nil => contradiction
+ case cons hd tl 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_260f636d1d43_0 | c86cde297de8a796 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/Contains.lean | Contains | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "type_of_contains_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hc, hty, ty₁, ty₂, _, ht₁, ht₂⟩ := type_of_contains_inversion h₃\n subst hc ; rw [hty]\n apply And.intro... | [
{
"name": "type_of_contains_inversion",
"text": "theorem type_of_contains_inversion {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}\n (h₁ : typeOf (Expr.binaryApp .contains x₁ x₂) c env = Except.ok (ty, c')) :\n c' = ∅ ∧\n ty.typeOf = .bool .anyBool ∧\n ∃ ty₁ ty₂,\n (ty₁ ⊔ ty₂).... | [
{
"name": "type_of_contains_is_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1660,
"n_subproofs": 2,
"n_tactics": 33,
"cyclomatic": 8,
"n_automation": 5,
"n_rewrites": 6,
"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... | @@ -26,6 +26,31 @@
open Cedar.Spec
open Cedar.Validation
+theorem type_of_contains_inversion {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}
+ (h₁ : typeOf (Expr.binaryApp .contains x₁ x₂) c env = Except.ok (ty, c')) :
+ c' = ∅ ∧
+ ty.typeOf = .bool .anyBool ∧
+ ∃ ty₁ ty₂,
+ (ty₁ ⊔ 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_d63325884d6d_0 | afa497f8ae25aaff | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Input.lean | Input | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "consistent_checks_ensure_refinement",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n simp only [isValidAndConsistent] at h\n split at h <;> try cases h\n rcases do_eq_ok₂ h w... | [
{
"name": "decide_eq_implies_eq",
"text": "theorem decide_eq_implies_eq {α} [DecidableEq α] {y : α} :\n ∀ x, decide (x = y) → x = y := by\n simp only [decide_eq_true_eq, imp_self, implies_true]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "consistent_checks_ensure_refinement",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 74,
"n_chars": 2852,
"n_subproofs": 1,
"n_tactics": 72,
"cyclomatic": 23,
"n_automation": 22,
"n_rewrites": 2,
"n_structural": 18,
"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... | @@ -30,6 +30,10 @@
open Cedar.Validation
open Cedar.Thm
+theorem decide_eq_implies_eq {α} [DecidableEq α] {y : α} :
+ ∀ x, decide (x = y) → x = y := by
+ simp only [decide_eq_true_eq, imp_self, implies_true]
+
inductive PartialIsValid {α} : (α → Prop) → Option α -> Prop
| some (p : α → Prop) (x : α)
... | {
"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_e1518ae499e8_0 | 81a8686f99106545 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable/GetAttr.lean | GetAttr | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "checked_eval_entity_reachable_get_attr",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"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 have ⟨ hc',... | [
{
"name": "reachable_attr_step",
"text": "theorem reachable_attr_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {path : List Attr}\n (hr : ReachableIn entities start euid n)\n (he₁: entities.find? euid = some ed)\n (he₂ : Value.EuidViaPath (.record... | [
{
"name": "checked_eval_entity_reachable_get_attr",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 64,
"n_chars": 2617,
"n_subproofs": 10,
"n_tactics": 58,
"cyclomatic": 14,
"n_automation": 9,
"n_rewrites": 14,
"n_structural": 8,
"automation_o... | 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... | @@ -30,6 +30,30 @@
open Cedar.Spec
open Cedar.Validation
+theorem reachable_attr_step {n : Nat} {euid euid' : EntityUID} {start : Set EntityUID} {entities : Entities} {ed : EntityData} {path : List Attr}
+ (hr : ReachableIn entities start euid n)
+ (he₁: entities.find? euid = some ed)
+ (he₂ : Value.EuidViaPath ... | {
"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_d2806220fb0f_0 | 545e10a43172b967 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels/Record.lean | Record | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "level_based_slicing_is_sound_record",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨ hc₁, atxs, htx, hatxs ⟩ := type_of_record_inversion ht\n subst htx\n cases hl\n rename_i h... | [
{
"name": "level_based_slicing_is_sound_record_attrs",
"text": "theorem level_based_slicing_is_sound_record_attrs {rxs : List (Attr × Expr)} {n : Nat} {c : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities}\n (hc : CapabilitiesInvariant c request entities)\n (hr : InstanceOfWellFormed... | [
{
"name": "level_based_slicing_is_sound_record",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 781,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 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... | @@ -33,6 +33,37 @@
open Cedar.Spec
open Cedar.Validation
+theorem level_based_slicing_is_sound_record_attrs {rxs : List (Attr × Expr)} {n : Nat} {c : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities}
+ (hc : CapabilitiesInvariant c request entities)
+ (hr : InstanceOfWellFormedEnvironment re... | {
"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_e1e972644e02_0 | c7b83057fa266656 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/ContainsAnyAll.lean | ContainsAnyAll | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "type_of_containsA_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hc, hty, ty₁, ty₂, _, ht₁, ht₂⟩ := type_of_containsA_inversion h₀ h₃\n subst hc ; rw [hty]\n apply And.... | [
{
"name": "type_of_containsA_inversion",
"text": "theorem type_of_containsA_inversion {op₂ : BinaryOp} {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}\n (h₁ : op₂ = .containsAll ∨ op₂ = .containsAny)\n (h₂ : typeOf (Expr.binaryApp op₂ x₁ x₂) c env = Except.ok (ty, c')) :\n c' = ∅ ∧\... | [
{
"name": "type_of_containsA_is_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 1893,
"n_subproofs": 3,
"n_tactics": 39,
"cyclomatic": 9,
"n_automation": 5,
"n_rewrites": 8,
"n_structural": 8,
"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,35 @@
open Cedar.Spec
open Cedar.Validation
+theorem type_of_containsA_inversion {op₂ : BinaryOp} {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}
+ (h₁ : op₂ = .containsAll ∨ op₂ = .containsAny)
+ (h₂ : typeOf (Expr.binaryApp op₂ x₁ x₂) c env = Except.ok (ty, c')) :
+ 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_09cca21d7a5c_0 | ff99a1fdc83b448b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels/GetAttr.lean | GetAttr | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "level_based_slicing_is_sound_get_attr",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨ h₇, ty₁, _, ht, h₅, h₆ ⟩ := type_of_getAttr_inversion ht\n rw [h₅] at hl\n cases h₆\n case... | [
{
"name": "level_based_slicing_is_sound_get_attr_record",
"text": "theorem level_based_slicing_is_sound_get_attr_record {e : Expr} {tx : TypedExpr} {ty : CedarType} {a : Attr} {n : Nat} {c₀: Capabilities} {env : TypeEnv} {request : Request} {entities : Entities}\n (hc : CapabilitiesInvariant c₀ request ent... | [
{
"name": "level_based_slicing_is_sound_get_attr",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 904,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"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... | @@ -62,6 +62,31 @@
have hfeq := checked_eval_entity_find_entities_eq_find_slice hc hr ht hl₁ he
simp [hfeq, getAttr, attrsOf, Entities.attrs, Map.findOrErr]
+theorem level_based_slicing_is_sound_get_attr_record {e : Expr} {tx : TypedExpr} {ty : CedarType} {a : Attr} {n : Nat} {c₀: Capabilities} {env : TypeEnv} ... | {
"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_59b48f8209b5_0 | 6f9953695b93f506 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_true",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_true]",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "pe_ite_simplify_true",
"text": "theorem pe_ite_simplify_true {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_ite_true",
"fan_in": 9,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 181,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"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... | @@ -164,6 +164,10 @@
/-! ### PE for Factory.ite -/
+theorem pe_ite_simplify_true {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
+:= by simp [ite.simplify]
+
theorem pe_ite_simplify_false {t₁ t₂ : Term} :
Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
:= by simp [ite.simplify]
... | {
"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_59b48f8209b5_1 | 551b7cf574e9c079 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ite_false",
"fan_in": 9,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 184,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_2 | 48a4006e7eac7d74 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ite_wfl",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 618,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_3 | e317ffa3066a4c6b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_eq_same",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Factory.eq] ; split <;> simp [pe_eq_simplify_same]",
"n_chars": 65,
"n_subproofs": 0,
"n_tactics": 3,
"c... | [
{
"name": "pe_eq_simplify_same",
"text": "public theorem pe_eq_simplify_same {t : Term} :\n Factory.eq.simplify t t = .prim (.bool true)\n:= by simp [Factory.eq.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_eq_same",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
... | 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... | @@ -186,10 +186,14 @@
simp only [Factory.ite]
split <;> simp [pe_ite_simplify_false]
+public theorem pe_eq_simplify_same {t : Term} :
+ Factory.eq.simplify t t = .prim (.bool true)
+:= by simp [Factory.eq.simplify]
+
@[simp]
public theorem pe_eq_same {t : Term} :
Factory.eq t t = .prim (.bool true)
-:= so... | {
"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_59b48f8209b5_4 | 3f96deb01a7135e5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_eq_prim",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [@pe_eq_lit (.prim p₁) (.prim p₂) isLiteral_prim isLiteral_prim, BEq.beq,\n Term.prim.injEq]",
"n_chars": 114,
... | [
{
"name": "pe_eq_lit",
"text": "public theorem pe_eq_lit {t₁ t₂ : Term} :\n t₁.isLiteral → t₂.isLiteral →\n Term.isLiteral (Factory.eq t₁ t₂) ∧\n Factory.eq t₁ t₂ = (t₁ == t₂)\n:= by\n fun_cases Factory.eq t₁ t₂\n · intro h₁ h₂\n have h₃ := pe_eq_simplify_lit (isLiteral_some.mp h₁) (isLiteral_some.m... | [
{
"name": "pe_eq_prim",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 287,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 4
... | 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... | @@ -214,9 +214,27 @@
:= by
fun_cases Factory.eq.simplify t₁ t₂ <;> simp_all
+public theorem pe_eq_lit {t₁ t₂ : Term} :
+ t₁.isLiteral → t₂.isLiteral →
+ Term.isLiteral (Factory.eq t₁ t₂) ∧
+ Factory.eq t₁ t₂ = (t₁ == t₂)
+:= by
+ fun_cases Factory.eq t₁ t₂
+ · intro h₁ h₂
+ have h₃ := pe_eq_simplify_lit (... | {
"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_59b48f8209b5_5 | 04910b5fe9e69ead | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_true",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_true]",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "pe_ite_simplify_true",
"text": "theorem pe_ite_simplify_true {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_ifSome_none",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 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... | @@ -164,6 +164,10 @@
/-! ### PE for Factory.ite -/
+theorem pe_ite_simplify_true {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
+:= by simp [ite.simplify]
+
theorem pe_ite_simplify_false {t₁ t₂ : Term} :
Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
:= by simp [ite.simplify]
... | {
"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_59b48f8209b5_6 | 05016986b9eaff1d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ifSome_some",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 199,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_7 | 79d4e504e578ff15 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ifSome_get_eq_get'",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 20,
"n_chars": 725,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_8 | c0d5bc3a8cbf1898 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ifSome_get_eq_get'₂",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 30,
"n_chars": 1588,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 7,
"n_structural": 2,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_9 | b96e42f9d8f12328 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ifSome_ok_get_eq_get'",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 22,
"n_chars": 976,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 1,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_10 | 5c3d718ec3caaf99 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_ifSome_ok_get_eq_get'₂",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 36,
"n_chars": 1745,
"n_subproofs": 2,
"n_tactics": 29,
"cyclomatic": 4,
"n_automation": 8,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_11 | 1823664111a55301 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_anyTrue_true",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hin ht\n unfold anyTrue\n generalize hf : Term.prim (TermPrim.bool false) = init\n clear hf\n induction ts gener... | [
{
"name": "pe_foldl_or_right_true",
"text": "private theorem pe_foldl_or_right_true {ts : List Term} {f : Term → Term} :\n ts.foldl (λ acc t => Factory.or (f t) acc) true = true\n:= by\n induction ts\n case nil =>\n simp only [List.foldl_nil]\n case cons hd tl ih =>\n simp only [List.foldl_cons, p... | [
{
"name": "pe_anyTrue_true",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 581,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 2,
"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... | @@ -246,10 +246,35 @@
/-! ### PE for Factory.ifSome -/
+private theorem pe_foldl_or_right_true {ts : List Term} {f : Term → Term} :
+ ts.foldl (λ acc t => Factory.or (f t) acc) true = true
+:= by
+ induction ts
+ case nil =>
+ simp only [List.foldl_nil]
+ case cons hd tl ih =>
+ simp only [List.foldl_con... | {
"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_59b48f8209b5_12 | f039da6612f0eab8 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_anyNone_true",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold anyNone\n intro hin\n exact pe_anyTrue_true hin pe_isNone_none",
"n_chars": 75,
"n_subproofs": 0,
"n_t... | [
{
"name": "pe_anyTrue_true",
"text": "public theorem pe_anyTrue_true {f : Term → Term} {ts : List Term} {t : Term} :\n t ∈ ts → f t = true →\n anyTrue f ts = true\n:= by\n intro hin ht\n unfold anyTrue\n generalize hf : Term.prim (TermPrim.bool false) = init\n clear hf\n induction ts generalizing ini... | [
{
"name": "pe_anyNone_true",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 191,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 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... | @@ -255,10 +255,34 @@
case cons hd tl ih =>
simp only [List.foldl_cons, pe_or_true_right, ih]
+public theorem pe_anyTrue_true {f : Term → Term} {ts : List Term} {t : Term} :
+ t ∈ ts → f t = true →
+ anyTrue f ts = true
+:= by
+ intro hin ht
+ unfold anyTrue
+ generalize hf : Term.prim (TermPrim.bool fal... | {
"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_59b48f8209b5_13 | 81a6a546fe34638b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_anyNone_false",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply pe_anyTrue_false\n intro t hin\n simp only [List.mem_map] at hin\n replace ⟨_, _, hin⟩ := hin\n simp only [← hin... | [
{
"name": "pe_anyTrue_false",
"text": "public theorem pe_anyTrue_false {f : Term → Term} {ts : List Term} :\n (∀ t ∈ ts, f t = false) →\n anyTrue f ts = false\n:= by\n intro hf\n unfold anyTrue\n generalize hf : Term.prim (TermPrim.bool false) = init\n clear hf\n induction ts generalizing init\n cas... | [
{
"name": "pe_anyNone_false",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 239,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"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... | @@ -246,9 +246,35 @@
/-! ### PE for Factory.ifSome -/
+public theorem pe_anyTrue_false {f : Term → Term} {ts : List Term} :
+ (∀ t ∈ ts, f t = false) →
+ anyTrue f ts = false
+:= by
+ intro hf
+ unfold anyTrue
+ generalize hf : Term.prim (TermPrim.bool false) = init
+ clear hf
+ induction ts generalizing in... | {
"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_59b48f8209b5_14 | 4370cb1e740b616b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_anyNone_true",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold anyNone\n intro hin\n exact pe_anyTrue_true hin pe_isNone_none",
"n_chars": 75,
"n_subproofs": 0,
"n_t... | [
{
"name": "pe_anyTrue_true",
"text": "public theorem pe_anyTrue_true {f : Term → Term} {ts : List Term} {t : Term} :\n t ∈ ts → f t = true →\n anyTrue f ts = true\n:= by\n intro hin ht\n unfold anyTrue\n generalize hf : Term.prim (TermPrim.bool false) = init\n clear hf\n induction ts generalizing ini... | [
{
"name": "pe_ifAllSome_none",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 9,
"n_chars": 271,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 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... | @@ -255,10 +255,34 @@
case cons hd tl ih =>
simp only [List.foldl_cons, pe_or_true_right, ih]
+public theorem pe_anyTrue_true {f : Term → Term} {ts : List Term} {t : Term} :
+ t ∈ ts → f t = true →
+ anyTrue f ts = true
+:= by
+ intro hin ht
+ unfold anyTrue
+ generalize hf : Term.prim (TermPrim.bool fal... | {
"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_59b48f8209b5_15 | b4944fdeaca77e4c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_anyNone_false",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply pe_anyTrue_false\n intro t hin\n simp only [List.mem_map] at hin\n replace ⟨_, _, hin⟩ := hin\n simp only [← hin... | [
{
"name": "pe_anyTrue_false",
"text": "public theorem pe_anyTrue_false {f : Term → Term} {ts : List Term} :\n (∀ t ∈ ts, f t = false) →\n anyTrue f ts = false\n:= by\n intro hf\n unfold anyTrue\n generalize hf : Term.prim (TermPrim.bool false) = init\n clear hf\n induction ts generalizing init\n cas... | [
{
"name": "pe_ifAllSome_some",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 278,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 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... | @@ -246,9 +246,35 @@
/-! ### PE for Factory.ifSome -/
+public theorem pe_anyTrue_false {f : Term → Term} {ts : List Term} :
+ (∀ t ∈ ts, f t = false) →
+ anyTrue f ts = false
+:= by
+ intro hf
+ unfold anyTrue
+ generalize hf : Term.prim (TermPrim.bool false) = init
+ clear hf
+ induction ts generalizing in... | {
"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_59b48f8209b5_16 | aa64531da4a85847 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvaddChecked_wfl",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 17,
"n_chars": 770,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_17 | 477e8234d2bd8c28 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvsubChecked_wfl",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 17,
"n_chars": 770,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_18 | 5802c362ba27233c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvmulChecked_wfl",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 17,
"n_chars": 770,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_19 | 087ee8ba4cc501e6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_true",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_true]",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "pe_ite_simplify_true",
"text": "theorem pe_ite_simplify_true {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_bvaddChecked_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -164,6 +164,10 @@
/-! ### PE for Factory.ite -/
+theorem pe_ite_simplify_true {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
+:= by simp [ite.simplify]
+
theorem pe_ite_simplify_false {t₁ t₂ : Term} :
Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
:= by simp [ite.simplify]
... | {
"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_59b48f8209b5_20 | bcc6bb3dc0ba3ab2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvaddChecked_no_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 459,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_21 | 620fefe3aa024e4d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_true",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_true]",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "pe_ite_simplify_true",
"text": "theorem pe_ite_simplify_true {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_bvsubChecked_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -164,6 +164,10 @@
/-! ### PE for Factory.ite -/
+theorem pe_ite_simplify_true {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
+:= by simp [ite.simplify]
+
theorem pe_ite_simplify_false {t₁ t₂ : Term} :
Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
:= by simp [ite.simplify]
... | {
"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_59b48f8209b5_22 | bc4ee9ab31c5d26d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvsubChecked_no_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 459,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_23 | 1434958afbbb46d1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_true",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_true]",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "pe_ite_simplify_true",
"text": "theorem pe_ite_simplify_true {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "pe_bvmulChecked_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -164,6 +164,10 @@
/-! ### PE for Factory.ite -/
+theorem pe_ite_simplify_true {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
+:= by simp [ite.simplify]
+
theorem pe_ite_simplify_false {t₁ t₂ : Term} :
Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
:= by simp [ite.simplify]
... | {
"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_59b48f8209b5_24 | 8ddc6cb8021f4bd5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_ite_false",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Factory.ite]\n split <;> simp [pe_ite_simplify_false]",
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "pe_ite_simplify_false",
"text": "theorem pe_ite_simplify_false {t₁ t₂ : Term} :\n Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂\n:= by simp [ite.simplify]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 140,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "pe_bvmulChecked_no_overflow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 520,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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... | @@ -168,6 +168,10 @@
Factory.ite.simplify (.prim (.bool true)) t₁ t₂ = t₁
:= by simp [ite.simplify]
+theorem pe_ite_simplify_false {t₁ t₂ : Term} :
+ Factory.ite.simplify (.prim (.bool false)) t₁ t₂ = t₂
+:= by simp [ite.simplify]
+
@[simp]
public theorem pe_ite_true {t₁ t₂ : Term} :
Factory.ite (.prim (.bo... | {
"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_59b48f8209b5_25 | 8ac07420e1860ca9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Term/PE.lean | PE | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "pe_set_intersects",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n simp only [set.intersects, set.isEmpty, pe_set_inter h₁ h₂, pe_not_lit, Term.prim.injEq,\n TermPrim.boo... | [
{
"name": "pe_set_inter",
"text": "public theorem pe_set_inter {s₁ s₂ : Set Term} {ty : TermType} :\n (Term.set s₁ ty).isLiteral →\n (Term.set s₂ ty).isLiteral →\n (Factory.set.inter (Term.set s₁ ty) (Term.set s₂ ty)) = Term.set (Set.intersect s₁ s₂) ty\n:= by\n intro h₁ h₂\n simp only [set.inter]\n s... | [
{
"name": "pe_set_intersects",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 530,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 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... | @@ -407,11 +407,42 @@
cases s ; rename_i ts
cases ts <;> simp [set.isEmpty]
+public theorem pe_set_inter {s₁ s₂ : Set Term} {ty : TermType} :
+ (Term.set s₁ ty).isLiteral →
+ (Term.set s₂ ty).isLiteral →
+ (Factory.set.inter (Term.set s₁ ty) (Term.set s₂ ty)) = Term.set (Set.intersect s₁ s₂) ty
+:= by
+ int... | {
"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_7db2092826c4_0 | 74343d57b07e13c3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "is_authorized_congr_evaluate",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [isAuthorized]\n rw [\n satisfied_policies_congr_evaluate .permit heq,\n satisfied_policies_c... | [
{
"name": "satisfied_policies_congr_evaluate",
"text": "theorem satisfied_policies_congr_evaluate {ps : Policies} {r₁ r₂ : Request} {es₁ es₂ : Entities} (effect : Effect)\n (heq : ∀ p ∈ ps, evaluate p.toExpr r₁ es₁ = evaluate p.toExpr r₂ es₂) :\n satisfiedPolicies effect ps r₁ es₁ = satisfiedPolicies effe... | [
{
"name": "is_authorized_congr_evaluate",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"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... | @@ -27,6 +27,17 @@
open Cedar.Spec Cedar.Data
+theorem satisfied_policies_congr_evaluate {ps : Policies} {r₁ r₂ : Request} {es₁ es₂ : Entities} (effect : Effect)
+ (heq : ∀ p ∈ ps, evaluate p.toExpr r₁ es₁ = evaluate p.toExpr r₂ es₂) :
+ satisfiedPolicies effect ps r₁ es₁ = satisfiedPolicies effect ps r₂ es₂
+:=... | {
"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_7db2092826c4_1 | 778d809fa01e1977 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "satisfied_implies_principal_scope",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n simp [satisfied, Policy.toExpr] at h₁\n replace h₁ := and_true_implies_left_true h₁\n ex... | [
{
"name": "principal_eval_ok_means_principal_in_uid",
"text": "theorem principal_eval_ok_means_principal_in_uid {policy : Policy} {request : Request} {entities : Entities} {uid: EntityUID} :\n evaluate policy.principalScope.toExpr request entities = .ok true →\n policy.principalScope.scope.bound = .some u... | [
{
"name": "satisfied_implies_principal_scope",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 443,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 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... | @@ -33,11 +33,38 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+theorem principal_eval_ok_means_principal_in_uid {policy : Policy} {request : Request} {entities : 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_7db2092826c4_2 | 6dd18512b30d9fc6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "satisfied_implies_resource_scope",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n simp [satisfied, Policy.toExpr] at h₁\n replace h₁ :=\n and_true_implies_left_true\n ... | [
{
"name": "resource_eval_ok_means_resource_in_uid",
"text": "theorem resource_eval_ok_means_resource_in_uid {policy : Policy} {request : Request} {entities : Entities} {uid : EntityUID} :\n evaluate policy.resourceScope.toExpr request entities = .ok true →\n policy.resourceScope.scope.bound = .some uid →\... | [
{
"name": "satisfied_implies_resource_scope",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 516,
"n_subproofs": 0,
"n_tactics": 8,
"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... | @@ -33,11 +33,41 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+theorem resource_eval_ok_means_resource_in_uid {policy : Policy} {request : Request} {entities : Entities}... | {
"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_7db2092826c4_3 | b8d66f36e4b4f2d9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "mapM_asEntityUID_of_uid",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction uids\n case nil =>\n rw [List.map_nil, List.mapM_nil]\n simp [pure, Except.pure]\n case cons x xs... | [
{
"name": "asEntityUID_of_uid",
"text": "theorem asEntityUID_of_uid (uid : EntityUID) :\n Value.asEntityUID (.prim (.entityUID uid)) = .ok uid\n:= by\n unfold Value.asEntityUID\n split <;> simp\n case h_1 uid' h => simp at h; simp [h]\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 194,
"n_s... | [
{
"name": "mapM_asEntityUID_of_uid",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"ma... | 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... | @@ -33,9 +33,23 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+theorem asEntityUID_of_uid (uid : EntityUID) :
+ Value.asEntityUID (.prim (.entityUID uid)) = .ok uid
+:= ... | {
"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_7db2092826c4_4 | 7645eaf77c0ee063 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n replace ⟨bs, h₁⟩ := Except.isOk_iff_exists.mp h₁\n replace h₁ := List.m... | [
{
"name": "Except.isOk_iff_exists",
"text": "/--\n Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`\n-/\ntheorem Except.isOk_iff_exists {x : Except ε α} :\n Except.isOk x ↔ ∃ a, x = .ok a\n:= by\n cases x <;> simp [Except.isOk, Except.toBool]\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 832,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 8,
"a... | 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... | @@ -33,10 +33,34 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+/--
+ Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`
+-/
+theorem Except.is... | {
"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_7db2092826c4_5 | 11e938043dc432da | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "mapM_asEntityUID_on_set_uids_produces_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set\n unfold Except.isOk Except.toBool\n ... | [
{
"name": "mapM_asEntityUID_of_uid",
"text": "theorem mapM_asEntityUID_of_uid (uids : List EntityUID) :\n List.mapM Value.asEntityUID (uids.map (Value.prim ∘ Prim.entityUID)) = .ok uids\n:= by\n induction uids\n case nil =>\n rw [List.map_nil, List.mapM_nil]\n simp [pure, Except.pure]\n case cons ... | [
{
"name": "mapM_asEntityUID_on_set_uids_produces_ok",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 412,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 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... | @@ -40,6 +40,17 @@
split <;> simp
case h_1 uid' h => simp at h; simp [h]
+theorem mapM_asEntityUID_of_uid (uids : List EntityUID) :
+ List.mapM Value.asEntityUID (uids.map (Value.prim ∘ Prim.entityUID)) = .ok uids
+:= by
+ induction uids
+ case nil =>
+ rw [List.map_nil, List.mapM_nil]
+ simp [pure, Ex... | {
"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_7db2092826c4_6 | 93402540d5e38f90 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n replace ⟨bs, h₁⟩ := Except.isOk_iff_exists.mp h₁\n replace h₁ := List.m... | [
{
"name": "Except.isOk_iff_exists",
"text": "/--\n Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`\n-/\ntheorem Except.isOk_iff_exists {x : Except ε α} :\n Except.isOk x ↔ ∃ a, x = .ok a\n:= by\n cases x <;> simp [Except.isOk, Except.toBool]\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "mapOrErr_value_asEntityUID_on_uids_produces_set",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 28,
"n_chars": 1054,
"n_subproofs": 2,
"n_tactics": 25,
"cyclomatic": 7,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 6,
"automa... | 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... | @@ -51,10 +51,34 @@
rw [List.map_cons, List.mapM_cons]
simp [pure, Except.pure, asEntityUID_of_uid, ih]
+/--
+ Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`
+-/
+theorem Except.isOk_iff_exists {x : Except ε α} :
+ Except.isOk x ↔ ∃ a, x = .ok a
+:= by
+ cases x <;> simp [Ex... | {
"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_7db2092826c4_7 | 35aa2c6f7c342e95 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n replace ⟨bs, h₁⟩ := Except.isOk_iff_exists.mp h₁\n replace h₁ := List.m... | [
{
"name": "Except.isOk_iff_exists",
"text": "/--\n Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`\n-/\ntheorem Except.isOk_iff_exists {x : Except ε α} :\n Except.isOk x ↔ ∃ a, x = .ok a\n:= by\n cases x <;> simp [Except.isOk, Except.toBool]\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "action_in_set_of_euids_produces_boolean",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 23,
"n_chars": 991,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 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... | @@ -59,10 +59,34 @@
rw [List.map_cons, List.mapM_cons]
simp [pure, Except.pure, asEntityUID_of_uid, ih]
+/--
+ Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`
+-/
+theorem Except.isOk_iff_exists {x : Except ε α} :
+ Except.isOk x ↔ ∃ a, x = .ok a
+:= by
+ cases x <;> simp [Ex... | {
"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_7db2092826c4_8 | cf210c898a345022 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "if_mapM_doesn't_fail_on_list_then_doesn't_fail_on_set",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n replace ⟨bs, h₁⟩ := Except.isOk_iff_exists.mp h₁\n replace h₁ := List.m... | [
{
"name": "Except.isOk_iff_exists",
"text": "/--\n Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`\n-/\ntheorem Except.isOk_iff_exists {x : Except ε α} :\n Except.isOk x ↔ ∃ a, x = .ok a\n:= by\n cases x <;> simp [Except.isOk, Except.toBool]\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "action_scope_produces_boolean",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 31,
"n_chars": 1148,
"n_subproofs": 1,
"n_tactics": 28,
"cyclomatic": 11,
"n_automation": 10,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fals... | 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... | @@ -59,10 +59,34 @@
rw [List.map_cons, List.mapM_cons]
simp [pure, Except.pure, asEntityUID_of_uid, ih]
+/--
+ Batteries has `Option.isSome_iff_exists`, but not this analogue for `Except`
+-/
+theorem Except.isOk_iff_exists {x : Except ε α} :
+ Except.isOk x ↔ ∃ a, x = .ok a
+:= by
+ cases x <;> simp [Ex... | {
"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_7db2092826c4_9 | abad4d3769755fe5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "principal_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := principal_scope_produces_boolean policy request entities\n simp [producesBool, h]... | [
{
"name": "principal_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)\n-/\ntheorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.principalScope.toExpr re... | [
{
"name": "principal_scope_does_not_throw",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 316,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"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... | @@ -33,9 +33,30 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+/--
+ Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)
+-/
+theo... | {
"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_7db2092826c4_10 | 905ddb6b878bd298 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "mapOrErr_value_asEntityUID_on_uids_produces_set",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Set.mapOrErr\n split <;> simp\n case h_1 list' h =>\n -- in this case, mapping... | [
{
"name": "mapM_asEntityUID_on_set_uids_produces_ok",
"text": "theorem mapM_asEntityUID_on_set_uids_produces_ok (uids : List EntityUID) :\n Except.isOk (List.mapM\n Value.asEntityUID\n (Set.elts (Set.make (uids.map (Value.prim ∘ Prim.entityUID)))))\n:= by\n apply if_mapM_doesn't_fail_on_list_then_do... | [
{
"name": "action_scope_does_not_throw",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 8,
"n_chars": 307,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -88,10 +88,42 @@
replace ⟨b, _, h₄⟩ := h₂ a h₃
exists b
+theorem mapM_asEntityUID_on_set_uids_produces_ok (uids : List EntityUID) :
+ Except.isOk (List.mapM
+ Value.asEntityUID
+ (Set.elts (Set.make (uids.map (Value.prim ∘ Prim.entityUID)))))
+:= by
+ apply if_mapM_doesn't_fail_on_list_then_d... | {
"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_7db2092826c4_11 | 560013c4652d8076 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "resource_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := resource_scope_produces_boolean policy request entities\n simp [producesBool, h] a... | [
{
"name": "resource_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the resourceScope of any policy produces a boolean (and does not error)\n-/\ntheorem resource_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.resourceScope.toExpr reques... | [
{
"name": "resource_scope_does_not_throw",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 313,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"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... | @@ -33,9 +33,30 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+/--
+ Lemma: evaluating the resourceScope of any policy produces a boolean (and does not error)
+-/
+theor... | {
"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_7db2092826c4_12 | 829f39f681604916 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "principal_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := principal_scope_produces_boolean policy request entities\n simp [producesBool, h]... | [
{
"name": "principal_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)\n-/\ntheorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.principalScope.toExpr re... | [
{
"name": "action_scope_false_then_policy_false",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 350,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": f... | 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... | @@ -33,10 +33,32 @@
def alternateErrorPolicies (policies : Policies) (request : Request) (entities : Entities) : Set PolicyID :=
Set.make (List.map Policy.id (policies.filter (hasError · request entities)))
+/--
+ Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)
+-/
+the... | {
"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_7db2092826c4_13 | 4acb40da288ac531 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "action_in_set_of_euids_produces_boolean",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold producesBool\n split <;> simp only [Bool.false_eq_true]\n case h_2 _ h₁ =>\n simp only... | [
{
"name": "mapOrErr_value_asEntityUID_on_uids_produces_set",
"text": "theorem mapOrErr_value_asEntityUID_on_uids_produces_set (list : List EntityUID) (err : Error) :\n Set.mapOrErr Value.asEntityUID (Set.make (list.map (Value.prim ∘ Prim.entityUID))) err =\n .ok (Set.make list)\n:= by\n unfold Set.mapOrE... | [
{
"name": "resource_scope_false_then_policy_false",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 12,
"n_chars": 464,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only"... | 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... | @@ -98,6 +98,33 @@
split <;> simp only [Bool.false_eq_true]
case h_2 e h => simp only [mapM_asEntityUID_of_uid, reduceCtorEq] at h
+theorem mapOrErr_value_asEntityUID_on_uids_produces_set (list : List EntityUID) (err : Error) :
+ Set.mapOrErr Value.asEntityUID (Set.make (list.map (Value.prim ∘ Prim.entityUID))... | {
"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_7db2092826c4_14 | ba37158ce8572750 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "principal_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := principal_scope_produces_boolean policy request entities\n simp [producesBool, h]... | [
{
"name": "principal_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)\n-/\ntheorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.principalScope.toExpr re... | [
{
"name": "error_implies_scope_satisfied",
"fan_in": 2,
"n_deps_direct": 7,
"n_deps_transitive": 15,
"n_lines": 70,
"n_chars": 3479,
"n_subproofs": 5,
"n_tactics": 55,
"cyclomatic": 11,
"n_automation": 9,
"n_rewrites": 3,
"n_structural": 9,
"automation_only": fals... | 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... | @@ -148,6 +148,24 @@
simp_all
/--
+ Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)
+-/
+theorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :
+ producesBool policy.principalScope.toExpr request entities
+:= by
+ 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_7db2092826c4_15 | 0f39e1137e6d8533 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "principal_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := principal_scope_produces_boolean policy request entities\n simp [producesBool, h]... | [
{
"name": "principal_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)\n-/\ntheorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.principalScope.toExpr re... | [
{
"name": "error_implies_principal_scope_in",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 17,
"n_lines": 14,
"n_chars": 577,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 17 | /-
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... | @@ -171,6 +171,24 @@
simp_all
/--
+ Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)
+-/
+theorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :
+ producesBool policy.principalScope.toExpr request entities
+:= by
+ 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_7db2092826c4_16 | 359e893d4584b755 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Authorizer.lean | Authorizer | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 4 | [
{
"theorem_name": "principal_scope_does_not_throw",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n have h₁ := principal_scope_produces_boolean policy request entities\n simp [producesBool, h]... | [
{
"name": "principal_scope_produces_boolean",
"text": "/--\n Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)\n-/\ntheorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :\n producesBool policy.principalScope.toExpr re... | [
{
"name": "error_implies_resource_scope_in",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 17,
"n_lines": 15,
"n_chars": 573,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false... | 17 | /-
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... | @@ -171,6 +171,24 @@
simp_all
/--
+ Lemma: evaluating the principalScope of any policy produces a boolean (and does not error)
+-/
+theorem principal_scope_produces_boolean (policy : Policy) (request : Request) (entities : Entities) :
+ producesBool policy.principalScope.toExpr request entities
+:= by
+ 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_f76cc4160777_0 | 707ce8c78d20353f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/Same.lean | Same | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "same_bool_not_true_implies_false",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n rw [same_bool_def] at h₁\n rw [h₁] at h₂\n cases b\n case false => rfl\n case true => s... | [
{
"name": "same_bool_def",
"text": "theorem same_bool_def {b : Bool} {t : Term} :\n b ∼ t ↔ t = Term.bool b\n:= by simp only [Same.same]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "same_bool_not_true_implies_false",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"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... | @@ -29,11 +29,21 @@
instance : Same Bool Term where
same b t := t = Term.bool b
+theorem same_bool_def {b : Bool} {t : Term} :
+ b ∼ t ↔ t = Term.bool b
+:= by simp only [Same.same]
+
theorem same_bool_not_true_implies_false {b : Bool} {t : Term} :
b ∼ t →
not t = .bool true →
b = false
-:= sorry
+:= b... | {
"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_f76cc4160777_1 | 5d2bf4e9b9c9e174 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/Same.lean | Same | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "same_bool_not_true_implies_false",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n rw [same_bool_def] at h₁\n rw [h₁] at h₂\n cases b\n case false => rfl\n case true => s... | [
{
"name": "same_bool_def",
"text": "theorem same_bool_def {b : Bool} {t : Term} :\n b ∼ t ↔ t = Term.bool b\n:= by simp only [Same.same]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "same_bool_not_not_true_implies_true",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fa... | 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... | @@ -29,11 +29,21 @@
instance : Same Bool Term where
same b t := t = Term.bool b
+theorem same_bool_def {b : Bool} {t : Term} :
+ b ∼ t ↔ t = Term.bool b
+:= by simp only [Same.same]
+
theorem same_bool_not_not_true_implies_true {b : Bool} {t : Term} :
b ∼ t →
¬ not t = .bool true →
b = true
-:= sorry
+... | {
"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_b6923771ceb1_0 | 6214ce2cbb10d9b9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Data/LT.lean | LT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "StrictLT.not_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n by_contra h₂\n subst h₂\n have h₃ := StrictLT.irreflexive x\n contradiction",
"n_chars": 100,
"n_sub... | [
{
"name": "StrictLT.irreflexive",
"text": "public theorem StrictLT.irreflexive [LT α] [StrictLT α] (x : α) :\n ¬ x < x\n:= by\n by_contra h₁\n have h₂ := StrictLT.asymmetric x x h₁\n contradiction\n\n",
"fan_in": 2,
"n_lines": 8,
"n_chars": 164,
"n_subproofs": 1,
"n_tactics": 4,
... | [
{
"name": "StrictLT.not_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 191,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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... | @@ -32,6 +32,13 @@
transitive : ∀ (a b c : α), a < b → b < c → a < c
connected : ∀ (a b : α), a ≠ b → (a < b ∨ b < a)
+public theorem StrictLT.irreflexive [LT α] [StrictLT α] (x : α) :
+ ¬ x < x
+:= by
+ by_contra h₁
+ have h₂ := StrictLT.asymmetric x x h₁
+ contradiction
+
public theorem StrictLT.if_not_... | {
"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_b6923771ceb1_1 | 7b2bfea827db4b55 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Data/LT.lean | LT | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "StrictLT.not_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n by_contra h₂\n subst h₂\n have h₃ := StrictLT.irreflexive x\n contradiction",
"n_chars": 100,
"n_sub... | [
{
"name": "StrictLT.irreflexive",
"text": "public theorem StrictLT.irreflexive [LT α] [StrictLT α] (x : α) :\n ¬ x < x\n:= by\n by_contra h₁\n have h₂ := StrictLT.asymmetric x x h₁\n contradiction\n\n",
"fan_in": 2,
"n_lines": 8,
"n_chars": 164,
"n_subproofs": 1,
"n_tactics": 4,
... | [
{
"name": "List.slt_irrefl",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 313,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 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... | @@ -32,6 +32,13 @@
transitive : ∀ (a b c : α), a < b → b < c → a < c
connected : ∀ (a b : α), a ≠ b → (a < b ∨ b < a)
+public theorem StrictLT.irreflexive [LT α] [StrictLT α] (x : α) :
+ ¬ x < x
+:= by
+ by_contra h₁
+ have h₂ := StrictLT.asymmetric x x h₁
+ contradiction
+
public theorem StrictLT.if_not_... | {
"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_b6923771ceb1_2 | 5ad7c69ef7dfe043 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Data/LT.lean | LT | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "List.slt_irrefl",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs\n case nil => by_contra; contradiction\n case cons _ _ hd tl ih =>\n by_contra h₁\n replace h₁ := List... | [
{
"name": "List.lt_cons_cases",
"text": "theorem List.lt_cons_cases [LT α] [DecidableLT α] {x y : α} {xs ys : List α} :\n x :: xs < y :: ys →\n (x < y ∨ (¬ x < y ∧ ¬ y < x ∧ xs < ys))\n:= by\n intro h₁\n cases h₁ <;> simp_all [lex_lt, Decidable.em]\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars":... | [
{
"name": "List.slt_asymm",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 424,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 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... | @@ -53,9 +53,23 @@
open Cedar.Data
+theorem List.lt_cons_cases [LT α] [DecidableLT α] {x y : α} {xs ys : List α} :
+ x :: xs < y :: ys →
+ (x < y ∨ (¬ x < y ∧ ¬ y < x ∧ xs < ys))
+:= by
+ intro h₁
+ cases h₁ <;> simp_all [lex_lt, Decidable.em]
+
public theorem List.slt_irrefl [LT α] [StrictLT α] [DecidableLT ... | {
"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_b6923771ceb1_3 | 7a9e63d6dc19db23 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Data/LT.lean | LT | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "List.lt_conn",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n by_contra h₂\n simp only [not_or] at h₂\n replace ⟨h₂, h₃⟩ := h₂\n cases xs <;> cases ys\n case nil.nil => co... | [
{
"name": "StrictLT.if_not_lt_eq_then_gt",
"text": "public theorem StrictLT.if_not_lt_eq_then_gt [LT α] [StrictLT α] (x y : α) :\n ¬ x < y → ¬ x = y → x > y\n:= by\n intro h₁ h₂\n by_contra h₃\n have h₄ := StrictLT.connected x y h₂\n simp [h₁, h₃] at h₄\n\n",
"fan_in": 1,
"n_lines": 9,
"n_c... | [
{
"name": "List.lt_conn",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1291,
"n_subproofs": 2,
"n_tactics": 43,
"cyclomatic": 6,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 15,
"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... | @@ -39,6 +39,14 @@
have h₂ := StrictLT.asymmetric x x h₁
contradiction
+public theorem StrictLT.if_not_lt_eq_then_gt [LT α] [StrictLT α] (x y : α) :
+ ¬ x < y → ¬ x = y → x > y
+:= by
+ intro h₁ h₂
+ by_contra h₃
+ have h₄ := StrictLT.connected x y h₂
+ simp [h₁, h₃] at h₄
+
end Cedar.Data
----- Theore... | {
"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_2137c96b1bbd_0 | e816dda28329b7fb | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/BinaryApp/Cmp.lean | Cmp | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "type_of_int_cmp_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hc, hty, ht⟩ := type_of_int_cmp_inversion h₀ h₃\n rcases ht with ⟨ht₁, ht₂⟩ | ⟨ht₁, ht₂⟩ | ⟨ht₁, ht₂⟩\n a... | [
{
"name": "type_of_int_cmp_inversion",
"text": "theorem type_of_int_cmp_inversion {op₂ : BinaryOp} {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}\n (h₁ : op₂ = .less ∨ op₂ = .lessEq)\n (h₂ : typeOf (Expr.binaryApp op₂ x₁ x₂) c env = Except.ok (ty, c')) :\n c' = ∅ ∧\n ty.typeOf = .... | [
{
"name": "type_of_int_cmp_is_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2414,
"n_subproofs": 7,
"n_tactics": 51,
"cyclomatic": 10,
"n_automation": 5,
"n_rewrites": 8,
"n_structural": 9,
"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,49 @@
open Cedar.Spec
open Cedar.Validation
+theorem type_of_int_cmp_inversion {op₂ : BinaryOp} {x₁ x₂ : Expr} {c c' : Capabilities} {env : TypeEnv} {ty : TypedExpr}
+ (h₁ : op₂ = .less ∨ op₂ = .lessEq)
+ (h₂ : typeOf (Expr.binaryApp op₂ x₁ x₂) c env = Except.ok (ty, c')) :
+ c' = ∅ ∧
+ ty.typeOf =... | {
"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_ca40c013d682_0 | bc090b519e809695 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/GetAttr.lean | GetAttr | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "type_of_getAttr_inversion",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [typeOf] at h₁\n cases h₂ : typeOf x₁ c₁ env <;> simp [h₂] at h₁\n case ok res =>\n have ⟨ty₁, c₁'⟩ :=... | [
{
"name": "getAttrInRecord_has_empty_capabilities",
"text": "theorem getAttrInRecord_has_empty_capabilities {x₁ : Expr} {a : Attr} {c₁ c₂ : Capabilities} {rty : RecordType} {ty ty₁ : CedarType} :\n getAttrInRecord ty rty x₁ a c₁ = Except.ok (ty₁, c₂) →\n c₂ = ∅\n:= by\n intro h₁\n simp [getAttrInRecord]... | [
{
"name": "type_of_getAttr_inversion",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1314,
"n_subproofs": 1,
"n_tactics": 26,
"cyclomatic": 13,
"n_automation": 12,
"n_rewrites": 0,
"n_structural": 3,
"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,17 @@
open Cedar.Spec
open Cedar.Validation
+theorem getAttrInRecord_has_empty_capabilities {x₁ : Expr} {a : Attr} {c₁ c₂ : Capabilities} {rty : RecordType} {ty ty₁ : CedarType} :
+ getAttrInRecord ty rty x₁ a c₁ = Except.ok (ty₁, c₂) →
+ c₂ = ∅
+:= by
+ intro h₁
+ simp [getAttrInRecord] at h₁
+ 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_ca40c013d682_1 | 4a79135204126049 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/GetAttr.lean | GetAttr | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "type_of_getAttr_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨h₅, tx, c₁', h₄, h₆, h₇⟩ := type_of_getAttr_inversion h₃\n subst h₅\n apply And.intro empty_guarded_capab... | [
{
"name": "type_of_getAttr_is_sound_for_records",
"text": "theorem type_of_getAttr_is_sound_for_records {x₁ : Expr} {a : Attr} {c₁ c₁' : Capabilities} {env : TypeEnv} {rty : RecordType} {request : Request} {entities : Entities} {v₁ : Value}\n (h₁ : CapabilitiesInvariant c₁ request entities)\n (h₂ : typeOf... | [
{
"name": "type_of_getAttr_is_sound",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1506,
"n_subproofs": 4,
"n_tactics": 24,
"cyclomatic": 10,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 8,
"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... | @@ -67,6 +67,69 @@
simp [TypedExpr.typeOf]
apply getAttrInRecord_has_empty_capabilities heq₃
+theorem type_of_getAttr_is_sound_for_records {x₁ : Expr} {a : Attr} {c₁ c₁' : Capabilities} {env : TypeEnv} {rty : RecordType} {request : Request} {entities : Entities} {v₁ : Value}
+ (h₁ : CapabilitiesInvaria... | {
"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_8b629277d751_0 | 97e8f3b0e708eed5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/WF.lean | WF | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "wf_env_implies_wf_action_entity_ancestor",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨_, _, _, _, _, hwf_anc, _⟩ := wf_env_implies_wf_action_entity_entry hwf hfind\n have := hwf... | [
{
"name": "wf_env_implies_wf_action_entity_entry",
"text": "theorem wf_env_implies_wf_action_entity_entry\n {env : TypeEnv} {uid : EntityUID} {entry : ActionSchemaEntry}\n (hwf : env.WellFormed)\n (hfind : env.acts.find? uid = some entry) :\n entry.WellFormed env\n:= by\n have ⟨_, hwf_acts, _⟩ := hwf\n... | [
{
"name": "wf_env_implies_wf_action_entity_ancestor",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 736,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"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... | @@ -170,6 +170,15 @@
----- Some lemmas -----
+theorem wf_env_implies_wf_action_entity_entry
+ {env : TypeEnv} {uid : EntityUID} {entry : ActionSchemaEntry}
+ (hwf : env.WellFormed)
+ (hfind : env.acts.find? uid = some entry) :
+ entry.WellFormed env
+:= by
+ have ⟨_, hwf_acts, _⟩ := hwf
+ exact hwf_acts.2.1 ... | {
"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_4aea6cc51d21_0 | 85c253896656ff59 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE.lean | TPE | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "partial_re_authorize_decision_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂ h₃\n have h₄ := partial_authorize_decision_is_sound h₁ h₂ h₃\n have h₅ := reauthorize_is_sou... | [
{
"name": "reauthorize_is_sound",
"text": "/-- Main re-authorization soundness theorem: The result of reauthorizing a\npartial authorization response with concrete request and entities is equivalent\nto directly authorizing with the concrete request and entities.\n-/\ntheorem reauthorize_is_sound\n {schema... | [
{
"name": "partial_re_authorize_decision_eq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 769,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -44,6 +44,35 @@
open Cedar.Validation
open Cedar.Thm
+/-- Main re-authorization soundness theorem: The result of reauthorizing a
+partial authorization response with concrete request and entities is equivalent
+to directly authorizing with the concrete request and entities.
+-/
+theorem reauthorize_is_sound
+ {... | {
"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_6c9a499505bd_0 | 2ea22f949b770316 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/LT.lean | LT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "ValueAttrs.lt_asym",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases vs₁ <;> cases vs₂ <;> simp [ValueAttrs.lt]\n rename_i hd₁ tl₁ hd₂ tl₂\n cases hd₁ ; cases hd₂ ; simp [ValueAttr... | [
{
"name": "Value.lt_not_eq",
"text": "theorem Value.lt_not_eq {x y : Value} :\n x < y → ¬ x = y\n:= by\n intro h₁\n false_or_by_contra ; rename_i h₂\n subst h₂\n have h₃ := Value.lt_irrefl x\n contradiction\n\n",
"fan_in": 1,
"n_lines": 10,
"n_chars": 180,
"n_subproofs": 1,
"n_tact... | [
{
"name": "Value.lt_asymm",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 21,
"n_chars": 602,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 11,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 11,
"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... | @@ -410,6 +410,15 @@
end
+theorem Value.lt_not_eq {x y : Value} :
+ x < y → ¬ x = y
+:= by
+ intro h₁
+ false_or_by_contra ; rename_i h₂
+ subst h₂
+ have h₃ := Value.lt_irrefl x
+ contradiction
+
mutual
theorem Value.lt_asymm {a b : Value} :
a < b → ¬ b < a
@@ -447,7 +456,39 @@
theorem ValueAttrs.lt... | {
"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_f1159ba74c21_0 | 18559f8d6065e3b7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "ofType_typeOf_pullback_prim",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases p with\n | bool b =>\n simp only [typeOf_bool, TermType.bool] at heq_ty\n unfold TermType.ofType ... | [
{
"name": "sym_entities_is_valid_entity_uid_implies_entity_uid_wf",
"text": "/--\nInverse of `entity_uid_wf_implies_sym_entities_is_valid_entity_uid`\n-/\nprivate theorem sym_entities_is_valid_entity_uid_implies_entity_uid_wf\n {Γ : TypeEnv} {uid : EntityUID}\n (hwf : Γ.WellFormed)\n (huid : (SymEnv.ofEn... | [
{
"name": "ofType_typeOf_pullback_prim",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 70,
"n_chars": 2684,
"n_subproofs": 0,
"n_tactics": 57,
"cyclomatic": 15,
"n_automation": 22,
"n_rewrites": 5,
"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... | @@ -31,6 +31,67 @@
open Cedar.Validation
open Cedar.Data
+/--
+Inverse of `entity_uid_wf_implies_sym_entities_is_valid_entity_uid`
+-/
+private theorem sym_entities_is_valid_entity_uid_implies_entity_uid_wf
+ {Γ : TypeEnv} {uid : EntityUID}
+ (hwf : Γ.WellFormed)
+ (huid : (SymEnv.ofEnv Γ).entities.isValidEntity... | {
"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_f1159ba74c21_1 | d175b57dfc301fb2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofType_typeOf_pullback",
"depth": 1,
"n_commands": 0,
"n_lines": 280,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases t with\n | prim p => exact ofType_typeOf_pullback_prim hwf_Γ hwf_ty hlift_ty hwf_t heq_ty hval\n | var var... | [
{
"name": "value?_some_implies_typeOf_not_option",
"text": "private theorem value?_some_implies_typeOf_not_option\n {t : Term} {v : Value} {ty : TermType}\n (hsome : t.value? = .some v)\n (hopt : t.typeOf = .option ty) :\n False\n:= by\n cases t with\n | prim p =>\n cases p with\n | ext ext =>\n... | [
{
"name": "ofType_typeOf_pullback",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 312,
"n_chars": 12103,
"n_subproofs": 38,
"n_tactics": 275,
"cyclomatic": 42,
"n_automation": 96,
"n_rewrites": 12,
"n_structural": 41,
"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... | @@ -161,6 +161,29 @@
constructor
simp only [InstanceOfExtType]
+private theorem value?_some_implies_typeOf_not_option
+ {t : Term} {v : Value} {ty : TermType}
+ (hsome : t.value? = .some v)
+ (hopt : t.typeOf = .option ty) :
+ False
+:= by
+ cases t with
+ | prim p =>
+ cases p with
+ | ext ... | {
"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_f1159ba74c21_2 | 53d3ec5fa172569d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "ofEnv_request_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hwf_I_vars, _⟩ := hwf_I\n have ⟨⟨hsame_I_princ, hsame_I_act, hsame_I_res, hsame_I_ctx⟩, _⟩ := hsame_I\n ... | [
{
"name": "ofType_typeOf_pullback",
"text": "/--\nIf a term type is both the result of `TermType.ofType` and `Term.typeOf`\nfor some well-formed `CedarType` and well-formed `Term`,\nthen the if the the term is concretizable (via `value?`),\nthe resulting `Value` should be well-typed.\n\ni.e., if we know \"-... | [
{
"name": "ofEnv_request_completeness",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 72,
"n_chars": 2928,
"n_subproofs": 11,
"n_tactics": 61,
"cyclomatic": 5,
"n_automation": 16,
"n_rewrites": 0,
"n_structural": 7,
"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... | @@ -184,6 +184,317 @@
try simp only [Term.typeOf] at hopt
contradiction
+/--
+If a term type is both the result of `TermType.ofType` and `Term.typeOf`
+for some well-formed `CedarType` and well-formed `Term`,
+then the if the the term is concretizable (via `value?`),
+the resulting `Value` should be well-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_f1159ba74c21_3 | 413592ae6dae7f2a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "ets_find_some_standard_entry_implies_valid_uid_ty",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hvalid_uid := ets_find_some_standard_entry_implies_valid_uid hfind_uid\n simp only ... | [
{
"name": "ets_find_some_standard_entry_implies_valid_uid",
"text": "private theorem ets_find_some_standard_entry_implies_valid_uid\n {Γ : TypeEnv} {uid : EntityUID} {entry : StandardSchemaEntry}\n (hfind_uid : Γ.ets.find? uid.ty = .some (.standard entry)) :\n (SymEnv.ofEnv Γ).entities.isValidEntityUID u... | [
{
"name": "ets_find_some_standard_entry_implies_valid_uid_ty",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 530,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 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,11 +31,31 @@
open Cedar.Validation
open Cedar.Data
+private theorem ets_find_some_standard_entry_implies_valid_uid
+ {Γ : TypeEnv} {uid : EntityUID} {entry : StandardSchemaEntry}
+ (hfind_uid : Γ.ets.find? uid.ty = .some (.standard entry)) :
+ (SymEnv.ofEnv Γ).entities.isValidEntityUID uid
+:= by
+ 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_f1159ba74c21_4 | 265e102244fddadf | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "ofEnv_entity_completeness_standard_inst_tags",
"depth": 1,
"n_commands": 0,
"n_lines": 153,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hsame_attrs, _, _, hvalid_eid, hsame_tags⟩ := hsame_δ\n have ⟨_, hwf_funs⟩ := hwf_I\n... | [
{
"name": "ets_find_some_standard_entry_implies_valid_uid_ty",
"text": "private theorem ets_find_some_standard_entry_implies_valid_uid_ty\n {Γ : TypeEnv} {uid : EntityUID} {entry : StandardSchemaEntry}\n (hfind_uid : Γ.ets.find? uid.ty = .some (.standard entry)) :\n (SymEnv.ofEnv Γ).entities.isValidEntit... | [
{
"name": "ofEnv_entity_completeness_standard_inst_tags",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 168,
"n_chars": 6440,
"n_subproofs": 18,
"n_tactics": 150,
"cyclomatic": 15,
"n_automation": 31,
"n_rewrites": 0,
"n_structural": 25,
"aut... | 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... | @@ -509,6 +509,18 @@
exact hfind_uid
simp only [this, SymEntityData.ofEntityType, SymEntityData.ofStandardEntityType]
+private theorem ets_find_some_standard_entry_implies_valid_uid_ty
+ {Γ : TypeEnv} {uid : EntityUID} {entry : StandardSchemaEntry}
+ (hfind_uid : Γ.ets.find? uid.ty = .some (.standard entry)... | {
"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_f1159ba74c21_5 | 613b714cd462cc3d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofEnv_entity_completeness_standard",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hsame_attrs, hanc₁, _, hvalid_eid, hsame_tags⟩ := hsame_δ\n have ⟨_, hwf_funs⟩ := hwf_I\n have ... | [
{
"name": "ofEnv_entity_completeness_standard_inst_tags",
"text": "private theorem ofEnv_entity_completeness_standard_inst_tags\n {Γ : TypeEnv} {I : Interpretation} {entities : Entities}\n {uid : EntityUID} {entry : StandardSchemaEntry}\n {δ δ' : SymEntityData} {data : EntityData}\n (hwf_Γ : Γ.WellForme... | [
{
"name": "ofEnv_entity_completeness_standard",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 99,
"n_chars": 4016,
"n_subproofs": 16,
"n_tactics": 83,
"cyclomatic": 4,
"n_automation": 19,
"n_rewrites": 0,
"n_structural": 18,
"automation_only"... | 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... | @@ -521,6 +521,173 @@
simp only [SymEntities.isValidEntityType, Map.contains, heq, Option.isSome]
· contradiction
+private theorem ofEnv_entity_completeness_standard_inst_tags
+ {Γ : TypeEnv} {I : Interpretation} {entities : Entities}
+ {uid : EntityUID} {entry : StandardSchemaEntry}
+ {δ δ' : SymEntityDat... | {
"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_f1159ba74c21_6 | 7f6963105e8179c4 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "ofEnv_request_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hwf_I_vars, _⟩ := hwf_I\n have ⟨⟨hsame_I_princ, hsame_I_act, hsame_I_res, hsame_I_ctx⟩, _⟩ := hsame_I\n ... | [
{
"name": "ofType_typeOf_pullback",
"text": "/--\nIf a term type is both the result of `TermType.ofType` and `Term.typeOf`\nfor some well-formed `CedarType` and well-formed `Term`,\nthen the if the the term is concretizable (via `value?`),\nthe resulting `Value` should be well-typed.\n\ni.e., if we know \"-... | [
{
"name": "ofEnv_entity_completeness_enum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 77,
"n_chars": 2389,
"n_subproofs": 3,
"n_tactics": 64,
"cyclomatic": 4,
"n_automation": 13,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": fal... | 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... | @@ -184,6 +184,317 @@
try simp only [Term.typeOf] at hopt
contradiction
+/--
+If a term type is both the result of `TermType.ofType` and `Term.typeOf`
+for some well-formed `CedarType` and well-formed `Term`,
+then the if the the term is concretizable (via `value?`),
+the resulting `Value` should be well-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_f1159ba74c21_7 | b99d565321faff25 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofEnv_entity_completeness_ordinary",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases entry with\n | standard entry =>\n exact ofEnv_entity_completeness_standard hwf_Γ hwf_data hwf... | [
{
"name": "ofEnv_entity_completeness_enum",
"text": "private theorem ofEnv_entity_completeness_enum\n {Γ : TypeEnv} {I : Interpretation}\n {uid : EntityUID} {eids : Set String}\n {δ δ' : SymEntityData} {data : EntityData}\n (hwf_Γ : Γ.WellFormed)\n (hwf_I : I.WellFormed (SymEnv.ofEnv Γ).entities)\n (h... | [
{
"name": "ofEnv_entity_completeness_ordinary",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 21,
"n_chars": 898,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fal... | 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... | @@ -786,6 +786,82 @@
· exact ofEnv_entity_completeness_standard_inst_tags
hwf_Γ hwf_data hwf_I hfind_uid hδ' hδ hsame_δ hfind_δ
+private theorem ofEnv_entity_completeness_enum
+ {Γ : TypeEnv} {I : Interpretation}
+ {uid : EntityUID} {eids : Set String}
+ {δ δ' : SymEntityData} {data : EntityData}
+ (hwf... | {
"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_f1159ba74c21_8 | f5b94f370b66b566 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofEnv_entity_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [\n SymEnv.interpret,\n SymEntities.interpret,\n SymEnv.ofEnv,\n SymEntities.ofSchema,\n ... | [
{
"name": "ofEnv_entity_completeness_action",
"text": "private theorem ofEnv_entity_completeness_action\n {Γ : TypeEnv} {I : Interpretation} {entities : Entities}\n {uid : EntityUID} {entry : ActionSchemaEntry}\n {δ δ' : SymEntityData} {data : EntityData}\n (hwf_Γ : Γ.WellFormed)\n (hwf_data : data.Wel... | [
{
"name": "ofEnv_entity_completeness",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 59,
"n_chars": 2467,
"n_subproofs": 17,
"n_tactics": 47,
"cyclomatic": 5,
"n_automation": 11,
"n_rewrites": 1,
"n_structural": 5,
"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... | @@ -882,6 +882,155 @@
| enum eids =>
exact ofEnv_entity_completeness_enum hwf_Γ hwf_I hfind_uid hδ' hδ hsame_δ
+private theorem ofEnv_entity_completeness_action
+ {Γ : TypeEnv} {I : Interpretation} {entities : Entities}
+ {uid : EntityUID} {entry : ActionSchemaEntry}
+ {δ δ' : SymEntityData} {data : Entity... | {
"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_f1159ba74c21_9 | 52248177db205707 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofEnv_entities_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨_, hsame_ents⟩ := hsame_I\n constructor\n · intros uid data hfind_uid\n have ⟨δ, hfind_δ, hsame_δ⟩ ... | [
{
"name": "enum_complete_implies_has_all_actions",
"text": "private theorem enum_complete_implies_has_all_actions\n {Γ : TypeEnv} {env : Env}\n (hwf_Γ : Γ.WellFormed)\n (henum_comp : Env.EnumCompleteFor env (SymEnv.ofEnv Γ)) :\n Entities.HasAllActions env.entities Γ\n:= by\n intros uid entry hfind_uid\... | [
{
"name": "ofEnv_entities_completeness",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 21,
"n_chars": 840,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"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... | @@ -1089,6 +1089,68 @@
have hfind_uid := (Map.in_list_iff_find?_some hwf_acts).mp hmem_uid'
exact ofEnv_entity_completeness_action hwf_Γ hwf_data hfind_uid (Eq.symm heq_δ') hδ' hsame_δ
+private theorem enum_complete_implies_has_all_actions
+ {Γ : TypeEnv} {env : Env}
+ (hwf_Γ : Γ.WellFormed)
+ (henum_com... | {
"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_f1159ba74c21_10 | b17d55a40b2ac8f0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Env/Completeness.lean | Completeness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "ofEnv_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · exact hwf_Γ\n have ⟨I, hwf_I, hsame_I⟩ := hinst\n constructor\n · exact ofEnv_request_completeness h... | [
{
"name": "ofEnv_entities_completeness",
"text": "private theorem ofEnv_entities_completeness\n {Γ : TypeEnv} {env : Env} {I : Interpretation}\n (hwf_Γ : Γ.WellFormed)\n (hwf_env : env.StronglyWellFormed)\n (hwf_I : I.WellFormed (SymEnv.ofEnv Γ).entities)\n (henum_comp : Env.EnumCompleteFor env (SymEnv... | [
{
"name": "ofEnv_completeness",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 15,
"n_lines": 16,
"n_chars": 513,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_ne... | 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... | @@ -1222,6 +1222,26 @@
simp only [↓reduceIte, and_true]
exact Map.find?_mem_toList hfind_uid
+private theorem ofEnv_entities_completeness
+ {Γ : TypeEnv} {env : Env} {I : Interpretation}
+ (hwf_Γ : Γ.WellFormed)
+ (hwf_env : env.StronglyWellFormed)
+ (hwf_I : I.WellFormed (SymEnv.ofEnv Γ).entities)
+ (... | {
"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_fcec3c65cee2_0 | cc3d8cff8846146e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Interpretation.lean | Interpretation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "wf_interpretation_implies_wf_var",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂\n exact (wf_interpretation_implies_wfl_var h₁ h₂).left",
"n_chars": 80,
"n_subproofs"... | [
{
"name": "wf_interpretation_implies_wfl_var",
"text": "public theorem wf_interpretation_implies_wfl_var {εs : SymEntities} {I : Interpretation} {v : TermVar} :\n I.WellFormed εs → v.WellFormed εs → (I.vars v).WellFormedLiteral εs\n:= by\n intro h₁ h₂\n exact (h₁.left v h₂).left\n\n",
"fan_in": 1,
... | [
{
"name": "wf_interpretation_implies_wf_var",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 259,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"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... | @@ -31,9 +31,17 @@
open Batteries Data Spec SymCC
+public theorem wf_interpretation_implies_wfl_var {εs : SymEntities} {I : Interpretation} {v : TermVar} :
+ I.WellFormed εs → v.WellFormed εs → (I.vars v).WellFormedLiteral εs
+:= by
+ intro h₁ h₂
+ exact (h₁.left v h₂).left
+
public theorem wf_interpretation_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_27055e5d1a86_0 | 4daf362aa65547d0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Control.lean | Control | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "compile_evaluate_ite",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨t₁, hr₁, h₄⟩ := compile_ite_ok_implies h₄\n have ⟨hwf₁, hwf₂, hwf₃⟩ := wf_env_for_ite_implies h₂\n have ⟨h... | [
{
"name": "compile_evaluate_ite_none",
"text": "private theorem compile_evaluate_ite_none {x₂ x₃ : Expr} {εnv : SymEnv} {t : Term} {e : Spec.Error} {ty : TermType}\n (hwφ₂ : SymEnv.WellFormedFor εnv x₂)\n (hwφ₃ : SymEnv.WellFormedFor εnv x₃)\n (h₁ : CompileIfSym t (Term.none ty) (compile x₂ εnv) (compi... | [
{
"name": "compile_evaluate_ite",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 61,
"n_chars": 2592,
"n_subproofs": 2,
"n_tactics": 57,
"cyclomatic": 12,
"n_automation": 10,
"n_rewrites": 6,
"n_structural": 7,
"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... | @@ -27,6 +27,28 @@
open Batteries Data Spec SymCC Factory
+private theorem compile_evaluate_ite_none {x₂ x₃ : Expr} {εnv : SymEnv} {t : Term} {e : Spec.Error} {ty : TermType}
+ (hwφ₂ : SymEnv.WellFormedFor εnv x₂)
+ (hwφ₃ : SymEnv.WellFormedFor εnv x₃)
+ (h₁ : CompileIfSym t (Term.none ty) (compile x₂ εnv) (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_27055e5d1a86_1 | 90c6727354106402 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Control.lean | Control | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "compile_evaluate_and",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨_, hr₁, h₄⟩ := compile_and_ok_implies h₄\n have ⟨hwf₁, hwf₂⟩ := wf_env_for_and_implies h₂\n have ⟨hwφ₁, hw... | [
{
"name": "compile_bool_same_implies_bool",
"text": "private theorem compile_bool_same_implies_bool {x : Expr} {εnv : SymEnv} {t : Term} {v : Value}\n (hwφ : Term.WellFormed εnv.entities t)\n (hr : compile x εnv = Except.ok t)\n (hs : (Except.ok v : Spec.Result Value) ∼ t)\n (hty : Term.typeOf t = Ter... | [
{
"name": "compile_evaluate_and",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 2358,
"n_subproofs": 4,
"n_tactics": 52,
"cyclomatic": 8,
"n_automation": 11,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
"ma... | 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... | @@ -48,6 +48,25 @@
simp [pe_ifSome_none hite.right]
exact same_error_implied_by h₂
+private theorem compile_bool_same_implies_bool {x : Expr} {εnv : SymEnv} {t : Term} {v : Value}
+ (hwφ : Term.WellFormed εnv.entities t)
+ (hr : compile x εnv = Except.ok t)
+ (hs : (Except.ok v : Spec.Result Value) ∼ 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_27055e5d1a86_2 | bfa77c4d425f1a63 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Control.lean | Control | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "compile_evaluate_and",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨_, hr₁, h₄⟩ := compile_and_ok_implies h₄\n have ⟨hwf₁, hwf₂⟩ := wf_env_for_and_implies h₂\n have ⟨hwφ₁, hw... | [
{
"name": "compile_bool_same_implies_bool",
"text": "private theorem compile_bool_same_implies_bool {x : Expr} {εnv : SymEnv} {t : Term} {v : Value}\n (hwφ : Term.WellFormed εnv.entities t)\n (hr : compile x εnv = Except.ok t)\n (hs : (Except.ok v : Spec.Result Value) ∼ t)\n (hty : Term.typeOf t = Ter... | [
{
"name": "compile_evaluate_or",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 2331,
"n_subproofs": 4,
"n_tactics": 52,
"cyclomatic": 8,
"n_automation": 11,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
"max... | 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... | @@ -27,6 +27,25 @@
open Batteries Data Spec SymCC Factory
+private theorem compile_bool_same_implies_bool {x : Expr} {εnv : SymEnv} {t : Term} {v : Value}
+ (hwφ : Term.WellFormed εnv.entities t)
+ (hr : compile x εnv = Except.ok t)
+ (hs : (Except.ok v : Spec.Result Value) ∼ t)
+ (hty : Term.typeOf t = Term... | {
"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_c959eb5953d9_0 | f431b5fd80bfe1bb | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker.lean | Typechecker | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "type_of_preserves_evaluation_results",
"depth": 1,
"n_commands": 0,
"n_lines": 329,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂ h₃\n induction e, c₁ using typeOf.induct generalizing ty c₂\n case _ =>\n simp [typ... | [
{
"name": "type_of_is_sound",
"text": "/--\nIf an expression is well-typed according to the typechecker, and the input\nenvironment and capabilities satisfy some invariants, then either (1) evaluation\nproduces a value of the returned type or (2) it returns an error of type\n`entityDoesNotExist`, `extension... | [
{
"name": "type_of_preserves_evaluation_results",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 339,
"n_chars": 14574,
"n_subproofs": 10,
"n_tactics": 347,
"cyclomatic": 102,
"n_automation": 118,
"n_rewrites": 44,
"n_structural": 74,
"automat... | 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... | @@ -40,6 +40,69 @@
open Cedar.Spec
open Cedar.Validation
+/--
+If an expression is well-typed according to the typechecker, and the input
+environment and capabilities satisfy some invariants, then either (1) evaluation
+produces a value of the returned type or (2) it returns an error of type
+`entityDoesNotExist`,... | {
"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_c9c034dd2c88_0 | f9a1fb6d835dda40 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/BatchedEvaluator/Authorize.lean | Authorize | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evaluatePolicy_ok_implies_requestMatchesEnvironment",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h env h_env\n simp only [evaluatePolicy, h_env] at h\n split at h <;> try cases... | [
{
"name": "requestIsValid_asPartialRequest_eq",
"text": "private theorem requestIsValid_asPartialRequest_eq {env : TypeEnv} {req : Request} :\n requestIsValid env req.asPartialRequest = instanceOfRequestType req env\n:= by\n simp only [requestIsValid, Request.asPartialRequest, PartialEntityUID.asEntityUID... | [
{
"name": "evaluatePolicy_ok_implies_requestMatchesEnvironment",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 656,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 5,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 3,
"auto... | 1 | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | @@ -20,12 +20,25 @@
open Cedar.Thm
open Cedar.Data
+private theorem requestIsValid_asPartialRequest_eq {env : TypeEnv} {req : Request} :
+ requestIsValid env req.asPartialRequest = instanceOfRequestType req env
+:= by
+ simp only [requestIsValid, Request.asPartialRequest, PartialEntityUID.asEntityUID,
+ partia... | {
"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_c9c034dd2c88_1 | 6a60d7abdd556117 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/BatchedEvaluator/Authorize.lean | Authorize | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evaluatePolicy_ok_implies_well_formed_env",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_ep h_schema_wf h_entities\n obtain ⟨env, h_env⟩ := evaluatePolicy_ok_implies_env_some h_... | [
{
"name": "evaluatePolicy_ok_implies_env_some",
"text": "theorem evaluatePolicy_ok_implies_env_some {schema : Schema} {p : Policy}\n {preq : PartialRequest} {pes : PartialEntities} {r : Residual} :\n evaluatePolicy schema p preq pes = .ok r →\n ∃ env, schema.environment? preq.principal.ty preq.resource.t... | [
{
"name": "evaluatePolicy_ok_implies_well_formed_env",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1094,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_on... | 3 | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | @@ -20,6 +20,15 @@
open Cedar.Thm
open Cedar.Data
+theorem evaluatePolicy_ok_implies_env_some {schema : Schema} {p : Policy}
+ {preq : PartialRequest} {pes : PartialEntities} {r : Residual} :
+ evaluatePolicy schema p preq pes = .ok r →
+ ∃ env, schema.environment? preq.principal.ty preq.resource.ty preq.action ... | {
"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_c9c034dd2c88_2 | f2ec80f8d787fa08 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/BatchedEvaluator/Authorize.lean | Authorize | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "batched_authorize_loop_decision_agrees",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₀ h₁ h₂ h₃ h_dec\n unfold batchedAuthorizeLoop at h_dec\n simp only at h_dec\n split at h... | [
{
"name": "equiv_well_typed_implies_equiv",
"text": "theorem equiv_well_typed_implies_equiv\n (h : ResidualPoliciesEquivAndWellTyped env policies residuals req es) :\n ResidualPoliciesEquiv policies residuals req es :=\n List.Forall₂.imp (fun _ _ ⟨a, b, c, _⟩ => ⟨a, b, c⟩) h\n\n",
"fan_in": 1,
"n... | [
{
"name": "batched_authorize_loop_decision_agrees",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1552,
"n_subproofs": 1,
"n_tactics": 24,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 10,
"automation_onl... | 2 | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | import Cedar.TPE.Input
import Cedar.TPE.BatchedEvaluator
import Cedar.Spec
import Cedar.Validation
import Cedar.Thm.Validation
import Cedar.Thm.TPE
import Cedar.Thm.Authorization
import Cedar.Thm.BatchedEvaluator.Common
/-!
Soundness of batched authorization: if the batched authorizer reaches a
definitive decision, th... | @@ -33,6 +33,11 @@
Residual.WellTyped env rp.residual
) policies residuals
+theorem equiv_well_typed_implies_equiv
+ (h : ResidualPoliciesEquivAndWellTyped env policies residuals req es) :
+ ResidualPoliciesEquiv policies residuals req es :=
+ List.Forall₂.imp (fun _ _ ⟨a, b, c, _⟩ => ⟨a, b, c⟩) h
+
theor... | {
"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_4761dafef8c6_0 | a021bd5c373fe2bb | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable.lean | Reachable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "checked_eval_entity_reachable",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases e\n case lit =>\n have hi : euid ∈ request.sliceEUIDs := by\n have hact := checked_eval_entit... | [
{
"name": "unary_not_euid_via_path",
"text": "theorem unary_not_euid_via_path {op : UnaryOp} {e₁ : Expr} {entities : Entities} {path : List Attr}\n (he : evaluate (.unaryApp op e₁) request entities = .ok v) :\n ¬ Value.EuidViaPath v path euid\n:= by\n intro ha\n simp only [evaluate] at he\n simp_do_let... | [
{
"name": "checked_eval_entity_reachable",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 74,
"n_chars": 2502,
"n_subproofs": 9,
"n_tactics": 49,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 15,
"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... | @@ -89,6 +89,21 @@
simp only [he₂, Except.map_error, reduceCtorEq, Except.map_ok, Except.ok.injEq] at he
subst he ; cases ha
+theorem unary_not_euid_via_path {op : UnaryOp} {e₁ : Expr} {entities : Entities} {path : List Attr}
+ (he : evaluate (.unaryApp op e₁) request entities = .ok v) :
+ ¬ Value.EuidV... | {
"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_4761dafef8c6_1 | f31fb941fd4b4ef1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable.lean | Reachable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "slice_contains_reachable",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hw\n case in_start hw =>\n exact in_work_then_in_slice hw\n case step ed euid' hf hi hw =>\n simp o... | [
{
"name": "in_work_then_in_slice",
"text": "theorem in_work_then_in_slice {entities : Entities} {work : Set EntityUID} {euid : EntityUID} {n : Nat}\n (hw : euid ∈ work)\n : euid ∈ Entities.sliceAtLevel.sliceAtLevel entities work (n + 1)\n:= by\n simp only [Entities.sliceAtLevel.sliceAtLevel]\n let slice... | [
{
"name": "slice_contains_reachable",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 999,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 1,
"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... | @@ -36,6 +36,16 @@
open Cedar.Spec
open Cedar.Validation
+theorem in_work_then_in_slice {entities : Entities} {work : Set EntityUID} {euid : EntityUID} {n : Nat}
+ (hw : euid ∈ work)
+ : euid ∈ Entities.sliceAtLevel.sliceAtLevel entities work (n + 1)
+:= by
+ simp only [Entities.sliceAtLevel.sliceAtLevel]
+ let... | {
"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_4761dafef8c6_2 | 132bf7972fe209f1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable.lean | Reachable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "slice_contains_reachable",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hw\n case in_start hw =>\n exact in_work_then_in_slice hw\n case step ed euid' hf hi hw =>\n simp o... | [
{
"name": "in_work_then_in_slice",
"text": "theorem in_work_then_in_slice {entities : Entities} {work : Set EntityUID} {euid : EntityUID} {n : Nat}\n (hw : euid ∈ work)\n : euid ∈ Entities.sliceAtLevel.sliceAtLevel entities work (n + 1)\n:= by\n simp only [Entities.sliceAtLevel.sliceAtLevel]\n let slice... | [
{
"name": "reachable_then_mem_slice",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 498,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"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... | @@ -36,6 +36,16 @@
open Cedar.Spec
open Cedar.Validation
+theorem in_work_then_in_slice {entities : Entities} {work : Set EntityUID} {euid : EntityUID} {n : Nat}
+ (hw : euid ∈ work)
+ : euid ∈ Entities.sliceAtLevel.sliceAtLevel entities work (n + 1)
+:= by
+ simp only [Entities.sliceAtLevel.sliceAtLevel]
+ let... | {
"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_a20fa9834664_0 | 56290d4ecd597ec0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Record.lean | Record | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "type_of_record_inversion",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [typeOf, ok] at h₁\n cases h₂ : axs.mapM₂ fun x => Except.map (fun x_1 => (x.1.fst, x_1.fst)) (typeOf x.1.sn... | [
{
"name": "type_of_record_inversion_forall",
"text": "theorem type_of_record_inversion_forall {axs : List (Attr × Expr)} {c : Capabilities} {env : TypeEnv} {rtx : List (Attr × TypedExpr)}\n (h₁ : axs.mapM (λ x => (typeOf x.snd c env).map (λ (ty, _) => (x.fst, ty))) = Except.ok rtx) :\n List.Forall₂ (AttrE... | [
{
"name": "type_of_record_inversion",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 812,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 3,
"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... | @@ -34,13 +34,57 @@
ax.fst = atx.fst ∧
∃ c', (typeOf ax.snd c env) = Except.ok (atx.snd, c')
+theorem type_of_record_inversion_forall {axs : List (Attr × Expr)} {c : Capabilities} {env : TypeEnv} {rtx : List (Attr × TypedExpr)}
+ (h₁ : axs.mapM (λ x => (typeOf x.snd c env).map (λ (ty, _) => (x.fst, ty))) = Exc... | {
"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_a20fa9834664_1 | 9927780b5505a78d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Record.lean | Record | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mk_vals_instance_of_mk_types",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply InstanceOfType.instance_of_record\n case h₁ =>\n intro a h₂\n exact mk_vals_instance_of_mk_types... | [
{
"name": "mk_vals_instance_of_mk_types₃",
"text": "theorem mk_vals_instance_of_mk_types₃ {env : TypeEnv} {a : Attr} {qty : QualifiedType} {avs : List (Attr × Value)} {rtx : List (Attr × QualifiedType)}\n (h₁ : List.Forall₂ (AttrValueHasAttrType (env := env)) avs rtx)\n (h₂ : (Map.mk rtx).find? a = some q... | [
{
"name": "mk_vals_instance_of_mk_types",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 595,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"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... | @@ -72,10 +72,38 @@
apply @mk_vals_instance_of_mk_types₂ env a v qty atl rtl h₅ <;>
simp [Map.find?, Map.toList, h₂, h₃]
+theorem mk_vals_instance_of_mk_types₃ {env : TypeEnv} {a : Attr} {qty : QualifiedType} {avs : List (Attr × Value)} {rtx : List (Attr × QualifiedType)}
+ (h₁ : List.Forall₂ (AttrValu... | {
"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_a20fa9834664_2 | 27e0a18bc5c1713d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Record.lean | Record | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "find_make_xs_find_make_txs",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply @find_mk_xs_find_mk_txs _ _ _ _ (List.canonicalize Prod.fst axs)\n · let p := fun (x : Expr) (tx : Typed... | [
{
"name": "find_mk_xs_find_mk_txs",
"text": "theorem find_mk_xs_find_mk_txs {axs : List (Attr × Expr)} {atxs : List (Attr × TypedExpr)}\n (h₁ : List.Forall₂ (AttrExprHasAttrType c env) axs atxs)\n (h₂ : (Map.mk axs).find? a = some x) :\n ∃ tx c', (Map.mk atxs).find? a = some tx ∧ typeOf x c env = .ok (tx... | [
{
"name": "find_make_xs_find_make_txs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 640,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"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... | @@ -34,11 +34,41 @@
ax.fst = atx.fst ∧
∃ c', (typeOf ax.snd c env) = Except.ok (atx.snd, c')
+theorem find_mk_xs_find_mk_txs {axs : List (Attr × Expr)} {atxs : List (Attr × TypedExpr)}
+ (h₁ : List.Forall₂ (AttrExprHasAttrType c env) axs atxs)
+ (h₂ : (Map.mk axs).find? a = some x) :
+ ∃ tx c', (Map.mk atxs)... | {
"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_a20fa9834664_3 | a0e4010b905f39b1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Record.lean | Record | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "vals_instance_of_types",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases h₃\n case nil =>\n simp [←List.mapM'_eq_mapM, pure, Except.pure] at h₄\n subst h₄\n simp [List.map_... | [
{
"name": "head_of_vals_instance_of_head_of_types",
"text": "theorem head_of_vals_instance_of_head_of_types {xhd : Attr × Expr} {c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities} {rhd : Attr × TypedExpr} {vhd : Attr × Value}\n (h₁ : TypeOfIsSound xhd.snd)\n (h₂ : CapabilitiesInv... | [
{
"name": "vals_instance_of_types",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1444,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 6,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 9,
"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... | @@ -34,6 +34,23 @@
ax.fst = atx.fst ∧
∃ c', (typeOf ax.snd c env) = Except.ok (atx.snd, c')
+theorem head_of_vals_instance_of_head_of_types {xhd : Attr × Expr} {c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities} {rhd : Attr × TypedExpr} {vhd : Attr × Value}
+ (h₁ : TypeOfIsSound xhd.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_a20fa9834664_4 | 72a3cbd85be20ba9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Record.lean | Record | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "type_of_record_is_sound_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply mk_vals_instance_of_mk_types\n let p := fun (v : Value) (qty : QualifiedType) => InstanceOfType env v qty... | [
{
"name": "vals_instance_of_types",
"text": "theorem vals_instance_of_types {axs : List (Attr × Expr)} {c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities} {rtx : List (Attr × TypedExpr)} {avs : List (Attr × Value)}\n (ih : ∀ (axᵢ : Attr × Expr), axᵢ ∈ axs → TypeOfIsSound axᵢ.snd)\... | [
{
"name": "type_of_record_is_sound_ok",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 16,
"n_chars": 1044,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"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... | @@ -122,6 +122,35 @@
simp [EvaluatesTo, h₈] at h₁ ; subst h₁ h₅
simp [AttrValueHasAttrType, Qualified.getType, h₇]
+theorem vals_instance_of_types {axs : List (Attr × Expr)} {c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities} {rtx : List (Attr × TypedExpr)} {avs : List (Attr × 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.