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_255fff183c87_11 | e8dc6b76b6a6ba00 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Canonical.lean | Canonical | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "equiv_implies_canonical_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n apply sortedBy_equiv_implies_eq id\n exact (canonicalize_sortedBy id xs)\n exact (canonicalize_so... | [
{
"name": "canonicalize_sortedBy",
"text": "public theorem canonicalize_sortedBy [LT β] [StrictLT β] [DecidableLT β] (f : α → β) (xs : List α) :\n SortedBy f (canonicalize f xs)\n:= by\n induction xs\n case nil => simp [canonicalize_nil, SortedBy.nil]\n case cons hd tl ih =>\n unfold canonicalize\n ... | [
{
"name": "canonicalize_idempotent",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 704,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 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... | @@ -77,6 +77,16 @@
canonicalize f [] = []
:= by unfold canonicalize; rfl
+public theorem canonicalize_sortedBy [LT β] [StrictLT β] [DecidableLT β] (f : α → β) (xs : List α) :
+ SortedBy f (canonicalize f xs)
+:= by
+ induction xs
+ case nil => simp [canonicalize_nil, SortedBy.nil]
+ 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_255fff183c87_12 | 5ea2fa54bd8b7e0c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Canonical.lean | Canonical | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "canonicalize_nil'",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n case mp =>\n intro h₁ ; subst h₁\n exact canonicalize_nil f\n case mpr =>\n intro h₁\n cases... | [
{
"name": "canonicalize_nil",
"text": "public theorem canonicalize_nil [LT β] [DecidableLT β] (f : α → β) :\n canonicalize f [] = []\n:= by unfold canonicalize; rfl\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation"... | [
{
"name": "canonicalize_id_filter",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 14,
"n_chars": 539,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"ma... | 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... | @@ -150,13 +150,33 @@
apply cons_equiv_cons
exact ih
+public theorem canonicalize_nil [LT β] [DecidableLT β] (f : α → β) :
+ canonicalize f [] = []
+:= by unfold canonicalize; rfl
+
public theorem canonicalize_sortedBy [LT β] [StrictLT β] [DecidableLT β] (f : α → β) (xs : List α) :
... | {
"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_255fff183c87_13 | c89551b86e2f4450 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Canonical.lean | Canonical | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "canonicalize_nil'",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n case mp =>\n intro h₁ ; subst h₁\n exact canonicalize_nil f\n case mpr =>\n intro h₁\n cases... | [
{
"name": "canonicalize_nil",
"text": "public theorem canonicalize_nil [LT β] [DecidableLT β] (f : α → β) :\n canonicalize f [] = []\n:= by unfold canonicalize; rfl\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation"... | [
{
"name": "canonicalize_preserves_forall",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 629,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 4,
"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... | @@ -68,6 +68,10 @@
· contradiction
· exact Forall₂.cons (by exact h₁) (by exact h₄)
+public theorem canonicalize_nil [LT β] [DecidableLT β] (f : α → β) :
+ canonicalize f [] = []
+:= by unfold canonicalize; rfl
+
/--
Illustration that `equiv_implies_canonical_eq` does not hold for
all functions ... | {
"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_255fff183c87_14 | 4cf57f67530787a1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Canonical.lean | Canonical | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "canonicalize_of_map_fst",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases xs\n case nil => simp [canonicalize]\n case cons hd tl =>\n simp only [canonicalize]\n exact insertCa... | [
{
"name": "insertCanonical_map_fst_canonicalize",
"text": "public theorem insertCanonical_map_fst_canonicalize {α β γ} [LT α] [StrictLT α] [DecidableLT α] (xs : List (α × β)) (f : β → γ) (x : α × β) :\n insertCanonical Prod.fst (Prod.map id f x) (canonicalize Prod.fst (map (Prod.map id f) xs)) =\n map (Pr... | [
{
"name": "canonicalize_of_map_fst",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 407,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"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... | @@ -50,6 +50,18 @@
simp [ih, Prod.map]
· simp [Prod.map]
+public theorem insertCanonical_map_fst_canonicalize {α β γ} [LT α] [StrictLT α] [DecidableLT α] (xs : List (α × β)) (f : β → γ) (x : α × β) :
+ insertCanonical Prod.fst (Prod.map id f x) (canonicalize Prod.fst (map (Prod.map id f) xs)) =
+ ma... | {
"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_8ce7bde21b3c_0 | 0d852b5b893ed4ff | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/HasAttr.lean | HasAttr | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "type_of_hasAttr_inversion",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"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": "hasAttrInRecord_has_empty_or_singleton_capabilities",
"text": "theorem hasAttrInRecord_has_empty_or_singleton_capabilities {x₁ : Expr} {a : Attr} {c₁ c₂ : Capabilities} {rty : RecordType} {ty₁ : CedarType} :\n hasAttrInRecord rty x₁ a c₁ b = Except.ok (ty₁, c₂) →\n c₂ = ∅ ∨ c₂ = Capabilities.si... | [
{
"name": "type_of_hasAttr_inversion",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1304,
"n_subproofs": 1,
"n_tactics": 28,
"cyclomatic": 13,
"n_automation": 13,
"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 hasAttrInRecord_has_empty_or_singleton_capabilities {x₁ : Expr} {a : Attr} {c₁ c₂ : Capabilities} {rty : RecordType} {ty₁ : CedarType} :
+ hasAttrInRecord rty x₁ a c₁ b = Except.ok (ty₁, c₂) →
+ c₂ = ∅ ∨ c₂ = Capabilities.singleton x₁ (.attr a)
+:=... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8ce7bde21b3c_1 | f2db5d66a8177c1a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/HasAttr.lean | HasAttr | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "type_of_hasAttr_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨h₅, ty₁, c₁', hty₁, hty, h₄⟩ := type_of_hasAttr_inversion h₃\n apply And.intro\n case left =>\n simp [... | [
{
"name": "type_of_hasAttr_is_sound_for_entities",
"text": "theorem type_of_hasAttr_is_sound_for_entities {x₁ : Expr} {a : Attr} {c₁ c₁' : Capabilities} {env : TypeEnv} {ety : EntityType} {request : Request} {entities : Entities} {v₁ : Value}\n (h₁ : CapabilitiesInvariant c₁ request entities)\n (h₂ : Inst... | [
{
"name": "type_of_hasAttr_is_sound",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1791,
"n_subproofs": 5,
"n_tactics": 37,
"cyclomatic": 18,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 10,
"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... | @@ -114,6 +114,74 @@
have h₇ := absent_attribute_is_absent h₅ h₇
simp [Map.contains_iff_some_find?, h₇] at h₆
+theorem type_of_hasAttr_is_sound_for_entities {x₁ : Expr} {a : Attr} {c₁ c₁' : Capabilities} {env : TypeEnv} {ety : EntityType} {request : Request} {entities : Entities} {v₁ : Value}
+ (h₁ : Capab... | {
"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_313072d0f273_0 | a6f901d20e804b88 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Symbolizer.lean | Symbolizer | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "value_symbolize?_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 164,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hwf_Γ, _, _⟩ := hinst\n cases v with\n | prim p =>\n cases p with\n | bool | int | string =>\n sim... | [
{
"name": "value_symbolize?_well_typed",
"text": "/-- The results of `symbolize?` has the correct type. -/\ntheorem value_symbolize?_well_typed\n {Γ : TypeEnv} {v : Value} {ty : CedarType} {t : Term}\n (hwf_ty : ty.WellFormed Γ)\n (hwt_v : InstanceOfType Γ v ty)\n (hsym : v.symbolize? ty = .some t) :\n ... | [
{
"name": "value_symbolize?_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 176,
"n_chars": 6674,
"n_subproofs": 18,
"n_tactics": 161,
"cyclomatic": 38,
"n_automation": 49,
"n_rewrites": 3,
"n_structural": 43,
"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,6 +29,131 @@
open Cedar.Validation
open Cedar.Data
+/-- The results of `symbolize?` has the correct type. -/
+theorem value_symbolize?_well_typed
+ {Γ : TypeEnv} {v : Value} {ty : CedarType} {t : Term}
+ (hwf_ty : ty.WellFormed Γ)
+ (hwt_v : InstanceOfType Γ v ty)
+ (hsym : v.symbolize? ty = .some 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_313072d0f273_1 | 1f8094ebf3e43657 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Symbolizer.lean | Symbolizer | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "value?_symbolize?_id",
"depth": 1,
"n_commands": 0,
"n_lines": 344,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hwt_v with\n | instance_of_bool\n | instance_of_string\n | instance_of_entity\n | instance_of_ext\n | ins... | [
{
"name": "value_symbolize?_not_some",
"text": "/-- The results of `symbolize?` is not Term.some. -/\ntheorem value_symbolize?_not_some\n {v : Value} {ty : CedarType} {t : Term} {t' : Term}\n (hsome : v.symbolize? ty = .some t) :\n t ≠ .some t'\n:= by\n intros ht_some\n simp only [ht_some] at hsome\n ... | [
{
"name": "value?_symbolize?_id",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 360,
"n_chars": 16872,
"n_subproofs": 71,
"n_tactics": 335,
"cyclomatic": 23,
"n_automation": 81,
"n_rewrites": 6,
"n_structural": 65,
"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... | @@ -53,6 +53,30 @@
try simp at hsome
try contradiction
+/-- The results of `symbolize?` is not Term.some. -/
+theorem value_symbolize?_not_some
+ {v : Value} {ty : CedarType} {t : Term} {t' : Term}
+ (hsome : v.symbolize? ty = .some t) :
+ t ≠ .some t'
+:= by
+ intros ht_some
+ simp only [ht_some] ... | {
"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_4352d476c78b_0 | 5d5a15e9b7f8c3b5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Typechecker/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "empty_guarded_capabilities_invariant",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro _\n exact empty_capabilities_invariant request entities",
"n_chars": 67,
"n_subproofs":... | [
{
"name": "empty_capabilities_invariant",
"text": "theorem empty_capabilities_invariant (request : Request) (entities : Entities) :\n CapabilitiesInvariant ∅ request entities\n:= by\n constructor <;>\n intro e k h <;>\n contradiction\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 185,
"n_su... | [
{
"name": "empty_guarded_capabilities_invariant",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"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... | @@ -86,9 +86,18 @@
----- Capability lemmas -----
+theorem empty_capabilities_invariant (request : Request) (entities : Entities) :
+ CapabilitiesInvariant ∅ request entities
+:= by
+ constructor <;>
+ intro e k h <;>
+ contradiction
+
theorem empty_guarded_capabilities_invariant {e: Expr} {request : Request} ... | {
"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_edfb8b32eb62_0 | d95bff13c2965291 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "concretize?_mapM_entityData?_wf_some_implies_sortedBy",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hsrt hs\n induction hsrt generalizing eds\n case nil =>\n simp only [List... | [
{
"name": "concretize?_entityData?_implies_fst",
"text": "private theorem concretize?_entityData?_implies_fst {uid : EntityUID} {ed : EntityUID × EntityData} {εs : SymEntities} :\n SymEntities.concretize?.entityData? εs uid = some ed →\n ed.fst = uid\n:= by\n intro hs\n replace ⟨_, _, _, _, hs⟩ := concr... | [
{
"name": "concretize?_mapM_entityData?_wf_some_implies_sortedBy",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1312,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 7,
"... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -28,6 +28,14 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem concretize?_entityData?_implies_fst {uid : EntityUID} {ed : EntityUID × EntityData} {εs : SymEntities} :
+ SymEntities.concretize?.entityData? εs uid = some ed →
+ ed.fst = uid
+:= by
+ intro hs
+ replace ⟨_, _, _, _, hs⟩ := co... | {
"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_edfb8b32eb62_1 | d89ab043f3ef4fe1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "concretize?_mapM_entityData?_wf_some_implies_sortedBy",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hsrt hs\n induction hsrt generalizing eds\n case nil =>\n simp only [List... | [
{
"name": "concretize?_entityData?_implies_fst",
"text": "private theorem concretize?_entityData?_implies_fst {uid : EntityUID} {ed : EntityUID × EntityData} {εs : SymEntities} :\n SymEntities.concretize?.entityData? εs uid = some ed →\n ed.fst = uid\n:= by\n intro hs\n replace ⟨_, _, _, _, hs⟩ := concr... | [
{
"name": "concretize?_εs_some_implies_closed",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 38,
"n_chars": 1454,
"n_subproofs": 3,
"n_tactics": 33,
"cyclomatic": 4,
"n_automation": 10,
"n_rewrites": 3,
"n_structural": 9,
"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... | @@ -28,6 +28,14 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem concretize?_entityData?_implies_fst {uid : EntityUID} {ed : EntityUID × EntityData} {εs : SymEntities} :
+ SymEntities.concretize?.entityData? εs uid = some ed →
+ ed.fst = uid
+:= by
+ intro hs
+ replace ⟨_, _, _, _, hs⟩ := co... | {
"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_edfb8b32eb62_2 | a8a3269b24765d3c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "concretize?_εs_some_implies_closed",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs uid hin\n replace ⟨eds, hs, heq⟩ := concretize?_εs_some_eq hs\n subst heq\n simp only [Map.... | [
{
"name": "concretize?_mapM_entityData?_wf_some_implies_sortedBy",
"text": "private theorem concretize?_mapM_entityData?_wf_some_implies_sortedBy {eds : List (EntityUID × EntityData)} {uids : List EntityUID} {εs : SymEntities} :\n uids.Sorted →\n List.mapM (SymEntities.concretize?.entityData? εs) uids = s... | [
{
"name": "concretize?_εs_some_implies_closed_uids",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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... | @@ -36,6 +36,37 @@
replace ⟨_, _, _, _, hs⟩ := concretize?_entityData?_some_eq hs
simp only [← hs]
+private theorem concretize?_mapM_entityData?_wf_some_implies_sortedBy {eds : List (EntityUID × EntityData)} {uids : List EntityUID} {εs : SymEntities} :
+ uids.Sorted →
+ List.mapM (SymEntities.concretize?.enti... | {
"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_edfb8b32eb62_3 | b28e0368bb3383e7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "concretize?_εs_some_implies_closed",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs uid hin\n replace ⟨eds, hs, heq⟩ := concretize?_εs_some_eq hs\n subst heq\n simp only [Map.... | [
{
"name": "concretize?_mapM_entityData?_wf_some_implies_sortedBy",
"text": "private theorem concretize?_mapM_entityData?_wf_some_implies_sortedBy {eds : List (EntityUID × EntityData)} {uids : List EntityUID} {εs : SymEntities} :\n uids.Sorted →\n List.mapM (SymEntities.concretize?.entityData? εs) uids = s... | [
{
"name": "concretize?_εs_some_implies_closed_εs_entityUIDs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 375,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automati... | 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... | @@ -36,6 +36,37 @@
replace ⟨_, _, _, _, hs⟩ := concretize?_entityData?_some_eq hs
simp only [← hs]
+private theorem concretize?_mapM_entityData?_wf_some_implies_sortedBy {eds : List (EntityUID × EntityData)} {uids : List EntityUID} {εs : SymEntities} :
+ uids.Sorted →
+ List.mapM (SymEntities.concretize?.enti... | {
"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_edfb8b32eb62_4 | 96efc0c2fea95fc3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "concretize?_ρ_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hw hr huids\n replace ⟨uidₚ, uidₐ, uidᵣ, ctx, hp, ha, hr, hc, hs⟩ := concretize?_ρ_some_eq hr\n simp only [h... | [
{
"name": "term_entityUID?_some_mem_entityUIDs",
"text": "private theorem term_entityUID?_some_mem_entityUIDs {t : Term} {uid : EntityUID} :\n t.entityUID? = .some uid → uid ∈ t.entityUIDs\n:= by\n intro h\n rw [term_entityUID?_some_iff_eq] at h\n simp only [h, Term.entityUIDs, TermPrim.entityUIDs, Set.... | [
{
"name": "concretize?_ρ_implies",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1114,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"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... | @@ -28,6 +28,13 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem term_entityUID?_some_mem_entityUIDs {t : Term} {uid : EntityUID} :
+ t.entityUID? = .some uid → uid ∈ t.entityUIDs
+:= by
+ intro h
+ rw [term_entityUID?_some_iff_eq] at h
+ simp only [h, Term.entityUIDs, TermPrim.entityUIDs, 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_edfb8b32eb62_5 | 7b1aa8e841e2596d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "concretize?_εs_some_implies_closed_uids",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs\n replace hs := concretize?_εs_some_implies_closed hs\n exact subset_implies_closed (Set... | [
{
"name": "concretize?_εs_some_implies_closed",
"text": "private theorem concretize?_εs_some_implies_closed {uids : Set EntityUID} {εs : SymEntities} {es : Entities} :\n SymEntities.concretize? uids εs = some es →\n es.ClosedFor (uids ∪ εs.entityUIDs)\n:= by\n intro hs uid hin\n replace ⟨eds, hs, heq⟩ :... | [
{
"name": "concretize?_ρ_wf",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 17,
"n_chars": 645,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 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... | @@ -67,6 +67,43 @@
· apply ih
simp only [List.mapM_cons, hs₂, hs, Option.pure_def, Option.bind_some_fun]
+private theorem concretize?_εs_some_implies_closed {uids : Set EntityUID} {εs : SymEntities} {es : Entities} :
+ SymEntities.concretize? uids εs = some es →
+ es.ClosedFor (uids ∪ εs.entityUIDs)
+:=... | {
"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_edfb8b32eb62_6 | 692a7d76607208c3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "concretize?_δ_attrs_some_implies_ws_entityUIDs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace hs := same_values_def.mp (term_recordValue?_some_same hs)\n have hwa := wf_δ_implie... | [
{
"name": "app_value?_some_implies_entityUIDs",
"text": "private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :\n (app f t).value? = some v →\n t.isLiteral →\n v.entityUIDs ⊆ f.entityUIDs\n:= by\n intro hv hlit\n simp only [app] at hv\n split at hv <;> try simp... | [
{
"name": "concretize?_δ_attrs_some_implies_ws_entityUIDs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 723,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -28,13 +28,44 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :
+ (app f t).value? = some v →
+ t.isLiteral →
+ v.entityUIDs ⊆ f.entityUIDs
+:= by
+ intro hv hlit
+ simp only [app] at hv
+ split at hv <;> try... | {
"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_edfb8b32eb62_7 | ed72f64b777a221f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "concretize?_δ_attrs_some_implies_ws_entityUIDs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace hs := same_values_def.mp (term_recordValue?_some_same hs)\n have hwa := wf_δ_implie... | [
{
"name": "app_value?_some_implies_entityUIDs",
"text": "private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :\n (app f t).value? = some v →\n t.isLiteral →\n v.entityUIDs ⊆ f.entityUIDs\n:= by\n intro hv hlit\n simp only [app] at hv\n split at hv <;> try simp... | [
{
"name": "concretize?_δ_ancs_some_implies_entityUIDs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1486,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 5,
"automation_... | 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... | @@ -28,6 +28,32 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :
+ (app f t).value? = some v →
+ t.isLiteral →
+ v.entityUIDs ⊆ f.entityUIDs
+:= by
+ intro hv hlit
+ simp only [app] at hv
+ split at hv <;> try ... | {
"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_edfb8b32eb62_8 | 8a63f16c63e9ed0c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "concretize?_δ_attrs_some_implies_ws_entityUIDs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace hs := same_values_def.mp (term_recordValue?_some_same hs)\n have hwa := wf_δ_implie... | [
{
"name": "app_value?_some_implies_entityUIDs",
"text": "private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :\n (app f t).value? = some v →\n t.isLiteral →\n v.entityUIDs ⊆ f.entityUIDs\n:= by\n intro hv hlit\n simp only [app] at hv\n split at hv <;> try simp... | [
{
"name": "concretize?_δ_tags_some_implies_ws_entityUIDs",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 58,
"n_chars": 2706,
"n_subproofs": 2,
"n_tactics": 55,
"cyclomatic": 8,
"n_automation": 14,
"n_rewrites": 8,
"n_structural": 12,
"automa... | 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... | @@ -28,6 +28,32 @@
namespace Cedar.Thm
open Data Spec SymCC Factory
+private theorem app_value?_some_implies_entityUIDs {f : UnaryFunction} {t : Term} {v : Value} :
+ (app f t).value? = some v →
+ t.isLiteral →
+ v.entityUIDs ⊆ f.entityUIDs
+:= by
+ intro hv hlit
+ simp only [app] at hv
+ split at hv <;> try ... | {
"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_edfb8b32eb62_9 | 359cd24058d7999c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "concretize?_δ_some_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hf hw hs\n simp only [SymEntityData.concretize?, Option.bind_eq_bind, Option.bind_some_fun,\n Option.... | [
{
"name": "concretize?_δ_attrs_some_implies_ws_entityUIDs",
"text": "private theorem concretize?_δ_attrs_some_implies_ws_entityUIDs {uid : EntityUID} {attrs : Map Attr Value} {δ : SymEntityData} {εs : SymEntities}\n (hwδ : δ.WellFormed εs uid.ty)\n (hwu : Term.WellFormedLiteral εs (Term.entity uid))\n (h... | [
{
"name": "concretize?_δ_some_implies",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 35,
"n_chars": 1553,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 5,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 9,
"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... | @@ -54,6 +54,19 @@
· simp only [Set.mem_union, hin, or_true]
· simp only [hv, Set.subset_union]
+private theorem concretize?_δ_attrs_some_implies_ws_entityUIDs {uid : EntityUID} {attrs : Map Attr Value} {δ : SymEntityData} {εs : SymEntities}
+ (hwδ : δ.WellFormed εs uid.ty)
+ (hwu : Term.WellFormedLiteral ε... | {
"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_edfb8b32eb62_10 | bea12abda1c4d117 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "concretize?_εs_some_implies_closed_uids",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs\n replace hs := concretize?_εs_some_implies_closed hs\n exact subset_implies_closed (Set... | [
{
"name": "subset_implies_closed",
"text": "private theorem subset_implies_closed {uids₁ uids₂ : Set EntityUID} {es : Entities} :\n uids₁ ⊆ uids₂ → es.ClosedFor uids₂ → es.ClosedFor uids₁\n:= by\n intro hsub hcf uid hin\n exact hcf uid (Set.mem_subset_mem hin hsub)\n\n",
"fan_in": 3,
"n_lines": 7... | [
{
"name": "concretize?_εs_wf",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 15,
"n_lines": 37,
"n_chars": 1326,
"n_subproofs": 3,
"n_tactics": 31,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 12,
"automation_only": false,
"max_... | 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... | @@ -104,9 +104,19 @@
simp only [hf, hc, Option.some.injEq, Prod.mk.injEq, and_false, not_false_eq_true]
simp only [hc, reduceCtorEq] at hf
+private theorem subset_implies_closed {uids₁ uids₂ : Set EntityUID} {es : Entities} :
+ uids₁ ⊆ uids₂ → es.ClosedFor uids₂ → es.ClosedFor uids₁
+:= by
+ intro hsub ... | {
"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_edfb8b32eb62_11 | 7318e607aa25e146 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Concretizer/WF.lean | WF | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "concretize?_εs_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hw hs\n simp only [Entities.WellFormed]\n constructor\n simp only [SymEntities.concretize?, bind, Option.bind] ... | [
{
"name": "concretize?_εs_some_implies_closed_εs_entityUIDs",
"text": "private theorem concretize?_εs_some_implies_closed_εs_entityUIDs {uids : Set EntityUID} {εs : SymEntities} {es : Entities} :\n SymEntities.concretize? uids εs = some es → es.ClosedFor εs.entityUIDs\n:= by\n intro hs\n replace hs := co... | [
{
"name": "concretize?_some_wf",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 21,
"n_lines": 24,
"n_chars": 799,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 10,
"automation_only": false,
"max... | 21 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -117,6 +117,14 @@
replace hs := concretize?_εs_some_implies_closed hs
exact subset_implies_closed (Set.subset_union uids _) hs
+private theorem concretize?_εs_some_implies_closed_εs_entityUIDs {uids : Set EntityUID} {εs : SymEntities} {es : Entities} :
+ SymEntities.concretize? uids εs = some es → es.Closed... | {
"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_47fde19fb6d7_0 | 76dbb2203f120ae6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice.lean | Slice | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "checked_eval_entity_in_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Entities.sliceAtLevel]\n have hw : ReachableIn entities request.sliceEUIDs euid (n + 1) :=\n c... | [
{
"name": "slice_at_level_inner_well_formed",
"text": "theorem slice_at_level_inner_well_formed {entities : Entities} {work : Set EntityUID} {n : Nat} :\n (Entities.sliceAtLevel.sliceAtLevel entities work n).WellFormed\n:= by\n unfold Entities.sliceAtLevel.sliceAtLevel\n split\n · exact Set.empty_wf\n ... | [
{
"name": "checked_eval_entity_in_slice",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1316,
"n_subproofs": 5,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -31,6 +31,14 @@
open Cedar.Spec
open Cedar.Validation
+theorem slice_at_level_inner_well_formed {entities : Entities} {work : Set EntityUID} {n : Nat} :
+ (Entities.sliceAtLevel.sliceAtLevel entities work n).WellFormed
+:= by
+ unfold Entities.sliceAtLevel.sliceAtLevel
+ split
+ · exact Set.empty_wf
+ · sim... | {
"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_47fde19fb6d7_1 | ff8f7de5904204f1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice.lean | Slice | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "checked_eval_entity_find_entities_eq_find_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hfe : Map.find? entities euid\n case none =>\n exact not_entities_then_not_slice ... | [
{
"name": "not_entities_then_not_slice",
"text": "theorem not_entities_then_not_slice {n: Nat} {request : Request} {uid : EntityUID} {entities : Entities}\n (hse : entities.find? uid = none) :\n (Entities.sliceAtLevel entities request n).find? uid = none\n:= by\n simp only [Entities.sliceAtLevel]\n exac... | [
{
"name": "checked_eval_entity_find_entities_eq_find_slice",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 850,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automati... | 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... | @@ -64,6 +64,13 @@
rw [←hmake]
exact Map.find?_filterMap_key_id hi
+theorem not_entities_then_not_slice {n: Nat} {request : Request} {uid : EntityUID} {entities : Entities}
+ (hse : entities.find? uid = none) :
+ (Entities.sliceAtLevel entities request n).find? uid = none
+:= by
+ simp only [Entities.sliceAt... | {
"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_41528eede7b0_0 | 5fe943cf828a6836 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluate.lean | VerifyEvaluate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "verifyEvaluate_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ⟨hwφ, hiφ, hφf⟩ hwε hok hsat env ⟨I, hwI, heq⟩ hwe\n rw [asserts_unsatisfiable_def] at hsat\n replace ⟨t, ... | [
{
"name": "verifyEvaluate_ok_implies",
"text": "private theorem verifyEvaluate_ok_implies {φ : Term → Term} {p : Policy} {εnv : SymEnv} {asserts : Asserts} :\n verifyEvaluate φ p εnv = .ok asserts →\n ∃ t ts,\n compile p.toExpr εnv = .ok t ∧\n enforce [p.toExpr] εnv = Set.mk ts ∧\n asserts = ts +... | [
{
"name": "verifyEvaluate_is_sound",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1365,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -74,6 +74,21 @@
· rw [hiφ t εs I hwt hwI]
· exact (hwφ t εs hwt).left
+private theorem verifyEvaluate_ok_implies {φ : Term → Term} {p : Policy} {εnv : SymEnv} {asserts : Asserts} :
+ verifyEvaluate φ p εnv = .ok asserts →
+ ∃ t ts,
+ compile p.toExpr εnv = .ok t ∧
+ enforce [p.toExpr] εnv = Set.mk ts... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_41528eede7b0_1 | 6d86463bee8ca08a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluate.lean | VerifyEvaluate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "verifyEvaluate_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ⟨hwφ, hiφ, hφf⟩ hwε hok hsat env ⟨I, hwI, heq⟩ hwe\n rw [asserts_unsatisfiable_def] at hsat\n replace ⟨t, ... | [
{
"name": "verifyEvaluate_ok_implies",
"text": "private theorem verifyEvaluate_ok_implies {φ : Term → Term} {p : Policy} {εnv : SymEnv} {asserts : Asserts} :\n verifyEvaluate φ p εnv = .ok asserts →\n ∃ t ts,\n compile p.toExpr εnv = .ok t ∧\n enforce [p.toExpr] εnv = Set.mk ts ∧\n asserts = ts +... | [
{
"name": "verifyEvaluate_is_complete",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 35,
"n_chars": 1534,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 6,
"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... | @@ -74,6 +74,21 @@
· rw [hiφ t εs I hwt hwI]
· exact (hwφ t εs hwt).left
+private theorem verifyEvaluate_ok_implies {φ : Term → Term} {p : Policy} {εnv : SymEnv} {asserts : Asserts} :
+ verifyEvaluate φ p εnv = .ok asserts →
+ ∃ t ts,
+ compile p.toExpr εnv = .ok t ∧
+ enforce [p.toExpr] εnv = Set.mk ts... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_817091f4e0a9_0 | a39b541099b9dbd5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/PolicySlice.lean | PolicySlice | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "scope_analysis_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [IsSoundBoundAnalysis, scope_bound_is_sound]",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "scope_bound_is_sound",
"text": "/--\nScope-based bounds are sound.\n-/\ntheorem scope_bound_is_sound (policy : Policy) :\n IsSoundPolicyBound (scopeAnalysis policy) policy\n:= by\n unfold IsSoundPolicyBound\n intro request entities\n unfold scopeAnalysis\n unfold satisfiedBound\n unfold Sco... | [
{
"name": "scope_analysis_is_sound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 174,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 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... | @@ -41,11 +41,51 @@
open Cedar.Spec Cedar.Slice
/--
+Scope-based bounds are sound.
+-/
+theorem scope_bound_is_sound (policy : Policy) :
+ IsSoundPolicyBound (scopeAnalysis policy) policy
+:= by
+ unfold IsSoundPolicyBound
+ intro request entities
+ unfold scopeAnalysis
+ unfold satisfiedBound
+ unfold Scope.... | {
"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_817091f4e0a9_1 | 8b09b3b8787a4e06 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/PolicySlice.lean | PolicySlice | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "isAuthorized_eq_for_scope_based_policy_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply isAuthorized_eq_for_sound_policy_slice\n apply sound_bound_analysis_produces_sound_slic... | [
{
"name": "sound_bound_analysis_produces_sound_slices",
"text": "/--\nA sound bound analysis produces sound policy slices.\n-/\ntheorem sound_bound_analysis_produces_sound_slices (ba : BoundAnalysis) (request : Request) (entities : Entities) (policies : Policies) :\n IsSoundBoundAnalysis ba →\n IsSoundPol... | [
{
"name": "isAuthorized_eq_for_scope_based_policy_slice",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 560,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_... | 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... | @@ -55,6 +55,36 @@
simp [isAuthorized, hf, hp, he]
/--
+A sound bound analysis produces sound policy slices.
+-/
+theorem sound_bound_analysis_produces_sound_slices (ba : BoundAnalysis) (request : Request) (entities : Entities) (policies : Policies) :
+ IsSoundBoundAnalysis ba →
+ IsSoundPolicySlice request ent... | {
"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_b485f5466944_0 | d53e604e3019f01d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Soundness.lean | Soundness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "partial_evaluate_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁ h₂ h₃\n induction h₁\n case val =>\n exact partial_evaluate_is_sound_val\n case var =>\n exact... | [
{
"name": "partial_evaluate_is_sound_error",
"text": "theorem partial_evaluate_is_sound_error\n{req : Request}\n{es : Entities}\n{preq : PartialRequest}\n{pes : PartialEntities}\n{ty : CedarType} :\n Except.toOption ((Residual.error ty).evaluate req es) =\n Except.toOption ((TPE.evaluate (Residual.error t... | [
{
"name": "partial_evaluate_is_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2279,
"n_subproofs": 0,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 17,
"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... | @@ -44,6 +44,17 @@
open Cedar.TPE
open Cedar.Thm
+theorem partial_evaluate_is_sound_error
+{req : Request}
+{es : Entities}
+{preq : PartialRequest}
+{pes : PartialEntities}
+{ty : CedarType} :
+ Except.toOption ((Residual.error ty).evaluate req es) =
+ Except.toOption ((TPE.evaluate (Residual.error ty) preq pes)... | {
"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_dc70b80ca5f3_0 | fa4efa515cfb92a8 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Authorizer.lean | Authorizer | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evaluatePolicies_residuals_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ref := consistent_checks_ensure_refinement hv\n have ⟨env, h_schema_env, h_wf⟩ := isValidAndConsi... | [
{
"name": "isValidAndConsistent_env",
"text": "theorem isValidAndConsistent_env\n {schema : Schema} {req : Request} {es : Entities}\n {preq : PartialRequest} {pes : PartialEntities} :\n isValidAndConsistent schema req es preq pes = .ok () →\n ∃ env,\n schema.environment? preq.principal.ty preq.resour... | [
{
"name": "evaluatePolicies_residuals_equiv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 942,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 4,
"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... | @@ -45,6 +45,39 @@
(rp.residual.evaluate req es).toOption = (Spec.evaluate p.toExpr req es).toOption
) policies residuals
+theorem isValidAndConsistent_env
+ {schema : Schema} {req : Request} {es : Entities}
+ {preq : PartialRequest} {pes : PartialEntities} :
+ isValidAndConsistent schema req es preq pes =... | {
"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_dc70b80ca5f3_1 | 0e8534c350db0b1c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Authorizer.lean | Authorizer | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "residuals_decision_agrees",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [isAuthorizedFromResiduals] at h_dec\n split at h_dec <;>\n simp only [Option.some.injEq, reduceCtorEq]... | [
{
"name": "satisfied_effect_if_non_empty_satisfied_policies",
"text": "theorem satisfied_effect_if_non_empty_satisfied_policies\n {policies : List Policy}\n {rps : List ResidualPolicy}\n {req : Request}\n {es : Entities}\n {effect : Effect}\n (h₃ : ResidualPoliciesEquiv policies rps req es)\n (h_non_... | [
{
"name": "residuals_decision_agrees",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1623,
"n_subproofs": 6,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 3,
"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... | @@ -79,6 +79,33 @@
· rename_i hp; simp [hp, Residual.evaluate] at ha
· rename_i hp; simp [hp, Residual.evaluate] at ha
+theorem satisfied_effect_if_non_empty_satisfied_policies
+ {policies : List Policy}
+ {rps : List ResidualPolicy}
+ {req : Request}
+ {es : Entities}
+ {effect : Effect}
+ (h₃ : Residual... | {
"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_dc70b80ca5f3_2 | d56fc4ea85103155 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Authorizer.lean | Authorizer | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "partial_authorize_satisfied_forbids_is_sound",
"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 only [TPE.isAuthorized] at h₁\n cases h₃ : isAuthorized.evaluatePolicies ... | [
{
"name": "evaluatePolicies_residuals_equiv",
"text": "theorem evaluatePolicies_residuals_equiv\n {schema : Schema}\n {policies : List Policy}\n {rps : List ResidualPolicy}\n {req : Request}\n {es : Entities}\n {preq : PartialRequest}\n {pes : PartialEntities}\n (hv : isValidAndConsistent schema req... | [
{
"name": "partial_authorize_satisfied_forbids_is_sound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 725,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 3,
"automation_... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -78,6 +78,28 @@
split at h₂ <;> cases h₂; rename_i heq₅
exact instance_of_well_formed_env heq₅ h_guard.2 heq₄
+theorem evaluatePolicies_residuals_equiv
+ {schema : Schema}
+ {policies : List Policy}
+ {rps : List ResidualPolicy}
+ {req : Request}
+ {es : Entities}
+ {preq : PartialRequest}
+ {pes : Pa... | {
"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_dc70b80ca5f3_3 | 8dd9ed1eba2820bd | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/Authorizer.lean | Authorizer | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "partial_authorize_satisfied_forbids_is_sound",
"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 only [TPE.isAuthorized] at h₁\n cases h₃ : isAuthorized.evaluatePolicies ... | [
{
"name": "evaluatePolicies_residuals_equiv",
"text": "theorem evaluatePolicies_residuals_equiv\n {schema : Schema}\n {policies : List Policy}\n {rps : List ResidualPolicy}\n {req : Request}\n {es : Entities}\n {preq : PartialRequest}\n {pes : PartialEntities}\n (hv : isValidAndConsistent schema req... | [
{
"name": "partial_authorize_satisfied_permits_is_sound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 724,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 3,
"automation_... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -78,6 +78,28 @@
split at h₂ <;> cases h₂; rename_i heq₅
exact instance_of_well_formed_env heq₅ h_guard.2 heq₄
+theorem evaluatePolicies_residuals_equiv
+ {schema : Schema}
+ {policies : List Policy}
+ {rps : List ResidualPolicy}
+ {req : Request}
+ {es : Entities}
+ {preq : PartialRequest}
+ {pes : Pa... | {
"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_7fcd5317439f_0 | 78e09a6d8f8d4b5a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/CompiledPolicies.lean | CompiledPolicies | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "intoCompiledPolicySet_correctness",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [CompiledPolicy.compile, CompiledPolicySet.compile, CompiledPolicy.intoCompiledPolicySet, wellTyped... | [
{
"name": "wellTypedPolicy_wellTypedPolicies",
"text": "/--\nLemma about the behavior of `wellTypedPolicy` vs `wellTypedPolicies`\n-/\nprivate theorem wellTypedPolicy_wellTypedPolicies {p : Policy} {Γ : Validation.TypeEnv} :\n wellTypedPolicies [p] Γ = (wellTypedPolicy p Γ).map λ x => [x]\n:= by\n simp [w... | [
{
"name": "intoCompiledPolicySet_correctness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1215,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 5,
"n_automation": 8,
"n_rewrites": 1,
"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... | @@ -31,6 +31,15 @@
open Cedar.Spec Cedar.SymCC
/--
+Lemma about the behavior of `wellTypedPolicy` vs `wellTypedPolicies`
+-/
+private theorem wellTypedPolicy_wellTypedPolicies {p : Policy} {Γ : Validation.TypeEnv} :
+ wellTypedPolicies [p] Γ = (wellTypedPolicy p Γ).map λ x => [x]
+:= by
+ simp [wellTypedPolicies,... | {
"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_7fcd5317439f_1 | 1d762d18346770c1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/CompiledPolicies.lean | CompiledPolicies | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "cp_compile_produces_the_right_acyclicity",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro temp ; have hf := cp_compile_produces_the_right_footprint temp ; revert temp\n simp [Compil... | [
{
"name": "cp_compile_produces_the_right_footprint",
"text": "theorem cp_compile_produces_the_right_footprint {p : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} :\n CompiledPolicy.compile p Γ = .ok cp →\n cp.footprint = footprint cp.policy.toExpr cp.εnv\n:= by\n simp [CompiledPolicy.compile, do_... | [
{
"name": "cp_compile_produces_the_right_acyclicity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 438,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_onl... | 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,9 +30,29 @@
open Cedar.Spec Cedar.SymCC
+theorem cp_compile_produces_the_right_footprint {p : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} :
+ CompiledPolicy.compile p Γ = .ok cp →
+ cp.footprint = footprint cp.policy.toExpr cp.εnv
+:= by
+ simp [CompiledPolicy.compile, do_eq_ok]
+ intro p h₀ ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7fcd5317439f_2 | c6e1c6eabdba379c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/CompiledPolicies.lean | CompiledPolicies | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "cpset_compile_produces_the_right_acyclicity",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro temp ; have hf := cpset_compile_produces_the_right_footprint temp ; revert temp\n simp [... | [
{
"name": "cpset_compile_produces_the_right_footprint",
"text": "theorem cpset_compile_produces_the_right_footprint {ps : Policies} {cpset : CompiledPolicySet} {Γ : Validation.TypeEnv} :\n CompiledPolicySet.compile ps Γ = .ok cpset →\n cpset.footprint = footprints (cpset.policies.map Policy.toExpr) cpset.... | [
{
"name": "cpset_compile_produces_the_right_acyclicity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 476,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_... | 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,9 +30,29 @@
open Cedar.Spec Cedar.SymCC
+theorem cpset_compile_produces_the_right_footprint {ps : Policies} {cpset : CompiledPolicySet} {Γ : Validation.TypeEnv} :
+ CompiledPolicySet.compile ps Γ = .ok cpset →
+ cpset.footprint = footprints (cpset.policies.map Policy.toExpr) cpset.εnv
+:= by
+ simp [Comp... | {
"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_a74ab2321dd2_0 | b8481d8b128b9bad | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Evaluator.lean | Evaluator | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "left_bool_right_false_implies_and_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 simp only [producesBool] at h₁\n split at h₁ <;> try contradiction\n clear h₁ ; re... | [
{
"name": "and_bool_operands_is_boolean_and",
"text": "theorem and_bool_operands_is_boolean_and {b₁ b₂ : Bool} {e₁ e₂ : Expr} {request : Request} {entities : Entities} :\n evaluate e₁ request entities = .ok b₁ →\n evaluate e₂ request entities = .ok b₂ →\n evaluate (Expr.and e₁ e₂) request entities = .ok ... | [
{
"name": "left_bool_right_false_implies_and_false",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 482,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 4,
"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... | @@ -45,11 +45,32 @@
| .error _ => false
| _ => true
+theorem and_bool_operands_is_boolean_and {b₁ b₂ : Bool} {e₁ e₂ : Expr} {request : Request} {entities : Entities} :
+ evaluate e₁ request entities = .ok b₁ →
+ evaluate e₂ request entities = .ok b₂ →
+ evaluate (Expr.and e₁ e₂) request entities = .ok (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_a74ab2321dd2_1 | 402f88499b4b08c1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Evaluator.lean | Evaluator | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "and_true_implies_right_true",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h₁\n have h₂ := and_true_implies_left_true h₁\n simp only [evaluate, Result.as, h₂, Coe.coe, Value.asB... | [
{
"name": "and_true_implies_left_true",
"text": "theorem and_true_implies_left_true {e₁ e₂ : Expr} {request : Request} {entities : Entities} :\n evaluate (Expr.and e₁ e₂) request entities = .ok true →\n evaluate e₁ request entities = .ok true\n:= by\n intro h₁\n simp [evaluate, Result.as] at h₁\n gener... | [
{
"name": "and_true_implies_right_true",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1015,
"n_subproofs": 1,
"n_tactics": 21,
"cyclomatic": 8,
"n_automation": 7,
"n_rewrites": 0,
"n_structural": 5,
"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... | @@ -45,10 +45,49 @@
| .error _ => false
| _ => true
+theorem and_true_implies_left_true {e₁ e₂ : Expr} {request : Request} {entities : Entities} :
+ evaluate (Expr.and e₁ e₂) request entities = .ok true →
+ evaluate e₁ request entities = .ok true
+:= by
+ intro h₁
+ simp [evaluate, Result.as] at h₁
+ gener... | {
"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_a74ab2321dd2_2 | ae251ad31395e092 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Authorization/Evaluator.lean | Evaluator | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "policy_produces_bool_or_error",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Policy.toExpr\n apply and_produces_bool_or_error",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "and_produces_bool_or_error",
"text": "/--\n Every `and` expression produces either .ok bool or .error\n-/\ntheorem and_produces_bool_or_error (e₁ e₂ : Expr) (request : Request) (entities : Entities) :\n match (evaluate (Expr.and e₁ e₂) request entities) with\n | .ok (.prim (.bool _)) => true\n... | [
{
"name": "policy_produces_bool_or_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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... | @@ -46,6 +46,40 @@
| _ => true
/--
+ Every `and` expression produces either .ok bool or .error
+-/
+theorem and_produces_bool_or_error (e₁ e₂ : Expr) (request : Request) (entities : Entities) :
+ match (evaluate (Expr.and e₁ e₂) request entities) with
+ | .ok (.prim (.bool _)) => true
+ | .error _ => true
+ ... | {
"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_f577978243bd_0 | 0f5e4c150dba85b3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels.lean | Levels | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "typecheck_policy_with_level_is_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [typecheckPolicyWithLevel, typecheckPolicy] at htl\n split at htl <;> try contradiction\n ... | [
{
"name": "level_based_slicing_is_sound_expr",
"text": "theorem level_based_slicing_is_sound_expr {e : Expr} {n : Nat} {tx : TypedExpr} {c c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities}\n (hc : CapabilitiesInvariant c request entities)\n (hr : InstanceOfWellFormedEnvironment ... | [
{
"name": "typecheck_policy_with_level_is_sound",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1206,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 8,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only":... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,10 +43,89 @@
open Cedar.Spec
open Cedar.Validation
+theorem level_based_slicing_is_sound_expr {e : Expr} {n : Nat} {tx : TypedExpr} {c c₁ : Capabilities} {env : TypeEnv} {request : Request} {entities : Entities}
+ (hc : CapabilitiesInvariant c request entities)
+ (hr : InstanceOfWellFormedEnvironment reque... | {
"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_f577978243bd_1 | 34549609a78d35c0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels.lean | Levels | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "typecheck_policy_with_level_no_dne_on_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← typecheck_policy_with_level_is_sound hr htl]\n exact typecheck_policy_with_level_no_dne ... | [
{
"name": "typecheck_policy_with_level_is_sound",
"text": "theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}\n (hr : InstanceOfWellFormedEnvironment request entities env)\n (htl : typecheckPolicyWithLevel p n env ... | [
{
"name": "typecheck_policy_with_level_no_dne_on_slice",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 838,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_o... | 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... | @@ -109,6 +109,25 @@
exact level_based_slicing_is_sound_record hc hr ht hl ih
termination_by e
+theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}
+ (hr : InstanceOfWellFormedEnvironment request entities env)
+ (htl : ... | {
"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_f577978243bd_2 | f4bbce6b1e219345 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels.lean | Levels | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "typecheck_policy_with_level_no_dne_on_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← typecheck_policy_with_level_is_sound hr htl]\n exact typecheck_policy_with_level_no_dne ... | [
{
"name": "typecheck_policy_with_level_is_sound",
"text": "theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}\n (hr : InstanceOfWellFormedEnvironment request entities env)\n (htl : typecheckPolicyWithLevel p n env ... | [
{
"name": "typecheck_policy_at_level_with_environments_is_sound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1122,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"a... | 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... | @@ -109,10 +109,41 @@
exact level_based_slicing_is_sound_record hc hr ht hl ih
termination_by e
+theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}
+ (hr : InstanceOfWellFormedEnvironment request entities env)
+ (htl :... | {
"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_f577978243bd_3 | b9a34eea5140959b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels.lean | Levels | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "typecheck_policy_with_level_no_dne_on_slice",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← typecheck_policy_with_level_is_sound hr htl]\n exact typecheck_policy_with_level_no_dne ... | [
{
"name": "typecheck_policy_with_level_is_sound",
"text": "theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}\n (hr : InstanceOfWellFormedEnvironment request entities env)\n (htl : typecheckPolicyWithLevel p n env ... | [
{
"name": "validate_with_level_is_sound_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 665,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"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... | @@ -109,11 +109,42 @@
exact level_based_slicing_is_sound_record hc hr ht hl ih
termination_by e
+theorem typecheck_policy_with_level_is_sound {p : Policy} {tx : TypedExpr} {n : Nat} {env : TypeEnv} {request : Request} {entities : Entities}
+ (hr : InstanceOfWellFormedEnvironment request entities env)
+ (htl :... | {
"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_f577978243bd_4 | dae341f9842ce8d8 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels.lean | Levels | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "validate_with_level_no_dne_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace htl := List.forM_ok_implies_all_ok _ _ htl\n intro p hp\n exact typecheck_policy_at_level_with_envi... | [
{
"name": "typecheck_policy_at_level_with_environments_no_dne",
"text": "/--\nThe `_no_dne` analogue of `typecheck_policy_at_level_with_environments_is_sound`:\na policy that level-checks against every environment of the schema (and so, in\nparticular, the one the request inhabits), evaluated against a stor... | [
{
"name": "validate_with_level_no_dne_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 1066,
"n_subproofs": 0,
"n_tactics": 4,
"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... | @@ -44,6 +44,31 @@
open Cedar.Validation
/--
+The `_no_dne` analogue of `typecheck_policy_at_level_with_environments_is_sound`:
+a policy that level-checks against every environment of the schema (and so, in
+particular, the one the request inhabits), evaluated against a store closed at
+that level, never produces ... | {
"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_dc563ab1d3b5_0 | 582d3ab9e98dcb32 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyNeverErrorsOpt_eqv_verifyNeverErrors_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyNeverErrors, verifyNeverErrorsOpt]\n exact verifyEvaluateOpt_eqv_verifyEvaluate_... | [
{
"name": "verifyEvaluateOpt_eqv_verifyEvaluate_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are\nequivalent.\n-/\ntheorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : Compi... | [
{
"name": "verifyNeverErrorsOpt_eqv_verifyNeverErrors_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 550,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 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,30 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are
+equivalent.
+-/
+theorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} {φ : Term → 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_dc563ab1d3b5_1 | ebb4d1d7e9e6c811 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyNeverErrorsOpt_eqv_verifyNeverErrors_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyNeverErrors, verifyNeverErrorsOpt]\n exact verifyEvaluateOpt_eqv_verifyEvaluate_... | [
{
"name": "verifyEvaluateOpt_eqv_verifyEvaluate_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are\nequivalent.\n-/\ntheorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : Compi... | [
{
"name": "verifyAlwaysMatchesOpt_eqv_verifyAlwaysMatches_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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,6 +31,30 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are
+equivalent.
+-/
+theorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} {φ : Term → 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_dc563ab1d3b5_2 | 96dc2ffaf8576a3f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyNeverErrorsOpt_eqv_verifyNeverErrors_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyNeverErrors, verifyNeverErrorsOpt]\n exact verifyEvaluateOpt_eqv_verifyEvaluate_... | [
{
"name": "verifyEvaluateOpt_eqv_verifyEvaluate_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are\nequivalent.\n-/\ntheorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : Compi... | [
{
"name": "verifyNeverMatchesOpt_eqv_verifyNeverMatches_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 558,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automati... | 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,30 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluate` and `verifyEvaluateOpt` are
+equivalent.
+-/
+theorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} {φ : Term → 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_dc563ab1d3b5_3 | ee937f4c65160ea7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyMatchesEquivalentOpt_eqv_verifyMatchesEquivalent_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyMatchesEquivalent, verifyMatchesEquivalentOpt]\n exact verifyEvaluat... | [
{
"name": "verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are\nequivalent.\n-/\ntheorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁... | [
{
"name": "verifyMatchesEquivalentOpt_eqv_verifyMatchesEquivalent_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 753,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 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... | @@ -31,6 +31,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are
+equivalent.
+-/
+theorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁ p₂ wp₁ wp₂ : Policy} {cp₁ cp₂ : CompiledPolicy} {Γ : Validati... | {
"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_dc563ab1d3b5_4 | d965a56374fbc709 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyMatchesEquivalentOpt_eqv_verifyMatchesEquivalent_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyMatchesEquivalent, verifyMatchesEquivalentOpt]\n exact verifyEvaluat... | [
{
"name": "verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are\nequivalent.\n-/\ntheorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁... | [
{
"name": "verifyMatchesImpliesOpt_eqv_verifyMatchesImplies_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 729,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 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,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are
+equivalent.
+-/
+theorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁ p₂ wp₁ wp₂ : Policy} {cp₁ cp₂ : CompiledPolicy} {Γ : Validati... | {
"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_dc563ab1d3b5_5 | b9f1b9d61636c4d2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyMatchesEquivalentOpt_eqv_verifyMatchesEquivalent_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyMatchesEquivalent, verifyMatchesEquivalentOpt]\n exact verifyEvaluat... | [
{
"name": "verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are\nequivalent.\n-/\ntheorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁... | [
{
"name": "verifyMatchesDisjointOpt_eqv_verifyMatchesDisjoint_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 737,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"au... | 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,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyEvaluatePair` and `verifyEvaluatePairOpt` are
+equivalent.
+-/
+theorem verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok {p₁ p₂ wp₁ wp₂ : Policy} {cp₁ cp₂ : CompiledPolicy} {Γ : Validati... | {
"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_dc563ab1d3b5_6 | 0b4d1ddac365a71a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyImplies, verifyImpliesOpt]\n exact verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
... | [
{
"name": "verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are\nequivalent.\n-/\ntheorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps... | [
{
"name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 718,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"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... | @@ -31,6 +31,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are
+equivalent.
+-/
+theorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {cpset₁ cpset₂ : CompiledPolicySet... | {
"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_dc563ab1d3b5_7 | da8f365376d69ca8 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "verifyAlwaysAllowsOpt_eqv_verifyAlwaysAllows_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyAlwaysAllows, verifyAlwaysAllowsOpt]\n intro hcpset hwps\n apply verifyImplie... | [
{
"name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyImplies` and `verifyImpliesOpt` are\nequivalent.\n-/\ntheorem verifyImpliesOpt_eqv_verifyImplies_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {c... | [
{
"name": "verifyAlwaysAllowsOpt_eqv_verifyAlwaysAllows_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 939,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automati... | 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... | @@ -67,6 +67,21 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyImplies` and `verifyImpliesOpt` are
+equivalent.
+-/
+theorem verifyImpliesOpt_eqv_verifyImplies_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {cpset₁ cpset₂ : CompiledPolicySet} {Γ : Validation.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_dc563ab1d3b5_8 | f9c9d0dffcffe28a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "verifyAlwaysAllowsOpt_eqv_verifyAlwaysAllows_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyAlwaysAllows, verifyAlwaysAllowsOpt]\n intro hcpset hwps\n apply verifyImplie... | [
{
"name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyImplies` and `verifyImpliesOpt` are\nequivalent.\n-/\ntheorem verifyImpliesOpt_eqv_verifyImplies_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {c... | [
{
"name": "verifyAlwaysDeniesOpt_eqv_verifyAlwaysDenies_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 966,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 2,
"automati... | 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... | @@ -67,6 +67,21 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyImplies` and `verifyImpliesOpt` are
+equivalent.
+-/
+theorem verifyImpliesOpt_eqv_verifyImplies_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {cpset₁ cpset₂ : CompiledPolicySet} {Γ : Validation.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_dc563ab1d3b5_9 | 8d78bb5acea3f57e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyImplies, verifyImpliesOpt]\n exact verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
... | [
{
"name": "verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are\nequivalent.\n-/\ntheorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps... | [
{
"name": "verifyEquivalentOpt_eqv_verifyEquivalent_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 742,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -31,6 +31,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are
+equivalent.
+-/
+theorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {cpset₁ cpset₂ : CompiledPolicySet... | {
"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_dc563ab1d3b5_10 | 3d8cfccb2fe4e119 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean | Verifier | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "verifyImpliesOpt_eqv_verifyImplies_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyImplies, verifyImpliesOpt]\n exact verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
... | [
{
"name": "verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok",
"text": "/--\nThis theorem covers the \"happy path\" -- showing that if optimized policy\ncompilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are\nequivalent.\n-/\ntheorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps... | [
{
"name": "verifyDisjointOpt_eqv_verifyDisjoint_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 725,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"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... | @@ -31,6 +31,42 @@
/--
This theorem covers the "happy path" -- showing that if optimized policy
+compilation succeeds, then `verifyIsAuthorized` and `verifyIsAuthorizedOpt` are
+equivalent.
+-/
+theorem verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok {ps₁ ps₂ wps₁ wps₂ : Policies} {cpset₁ cpset₂ : CompiledPolicySet... | {
"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_785cb8867545_0 | 142523f90e0f798a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Slice/Reachable/Record.lean | Record | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "checked_eval_entity_reachable_record",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨ rvs, hv ⟩ := record_produces_record_value he\n subst hv\n cases ha\n rename_i v a path' hfv... | [
{
"name": "record_entity_access_implies_attr_entity_access",
"text": "theorem record_entity_access_implies_attr_entity_access {atx : TypedExpr} {rtxs : List (Attr × TypedExpr)} {ty : CedarType} {n nmax : Nat} {a : Attr} {path : List Attr}\n (hl : (TypedExpr.record rtxs ty).EntityAccessAtLevel env n nmax (a... | [
{
"name": "checked_eval_entity_reachable_record",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1034,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"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... | @@ -40,6 +40,17 @@
have ⟨_, _, hatx, ht''⟩ := find_make_xs_find_make_txs hfat hx
simp [htx, hatx, ht'']
+theorem record_entity_access_implies_attr_entity_access {atx : TypedExpr} {rtxs : List (Attr × TypedExpr)} {ty : CedarType} {n nmax : Nat} {a : Attr} {path : List Attr}
+ (hl : (TypedExpr.record rtxs ty).En... | {
"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_987853b175cf_0 | 07583b7029788bf9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Validation/Levels/BinaryApp.lean | BinaryApp | 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_binary_app",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n replace ⟨tx₁, c₁, tx₂, c₂, htx₁, htx₂, ty, htx⟩ := type_of_binaryApp_inversion ht\n subst tx\n s... | [
{
"name": "level_based_slicing_is_sound_inₑ",
"text": "theorem level_based_slicing_is_sound_inₑ {e₁ : Expr} {euid₁ euid₂ : EntityUID} {n : Nat} {c₀ c₁ : Capabilities} {entities : Entities}\n (hc : CapabilitiesInvariant c₀ request entities)\n (hr : InstanceOfWellFormedEnvironment request entities env)\n (... | [
{
"name": "level_based_slicing_is_sound_binary_app",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 52,
"n_chars": 2431,
"n_subproofs": 3,
"n_tactics": 52,
"cyclomatic": 20,
"n_automation": 10,
"n_rewrites": 6,
"n_structural": 16,
"automation_... | 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... | @@ -47,6 +47,19 @@
) <;>
simp only
+theorem level_based_slicing_is_sound_inₑ {e₁ : Expr} {euid₁ euid₂ : EntityUID} {n : Nat} {c₀ c₁ : Capabilities} {entities : Entities}
+ (hc : CapabilitiesInvariant c₀ request entities)
+ (hr : InstanceOfWellFormedEnvironment request entities env)
+ (ht : typeOf e₁ c₀ e... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_236093948e4f_0 | 29cb88f6603293b0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/TPE/WellTyped/Call.lean | Call | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "partial_eval_well_typed_call",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros h_args_wt h_wf h_ref h_wt\n simp only [TPE.evaluate, TPE.call, List.any_eq_true]\n simp only [List.... | [
{
"name": "ext_well_typed_after_map",
"text": "theorem ext_well_typed_after_map {xfn args ty env f} :\n ExtResidualWellTyped xfn args ty →\n (∀ arg, arg ∈ args → Residual.WellTyped env arg → Residual.WellTyped env (f arg)) →\n (∀ arg, arg ∈ args → (f arg).typeOf = arg.typeOf) →\n (∀ x, x.asValue.isSome ... | [
{
"name": "partial_eval_well_typed_call",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 183,
"n_chars": 6261,
"n_subproofs": 8,
"n_tactics": 180,
"cyclomatic": 39,
"n_automation": 21,
"n_rewrites": 30,
"n_structural": 56,
"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... | @@ -32,8 +32,242 @@
open Cedar.TPE
-- Helper theorems for record key preservation and type lifting
+theorem ext_well_typed_after_map {xfn args ty env f} :
+ ExtResidualWellTyped xfn args ty →
+ (∀ arg, arg ∈ args → Residual.WellTyped env arg → Residual.WellTyped env (f arg)) →
+ (∀ arg, arg ∈ args → (f arg).type... | {
"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_84e66ae63667_0 | 8a20271efedb73e1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluateQueries.lean | VerifyEvaluateQueries | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "verifyAlwaysMatches_wbeq",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwo : WellBehavedEvaluateQuery.WellFormedOutput (eq · (⊙true)) := by\n simp only [WellBehavedEvaluateQuer... | [
{
"name": "value_type_bool_implies_bool",
"text": "theorem value_type_bool_implies_bool {v : Value} {t : Term} :\n v ∼ t → t.typeOf = .bool → ∃ b, v = .prim (.bool b)\n:= by\n intro hs hty\n simp only [Same.same, SameValues] at hs\n cases t\n case prim p =>\n cases p\n case bool b =>\n simp ... | [
{
"name": "verifyAlwaysMatches_wbeq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2131,
"n_subproofs": 6,
"n_tactics": 43,
"cyclomatic": 3,
"n_automation": 12,
"n_rewrites": 7,
"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... | @@ -24,9 +24,67 @@
open Data Spec SymCC Factory
+theorem value_type_bool_implies_bool {v : Value} {t : Term} :
+ v ∼ t → t.typeOf = .bool → ∃ b, v = .prim (.bool b)
+:= by
+ intro hs hty
+ simp only [Same.same, SameValues] at hs
+ cases t
+ case prim p =>
+ cases p
+ case bool b =>
+ simp only [Ter... | {
"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_84e66ae63667_1 | be2d645776bb9b82 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Verifier/VerifyEvaluateQueries.lean | VerifyEvaluateQueries | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "verifyAlwaysMatches_wbeq",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwo : WellBehavedEvaluateQuery.WellFormedOutput (eq · (⊙true)) := by\n simp only [WellBehavedEvaluateQuer... | [
{
"name": "value_type_bool_implies_bool",
"text": "theorem value_type_bool_implies_bool {v : Value} {t : Term} :\n v ∼ t → t.typeOf = .bool → ∃ b, v = .prim (.bool b)\n:= by\n intro hs hty\n simp only [Same.same, SameValues] at hs\n cases t\n case prim p =>\n cases p\n case bool b =>\n simp ... | [
{
"name": "verifyNeverMatches_wbeq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2327,
"n_subproofs": 7,
"n_tactics": 46,
"cyclomatic": 3,
"n_automation": 15,
"n_rewrites": 9,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -24,9 +24,70 @@
open Data Spec SymCC Factory
+theorem value_type_bool_implies_bool {v : Value} {t : Term} :
+ v ∼ t → t.typeOf = .bool → ∃ b, v = .prim (.bool b)
+:= by
+ intro hs hty
+ simp only [Same.same, SameValues] at hs
+ cases t
+ case prim p =>
+ cases p
+ case bool b =>
+ simp only [Ter... | {
"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_acfa6d7d03e9_0 | 534d1a22b35f0589 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 2 | [
{
"theorem_name": "all_attach₂",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold attach₂\n rw [all_pmap_subtype]",
"n_chars": 46,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "all_pmap_subtype",
"text": "/--\n Copied from Mathlib. We can delete this if it gets added to Batteries.\n-/\npublic theorem all_pmap_subtype\n {p : α → Prop}\n (f : α → Bool)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.all (List.pmap Subtype.mk as h) (λ x : { a : α // p a } => f x.v... | [
{
"name": "all_attach₂",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 221,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"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... | @@ -37,6 +37,22 @@
/--
Copied from Mathlib. We can delete this if it gets added to Batteries.
-/
+public theorem all_pmap_subtype
+ {p : α → Prop}
+ (f : α → Bool)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.all (List.pmap Subtype.mk as h) (λ x : { a : α // p a } => f x.val)
+ =
+ List.all as f
+... | {
"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_acfa6d7d03e9_1 | 6dd5c6cbaf6c149b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "map₁_eq_map",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [map₁, attach_def, map_pmap_subtype]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic":... | [
{
"name": "map_pmap_subtype",
"text": "/--\n Copied from Mathlib. We can delete this if it gets added to Batteries.\n-/\npublic theorem map_pmap_subtype\n {p : α → Prop}\n (f : α → β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.map (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)... | [
{
"name": "map₁_eq_map",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 181,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -60,6 +60,20 @@
let ⟨h₁, h₂⟩ := forall_mem_cons.1 h
rw [map, map, h₁, map_congr h₂]
+/--
+ Copied from Mathlib. We can delete this if it gets added to Batteries.
+-/
+public theorem map_pmap_subtype
+ {p : α → Prop}
+ (f : α → β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.map (λ x : { a : α... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_acfa6d7d03e9_2 | ad4f8b5d6fc89d75 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "map₁_eq_map",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [map₁, attach_def, map_pmap_subtype]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic":... | [
{
"name": "map_pmap_subtype",
"text": "/--\n Copied from Mathlib. We can delete this if it gets added to Batteries.\n-/\npublic theorem map_pmap_subtype\n {p : α → Prop}\n (f : α → β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.map (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)... | [
{
"name": "map₂_eq_map",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 279,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -60,6 +60,20 @@
let ⟨h₁, h₂⟩ := forall_mem_cons.1 h
rw [map, map, h₁, map_congr h₂]
+/--
+ Copied from Mathlib. We can delete this if it gets added to Batteries.
+-/
+public theorem map_pmap_subtype
+ {p : α → Prop}
+ (f : α → β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.map (λ x : { a : α... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_acfa6d7d03e9_3 | 6ead670e3fcf1dd2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "map₁_eq_map",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [map₁, attach_def, map_pmap_subtype]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic":... | [
{
"name": "map_pmap_subtype",
"text": "/--\n Copied from Mathlib. We can delete this if it gets added to Batteries.\n-/\npublic theorem map_pmap_subtype\n {p : α → Prop}\n (f : α → β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.map (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)... | [
{
"name": "map₃_eq_map",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 285,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -60,6 +60,20 @@
let ⟨h₁, h₂⟩ := forall_mem_cons.1 h
rw [map, map, h₁, map_congr h₂]
+/--
+ Copied from Mathlib. We can delete this if it gets added to Batteries.
+-/
+public theorem map_pmap_subtype
+ {p : α → Prop}
+ (f : α → β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.map (λ x : { a : α... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_acfa6d7d03e9_4 | d5dd4be459a21b5f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 2 | [
{
"theorem_name": "map₂_eq_map_snd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [map₂, attach₂, map_pmap_subtype_snd]",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic":... | [
{
"name": "map_pmap_subtype_snd",
"text": "/--\n Not actually a special case of `map_pmap_subtype` -- you can use this in\n places you can't use `map_pmap_subtype` because the LHS function (being\n mapped) doesn't fit the `map_pmap_subtype` form but does fit this form (where\n the application of `f` is ... | [
{
"name": "map₂_eq_map_snd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 640,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -60,6 +60,24 @@
let ⟨h₁, h₂⟩ := forall_mem_cons.1 h
rw [map, map, h₁, map_congr h₂]
+/--
+ Not actually a special case of `map_pmap_subtype` -- you can use this in
+ places you can't use `map_pmap_subtype` because the LHS function (being
+ mapped) doesn't fit the `map_pmap_subtype` form but does fit 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_acfa6d7d03e9_5 | 80d487d42622899e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 2 | [
{
"theorem_name": "map₂_eq_map_snd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [map₂, attach₂, map_pmap_subtype_snd]",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic":... | [
{
"name": "map_pmap_subtype_snd",
"text": "/--\n Not actually a special case of `map_pmap_subtype` -- you can use this in\n places you can't use `map_pmap_subtype` because the LHS function (being\n mapped) doesn't fit the `map_pmap_subtype` form but does fit this form (where\n the application of `f` is ... | [
{
"name": "map₃_eq_map_snd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 382,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -60,6 +60,24 @@
let ⟨h₁, h₂⟩ := forall_mem_cons.1 h
rw [map, map, h₁, map_congr h₂]
+/--
+ Not actually a special case of `map_pmap_subtype` -- you can use this in
+ places you can't use `map_pmap_subtype` because the LHS function (being
+ mapped) doesn't fit the `map_pmap_subtype` form but does fit 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_acfa6d7d03e9_6 | d2deb191f8c549f0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_singleton_right_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor <;> intro h\n case mp =>\n have ⟨xhd, xtl, hx, h, hxs⟩ := forall₂_cons_right_iff.mp h\n rw ... | [
{
"name": "forall₂_cons_right_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_cons_right_iff {b l u} :\n Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=\n Iff.intro\n (fun h =>\n match u, h with\n | b :: u', Forall₂.cons h₁ h₂ => ⟨b, u', h₁, h₂, ... | [
{
"name": "forall₂_singleton_right_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 441,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 4,
"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... | @@ -80,9 +80,32 @@
public theorem forall₂_nil_right_iff {l} : Forall₂ R l nil ↔ l = nil :=
⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_cons_right_iff {b l u} :
+ Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=
+ If... | {
"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_acfa6d7d03e9_7 | 5c0a88d3fa65cc9a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_singleton_right_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor <;> intro h\n case mp =>\n have ⟨xhd, xtl, hx, h, hxs⟩ := forall₂_cons_right_iff.mp h\n rw ... | [
{
"name": "forall₂_cons_right_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_cons_right_iff {b l u} :\n Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=\n Iff.intro\n (fun h =>\n match u, h with\n | b :: u', Forall₂.cons h₁ h₂ => ⟨b, u', h₁, h₂, ... | [
{
"name": "forall₂_pair_right_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 620,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 3,
"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... | @@ -80,9 +80,33 @@
public theorem forall₂_nil_right_iff {l} : Forall₂ R l nil ↔ l = nil :=
⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_cons_right_iff {b l u} :
+ Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=
+ If... | {
"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_acfa6d7d03e9_8 | 71fdc88f9030da37 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_singleton_right_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor <;> intro h\n case mp =>\n have ⟨xhd, xtl, hx, h, hxs⟩ := forall₂_cons_right_iff.mp h\n rw ... | [
{
"name": "forall₂_cons_right_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_cons_right_iff {b l u} :\n Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=\n Iff.intro\n (fun h =>\n match u, h with\n | b :: u', Forall₂.cons h₁ h₂ => ⟨b, u', h₁, h₂, ... | [
{
"name": "forall₂_iff_map_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 725,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 11,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 7,
"automation_only": false,
"max_n... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -74,10 +74,39 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_cons_right_iff {b l u} :
+ Forall₂ R u (b :: l) ↔ ∃ a u', R a b ∧ Forall₂ R u' l ∧ u = a :: u' :=
+ Iff.intro
+ (fun h =>
+ match u, h with
+ | b :: u', F... | {
"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_acfa6d7d03e9_9 | f09bd61999689714 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "forall₂_fun_subset_implies",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 512,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"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... | @@ -74,6 +74,29 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+... | {
"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_acfa6d7d03e9_10 | ba2117cdf29a4626 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "forall₂_fun_equiv_implies",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"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... | @@ -74,6 +74,29 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+... | {
"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_acfa6d7d03e9_11 | cef6e0bfead152d2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_trans_ish",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n induction h₁ generalizing zs with\n | nil => simp [forall₂_nil_left_iff] at h₂ ; simp [h₂]\n | cons hhd₁ ht... | [
{
"name": "forall₂_nil_left_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=\n ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "forall₂_trans_ish",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 752,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nes... | 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... | @@ -74,6 +74,12 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=
+ ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+
/-- kind of a transitivity property, if you squint -/
pu... | {
"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_acfa6d7d03e9_12 | 3912767f1c9bbb00 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "mapM₁_eq_mapM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [mapM₁, attach_def, mapM_pmap_subtype]",
"n_chars": 56,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomat... | [
{
"name": "mapM_pmap_subtype",
"text": "theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]\n {p : α → Prop}\n (f : α → m β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)\n =\n List.mapM f as\n:= by\n rw [←List.mapM'_eq_ma... | [
{
"name": "mapM₁_eq_mapM",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 231,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -79,12 +79,26 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]
+ {p : α → Prop}
+ (f : α → m β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)
+ =
+ List... | {
"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_acfa6d7d03e9_13 | d5da8d4c6c355981 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "mapM₁_eq_mapM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [mapM₁, attach_def, mapM_pmap_subtype]",
"n_chars": 56,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomat... | [
{
"name": "mapM_pmap_subtype",
"text": "theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]\n {p : α → Prop}\n (f : α → m β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)\n =\n List.mapM f as\n:= by\n rw [←List.mapM'_eq_ma... | [
{
"name": "mapM₂_eq_mapM",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -74,12 +74,26 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]
+ {p : α → Prop}
+ (f : α → m β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)
+ =
+ List... | {
"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_acfa6d7d03e9_14 | 956d8aa8c4181090 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "mapM₂_eq_map_snd",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [mapM₂, attach₂]\n exact mapM_pmap_subtype_snd f xs _",
"n_chars": 73,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "mapM_pmap_subtype_snd",
"text": "theorem mapM_pmap_subtype_snd [Monad m] [LawfulMonad m]\n {p : (α × β) → Prop}\n (f : β → m γ)\n (xs : List (α × β))\n (h : ∀ pair ∈ xs, p pair)\n : (List.mapM (λ x : { pair : (α × β) // p pair } => do pure (x.val.fst, ← f x.val.snd))) (List.pmap Subtype.mk x... | [
{
"name": "mapM₂_eq_map_snd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 556,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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... | @@ -74,6 +74,19 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+theorem mapM_pmap_subtype_snd [Monad m] [LawfulMonad m]
+ {p : (α × β) → Prop}
+ (f : β → m γ)
+ (xs : List (α × β))
+ (h : ∀ pair ∈ xs, p pair)
+ : (List.mapM (λ x : { pair : (α × β) // p pair } => do pure (x.val.fst, ← f... | {
"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_acfa6d7d03e9_15 | ef911885a2ad2569 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "mapM₁_eq_mapM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [mapM₁, attach_def, mapM_pmap_subtype]",
"n_chars": 56,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomat... | [
{
"name": "mapM_pmap_subtype",
"text": "theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]\n {p : α → Prop}\n (f : α → m β)\n (as : List α)\n (h : ∀ a, a ∈ as → p a)\n : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)\n =\n List.mapM f as\n:= by\n rw [←List.mapM'_eq_ma... | [
{
"name": "mapM₃_eq_mapM",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -74,12 +74,26 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+theorem mapM_pmap_subtype [Monad m] [LawfulMonad m]
+ {p : α → Prop}
+ (f : α → m β)
+ (as : List α)
+ (h : ∀ a, a ∈ as → p a)
+ : List.mapM (λ x : { a : α // p a } => f x.val) (List.pmap Subtype.mk as h)
+ =
+ List... | {
"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_acfa6d7d03e9_16 | 4a910f6f6695b7a7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "mapM_preserves_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← mapM'_eq_mapM]\n exact mapM'_preserves_length",
"n_chars": 59,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "mapM'_preserves_length",
"text": "public theorem mapM'_preserves_length :\n List.mapM' f xs = Except.ok ys →\n xs.length = ys.length\n:= by\n cases xs\n case nil =>\n simp only [mapM'_nil, pure, Except.pure, Except.ok.injEq, nil_eq, length_nil]\n intro h ; subst h ; simp\n case cons xh... | [
{
"name": "mapM_preserves_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -74,10 +74,33 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem mapM'_preserves_length :
+ List.mapM' f xs = Except.ok ys →
+ xs.length = ys.length
+:= by
+ cases xs
+ case nil =>
+ simp only [mapM'_nil, pure, Except.pure, Except.ok.injEq, nil_eq, length_nil]
+ 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_acfa6d7d03e9_17 | bea2c29b44b2d507 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_trans_ish",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n induction h₁ generalizing zs with\n | nil => simp [forall₂_nil_left_iff] at h₂ ; simp [h₂]\n | cons hhd₁ ht... | [
{
"name": "forall₂_nil_left_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=\n ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "mapM'_ok_iff_forall₂",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 43,
"n_chars": 1431,
"n_subproofs": 0,
"n_tactics": 39,
"cyclomatic": 8,
"n_automation": 11,
"n_rewrites": 4,
"n_structural": 11,
"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... | @@ -77,6 +77,12 @@
/--
Copied from Mathlib
-/
+public theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=
+ ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+
+/--
+ Copied from Mathlib
+-/
public theorem forall₂_cons_left_iff {a l u} :
Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂... | {
"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_acfa6d7d03e9_18 | 117a02ccc9274225 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_trans_ish",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n induction h₁ generalizing zs with\n | nil => simp [forall₂_nil_left_iff] at h₂ ; simp [h₂]\n | cons hhd₁ ht... | [
{
"name": "forall₂_nil_left_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=\n ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "mapM'_some_iff_forall₂",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 62,
"n_chars": 1840,
"n_subproofs": 0,
"n_tactics": 56,
"cyclomatic": 10,
"n_automation": 12,
"n_rewrites": 5,
"n_structural": 18,
"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... | @@ -77,6 +77,12 @@
/--
Copied from Mathlib
-/
+public theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=
+ ⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+
+/--
+ Copied from Mathlib
+-/
public theorem forall₂_cons_left_iff {a l u} :
Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂... | {
"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_acfa6d7d03e9_19 | 46862e52c7d9a5fa | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 2 | [
{
"theorem_name": "mapM'_ok_iff_forall₂",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n case mp =>\n intro h₁\n induction xs generalizing ys\n case nil =>\n simp only [mapM'_ni... | [
{
"name": "forall₂_cons_left_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_cons_left_iff {a l u} :\n Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂ R l u' ∧ u = b :: u' :=\n Iff.intro\n (fun h =>\n match u, h with\n | b :: u', Forall₂.cons h₁ h₂ => ⟨b, u', h₁, h₂, rf... | [
{
"name": "mapM_ok_iff_forall₂",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nes... | 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... | @@ -80,10 +80,60 @@
public theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=
⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_cons_left_iff {a l u} :
+ Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂ R l u' ∧ u = b :: u' :=
+ Iff... | {
"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_acfa6d7d03e9_20 | bd1dec8fef9ca817 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 2 | [
{
"theorem_name": "mapM'_ok_iff_forall₂",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n case mp =>\n intro h₁\n induction xs generalizing ys\n case nil =>\n simp only [mapM'_ni... | [
{
"name": "forall₂_cons_left_iff",
"text": "/--\n Copied from Mathlib\n-/\npublic theorem forall₂_cons_left_iff {a l u} :\n Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂ R l u' ∧ u = b :: u' :=\n Iff.intro\n (fun h =>\n match u, h with\n | b :: u', Forall₂.cons h₁ h₂ => ⟨b, u', h₁, h₂, rf... | [
{
"name": "mapM_some_iff_forall₂",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -80,11 +80,77 @@
public theorem forall₂_nil_left_iff {l} : Forall₂ R nil l ↔ l = nil :=
⟨fun H => by cases H; rfl, by rintro rfl; exact Forall₂.nil⟩
+/--
+ Copied from Mathlib
+-/
+public theorem forall₂_cons_left_iff {a l u} :
+ Forall₂ R (a :: l) u ↔ ∃ b u', R a b ∧ Forall₂ R l u' ∧ u = b :: u' :=
+ Iff... | {
"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_acfa6d7d03e9_21 | 8b751ecd0781e3ea | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM'_ok_implies_all_ok",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 438,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_22 | 206043aa849d7ad0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM_ok_implies_all_ok",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 248,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_23 | 1a5533a065068fc5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "all_ok_implies_mapM_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.mapM'_eq_mapM]\n exact all_ok_implies_mapM'_ok",
"n_chars": 65,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "all_ok_implies_mapM'_ok",
"text": "public theorem all_ok_implies_mapM'_ok {α β γ} {f : α → Except γ β} {xs : List α} :\n (∀ x ∈ xs, ∃ y, f x = .ok y) →\n ∃ ys, List.mapM' f xs = .ok ys\n:= by\n intro h₁\n induction xs\n case nil => exists []\n case cons xhd xtl ih =>\n simp only [mem_con... | [
{
"name": "all_ok_implies_mapM_ok",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 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... | @@ -74,10 +74,26 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem all_ok_implies_mapM'_ok {α β γ} {f : α → Except γ β} {xs : List α} :
+ (∀ x ∈ xs, ∃ y, f x = .ok y) →
+ ∃ ys, List.mapM' f xs = .ok ys
+:= by
+ intro h₁
+ induction xs
+ case nil => exists []
+ case cons 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_acfa6d7d03e9_24 | 19146348d9259c55 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_right",
"text": "public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ y ∈ ys, ∃ x ∈ xs, R x y\n:= by\n intro h\n induction h\n case nil =>\n simp only [not_mem_nil, false_and, exists_false, imp_sel... | [
{
"name": "mapM'_ok_implies_all_from_ok",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 449,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -93,6 +93,25 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+ ∀ y ∈ ys, ∃ x ∈ xs, R x y
+:= by
+ intro h
+ induction h
+ case nil =>
+ simp only [not_mem_ni... | {
"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_acfa6d7d03e9_25 | c451b2a13569da30 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_right",
"text": "public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ y ∈ ys, ∃ x ∈ xs, R x y\n:= by\n intro h\n induction h\n case nil =>\n simp only [not_mem_nil, false_and, exists_false, imp_sel... | [
{
"name": "mapM_ok_implies_all_from_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 258,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -93,6 +93,25 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+ ∀ y ∈ ys, ∃ x ∈ xs, R x y
+:= by
+ intro h
+ induction h
+ case nil =>
+ simp only [not_mem_ni... | {
"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_acfa6d7d03e9_26 | 3ec1639c805f0d0f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "all_from_ok_implies_mapM_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n have ⟨xs, h₂⟩ := all_from_ok_implies_mapM'_ok h\n rw [List.mapM'_eq_mapM] at h₂\n exists xs",
... | [
{
"name": "all_from_ok_implies_mapM'_ok",
"text": "public theorem all_from_ok_implies_mapM'_ok {α β γ} {f : α → Except γ β} {ys : List β} :\n (∀ y ∈ ys, ∃ x, f x = .ok y) →\n ∃ xs, List.mapM' f xs = .ok ys\n:= by\n intro h₁\n induction ys\n case nil => exists []\n case cons yhd ytl ih =>\n simp onl... | [
{
"name": "all_from_ok_implies_mapM_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 291,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -74,10 +74,28 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem all_from_ok_implies_mapM'_ok {α β γ} {f : α → Except γ β} {ys : List β} :
+ (∀ y ∈ ys, ∃ x, f x = .ok y) →
+ ∃ xs, List.mapM' f xs = .ok ys
+:= by
+ intro h₁
+ induction ys
+ case nil => exists []
+ case 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_acfa6d7d03e9_27 | 01a59fce2e21016c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "mapM_error_implies_exists_error",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.mapM'_eq_mapM]\n exact mapM'_error_implies_exists_error",
"n_chars": 74,
"n_subproofs":... | [
{
"name": "mapM'_error_implies_exists_error",
"text": "/--\n The converse is not true:\n counterexample `xs` is `[1, 2]` and `f` is `Except.error`.\n In that case, `f 2 = .error 2` but `xs.mapM' f = .error 1`.\n\n But for a limited converse, see `element_error_implies_mapM_error`\n-/\npublic theorem map... | [
{
"name": "mapM_error_implies_exists_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 249,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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... | @@ -74,9 +74,42 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+/--
+ The converse is not true:
+ counterexample `xs` is `[1, 2]` and `f` is `Except.error`.
+ In that case, `f 2 = .error 2` but `xs.mapM' f = .error 1`.
+
+ But for a limited converse, see `element_error_implies_mapM_erro... | {
"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_acfa6d7d03e9_28 | 3d9ae9c965f3c8b7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "element_error_implies_mapM'_error",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 18,
"n_chars": 550,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_29 | 13aa2563b664bd01 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "element_error_implies_mapM_error",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 9,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_30 | 2bd35b2f6a6a517c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "element_to_option_none_implies_mapM_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 11,
"n_chars": 357,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_31 | 4c281061ba64f549 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "mapM_ok_eq_filterMap",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.mapM'_eq_mapM]\n exact mapM'_ok_eq_filterMap",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "mapM'_ok_eq_filterMap",
"text": "public theorem mapM'_ok_eq_filterMap {α β} {f : α → Except ε β} {xs : List α} {ys : List β} :\n xs.mapM' f = .ok ys →\n xs.filterMap (λ x => match f x with | .ok y => some y | .error _ => none) = ys\n:= by\n intro h\n induction xs generalizing ys\n case nil =... | [
{
"name": "mapM_ok_eq_filterMap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 276,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_ne... | 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... | @@ -74,10 +74,31 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem mapM'_ok_eq_filterMap {α β} {f : α → Except ε β} {xs : List α} {ys : List β} :
+ xs.mapM' f = .ok ys →
+ xs.filterMap (λ x => match f x with | .ok y => some y | .error _ => none) = ys
+:= by
+ intro h
+ indu... | {
"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_acfa6d7d03e9_32 | 40ca090d889bb6bc | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM'_some_implies_all_some",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 448,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_33 | db17a578dcae64a9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM_some_implies_all_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 254,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_34 | 7499ceee41984bfc | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "mapM_some_iff_forall₂",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.mapM'_eq_mapM]\n exact mapM'_some_iff_forall₂",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "mapM'_some_iff_forall₂",
"text": "/-- Copy of mapM'_ok_iff_forall₂ but for option instead of exception -/\npublic theorem mapM'_some_iff_forall₂ {α β} {f : α → Option β} {xs : List α} {ys : List β} :\n List.mapM' f xs = .some ys ↔\n List.Forall₂ (λ x y => f x = .some y) xs ys\n:= by\n construc... | [
{
"name": "mem_mapM_some_implies_exists_unmapped",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 336,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": ... | 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... | @@ -93,10 +93,71 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/-- Copy of mapM'_ok_iff_forall₂ but for option instead of exception -/
+public theorem mapM'_some_iff_forall₂ {α β} {f : α → Option β} {xs : List α} {ys : List β} :
+ List.mapM' f xs = .some ys ↔
+ List.Forall₂ (λ x y => ... | {
"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_acfa6d7d03e9_35 | b96e29fce291a0dd | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 35 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "all_some_implies_mapM_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.mapM'_eq_mapM]\n exact all_some_implies_mapM'_some",
"n_chars": 69,
"n_subproofs": 0,
"n... | [
{
"name": "all_some_implies_mapM'_some",
"text": "public theorem all_some_implies_mapM'_some {α β} {f : α → Option β} {xs : List α} :\n (∀ x ∈ xs, ∃ y, f x = some y) →\n ∃ ys, List.mapM' f xs = some ys\n:= by\n intro h₁\n induction xs\n case nil => exists []\n case cons xhd xtl ih =>\n simp only [m... | [
{
"name": "all_some_implies_mapM_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 240,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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... | @@ -74,10 +74,26 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem all_some_implies_mapM'_some {α β} {f : α → Option β} {xs : List α} :
+ (∀ x ∈ xs, ∃ y, f x = some y) →
+ ∃ ys, List.mapM' f xs = some ys
+:= by
+ intro h₁
+ induction xs
+ case nil => exists []
+ case cons... | {
"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_acfa6d7d03e9_36 | f8bbf84218a9b7a1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 36 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_right",
"text": "public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ y ∈ ys, ∃ x ∈ xs, R x y\n:= by\n intro h\n induction h\n case nil =>\n simp only [not_mem_nil, false_and, exists_false, imp_sel... | [
{
"name": "mapM'_some_implies_all_from_some",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 459,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false... | 4 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -93,6 +93,25 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+ ∀ y ∈ ys, ∃ x ∈ xs, R x y
+:= by
+ intro h
+ induction h
+ case nil =>
+ simp only [not_mem_ni... | {
"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_acfa6d7d03e9_37 | 48b1548d542deaa6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 37 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 3 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_right",
"text": "public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ y ∈ ys, ∃ x ∈ xs, R x y\n:= by\n intro h\n induction h\n case nil =>\n simp only [not_mem_nil, false_and, exists_false, imp_sel... | [
{
"name": "mapM_some_implies_all_from_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -93,6 +93,25 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+public theorem forall₂_implies_all_right {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →
+ ∀ y ∈ ys, ∃ x ∈ xs, R x y
+:= by
+ intro h
+ induction h
+ case nil =>
+ simp only [not_mem_ni... | {
"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_acfa6d7d03e9_38 | b6381015c9e821a2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 38 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 1 | [
{
"theorem_name": "all_from_some_implies_mapM_some",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n have ⟨xs, h₂⟩ := all_from_some_implies_mapM'_some h\n rw [List.mapM'_eq_mapM] at h₂\n exists x... | [
{
"name": "all_from_some_implies_mapM'_some",
"text": "public theorem all_from_some_implies_mapM'_some {α β} {f : α → Option β} {ys : List β} :\n (∀ y ∈ ys, ∃ x, f x = some y) →\n ∃ xs, List.mapM' f xs = some ys\n:= by\n intro h₁\n induction ys\n case nil => exists []\n case cons yhd ytl ih =>\n si... | [
{
"name": "all_from_some_implies_mapM_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 295,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -74,10 +74,28 @@
unfold attach₂
simp [all_pmap_subtype λ ((_, b) : α × β) => f b]
+public theorem all_from_some_implies_mapM'_some {α β} {f : α → Option β} {ys : List β} :
+ (∀ y ∈ ys, ∃ x, f x = some y) →
+ ∃ xs, List.mapM' f xs = some ys
+:= by
+ intro h₁
+ induction ys
+ case nil => exists []
+ case... | {
"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_acfa6d7d03e9_39 | ec0fdb482f2f0396 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 39 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM'_none_iff_exists_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 32,
"n_chars": 1246,
"n_subproofs": 0,
"n_tactics": 32,
"cyclomatic": 8,
"n_automation": 7,
"n_rewrites": 2,
"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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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_acfa6d7d03e9_40 | 3d49bf6c5dd03dc7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/Data/List/Lemmas.lean | Lemmas | 40 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 49 | 4 | [
{
"theorem_name": "forall₂_fun_subset_implies",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha ha' hf heqv\n intro y hy\n replace ⟨x, hx, hr⟩ := List.forall₂_implies_all_right ha y hy\n replace h... | [
{
"name": "forall₂_implies_all_left",
"text": "/--\n Note the converse is not true:\n counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`\n-/\npublic theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :\n List.Forall₂ R xs ys →\n ∀ x ∈ xs, ∃ y ∈ ys, R x y\n:= by... | [
{
"name": "mapM_none_iff_exists_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 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... | @@ -93,6 +93,29 @@
match u, h with
| _, ⟨_, _, h₁, h₂, rfl⟩ => Forall₂.cons h₁ h₂
+/--
+ Note the converse is not true:
+ counterexample `R` is `=`, `xs` is `[1]`, `ys` is `[1, 2]`
+-/
+public theorem forall₂_implies_all_left {α β} {R : α → β → Prop} {xs : List α} {ys : List β} :
+ List.Forall₂ R xs ys →... | {
"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.