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_7ef84044b49c_10 | 12243757318019eb | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_tbound_inv_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨b0, hb0, he0⟩ := Context.label_tbound_inv hb\n cases b0\n case bound S0 =>\n simp [TBinding.weake... | [
{
"name": "Context.label_tbound_inv",
"text": "theorem Context.label_tbound_inv\n (hb : Context.TBound (Γ.label l) X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=\n Context.label_tbound_inv' rfl hb\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "Context.label_tbound_inv_bound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 390,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 2 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -23,9 +23,20 @@
cases hb <;> try (solve | cases he)
case there_label b0 hb0 => aesop
+theorem Context.label_tbound_inv
+ (hb : Context.TBound (Γ.label l) X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=
+ Context.label_tbound_inv' rfl hb
+
theorem Context.label_tbound_inv_bound
(hb : Context.TB... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_11 | b908d9c9755ba7f0 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.cvar_tbound_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.cvar_tbound_inv' rfl hb",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "Context.cvar_tbound_inv'",
"text": "theorem Context.cvar_tbound_inv'\n (he : Γ0 = Γ.cvar p)\n (hb : Context.TBound Γ0 X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.cweaken := by\n cases hb <;> try (solve | cases he)\n case there_cvar b0 hb0 =>\n cases he\n exists b0\n\n",
"fan_in":... | [
{
"name": "Context.tight_bound_tvar_absurd",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 11,
"n_lines": 19,
"n_chars": 540,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 11 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -71,9 +71,19 @@
∧ X = X0.succ :=
Context.tinst_tbound_bound_inv' rfl rfl hb
+theorem Context.cvar_tbound_inv'
+ (he : Γ0 = Γ.cvar p)
+ (hb : Context.TBound Γ0 X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.cweaken := by
+ cases hb <;> try (solve | cases he)
+ case there_cvar b0 hb0 =>
+ cases he
+ ... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_12 | eb0892736127ba73 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.tvar_tbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.tvar_tbound_succ_inv' rfl rfl hb",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 1,
"cycl... | [
{
"name": "Context.tvar_tbound_succ_inv'",
"text": "theorem Context.tvar_tbound_succ_inv'\n (he1 : Γ0 = Γ.tvar p) (he2 : X0 = Fin.succ X)\n (hb : Context.TBound Γ0 X0 b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_tvar hb0 =>\n ... | [
{
"name": "Context.tvar_tbound_succ_inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 189,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,20 @@
namespace Capless
+theorem Context.tvar_tbound_succ_inv'
+ (he1 : Γ0 = Γ.tvar p) (he2 : X0 = Fin.succ X)
+ (hb : Context.TBound Γ0 X0 b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken := by
+ cases hb <;> try (solve | cases he1 | cases he2)
+ case there_tvar hb0 =>
+ rw [Fin.succ_inj] ... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_13 | c84c334f06c04815 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.cvar_tbound_tvar_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.cvar_tbound_tvar_inv' rfl hb",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomat... | [
{
"name": "Context.cvar_tbound_tvar_inv'",
"text": "theorem Context.cvar_tbound_tvar_inv'\n (he : Γ0 = Context.cvar Γ b)\n (hb : Context.TBound Γ0 X T) :\n ∃ T0, Context.TBound Γ X T0 ∧ T = T0.cweaken := by\n cases hb <;> try (solve | cases he)\n case there_cvar =>\n cases he\n rename_i E0 _\n ... | [
{
"name": "Context.cvar_tbound_tvar_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 182,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,20 @@
namespace Capless
+theorem Context.cvar_tbound_tvar_inv'
+ (he : Γ0 = Context.cvar Γ b)
+ (hb : Context.TBound Γ0 X T) :
+ ∃ T0, Context.TBound Γ X T0 ∧ T = T0.cweaken := by
+ cases hb <;> try (solve | cases he)
+ case there_cvar =>
+ cases he
+ rename_i E0 _
+ exists E0
+
theorem... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_14 | 8d8c6a3cca61d6a8 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.tvar_tbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.tvar_tbound_succ_inv",
"text": "theorem Context.tvar_tbound_succ_inv\n (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=\n Context.tvar_tbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.tvar_tbound_inv'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 425,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 7,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"... | 2 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,11 +26,25 @@
cases he1; subst he2
aesop
+theorem Context.tvar_tbound_succ_inv
+ (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=
+ Context.tvar_tbound_succ_inv' rfl rfl hb
+
theorem Context.tvar_tbound_inv'
(he1 : Γ0 = Γ.tvar p)
(hb : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_15 | 35712e122dd41a1c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.tvar_tbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.tvar_tbound_succ_inv",
"text": "theorem Context.tvar_tbound_succ_inv\n (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=\n Context.tvar_tbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.tvar_tbound_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 3 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,11 +26,25 @@
cases he1; subst he2
aesop
+theorem Context.tvar_tbound_succ_inv
+ (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=
+ Context.tvar_tbound_succ_inv' rfl rfl hb
+
theorem Context.tvar_tbound_inv'
(he1 : Γ0 = Γ.tvar p)
(hb : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_16 | d078a2666a64058d | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.cvar_cbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.cvar_cbound_succ_inv' rfl rfl hb",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 1,
"cycl... | [
{
"name": "Context.cvar_cbound_succ_inv'",
"text": "theorem Context.cvar_cbound_succ_inv'\n (he1 : Γ0 = Γ.cvar p) (he2 : X0 = Fin.succ X)\n (hb : Context.CBound Γ0 X0 b) :\n ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_cvar hb0 =>\n ... | [
{
"name": "Context.cvar_cbound_succ_inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 189,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,20 @@
namespace Capless
+theorem Context.cvar_cbound_succ_inv'
+ (he1 : Γ0 = Γ.cvar p) (he2 : X0 = Fin.succ X)
+ (hb : Context.CBound Γ0 X0 b) :
+ ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken := by
+ cases hb <;> try (solve | cases he1 | cases he2)
+ case there_cvar hb0 =>
+ rw [Fin.succ_inj] ... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_17 | cc2092d372f7a2bd | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.cvar_cbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.cvar_cbound_succ_inv",
"text": "theorem Context.cvar_cbound_succ_inv\n (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :\n ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=\n Context.cvar_cbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.cvar_cbound_inv'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 425,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 7,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"... | 2 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,11 +26,25 @@
cases he1; subst he2
aesop
+theorem Context.cvar_cbound_succ_inv
+ (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :
+ ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=
+ Context.cvar_cbound_succ_inv' rfl rfl hb
+
theorem Context.cvar_cbound_inv'
(he1 : Γ0 = Γ.cvar p)
(hb : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_18 | d9dbe0512e87917b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.cvar_cbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.cvar_cbound_succ_inv",
"text": "theorem Context.cvar_cbound_succ_inv\n (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :\n ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=\n Context.cvar_cbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.cvar_cbound_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 3 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,11 +26,25 @@
cases he1; subst he2
aesop
+theorem Context.cvar_cbound_succ_inv
+ (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :
+ ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=
+ Context.cvar_cbound_succ_inv' rfl rfl hb
+
theorem Context.cvar_cbound_inv'
(he1 : Γ0 = Γ.cvar p)
(hb : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_19 | 8b0f1972f8299479 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.tvar_tbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.tvar_tbound_succ_inv",
"text": "theorem Context.tvar_tbound_succ_inv\n (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=\n Context.tvar_tbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.tbound_inj",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 692,
"n_subproofs": 6,
"n_tactics": 31,
"cyclomatic": 11,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": false,
"max_... | 2 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,9 +26,44 @@
cases he1; subst he2
aesop
+theorem Context.tvar_tbound_succ_inv
+ (hb : Context.TBound (Γ.tvar p) (Fin.succ X) b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.tweaken :=
+ Context.tvar_tbound_succ_inv' rfl rfl hb
+
theorem Context.tbound_inj
(h1 : Context.TBound Γ X b1)
- (h2 : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_20 | f273f42dbea83b90 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.var_lbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.var_lbound_succ_inv' rfl rfl hb",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "Context.var_lbound_succ_inv'",
"text": "theorem Context.var_lbound_succ_inv'\n (he1 : Γ0 = Γ.var T) (he2 : x0 = x.succ)\n (hb : Context.LBound Γ0 x0 S) :\n ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_var => aesop\n\n",
... | [
{
"name": "Context.var_lbound_succ_inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 188,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,17 @@
namespace Capless
+theorem Context.var_lbound_succ_inv'
+ (he1 : Γ0 = Γ.var T) (he2 : x0 = x.succ)
+ (hb : Context.LBound Γ0 x0 S) :
+ ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
+ cases hb <;> try (solve | cases he1 | cases he2)
+ case there_var => aesop
+
theorem Context.var_lbound... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_21 | 3a1d849f310f656d | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_lbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.label_lbound_succ_inv' rfl rfl hb",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "Context.label_lbound_succ_inv'",
"text": "theorem Context.label_lbound_succ_inv'\n (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)\n (hb : Context.LBound Γ0 x0 S) :\n ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_label => aesop\n... | [
{
"name": "Context.label_lbound_succ_inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 194,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,17 @@
namespace Capless
+theorem Context.label_lbound_succ_inv'
+ (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)
+ (hb : Context.LBound Γ0 x0 S) :
+ ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
+ cases hb <;> try (solve | cases he1 | cases he2)
+ case there_label => aesop
+
theorem Context.labe... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_22 | 5f3f3b76f7c93890 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_lbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.label_lbound_succ_inv' rfl rfl hb",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "Context.label_lbound_succ_inv'",
"text": "theorem Context.label_lbound_succ_inv'\n (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)\n (hb : Context.LBound Γ0 x0 S) :\n ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_label => aesop\n... | [
{
"name": "Context.bound_lbound_absurd",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 608,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 13,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 12,
"automation_only": false,
... | 4 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -28,9 +28,17 @@
∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
apply Context.var_lbound_succ_inv' rfl rfl hb
+theorem Context.label_lbound_succ_inv'
+ (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)
+ (hb : Context.LBound Γ0 x0 S) :
+ ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
+ cases hb <;> try (so... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_23 | b3a44b2bd4e27440 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_bound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.label_bound_succ_inv' rfl rfl hb",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "Context.label_bound_succ_inv'",
"text": "theorem Context.label_bound_succ_inv'\n (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)\n (hb : Context.Bound Γ0 x0 T) :\n ∃ T0, Context.Bound Γ x T0 ∧ T = T0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_label => aesop\n\n",... | [
{
"name": "Context.label_bound_succ_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 190,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,17 @@
namespace Capless
+theorem Context.label_bound_succ_inv'
+ (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)
+ (hb : Context.Bound Γ0 x0 T) :
+ ∃ T0, Context.Bound Γ x T0 ∧ T = T0.weaken := by
+ cases hb <;> try (solve | cases he1 | cases he2)
+ case there_label => aesop
+
theorem Context.label_b... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_24 | 42aac90f001d9b5b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.cvar_cbound_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases X0 using Fin.cases\n case zero =>\n left\n cases hb <;> try (solve | cases he1 | cases he2 | aesop)\... | [
{
"name": "Context.cvar_cbound_succ_inv",
"text": "theorem Context.cvar_cbound_succ_inv\n (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :\n ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=\n Context.cvar_cbound_succ_inv' rfl rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subp... | [
{
"name": "Context.cbound_injective",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 543,
"n_subproofs": 5,
"n_tactics": 23,
"cyclomatic": 6,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"... | 2 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -26,9 +26,35 @@
cases he1; subst he2
aesop
+theorem Context.cvar_cbound_succ_inv
+ (hb : Context.CBound (Γ.cvar p) (Fin.succ X) b) :
+ ∃ b0, Context.CBound Γ X b0 ∧ b = b0.cweaken :=
+ Context.cvar_cbound_succ_inv' rfl rfl hb
+
theorem Context.cbound_injective
(hb1 : Context.CBound Γ c b1)
- (hb2... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_25 | 6c2214ee079f5b2b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_bound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.label_bound_succ_inv' rfl rfl hb",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "Context.label_bound_succ_inv'",
"text": "theorem Context.label_bound_succ_inv'\n (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)\n (hb : Context.Bound Γ0 x0 T) :\n ∃ T0, Context.Bound Γ x T0 ∧ T = T0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_label => aesop\n\n",... | [
{
"name": "Context.bound_injective",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 21,
"n_chars": 450,
"n_subproofs": 2,
"n_tactics": 17,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"m... | 4 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -27,9 +27,17 @@
∃ T0, Context.Bound Γ x T0 ∧ T = T0.weaken :=
Context.var_bound_succ_inv' rfl rfl hb
+theorem Context.label_bound_succ_inv'
+ (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)
+ (hb : Context.Bound Γ0 x0 T) :
+ ∃ T0, Context.Bound Γ x T0 ∧ T = T0.weaken := by
+ cases hb <;> try (solve | cases he... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_26 | 4958904c5a97c34b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_lbound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.label_lbound_succ_inv' rfl rfl hb",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "Context.label_lbound_succ_inv'",
"text": "theorem Context.label_lbound_succ_inv'\n (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)\n (hb : Context.LBound Γ0 x0 S) :\n ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by\n cases hb <;> try (solve | cases he1 | cases he2)\n case there_label => aesop\n... | [
{
"name": "Context.lbound_inj",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 564,
"n_subproofs": 6,
"n_tactics": 22,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_ne... | 4 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -28,9 +28,17 @@
∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
apply Context.var_lbound_succ_inv' rfl rfl hb
+theorem Context.label_lbound_succ_inv'
+ (he1 : Γ0 = Γ.label l) (he2 : x0 = x.succ)
+ (hb : Context.LBound Γ0 x0 S) :
+ ∃ S0, Context.LBound Γ x S0 ∧ S = S0.weaken := by
+ cases hb <;> try (so... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_27 | b44f88f2a54a26c8 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.var_cbound_inv_inst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.var_cbound_inv_inst' rfl hb",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "Context.var_cbound_inv_inst'",
"text": "theorem Context.var_cbound_inv_inst'\n (he : b = CBinding.inst C)\n (hb : Context.CBound (Γ.var T) c b) :\n ∃ C0, Context.CBound Γ c (CBinding.inst C0) ∧ C = C0.weaken := by\n cases hb\n case there_var b0 hb =>\n cases b0 <;> cases he\n aesop\n\n... | [
{
"name": "Context.var_cbound_inv_inst",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 211,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,9 +16,19 @@
namespace Capless
+theorem Context.var_cbound_inv_inst'
+ (he : b = CBinding.inst C)
+ (hb : Context.CBound (Γ.var T) c b) :
+ ∃ C0, Context.CBound Γ c (CBinding.inst C0) ∧ C = C0.weaken := by
+ cases hb
+ case there_var b0 hb =>
+ cases b0 <;> cases he
+ aesop
+
theorem Context.var_... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_7ef84044b49c_28 | d3a458da120c6ea9 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.cvar_bound_cbound_inv_inst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.cvar_bound_cbound_inv_inst' rfl hb",
"n_chars": 54,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "Context.cvar_bound_cbound_inv_inst'",
"text": "theorem Context.cvar_bound_cbound_inv_inst'\n (he : b = CBinding.inst C)\n (hb : Context.CBound (Γ,c<:B) c b) :\n ∃ c0 C0, Context.CBound Γ c0 (CBinding.inst C0)\n ∧ c = c0.succ\n ∧ C = C0.cweaken := by\n cases hb\n case here => cases he\n... | [
{
"name": "Context.cvar_bound_cbound_inv_inst",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | import Capless.Context
import Capless.Store
/-! # Context Inversion Lemmas
This file contains inversion lemmas for context lookups and bindings. These lemmas provide
ways to analyze and destructure information stored in typing contexts, including:
- Variable bound inversions for different context extensions
- Type va... | @@ -16,11 +16,25 @@
namespace Capless
+theorem Context.cvar_bound_cbound_inv_inst'
+ (he : b = CBinding.inst C)
+ (hb : Context.CBound (Γ,c<:B) c b) :
+ ∃ c0 C0, Context.CBound Γ c0 (CBinding.inst C0)
+ ∧ c = c0.succ
+ ∧ C = C0.cweaken := by
+ cases hb
+ case here => cases he
+ case there_cvar b hb =>
... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_adc8af243d32_0 | 1691114ab3a02784 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Term.lean | Term | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "IsValue.rename_l",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " IsValue.rename_l' rfl hv",
"n_chars": 25,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "IsValue.rename_l'",
"text": "theorem IsValue.rename_l' {t : Term n m k} {t0 : Term n' m k}\n (he : t0 = t.rename f)\n (hv : t0.IsValue) :\n t.IsValue := by\n cases hv\n all_goals (cases t <;> simp [Term.rename] at he; try constructor)\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 2... | [
{
"name": "IsValue.rename_l",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | @@ -165,9 +165,16 @@
## Basic Properties
-/
+theorem IsValue.rename_l' {t : Term n m k} {t0 : Term n' m k}
+ (he : t0 = t.rename f)
+ (hv : t0.IsValue) :
+ t.IsValue := by
+ cases hv
+ all_goals (cases t <;> simp [Term.rename] at he; try constructor)
+
theorem IsValue.rename_l {t : Term n m k}
(hv : (t.ren... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_adc8af243d32_1 | f893c32ad2255800 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Term.lean | Term | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "IsValue.crename_l",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " IsValue.crename_l' rfl hv",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation... | [
{
"name": "IsValue.crename_l'",
"text": "theorem IsValue.crename_l' {t : Term n m k} {t0 : Term n m k'}\n (he : t0 = t.crename f)\n (hv : t0.IsValue) :\n t.IsValue := by\n cases hv\n all_goals (cases t <;> simp [Term.crename] at he; try constructor)\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars... | [
{
"name": "IsValue.crename_l",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 118,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 1 | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | @@ -165,9 +165,16 @@
## Basic Properties
-/
+theorem IsValue.crename_l' {t : Term n m k} {t0 : Term n m k'}
+ (he : t0 = t.crename f)
+ (hv : t0.IsValue) :
+ t.IsValue := by
+ cases hv
+ all_goals (cases t <;> simp [Term.crename] at he; try constructor)
+
theorem IsValue.crename_l {t : Term n m k}
(hv : (t... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_adc8af243d32_2 | 76b35fa1200eb693 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Term.lean | Term | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "IsValue.trename_l",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " IsValue.trename_l' rfl hv",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation... | [
{
"name": "IsValue.trename_l'",
"text": "theorem IsValue.trename_l' {t : Term n m k} {t0 : Term n m' k}\n (he : t0 = t.trename f)\n (hv : t0.IsValue) :\n t.IsValue := by\n cases hv\n all_goals (cases t <;> simp [Term.trename] at he; try constructor)\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars... | [
{
"name": "IsValue.trename_l",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 118,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 1 | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | import Capless.CaptureSet
import Capless.Type
import Capless.Basic
namespace Capless
/-!
# Terms in System Capless
This module defines the syntax of terms (Fig. 1) in System Capless.
## Intrinsically-Scoped Syntax
The terms are deBruijn-indexed and intrinsically-scoped. The type `Term` is parameterized by three nat... | @@ -165,9 +165,16 @@
## Basic Properties
-/
+theorem IsValue.trename_l' {t : Term n m k} {t0 : Term n m' k}
+ (he : t0 = t.trename f)
+ (hv : t0.IsValue) :
+ t.IsValue := by
+ cases hv
+ all_goals (cases t <;> simp [Term.trename] at he; try constructor)
+
theorem IsValue.trename_l {t : Term n m k}
(hv : (t... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_301847929e64_0 | a320132c423c45b0 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subst/Capture/Typing.lean | Typing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "Typed.copen",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [Term.copen, EType.copen]\n apply? Typed.csubst\n apply? CVarSubst.open",
"n_chars": 82,
"n_subproofs": 0,
"... | [
{
"name": "Typed.csubst",
"text": "theorem Typed.csubst\n {Γ : Context n m k} {Δ : Context n m k'}\n (h : Typed Γ t E Ct)\n (σ : CVarSubst Γ f Δ) :\n Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by\n induction h generalizing k'\n case var hb =>\n simp [Term.crename, EType.crename, CT... | [
{
"name": "Typed.copen",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 204,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 1 | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.copen
(h : Typed (Γ,c<:CBound.upper {c=c}) t E Ct) :
Typed Γ (t.copen c) (E.copen c) (Ct.copen c) := sorry
en... | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.csubst
{Γ : Context n m k} {Δ : Context n m k'}
(h : Typed Γ t E Ct)
(σ : CVarSubst Γ f Δ) :
Typed Δ (t.cr... | @@ -8,9 +8,135 @@
namespace Capless
+theorem Typed.csubst
+ {Γ : Context n m k} {Δ : Context n m k'}
+ (h : Typed Γ t E Ct)
+ (σ : CVarSubst Γ f Δ) :
+ Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by
+ induction h generalizing k'
+ case var hb =>
+ simp [Term.crename, EType.crename, CType.c... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_301847929e64_1 | 6cb820828d6d5d4b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subst/Capture/Typing.lean | Typing | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "Typed.copen",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [Term.copen, EType.copen]\n apply? Typed.csubst\n apply? CVarSubst.open",
"n_chars": 82,
"n_subproofs": 0,
"... | [
{
"name": "Typed.csubst",
"text": "theorem Typed.csubst\n {Γ : Context n m k} {Δ : Context n m k'}\n (h : Typed Γ t E Ct)\n (σ : CVarSubst Γ f Δ) :\n Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by\n induction h generalizing k'\n case var hb =>\n simp [Term.crename, EType.crename, CT... | [
{
"name": "Typed.cinstantiate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.cinstantiate {Γ : Context n m k}
(h : Typed (Γ,c<:CBound.star) t E Ct) :
Typed (Γ,c:= C) t E Ct := sorry
end ... | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.csubst
{Γ : Context n m k} {Δ : Context n m k'}
(h : Typed Γ t E Ct)
(σ : CVarSubst Γ f Δ) :
Typed Δ (t.cr... | @@ -8,9 +8,136 @@
namespace Capless
+theorem Typed.csubst
+ {Γ : Context n m k} {Δ : Context n m k'}
+ (h : Typed Γ t E Ct)
+ (σ : CVarSubst Γ f Δ) :
+ Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by
+ induction h generalizing k'
+ case var hb =>
+ simp [Term.crename, EType.crename, CType.c... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_301847929e64_2 | 0c4541e96db6f16e | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subst/Capture/Typing.lean | Typing | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "Typed.copen",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [Term.copen, EType.copen]\n apply? Typed.csubst\n apply? CVarSubst.open",
"n_chars": 82,
"n_subproofs": 0,
"... | [
{
"name": "Typed.csubst",
"text": "theorem Typed.csubst\n {Γ : Context n m k} {Δ : Context n m k'}\n (h : Typed Γ t E Ct)\n (σ : CVarSubst Γ f Δ) :\n Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by\n induction h generalizing k'\n case var hb =>\n simp [Term.crename, EType.crename, CT... | [
{
"name": "Typed.cinstantiate_extvar",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 385,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"... | 1 | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.cinstantiate_extvar {Γ : Context n m k}
(h : Typed ((Γ,c<:CBound.star).var P) t E Ct) :
Typed ((Γ,c:=C).var P)... | import Capless.Subst.Basic
import Capless.Subst.Capture.Subtyping
import Capless.Typing
/-
Substitution theorems for capture variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.csubst
{Γ : Context n m k} {Δ : Context n m k'}
(h : Typed Γ t E Ct)
(σ : CVarSubst Γ f Δ) :
Typed Δ (t.cr... | @@ -8,9 +8,140 @@
namespace Capless
+theorem Typed.csubst
+ {Γ : Context n m k} {Δ : Context n m k'}
+ (h : Typed Γ t E Ct)
+ (σ : CVarSubst Γ f Δ) :
+ Typed Δ (t.crename f) (E.crename f) (Ct.crename f) := by
+ induction h generalizing k'
+ case var hb =>
+ simp [Term.crename, EType.crename, CType.c... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_f0c8cb533e6f_0 | c71953b8969a6fde | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/WellScoped/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "WellScoped.subcapt",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hs generalizing cont\n case trans => aesop\n case subset => apply WellScoped.subset <;> easy\n case union ... | [
{
"name": "WellScoped.subset",
"text": "theorem WellScoped.subset\n (hsc : WellScoped Γ cont C)\n (hs : C' ⊆ C) :\n WellScoped Γ cont C' := by\n induction hs\n case empty => apply empty\n case rfl => easy\n case union_l => apply WellScoped.union <;> aesop\n case union_rl =>\n cases hsc\n aesop... | [
{
"name": "WellScoped.subcapt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 642,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 10,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": false,
"max_... | 1 | import Capless.Store
import Capless.Subcapturing
import Capless.Inversion.Context
/-!
# Basic Properties of Well-Scopedness
This file contains basic properties of the well-scopedness relation.
-/
namespace Capless
theorem WellScoped.subcapt
(hsc : WellScoped Γ cont C)
(hs : Γ ⊢ C' <:c C) :
WellScoped Γ cont C... | import Capless.Store
import Capless.Subcapturing
import Capless.Inversion.Context
/-!
# Basic Properties of Well-Scopedness
This file contains basic properties of the well-scopedness relation.
-/
namespace Capless
theorem WellScoped.subset
(hsc : WellScoped Γ cont C)
(hs : C' ⊆ C) :
WellScoped Γ cont C' := by... | @@ -10,10 +10,42 @@
namespace Capless
+theorem WellScoped.subset
+ (hsc : WellScoped Γ cont C)
+ (hs : C' ⊆ C) :
+ WellScoped Γ cont C' := by
+ induction hs
+ case empty => apply empty
+ case rfl => easy
+ case union_l => apply WellScoped.union <;> aesop
+ case union_rl =>
+ cases hsc
+ aesop
+ case... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_f18655ecec67_0 | 76f0c64118bcfd33 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Weakening/TypedCont/Capture.lean | Capture | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "TypedCont.cweaken",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h\n case none =>\n simp [Cont.cweaken]\n apply none\n apply? ESubtyp.cweaken\n case cons ht hs _ ih... | [
{
"name": "EType.cweaken_weaken",
"text": "theorem EType.cweaken_weaken (E : EType n m k) :\n E.weaken.cweaken = E.cweaken.weaken := by\n simp [EType.cweaken, EType.weaken, EType.crename_rename_comm]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 158,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "TypedCont.cweaken",
"fan_in": 6,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 39,
"n_chars": 1059,
"n_subproofs": 4,
"n_tactics": 35,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 6,
"n_structural": 13,
"automation_only": false,
"max_n... | 2 | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Capture Variables
This file proves weakening properties for typed continuations when extending contexts with
capture variables. It establishes that conti... | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Capture Variables
This file proves weakening properties for typed continuations when extending contexts with
capture variables. It establishes that conti... | @@ -37,6 +37,10 @@
-- (EType.type T).cweaken = EType.type T.cweaken := by
-- simp [EType.cweaken, EType.crename, CType.cweaken]
+theorem EType.cweaken_weaken (E : EType n m k) :
+ E.weaken.cweaken = E.cweaken.weaken := by
+ simp [EType.cweaken, EType.weaken, EType.crename_rename_comm]
+
theorem EType.cweaken... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_ec2fd4ef1a2d_0 | 3b1d6fc309bbac37 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Soundness/Preservation.lean | Preservation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "preservation",
"depth": 1,
"n_commands": 0,
"n_lines": 259,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hr\n case apply hl =>\n cases ht\n case mk hs hsc ht hc =>\n have hg := TypedStore.is_tight hs\n have... | [
{
"name": "value_typing_widen",
"text": "theorem value_typing_widen\n (hv : Typed Γ v (EType.type (S^C)) Cv)\n (hs : Γ ⊢ (S^C1) <: (S'^C2)) :\n Typed Γ v (S'^C) Cv := by\n cases hs\n apply Typed.sub\n easy\n apply Subcapt.refl\n constructor\n constructor\n apply Subcapt.refl\n eas... | [
{
"name": "preservation",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 264,
"n_chars": 8301,
"n_subproofs": 42,
"n_tactics": 295,
"cyclomatic": 68,
"n_automation": 20,
"n_rewrites": 6,
"n_structural": 156,
"automation_only": false,
"max_... | 2 | import Capless.Store
import Capless.Type
import Capless.Reduction
import Capless.Inversion.Typing
import Capless.Inversion.Lookup
import Capless.Renaming.Term.Subtyping
import Capless.Renaming.Type.Subtyping
import Capless.Renaming.Capture.Subtyping
import Capless.Subst.Term.Typing
import Capless.Subst.Type.Typing
impo... | import Capless.Store
import Capless.Type
import Capless.Reduction
import Capless.Inversion.Typing
import Capless.Inversion.Lookup
import Capless.Renaming.Term.Subtyping
import Capless.Renaming.Type.Subtyping
import Capless.Renaming.Capture.Subtyping
import Capless.Subst.Term.Typing
import Capless.Subst.Type.Typing
impo... | @@ -43,6 +43,19 @@
TypedState state ((Γ.label S).cvar b) E.weaken.cweaken ->
Preserve Γ E state
+theorem value_typing_widen
+ (hv : Typed Γ v (EType.type (S^C)) Cv)
+ (hs : Γ ⊢ (S^C1) <: (S'^C2)) :
+ Typed Γ v (S'^C) Cv := by
+ cases hs
+ apply Typed.sub
+ easy
+ apply Subcapt.refl
+ construct... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_0 | 9525d6e5ccaa53ab | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "ESubtyp.sub_type_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ESubtyp.sub_type_inv' rfl h",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "ESubtyp.sub_type_inv'",
"text": "theorem ESubtyp.sub_type_inv'\n (he : E2 = EType.type T2)\n (h : ESubtyp Γ E1 E2) :\n ∃ T1, E1 = EType.type T1 ∧ CSubtyp Γ T1 T2 := by\n cases h <;> try (solve | cases he)\n case type T1 T2 hs =>\n cases he\n exists T1\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "ESubtyp.sub_type_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -22,9 +22,19 @@
namespace Capless
+theorem ESubtyp.sub_type_inv'
+ (he : E2 = EType.type T2)
+ (h : ESubtyp Γ E1 E2) :
+ ∃ T1, E1 = EType.type T1 ∧ CSubtyp Γ T1 T2 := by
+ cases h <;> try (solve | cases he)
+ case type T1 T2 hs =>
+ cases he
+ exists T1
+
theorem ESubtyp.sub_type_inv
(h : ESubtyp... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_1 | 9b213be1f5d2f996 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SType.dealias_forall_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SType.dealias_forall_inj' rfl rfl h1 h2",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "SType.dealias_forall_inj'",
"text": "theorem SType.dealias_forall_inj'\n (he1 : S1 = SType.forall T1 E1) (he2 : S2 = SType.forall T2 E2)\n (h1 : SType.Dealias Γ S S1)\n (h2 : SType.Dealias Γ S S2) :\n T1 = T2 ∧ E1 = E2 := by\n induction h1 generalizing T2 E2\n case refl =>\n subst he1\n ... | [
{
"name": "SType.dealias_forall_inj",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 201,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -229,10 +229,32 @@
rename_i hd
cases hd
+theorem SType.dealias_forall_inj'
+ (he1 : S1 = SType.forall T1 E1) (he2 : S2 = SType.forall T2 E2)
+ (h1 : SType.Dealias Γ S S1)
+ (h2 : SType.Dealias Γ S S2) :
+ T1 = T2 ∧ E1 = E2 := by
+ induction h1 generalizing T2 E2
+ case refl =>
+ subst he1
+ c... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_2 | a33f861265c47d4a | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SType.dealias_tforall_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SType.dealias_tforall_inj' rfl rfl h1 h2",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "SType.dealias_tforall_inj'",
"text": "theorem SType.dealias_tforall_inj'\n (he1 : S1 = SType.tforall T1 E1) (he2 : S2 = SType.tforall T2 E2)\n (h1 : SType.Dealias Γ S S1)\n (h2 : SType.Dealias Γ S S2) :\n T1 = T2 ∧ E1 = E2 := by\n induction h1 generalizing T2 E2\n case refl =>\n subst he... | [
{
"name": "SType.dealias_tforall_inj",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 205,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -229,10 +229,32 @@
rename_i hd
cases hd
+theorem SType.dealias_tforall_inj'
+ (he1 : S1 = SType.tforall T1 E1) (he2 : S2 = SType.tforall T2 E2)
+ (h1 : SType.Dealias Γ S S1)
+ (h2 : SType.Dealias Γ S S2) :
+ T1 = T2 ∧ E1 = E2 := by
+ induction h1 generalizing T2 E2
+ case refl =>
+ subst he1
+ ... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_3 | 2cadba944cf891e7 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SSubtyp.sub_dealias_forall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply SSubtyp.rec\n (motive_1 := fun Γ E1 E2 h => SSubtyp.dealias_forall_inv.emotive Γ E1 E2)\n (moti... | [
{
"name": "SType.dealias_forall_inj",
"text": "theorem SType.dealias_forall_inj\n (h1 : SType.Dealias Γ S (SType.forall T1 E1))\n (h2 : SType.Dealias Γ S (SType.forall T2 E2)) :\n T1 = T2 ∧ E1 = E2 :=\n SType.dealias_forall_inj' rfl rfl h1 h2\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 201,
... | [
{
"name": "SSubtyp.sub_dealias_forall_inv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 106,
"n_chars": 2917,
"n_subproofs": 11,
"n_tactics": 104,
"cyclomatic": 34,
"n_automation": 6,
"n_rewrites": 12,
"n_structural": 40,
"automation_only":... | 2 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -250,6 +250,12 @@
cases h
trivial }
+theorem SType.dealias_forall_inj
+ (h1 : SType.Dealias Γ S (SType.forall T1 E1))
+ (h2 : SType.Dealias Γ S (SType.forall T2 E2)) :
+ T1 = T2 ∧ E1 = E2 :=
+ SType.dealias_forall_inj' rfl rfl h1 h2
+
def SSubtyp.dealias_forall_inv.emotive
(Γ : Context n ... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_4 | 212ded9dcdd3d587 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SSubtyp.sub_dealias_tforall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply SSubtyp.rec\n (motive_1 := fun Γ E1 E2 h => SSubtyp.dealias_tforall_inv.emotive Γ E1 E2)\n (mo... | [
{
"name": "SType.dealias_tforall_inj",
"text": "theorem SType.dealias_tforall_inj\n (h1 : SType.Dealias Γ S (SType.tforall T1 E1))\n (h2 : SType.Dealias Γ S (SType.tforall T2 E2)) :\n T1 = T2 ∧ E1 = E2 :=\n SType.dealias_tforall_inj' rfl rfl h1 h2\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": ... | [
{
"name": "SSubtyp.sub_dealias_tforall_inv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 106,
"n_chars": 2945,
"n_subproofs": 10,
"n_tactics": 102,
"cyclomatic": 31,
"n_automation": 6,
"n_rewrites": 12,
"n_structural": 38,
"automation_only"... | 2 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -250,6 +250,12 @@
cases h
trivial }
+theorem SType.dealias_tforall_inj
+ (h1 : SType.Dealias Γ S (SType.tforall T1 E1))
+ (h2 : SType.Dealias Γ S (SType.tforall T2 E2)) :
+ T1 = T2 ∧ E1 = E2 :=
+ SType.dealias_tforall_inj' rfl rfl h1 h2
+
def SSubtyp.dealias_forall_inv.emotive
(Γ : Contex... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_5 | 81c0b04fb8f9614b | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SType.dealias_cforall_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SType.dealias_cforall_inj' rfl rfl h1 h2",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "SType.dealias_cforall_inj'",
"text": "theorem SType.dealias_cforall_inj'\n (he1 : S1 = SType.cforall B1 E1) (he2 : S2 = SType.cforall B2 E2)\n (h1 : SType.Dealias Γ S S1)\n (h2 : SType.Dealias Γ S S2) :\n B1 = B2 ∧ E1 = E2 := by\n induction h1 generalizing E2\n case refl =>\n subst he1\n... | [
{
"name": "SType.dealias_cforall_inj",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 205,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -374,10 +374,32 @@
rename_i hd
cases hd
+theorem SType.dealias_cforall_inj'
+ (he1 : S1 = SType.cforall B1 E1) (he2 : S2 = SType.cforall B2 E2)
+ (h1 : SType.Dealias Γ S S1)
+ (h2 : SType.Dealias Γ S S2) :
+ B1 = B2 ∧ E1 = E2 := by
+ induction h1 generalizing E2
+ case refl =>
+ subst he1
+ c... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_6 | 147edf9a01d2b2a8 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SSubtyp.sub_dealias_cforall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 101,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply SSubtyp.rec\n (motive_1 := fun Γ E1 E2 h => SSubtyp.dealias_cforall_inv.emotive Γ E1 E2)\n (m... | [
{
"name": "SType.dealias_cforall_inj",
"text": "theorem SType.dealias_cforall_inj\n (h1 : SType.Dealias Γ S (SType.cforall B1 E1))\n (h2 : SType.Dealias Γ S (SType.cforall B2 E2)) :\n B1 = B2 ∧ E1 = E2 :=\n SType.dealias_cforall_inj' rfl rfl h1 h2\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": ... | [
{
"name": "SSubtyp.sub_dealias_cforall_inv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 108,
"n_chars": 2984,
"n_subproofs": 10,
"n_tactics": 106,
"cyclomatic": 31,
"n_automation": 4,
"n_rewrites": 12,
"n_structural": 41,
"automation_only"... | 2 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -395,6 +395,12 @@
cases h
trivial }
+theorem SType.dealias_cforall_inj
+ (h1 : SType.Dealias Γ S (SType.cforall B1 E1))
+ (h2 : SType.Dealias Γ S (SType.cforall B2 E2)) :
+ B1 = B2 ∧ E1 = E2 :=
+ SType.dealias_cforall_inj' rfl rfl h1 h2
+
def SSubtyp.dealias_cforall_inv.emotive
(Γ : Conte... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_7 | e834ddcaed076e75 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SType.dealias_boxed_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SType.dealias_boxed_inj' rfl rfl h1 h2",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic"... | [
{
"name": "SType.dealias_boxed_inj'",
"text": "theorem SType.dealias_boxed_inj'\n (he1 : S1 = SType.box T1) (he2 : S2 = SType.box T2)\n (h1 : SType.Dealias Γ S S1)\n (h2 : SType.Dealias Γ S S2) :\n T1 = T2 := by\n induction h1 generalizing T2\n case refl =>\n subst he1\n cases h2\n aesop\n c... | [
{
"name": "SType.dealias_boxed_inj",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 175,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -505,10 +505,32 @@
rename_i hd
cases hd
+theorem SType.dealias_boxed_inj'
+ (he1 : S1 = SType.box T1) (he2 : S2 = SType.box T2)
+ (h1 : SType.Dealias Γ S S1)
+ (h2 : SType.Dealias Γ S S2) :
+ T1 = T2 := by
+ induction h1 generalizing T2
+ case refl =>
+ subst he1
+ cases h2
+ aesop
+ case... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_8 | ad42932d37074fb6 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SSubtyp.sub_dealias_boxed_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 89,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply SSubtyp.rec\n (motive_1 := fun Γ E1 E2 _ => SSubtyp.dealias_boxed_inv.emotive Γ E1 E2)\n (motive... | [
{
"name": "SType.dealias_boxed_inj",
"text": "theorem SType.dealias_boxed_inj\n (h1 : SType.Dealias Γ S (SType.box T1))\n (h2 : SType.Dealias Γ S (SType.box T2)) :\n T1 = T2 :=\n SType.dealias_boxed_inj' rfl rfl h1 h2\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 175,
"n_subproofs": 0,
... | [
{
"name": "SSubtyp.sub_dealias_boxed_inv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 96,
"n_chars": 2503,
"n_subproofs": 10,
"n_tactics": 92,
"cyclomatic": 29,
"n_automation": 5,
"n_rewrites": 12,
"n_structural": 32,
"automation_only": fa... | 2 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -526,6 +526,12 @@
cases h
trivial }
+theorem SType.dealias_boxed_inj
+ (h1 : SType.Dealias Γ S (SType.box T1))
+ (h2 : SType.Dealias Γ S (SType.box T2)) :
+ T1 = T2 :=
+ SType.dealias_boxed_inj' rfl rfl h1 h2
+
def SSubtyp.dealias_boxed_inv.emotive
(Γ : Context n m k)
(E1 : EType n m k... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_9 | b8344bb88abd4c3c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SType.dealias_label_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SType.dealias_label_inj' rfl rfl h1 h2",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic"... | [
{
"name": "SType.dealias_label_inj'",
"text": "theorem SType.dealias_label_inj'\n (he1 : S1 = SType.label T1) (he2 : S2 = SType.label T2)\n (h1 : SType.Dealias Γ S S1)\n (h2 : SType.Dealias Γ S S2) :\n T1 = T2 := by\n induction h1 generalizing T2\n case refl =>\n subst he1\n cases h2\n aesop\... | [
{
"name": "SType.dealias_label_inj",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 179,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 1 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -636,10 +636,32 @@
apply Exists.intro
apply SType.Dealias.refl
+theorem SType.dealias_label_inj'
+ (he1 : S1 = SType.label T1) (he2 : S2 = SType.label T2)
+ (h1 : SType.Dealias Γ S S1)
+ (h2 : SType.Dealias Γ S S2) :
+ T1 = T2 := by
+ induction h1 generalizing T2
+ case refl =>
+ subst he1
+... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_fdfc707320e7_10 | b113dd505390b481 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Subtyping.lean | Subtyping | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "SSubtyp.sub_dealias_label_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 89,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply SSubtyp.rec\n (motive_1 := fun Γ E1 E2 _ => SSubtyp.dealias_label_inv.emotive Γ E1 E2)\n (motive... | [
{
"name": "SType.dealias_label_inj",
"text": "theorem SType.dealias_label_inj\n (h1 : SType.Dealias Γ S (SType.label T1))\n (h2 : SType.Dealias Γ S (SType.label T2)) :\n T1 = T2 :=\n SType.dealias_label_inj' rfl rfl h1 h2\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 179,
"n_subproofs": 0,... | [
{
"name": "SSubtyp.sub_dealias_label_inv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 96,
"n_chars": 2507,
"n_subproofs": 10,
"n_tactics": 92,
"cyclomatic": 29,
"n_automation": 5,
"n_rewrites": 12,
"n_structural": 32,
"automation_only": fa... | 2 | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | import Capless.Subtyping
import Capless.Store
import Capless.Inversion.Basic
import Capless.Inversion.Context
import Capless.Subtyping.Basic
import Capless.Narrowing
/-! # Subtyping Inversion Lemmas
This file contains inversion lemmas for the subtyping relation. These lemmas allow
reasoning about the structure of sub... | @@ -657,6 +657,12 @@
cases h
trivial }
+theorem SType.dealias_label_inj
+ (h1 : SType.Dealias Γ S (SType.label T1))
+ (h2 : SType.Dealias Γ S (SType.label T2)) :
+ T1 = T2 :=
+ SType.dealias_label_inj' rfl rfl h1 h2
+
def SSubtyp.dealias_label_inv.emotive
(Γ : Context n m k)
(E1 : EType n... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_f2b0add5f9c2_0 | 53f3ef679328f40c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Weakening/TypedCont/Type.lean | Type | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "TypedCont.tweaken",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h\n case none =>\n simp [Cont.tweaken]\n apply none\n apply? ESubtyp.tweaken\n case cons ht hs _ ih... | [
{
"name": "EType.tweaken_cweaken",
"text": "theorem EType.tweaken_cweaken (E : EType n m k) :\n E.cweaken.tweaken = E.tweaken.cweaken := by\n simp [EType.tweaken, EType.cweaken, EType.crename_trename_comm]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "TypedCont.tweaken",
"fan_in": 5,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 38,
"n_chars": 944,
"n_subproofs": 4,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 13,
"automation_only": false,
"max_ne... | 3 | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Type Variables
This file proves weakening properties for typed continuations when extending contexts with
type variables. It shows that continuation typi... | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Type Variables
This file proves weakening properties for typed continuations when extending contexts with
type variables. It shows that continuation typi... | @@ -41,6 +41,10 @@
E.weaken.tweaken = E.tweaken.weaken := by
simp [EType.tweaken, EType.weaken, EType.trename_rename_comm]
+theorem EType.tweaken_cweaken (E : EType n m k) :
+ E.cweaken.tweaken = E.tweaken.cweaken := by
+ simp [EType.tweaken, EType.cweaken, EType.crename_trename_comm]
+
theorem Cont.HasLabel... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_83937c536cf2_0 | 9abeecdeffc2defd | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Weakening/TypedCont/Term.lean | Term | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "TypedCont.weaken",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h\n case none =>\n simp [Cont.weaken]\n apply none\n apply? ESubtyp.weaken\n case cons ih =>\n si... | [
{
"name": "EType.weaken_ex",
"text": "theorem EType.weaken_ex (T : CType n m (k+1)) :\n (EType.ex T).weaken = EType.ex T.weaken := by\n simp [EType.weaken, EType.rename, CType.weaken]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1... | [
{
"name": "TypedCont.weaken",
"fan_in": 10,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 43,
"n_chars": 1217,
"n_subproofs": 4,
"n_tactics": 41,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 6,
"n_structural": 13,
"automation_only": false,
"max_... | 1 | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Term Variables
This file proves weakening properties for typed continuations when extending contexts with
term variables. It establishes that continuatio... | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Term Variables
This file proves weakening properties for typed continuations when extending contexts with
term variables. It establishes that continuatio... | @@ -39,6 +39,10 @@
simp [CaptureSet.weaken, CaptureSet.weaken1, CaptureSet.rename_rename]
rw [<- FinFun.comp_weaken]
+theorem EType.weaken_ex (T : CType n m (k+1)) :
+ (EType.ex T).weaken = EType.ex T.weaken := by
+ simp [EType.weaken, EType.rename, CType.weaken]
+
theorem EType.weaken_cweaken (E : EType n m... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_83937c536cf2_1 | e124f5918d2dfa8d | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Weakening/TypedCont/Term.lean | Term | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "TypedCont.weaken",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h\n case none =>\n simp [Cont.weaken]\n apply none\n apply? ESubtyp.weaken\n case cons ih =>\n si... | [
{
"name": "EType.weaken_ex",
"text": "theorem EType.weaken_ex (T : CType n m (k+1)) :\n (EType.ex T).weaken = EType.ex T.weaken := by\n simp [EType.weaken, EType.rename, CType.weaken]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1... | [
{
"name": "TypedCont.lweaken",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 43,
"n_chars": 1232,
"n_subproofs": 4,
"n_tactics": 41,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 6,
"n_structural": 13,
"automation_only": false,
"max_... | 1 | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Term Variables
This file proves weakening properties for typed continuations when extending contexts with
term variables. It establishes that continuatio... | import Capless.Store
import Capless.Weakening.Typing
import Capless.Weakening.Subtyping
import Capless.Weakening.Subcapturing
/-!
# Typed Continuation Weakening for Term Variables
This file proves weakening properties for typed continuations when extending contexts with
term variables. It establishes that continuatio... | @@ -39,6 +39,10 @@
simp [CaptureSet.weaken, CaptureSet.weaken1, CaptureSet.rename_rename]
rw [<- FinFun.comp_weaken]
+theorem EType.weaken_ex (T : CType n m (k+1)) :
+ (EType.ex T).weaken = EType.ex T.weaken := by
+ simp [EType.weaken, EType.rename, CType.weaken]
+
theorem EType.weaken_cweaken (E : EType n m... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_61e7b6cb8c68_0 | 0f489b6c7ff9835e | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Typing/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Typing.inv_subcapt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typing.inv_subcapt' rfl rfl h",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "Typing.inv_subcapt'",
"text": "theorem Typing.inv_subcapt'\n (he1 : t0 = Term.var x) (he2 : E0 = EType.type (CType.capt C S))\n (h : Typed Γ t0 E0 C0) :\n Subcapt Γ {x=x} C := by\n induction h <;> try (solve | cases he1 | cases he2)\n case var =>\n cases he1; cases he2\n apply Subcapt.... | [
{
"name": "Typing.inv_subcapt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typing.inv_subcapt
(h : Typed Γ (Term.var x) (EType.type (CType.capt C S)) C0... | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typing.inv_subcapt'
(he1 : t0 = Term.var x) (he2 : E0 = EType.type (CType.cap... | @@ -11,9 +11,29 @@
namespace Capless
+theorem Typing.inv_subcapt'
+ (he1 : t0 = Term.var x) (he2 : E0 = EType.type (CType.capt C S))
+ (h : Typed Γ t0 E0 C0) :
+ Subcapt Γ {x=x} C := by
+ induction h <;> try (solve | cases he1 | cases he2)
+ case var =>
+ cases he1; cases he2
+ apply Subcapt.refl
+ cas... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_61e7b6cb8c68_1 | 392d852f9c8f01e1 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Typing/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Typed.precise_capture",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.precise_capture' rfl rfl h",
"n_chars": 35,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "Typed.precise_capture'",
"text": "theorem Typed.precise_capture'\n (he1 : t0 = Term.var x)\n (he2 : E0 = EType.type (CType.capt C S))\n (h : Typed Γ t0 E0 C0) :\n Typed Γ (Term.var x) (EType.type (CType.capt {x=x} S)) {x=x} := by\n induction h <;> try (solve | cases he1 | cases he2)\n case ... | [
{
"name": "Typed.precise_capture",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 198,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 1 | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typed.precise_capture
(h : Typed Γ (Term.var x) (EType.type (CType.capt C S))... | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typed.precise_capture'
(he1 : t0 = Term.var x)
(he2 : E0 = EType.type (CTyp... | @@ -11,9 +11,33 @@
namespace Capless
+theorem Typed.precise_capture'
+ (he1 : t0 = Term.var x)
+ (he2 : E0 = EType.type (CType.capt C S))
+ (h : Typed Γ t0 E0 C0) :
+ Typed Γ (Term.var x) (EType.type (CType.capt {x=x} S)) {x=x} := by
+ induction h <;> try (solve | cases he1 | cases he2)
+ case var => cases h... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_61e7b6cb8c68_2 | 59c1136760ab61a8 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Typing/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Typed.precise_cv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.precise_cv' rfl h",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation... | [
{
"name": "Typed.precise_cv'",
"text": "theorem Typed.precise_cv'\n (he : t0 = Term.var x)\n (h : Typed Γ t0 E C0) :\n Typed Γ (Term.var x) E {x=x} := by\n induction h <;> try (solve | cases he)\n case var => cases he; apply Typed.var; trivial\n case label => cases he; apply Typed.label; trivial\n ca... | [
{
"name": "Typed.precise_cv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typed.precise_cv
(h : Typed Γ (Term.var x) E C0) :
Typed Γ (Term.var x) E {... | import Capless.Typing
import Capless.Subcapturing
import Capless.Subcapturing.Basic
import Capless.Subtyping.Basic
/-!
# Basic Properties of Typing
This file contains basic properties of the typing relation.
-/
namespace Capless
theorem Typed.precise_cv'
(he : t0 = Term.var x)
(h : Typed Γ t0 E C0) :
Typed Γ ... | @@ -11,9 +11,23 @@
namespace Capless
+theorem Typed.precise_cv'
+ (he : t0 = Term.var x)
+ (h : Typed Γ t0 E C0) :
+ Typed Γ (Term.var x) E {x=x} := by
+ induction h <;> try (solve | cases he)
+ case var => cases he; apply Typed.var; trivial
+ case label => cases he; apply Typed.label; trivial
+ case sub ih... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_d4aeddbeae3d_0 | 4b5b1d9060c687c1 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Soundness/Progress.lean | Progress | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "Store.val_lookup_exists",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hg := TypedStore.is_tight hs\n have h := Store.lookup_exists (σ := σ) (x := x)\n cases h\n case inl h => e... | [
{
"name": "Store.lookup_exists",
"text": "theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :\n (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by\n induction σ\n case empty => exact Fin.elim0 x\n case val =>\n cases x using Fin.cases\n case zero =>\n apply Or.inl\... | [
{
"name": "Store.val_lookup_exists",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1097,
"n_subproofs": 10,
"n_tactics": 28,
"cyclomatic": 13,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 12,
"automation_only": false,
... | 1 | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | @@ -14,10 +14,111 @@
namespace Capless
+theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :
+ (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by
+ induction σ
+ case empty => exact Fin.elim0 x
+ case val =>
+ cases x using Fin.cases
+ case zero =>
+ apply Or.inl
+ co... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_d4aeddbeae3d_1 | 0396c816e459a706 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Soundness/Progress.lean | Progress | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "Store.value_typing_label_absurd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Store.value_typing_label_absurd' hg (by rfl) (by constructor) ht hv",
"n_chars": 70,
"n_subproofs": 0,... | [
{
"name": "Store.value_typing_label_absurd'",
"text": "theorem Store.value_typing_label_absurd'\n (hg : Γ.IsTight)\n (he : E0 = EType.type (S0^C))\n (hd : SType.Dealias Γ S0 (Label[S]))\n (ht : Typed Γ v E0 Cv)\n (hv : v.IsValue) : False := by\n induction ht <;> try (solve | cases hv | cases he; try c... | [
{
"name": "Store.value_typing_label_absurd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 210,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | @@ -14,10 +14,26 @@
namespace Capless
+theorem Store.value_typing_label_absurd'
+ (hg : Γ.IsTight)
+ (he : E0 = EType.type (S0^C))
+ (hd : SType.Dealias Γ S0 (Label[S]))
+ (ht : Typed Γ v E0 Cv)
+ (hv : v.IsValue) : False := by
+ induction ht <;> try (solve | cases hv | cases he; try cases hd)
+ case sub ih... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_d4aeddbeae3d_2 | 98cddfb3a3f5ede5 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Soundness/Progress.lean | Progress | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "Store.val_lookup_exists",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hg := TypedStore.is_tight hs\n have h := Store.lookup_exists (σ := σ) (x := x)\n cases h\n case inl h => e... | [
{
"name": "Store.lookup_exists",
"text": "theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :\n (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by\n induction σ\n case empty => exact Fin.elim0 x\n case val =>\n cases x using Fin.cases\n case zero =>\n apply Or.inl\... | [
{
"name": "Store.label_lookup_exists",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 486,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 3 | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | @@ -14,6 +14,81 @@
namespace Capless
+theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :
+ (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by
+ induction σ
+ case empty => exact Fin.elim0 x
+ case val =>
+ cases x using Fin.cases
+ case zero =>
+ apply Or.inl
+ cons... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_d4aeddbeae3d_3 | c8dcb8e6a44a3094 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Soundness/Progress.lean | Progress | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "Store.val_lookup_exists",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hg := TypedStore.is_tight hs\n have h := Store.lookup_exists (σ := σ) (x := x)\n cases h\n case inl h => e... | [
{
"name": "Store.lookup_exists",
"text": "theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :\n (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by\n induction σ\n case empty => exact Fin.elim0 x\n case val =>\n cases x using Fin.cases\n case zero =>\n apply Or.inl\... | [
{
"name": "progress",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 52,
"n_chars": 1851,
"n_subproofs": 16,
"n_tactics": 58,
"cyclomatic": 18,
"n_automation": 18,
"n_rewrites": 0,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 5 | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | import Mathlib.Data.Fin.Basic
import Capless.Reduction
import Capless.Narrowing.TypedCont
import Capless.Inversion.Lookup
import Capless.Inversion.Typing
import Capless.Weakening.IsValue
import Capless.WellScoped.Basic
/-!
# Progress Theorem
This module proves that a well-typed term is either an answer (in which case... | @@ -14,10 +14,111 @@
namespace Capless
+theorem Store.lookup_exists {σ : Store n m k} {x : Fin n} :
+ (∃ v, Store.Bound σ x v ∧ v.IsValue) ∨ (∃ S, Store.LBound σ x S) := by
+ induction σ
+ case empty => exact Fin.elim0 x
+ case val =>
+ cases x using Fin.cases
+ case zero =>
+ apply Or.inl
+ co... | {
"repo": "capless-lean",
"git_repo": "github.com/Linyxus/capless-lean",
"revision": "9beeba12d520c447791349f079256254fc413f1b",
"lean_toolchain": "leanprover/lean4:v4.21.0-rc3",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary... |
ablate_00e69b3111fa_0 | 03376d1e163f3d8f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThan, pe_decimal_lessThan, gt_iff_lt]",
"n_chars": 67,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "pe_decimal_lessThan",
"text": "private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ < d₂)))\n:= by\n simp only [Decimal.lessThan, pe_ext_de... | [
{
"name": "pe_decimal_greaterThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -32,10 +32,16 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ < d₂)))
+:= by
+ simp only [Decimal.lessThan, pe_... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_1 | e6fcfeaa69b371e9 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThanOrEqual, pe_decimal_lessThanOrEqual, ge_iff_le]",
"n_chars": 81,
"n_subpro... | [
{
"name": "pe_decimal_lessThanOrEqual",
"text": "private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))\n:= by\n simp only [Decima... | [
{
"name": "pe_decimal_greaterThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 335,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,10 +32,17 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))
+:= by
+ simp only [Decimal... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_2 | 86e84bd0ccee8bf1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "pe_ipaddr_range",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth, pe_bvlshr, pe_bvshl, pe_bvadd, BitVec.add_eq,\n pe_bvsub, BitVec.sub_eq,... | [
{
"name": "pe_ipaddr_subnetWidth",
"text": "private theorem pe_ipaddr_subnetWidth {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.subnetWidth w (cidrPrefixTerm cidr) = Ext.IPAddr.CIDR.subnetWidth cidr\n:= by\n simp only [IPAddr.subnetWidth, cidrPrefixTerm, Ext.IPAddr.CIDR.subnetWidth]\n split <;> rename_... | [
{
"name": "pe_ipaddr_range",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 389,
"n_subproofs": 0,
"n_tactics": 3,
"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... | @@ -32,10 +32,23 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_ipaddr_subnetWidth {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.subnetWidth w (cidrPrefixTerm cidr) = Ext.IPAddr.CIDR.subnetWidth cidr
+:= by
+ simp only [IPAddr.subnetWidth, cidrPrefixTerm, Ext.IPAddr.CIDR.subnetWidth]
+ split <;> ren... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_3 | 4b701dbd961de4f7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "pe_ipaddr_rangeV4",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 319,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,10 +43,18 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_4 | 561237fdadc89dc6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "pe_ipaddr_rangeV6",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 319,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -43,10 +43,18 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_5 | 699f63d546515119 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [IPAddr.isInRange, Ext.IPAddr.IPNet.inRange, IPAddr.inRangeV]\n cases ip₁ <;> cases ip₂ <;>\n simp only [\n ... | [
{
"name": "pe_ipaddr_isIpv6_V6",
"text": "private theorem pe_ipaddr_isIpv6_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :\n IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = true\n:= by\n simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]\n\n",
"fan_in":... | [
{
"name": "pe_ipaddr_isInRange",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 9,
"n_lines": 15,
"n_chars": 610,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 5,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_n... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -47,6 +47,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V4, pe_not_true]
+private theorem pe_ipaddr_isIpv6_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :
+ IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = true
+:= by
+ simp only [IPAddr.isIpv6, pe_ext_ipaddr_is... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_6 | deda916ea98431fe | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "pe_ipaddr_isInRangeLit",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 16,
"n_chars": 603,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max... | 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... | @@ -53,15 +53,24 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_7 | 41d544b233a40062 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "pe_ipaddr_isLoopback",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 247,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 8 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -53,15 +53,24 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_8 | c29c662a4fb8b29f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "pe_ipaddr_isMulticast",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 8 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -53,15 +53,24 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_9 | cc41e0d4482b8477 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThan, interpret_decimal_lessThan]",
"n_chars": 65,
"n_subproofs": 0,
"n... | [
{
"name": "interpret_decimal_lessThan",
"text": "private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]\n\... | [
{
"name": "interpret_decimal_greaterThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,9 +32,15 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]
+
p... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_10 | 6d01603cd95fe1d5 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThanOrEqual, interpret_decimal_lessThanOrEqual]",
"n_chars": 79,
"n_... | [
{
"name": "interpret_decimal_lessThanOrEqual",
"text": "private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThanOrEqual, interpret_b... | [
{
"name": "interpret_decimal_greaterThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 298,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tr... | 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,9 +32,15 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThanOrEqual, interpret_bvsle, 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_00e69b3111fa_11 | 9a5777176039d73f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "interpret_ipaddr_range",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [\n IPAddr.range, Prod.map, interpret_bvshl, interpret_bvlshr,\n interpret_bvsub, interpret_bvadd, i... | [
{
"name": "interpret_ipaddr_subnetWidth",
"text": "private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}\n (hI : I.WellFormed εs)\n (h₁ : ipPre.WellFormed εs ∧ ipPre.typeOf = .option (.bitvec w)) :\n (IPAddr.subnetWidth w ipPre).interpret I = IPAddr... | [
{
"name": "interpret_ipaddr_range",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 530,
"n_subproofs": 0,
"n_tactics": 5,
"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... | @@ -32,12 +32,48 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : ipPre.WellFormed εs ∧ ipPre.typeOf = .option (.bitvec w)) :
+ (IPAddr.subnetWidth w ipPre).interpret I = IPAddr.su... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_12 | a967ebe1988c13b7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 4 | [
{
"theorem_name": "pe_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [IPAddr.isInRange, Ext.IPAddr.IPNet.inRange, IPAddr.inRangeV]\n cases ip₁ <;> cases ip₂ <;>\n simp only [\n ... | [
{
"name": "pe_ipaddr_isIpv4_V6",
"text": "private theorem pe_ipaddr_isIpv4_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :\n IPAddr.isIpv4 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = false\n:= by\n simp only [IPAddr.isIpv4, pe_ext_ipaddr_isV4_V6]\n\n",
"fan_in": 4,
"n_li... | [
{
"name": "interpret_ipaddr_rangeV4",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 873,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -32,6 +32,11 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_ipaddr_isIpv4_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :
+ IPAddr.isIpv4 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = false
+:= by
+ simp only [IPAddr.isIpv4, pe_ext_ipaddr_isV4_V6]
+
private theorem interpre... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_13 | cd233174aa075591 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "interpret_ipaddr_range",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [\n IPAddr.range, Prod.map, interpret_bvshl, interpret_bvlshr,\n interpret_bvsub, interpret_bvadd, i... | [
{
"name": "interpret_ipaddr_subnetWidth",
"text": "private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}\n (hI : I.WellFormed εs)\n (h₁ : ipPre.WellFormed εs ∧ ipPre.typeOf = .option (.bitvec w)) :\n (IPAddr.subnetWidth w ipPre).interpret I = IPAddr... | [
{
"name": "interpret_ipaddr_rangeV6",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 873,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"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... | @@ -37,12 +37,48 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V4, pe_not_true]
+private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : ipPre.WellFormed εs ∧ ipPre.typeOf = .option (.bitvec w)) :
+ (IPAddr.subnetWid... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_14 | 1c6efaacc28a4f95 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_ipaddr_inRangeV",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hw₃ := wf_ipaddr_inRange hr₁ hr₂\n have hw₄ := wf_and hw₂.left hw₃.left hw₂.right hw₃.right\n simp only [... | [
{
"name": "interpret_ipaddr_inRange",
"text": "private theorem interpret_ipaddr_inRange {εs : SymEntities} {I : Interpretation} {w : Nat} {rangeV : Term → Term × Term} {t₁ t₂ : Term}\n (hI : I.WellFormed εs)\n (h₁ : WFIPRange εs (rangeV t₁) w)\n (h₂ : WFIPRange εs (rangeV t₂) w)\n (h₃ : (rangeV t₁).map ... | [
{
"name": "interpret_ipaddr_inRangeV",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1821,
"n_subproofs": 4,
"n_tactics": 20,
"cyclomatic": 5,
"n_automation": 3,
"n_rewrites": 3,
"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... | @@ -32,6 +32,22 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_ipaddr_inRange {εs : SymEntities} {I : Interpretation} {w : Nat} {rangeV : Term → Term × Term} {t₁ t₂ : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : WFIPRange εs (rangeV t₁) w)
+ (h₂ : WFIPRange εs (rangeV t₂) w)
+ (h₃ : (rangeV t₁).map ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_15 | 8ddf63f15812f51b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv6",
"text": "private theorem interpret_ipaddr_isIpv6 {εs : SymEntities} {I : Interpretation} {t : Term}\n (hI : I.WellFormed εs)\n (h₁ : t.WellFormed εs ∧ t.typeOf = .ext .ipAddr) :\n (IPAddr.isIpv6 t).interpret I = IPAddr.isIpv6 (t.interpret I)\n:= by\n simp only [IPAdd... | [
{
"name": "interpret_ipaddr_isInRange",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 23,
"n_chars": 1292,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -47,6 +47,14 @@
:= by
simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+private theorem interpret_ipaddr_isIpv6 {εs : SymEntities} {I : Interpretation} {t : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : t.WellFormed εs ∧ t.typeOf = .ext .ipAddr) :
+ (IPAddr.isIpv6 t).interpret I = IPAddr.isIpv6 (t.interpret I)... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_16 | 0ebf6771273e65bd | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "interpret_ipaddr_inRangeLit",
"fan_in": 2,
"n_deps_direct": 7,
"n_deps_transitive": 10,
"n_lines": 40,
"n_chars": 2161,
"n_subproofs": 4,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 5,
"n_structural": 7,
"automation_only": false,
... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -52,6 +52,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
private theorem inte... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_17 | 40b54cf037bb152a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "interpret_ipaddr_isLoopback",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 8,
"n_chars": 324,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 11 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -52,6 +52,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
private theorem inte... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_18 | c212840dc0a38bb6 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "interpret_ipaddr_isMulticast",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 8,
"n_chars": 328,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 11 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -52,6 +52,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
private theorem inte... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_19 | 7d899abe527de098 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toSeconds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret_term_prim]",
... | [
{
"name": "interpret_duration_toMilliseconds",
"text": "private theorem interpret_duration_toMilliseconds {I : Interpretation} {t : Term} :\n (Duration.toMilliseconds t).interpret I = Duration.toMilliseconds (t.interpret I)\n:= by\n simp only [Duration.toMilliseconds, interpret_ext_duration_val]\n\n",
... | [
{
"name": "interpret_duration_toSeconds",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 267,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,9 +32,15 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_duration_toMilliseconds {I : Interpretation} {t : Term} :
+ (Duration.toMilliseconds t).interpret I = Duration.toMilliseconds (t.interpret I)
+:= by
+ simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+
private theorem... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_20 | 5e26c92e58e79be0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toMinutes",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term_prim]",
"n_c... | [
{
"name": "interpret_duration_toSeconds",
"text": "private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :\n (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)\n:= by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret... | [
{
"name": "interpret_duration_toMinutes",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 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... | @@ -37,9 +37,15 @@
:= by
simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :
+ (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)
+:= by
+ simp only [Duration.toSeconds, interpret_bvsdiv, interpret_d... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_21 | 4180b38ef67c5393 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toMinutes",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term_prim]",
"n_c... | [
{
"name": "interpret_duration_toSeconds",
"text": "private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :\n (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)\n:= by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret... | [
{
"name": "interpret_duration_toHours",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 254,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 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... | @@ -37,9 +37,15 @@
:= by
simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :
+ (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)
+:= by
+ simp only [Duration.toSeconds, interpret_bvsdiv, interpret_d... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_22 | c025e32710218be0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toHours",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toHours, interpret_bvsdiv, interpret_duration_toMinutes, interpret_term_prim]",
"n_chars... | [
{
"name": "interpret_duration_toMinutes",
"text": "private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :\n (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)\n:= by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term... | [
{
"name": "interpret_duration_toDays",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 310,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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... | @@ -42,9 +42,15 @@
:= by
simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret_term_prim]
+private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :
+ (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)
+:= by
+ simp only [Duration... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_23 | 18c8812f23a89b9d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThan, interpret_decimal_lessThan]",
"n_chars": 65,
"n_subproofs": 0,
"n... | [
{
"name": "interpret_decimal_lessThan",
"text": "private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]\n\... | [
{
"name": "compileCall_interpret_decimal_lessThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 531,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,11 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]
+
l... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_24 | 107cade459b29d0d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThanOrEqual, interpret_decimal_lessThanOrEqual]",
"n_chars": 79,
"n_... | [
{
"name": "interpret_decimal_lessThanOrEqual",
"text": "private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThanOrEqual, interpret_b... | [
{
"name": "compileCall_interpret_decimal_lessThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 580,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,11 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThanOrEqual, interpret_bvsle, 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_00e69b3111fa_25 | 950cf6af7899d60e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThan, interpret_decimal_lessThan]",
"n_chars": 65,
"n_subproofs": 0,
"n... | [
{
"name": "interpret_decimal_lessThan",
"text": "private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]\n\... | [
{
"name": "compileCall_interpret_decimal_greaterThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 552,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,9 +32,15 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThan {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThan t₁ t₂).interpret I = Decimal.lessThan (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThan, interpret_bvslt, interpret_ext_decimal_val]
+
p... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_26 | 0c67fa5692f97fef | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Decimal.greaterThanOrEqual, interpret_decimal_lessThanOrEqual]",
"n_chars": 79,
"n_... | [
{
"name": "interpret_decimal_lessThanOrEqual",
"text": "private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :\n (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)\n:= by\n simp only [Decimal.lessThanOrEqual, interpret_b... | [
{
"name": "compileCall_interpret_decimal_greaterThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 601,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,9 +32,15 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_decimal_lessThanOrEqual {I : Interpretation} {t₁ t₂ : Term} :
+ (Decimal.lessThanOrEqual t₁ t₂).interpret I = Decimal.lessThanOrEqual (t₁.interpret I) (t₂.interpret I)
+:= by
+ simp only [Decimal.lessThanOrEqual, interpret_bvsle, 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_00e69b3111fa_27 | da3491580caf4e14 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "compileCall_interpret_ipaddr_isIpv4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 512,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,11 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
local macro "simp_compileCall₀_interpret" hok:ident 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_00e69b3111fa_28 | b61852448597aec7 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv6",
"text": "private theorem interpret_ipaddr_isIpv6 {εs : SymEntities} {I : Interpretation} {t : Term}\n (hI : I.WellFormed εs)\n (h₁ : t.WellFormed εs ∧ t.typeOf = .ext .ipAddr) :\n (IPAddr.isIpv6 t).interpret I = IPAddr.isIpv6 (t.interpret I)\n:= by\n simp only [IPAdd... | [
{
"name": "compileCall_interpret_ipaddr_isIpv6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 512,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,14 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_ipaddr_isIpv6 {εs : SymEntities} {I : Interpretation} {t : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : t.WellFormed εs ∧ t.typeOf = .ext .ipAddr) :
+ (IPAddr.isIpv6 t).interpret I = IPAddr.isIpv6 (t.interpret I)
+:= by
+ simp only [IPAd... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_29 | c322d451f3677cbc | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "compileCall_interpret_ipaddr_isLoopback",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 11,
"n_chars": 540,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 12 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -52,6 +52,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
private theorem inte... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_30 | 1070449173f5d77f | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 3 | [
{
"theorem_name": "interpret_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ := wf_ipaddr_inRangeV (wf_ipaddr_rangeV4 h₁) (wf_ipaddr_rangeV4 h₂) (wf_ipaddr_isIpv4 h₁) (wf_ipaddr_is... | [
{
"name": "interpret_ipaddr_isIpv4",
"text": "private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :\n (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)\n:= by\n simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 200,... | [
{
"name": "compileCall_interpret_ipaddr_isMulticast",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 11,
"n_chars": 547,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 12 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -52,6 +52,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]
+private theorem interpret_ipaddr_isIpv4 {I : Interpretation} {t : Term} :
+ (IPAddr.isIpv4 t).interpret I = IPAddr.isIpv4 (t.interpret I)
+:= by
+ simp only [IPAddr.isIpv4, interpret_ext_ipaddr_isV4]
+
private theorem inte... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_31 | 46677f409a58e08b | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "interpret_ipaddr_range",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [\n IPAddr.range, Prod.map, interpret_bvshl, interpret_bvlshr,\n interpret_bvsub, interpret_bvadd, i... | [
{
"name": "interpret_ipaddr_subnetWidth",
"text": "private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}\n (hI : I.WellFormed εs)\n (h₁ : ipPre.WellFormed εs ∧ ipPre.typeOf = .option (.bitvec w)) :\n (IPAddr.subnetWidth w ipPre).interpret I = IPAddr... | [
{
"name": "compileCall_interpret_ipaddr_isInRange",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 11,
"n_chars": 533,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only"... | 11 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -55,12 +55,48 @@
simp only [IPAddr.isIpv6, interpret_not hI (wf_ext_ipaddr_isV4 h₁.left h₁.right).left,
interpret_ext_ipaddr_isV4]
+private theorem interpret_ipaddr_subnetWidth {εs : SymEntities} {I : Interpretation} {w : Nat} {ipPre : Term}
+ (hI : I.WellFormed εs)
+ (h₁ : ipPre.WellFormed εs ∧ ipPre.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_00e69b3111fa_32 | f13a9210cc97789e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_offset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₂_interpret I hI hwφ hok\n Datetime.offset compileCall_datetime_offset_ok_implies\n wf... | [
{
"name": "interpret_datetime_offset",
"text": "private theorem interpret_datetime_offset {I : Interpretation} {t₁ t₂ : Term}\n (hI : I.WellFormed εs)\n (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)\n (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .duration) :\n (Datetime.offset t₁ t₂).interpret I =... | [
{
"name": "compileCall_interpret_datetime_offset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 516,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,21 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_datetime_offset {I : Interpretation} {t₁ t₂ : Term}
+ (hI : I.WellFormed εs)
+ (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)
+ (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .duration) :
+ (Datetime.offset t₁ t₂).interpret I = ... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_33 | 79faa2e6acf20cb1 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_durationSince",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₂_interpret I hI hwφ hok\n Datetime.durationSince compileCall_datetime_durationS... | [
{
"name": "interpret_datetime_durationSince",
"text": "private theorem interpret_datetime_durationSince {I : Interpretation} {t₁ t₂ : Term}\n (hI : I.WellFormed εs)\n (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)\n (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .datetime) :\n (Datetime.durationSince... | [
{
"name": "compileCall_interpret_datetime_durationSince",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 565,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,21 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_datetime_durationSince {I : Interpretation} {t₁ t₂ : Term}
+ (hI : I.WellFormed εs)
+ (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)
+ (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .datetime) :
+ (Datetime.durationSince t₁ t₂).... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_34 | 36917ea8e49b279d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_toDate",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₁_interpret I hI hwφ hok\n Datetime.toDate compileCall_datetime_toDate_ok_implies\n wf... | [
{
"name": "interpret_datetime_toDate",
"text": "private theorem interpret_datetime_toDate {εs : SymEntities} {I : Interpretation} {t : Term}\n (hI : I.WellFormed εs)\n (hw : t.WellFormed εs ∧ t.typeOf = .ext .datetime) :\n (Datetime.toDate t).interpret I = Datetime.toDate (t.interpret I)\n:= by\n have ⟨... | [
{
"name": "compileCall_interpret_datetime_toDate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 516,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,25 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_datetime_toDate {εs : SymEntities} {I : Interpretation} {t : Term}
+ (hI : I.WellFormed εs)
+ (hw : t.WellFormed εs ∧ t.typeOf = .ext .datetime) :
+ (Datetime.toDate t).interpret I = Datetime.toDate (t.interpret I)
+:= by
+ have ⟨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_00e69b3111fa_35 | 05a2a04be516baf0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 35 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_toTime",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₁_interpret I hI hwφ hok\n Datetime.toTime compileCall_datetime_toTime_ok_implies\n wf... | [
{
"name": "interpret_datetime_toTime",
"text": "private theorem interpret_datetime_toTime {εs : SymEntities} {I : Interpretation} {t : Term}\n (hI : I.WellFormed εs)\n (hw : t.WellFormed εs ∧ t.typeOf = .ext .datetime) :\n (Datetime.toTime t).interpret I = Datetime.toTime (t.interpret I)\n:= by\n have ⟨... | [
{
"name": "compileCall_interpret_datetime_toTime",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 516,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,26 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_datetime_toTime {εs : SymEntities} {I : Interpretation} {t : Term}
+ (hI : I.WellFormed εs)
+ (hw : t.WellFormed εs ∧ t.typeOf = .ext .datetime) :
+ (Datetime.toTime t).interpret I = Datetime.toTime (t.interpret I)
+:= by
+ have ⟨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_00e69b3111fa_36 | 4881c59798e7a4db | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 36 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toSeconds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret_term_prim]",
... | [
{
"name": "interpret_duration_toMilliseconds",
"text": "private theorem interpret_duration_toMilliseconds {I : Interpretation} {t : Term} :\n (Duration.toMilliseconds t).interpret I = Duration.toMilliseconds (t.interpret I)\n:= by\n simp only [Duration.toMilliseconds, interpret_ext_duration_val]\n\n",
... | [
{
"name": "compileCall_interpret_duration_toMilliseconds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 578,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,11 @@
----- PE lemmas for ExtFuns -----
+private theorem interpret_duration_toMilliseconds {I : Interpretation} {t : Term} :
+ (Duration.toMilliseconds t).interpret I = Duration.toMilliseconds (t.interpret I)
+:= by
+ simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+
local macro "si... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_37 | b0cb49b58727ee57 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 37 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toMinutes",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term_prim]",
"n_c... | [
{
"name": "interpret_duration_toSeconds",
"text": "private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :\n (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)\n:= by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret... | [
{
"name": "compileCall_interpret_duration_toSeconds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 543,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -37,6 +37,11 @@
:= by
simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :
+ (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)
+:= by
+ simp only [Duration.toSeconds, interpret_bvsdiv, interpret_d... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_38 | 136dee7b220bf969 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 38 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toMinutes",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term_prim]",
"n_c... | [
{
"name": "interpret_duration_toSeconds",
"text": "private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :\n (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)\n:= by\n simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret... | [
{
"name": "compileCall_interpret_duration_toMinutes",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 543,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 3 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -37,9 +37,15 @@
:= by
simp only [Duration.toMilliseconds, interpret_ext_duration_val]
+private theorem interpret_duration_toSeconds {I : Interpretation} {t : Term} :
+ (Duration.toSeconds t).interpret I = Duration.toSeconds (t.interpret I)
+:= by
+ simp only [Duration.toSeconds, interpret_bvsdiv, interpret_d... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_39 | 16871ddd77474640 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 39 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toHours",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toHours, interpret_bvsdiv, interpret_duration_toMinutes, interpret_term_prim]",
"n_chars... | [
{
"name": "interpret_duration_toMinutes",
"text": "private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :\n (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)\n:= by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term... | [
{
"name": "compileCall_interpret_duration_toHours",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 529,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -42,9 +42,15 @@
:= by
simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret_term_prim]
+private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :
+ (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)
+:= by
+ simp only [Duration... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_40 | 6f3a7cd2275cf8cc | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 40 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "interpret_duration_toHours",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [Duration.toHours, interpret_bvsdiv, interpret_duration_toMinutes, interpret_term_prim]",
"n_chars... | [
{
"name": "interpret_duration_toMinutes",
"text": "private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :\n (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)\n:= by\n simp only [Duration.toMinutes, interpret_bvsdiv, interpret_duration_toSeconds, interpret_term... | [
{
"name": "compileCall_interpret_duration_toDays",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 522,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -42,9 +42,15 @@
:= by
simp only [Duration.toSeconds, interpret_bvsdiv, interpret_duration_toMilliseconds, interpret_term_prim]
+private theorem interpret_duration_toMinutes {I : Interpretation} {t : Term} :
+ (Duration.toMinutes t).interpret I = Duration.toMinutes (t.interpret I)
+:= by
+ simp only [Duration... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_41 | bfe12a3ea13dccc3 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 41 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_offset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₂_interpret I hI hwφ hok\n Datetime.offset compileCall_datetime_offset_ok_implies\n wf... | [
{
"name": "interpret_datetime_offset",
"text": "private theorem interpret_datetime_offset {I : Interpretation} {t₁ t₂ : Term}\n (hI : I.WellFormed εs)\n (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)\n (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .duration) :\n (Datetime.offset t₁ t₂).interpret I =... | [
{
"name": "compileCall_interpret",
"fan_in": 1,
"n_deps_direct": 22,
"n_deps_transitive": 51,
"n_lines": 31,
"n_chars": 2182,
"n_subproofs": 0,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 23,
"automation_only": false,
... | 51 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -284,6 +284,21 @@
:= by
simp only [IPAddr.isMulticast, interpret_ipaddr_inRangeLit hI hw]
+private theorem interpret_datetime_offset {I : Interpretation} {t₁ t₂ : Term}
+ (hI : I.WellFormed εs)
+ (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)
+ (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .duration) :
... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_42 | b9a9bd7ca0bdd2b2 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 42 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compileCall_interpret_datetime_durationSince",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp_compileCall₂_interpret I hI hwφ hok\n Datetime.durationSince compileCall_datetime_durationS... | [
{
"name": "interpret_datetime_durationSince",
"text": "private theorem interpret_datetime_durationSince {I : Interpretation} {t₁ t₂ : Term}\n (hI : I.WellFormed εs)\n (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .datetime)\n (hw₂ : t₂.WellFormed εs ∧ t₂.typeOf = .ext .datetime) :\n (Datetime.durationSince... | [
{
"name": "compile_interpret_call",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 52,
"n_lines": 26,
"n_chars": 1098,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"... | 52 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -299,6 +299,21 @@
interpret_ext_datetime_ofBitVec, interpret_bvadd, interpret_bvsaddo,
interpret_ext_datetime_val, interpret_ext_duration_val]
+private theorem interpret_datetime_durationSince {I : Interpretation} {t₁ t₂ : Term}
+ (hI : I.WellFormed εs)
+ (hw₁ : t₁.WellFormed εs ∧ t₁.typeOf = .ext .dat... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_43 | f9f8715b5385ef7a | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 43 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThan, pe_decimal_lessThan, gt_iff_lt]",
"n_chars": 67,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "pe_decimal_lessThan",
"text": "private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ < d₂)))\n:= by\n simp only [Decimal.lessThan, pe_ext_de... | [
{
"name": "compile_evaluate_call_decimal_lessThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,12 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ < d₂)))
+:= by
+ simp only [Decimal.lessThan, pe_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_00e69b3111fa_44 | 23dbfbcebfce8c2d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 44 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThanOrEqual, pe_decimal_lessThanOrEqual, ge_iff_le]",
"n_chars": 81,
"n_subpro... | [
{
"name": "pe_decimal_lessThanOrEqual",
"text": "private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))\n:= by\n simp only [Decima... | [
{
"name": "compile_evaluate_call_decimal_lessThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 621,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,13 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))
+:= by
+ simp only [Decimal.... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_45 | bba1be3e7bd98077 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 45 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThan",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThan, pe_decimal_lessThan, gt_iff_lt]",
"n_chars": 67,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "pe_decimal_lessThan",
"text": "private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ < d₂)))\n:= by\n simp only [Decimal.lessThan, pe_ext_de... | [
{
"name": "compile_evaluate_call_decimal_greaterThan",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 601,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,10 +32,16 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThan {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThan (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ < d₂)))
+:= by
+ simp only [Decimal.lessThan, pe_... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_46 | 2a0f41f7d189b24e | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 46 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_decimal_greaterThanOrEqual",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp only [Decimal.greaterThanOrEqual, pe_decimal_lessThanOrEqual, ge_iff_le]",
"n_chars": 81,
"n_subpro... | [
{
"name": "pe_decimal_lessThanOrEqual",
"text": "private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :\n Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =\n Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))\n:= by\n simp only [Decima... | [
{
"name": "compile_evaluate_call_decimal_greaterThanOrEqual",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 636,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 2 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -32,10 +32,17 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_decimal_lessThanOrEqual {d₁ d₂ : Ext.Decimal} :
+ Decimal.lessThanOrEqual (Term.prim (TermPrim.ext (Ext.decimal d₁))) (Term.prim (TermPrim.ext (Ext.decimal d₂))) =
+ Term.prim (TermPrim.bool (decide (d₁ ≤ d₂)))
+:= by
+ simp only [Decimal... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_47 | 84e3e14f7518c07c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 47 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compile_evaluate_call_ipaddr_isIpv4",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_compileCall₁_evaluate env hwφ ih hok\n compileCall_ipAddr_isIpv4_ok_implies wfl_of_type_ext_ipa... | [
{
"name": "pe_ipaddr_isIpv4",
"text": "private theorem pe_ipaddr_isIpv4 {ip : Ext.IPAddr.IPNet} :\n IPAddr.isIpv4 (Term.prim (TermPrim.ext (Ext.ipaddr ip))) = ip.isV4\n:= by\n simp only [IPAddr.isIpv4, Ext.IPAddr.IPNet.isV4]\n cases ip <;>\n simp only [pe_ext_ipaddr_isV4_V4, pe_ext_ipaddr_isV4_V6]\n\n",... | [
{
"name": "compile_evaluate_call_ipaddr_isIpv4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 575,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,13 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_ipaddr_isIpv4 {ip : Ext.IPAddr.IPNet} :
+ IPAddr.isIpv4 (Term.prim (TermPrim.ext (Ext.ipaddr ip))) = ip.isV4
+:= by
+ simp only [IPAddr.isIpv4, Ext.IPAddr.IPNet.isV4]
+ cases ip <;>
+ simp only [pe_ext_ipaddr_isV4_V4, pe_ext_ipaddr_isV4_V... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_48 | 38aaefc8f5f3b67d | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 48 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 1 | [
{
"theorem_name": "compile_evaluate_call_ipaddr_isIpv6",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_compileCall₁_evaluate env hwφ ih hok\n compileCall_ipAddr_isIpv6_ok_implies wfl_of_type_ext_ipa... | [
{
"name": "pe_ipaddr_isIpv6",
"text": "private theorem pe_ipaddr_isIpv6 {ip : Ext.IPAddr.IPNet} :\n IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr ip))) = ip.isV6\n:= by\n simp only [IPAddr.isIpv6, Ext.IPAddr.IPNet.isV6]\n cases ip <;>\n simp only [pe_ext_ipaddr_isV4_V4, pe_ext_ipaddr_isV4_V6, pe_no... | [
{
"name": "compile_evaluate_call_ipaddr_isIpv6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 575,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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... | @@ -32,6 +32,13 @@
----- PE lemmas for ExtFuns -----
+private theorem pe_ipaddr_isIpv6 {ip : Ext.IPAddr.IPNet} :
+ IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr ip))) = ip.isV6
+:= by
+ simp only [IPAddr.isIpv6, Ext.IPAddr.IPNet.isV6]
+ cases ip <;>
+ simp only [pe_ext_ipaddr_isV4_V4, pe_ext_ipaddr_isV4_V... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_49 | e311d263eb2cbd2c | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 49 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_isInRange",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [IPAddr.isInRange, Ext.IPAddr.IPNet.inRange, IPAddr.inRangeV]\n cases ip₁ <;> cases ip₂ <;>\n simp only [\n ... | [
{
"name": "pe_ipaddr_isIpv6_V6",
"text": "private theorem pe_ipaddr_isIpv6_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :\n IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = true\n:= by\n simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V6, pe_not_false]\n\n",
"fan_in":... | [
{
"name": "compile_evaluate_call_ipaddr_isInRange",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 10,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only"... | 10 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -47,6 +47,11 @@
:= by
simp only [IPAddr.isIpv6, pe_ext_ipaddr_isV4_V4, pe_not_true]
+private theorem pe_ipaddr_isIpv6_V6 {cidr : Ext.IPAddr.CIDR Ext.IPAddr.V6_WIDTH} :
+ IPAddr.isIpv6 (Term.prim (TermPrim.ext (Ext.ipaddr (Ext.IPAddr.IPNet.V6 cidr)))) = true
+:= by
+ simp only [IPAddr.isIpv6, pe_ext_ipaddr_is... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"revision": "795ddccff61c83aeb5d6a7ccd22abf5e00164c73",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_00e69b3111fa_50 | fe27fee4a5be6ba0 | lean | lean | github.com/cedar-policy/cedar-spec | 795ddccff61c83aeb5d6a7ccd22abf5e00164c73 | cedar-lean/Cedar/Thm/SymCC/Compiler/Call.lean | Call | 50 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 98 | 2 | [
{
"theorem_name": "pe_ipaddr_rangeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [IPAddr.rangeV4, pe_ext_ipaddr_addrV4_V4, pe_ext_ipaddr_prefixV4_V4, pe_ipaddr_range]",
"n_chars": 101,
... | [
{
"name": "pe_ipaddr_range",
"text": "private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :\n IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =\n (Ext.IPAddr.CIDR.range cidr).map Term.bitvec Term.bitvec\n:= by\n simp only [IPAddr.range, pe_ipaddr_subnetWidth,... | [
{
"name": "compile_evaluate_call_ipaddr_isLoopback",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 10,
"n_chars": 591,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only"... | 9 | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | /-
Copyright Cedar Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | @@ -53,15 +53,24 @@
have h : w ≤ 2 ^ w := by omega
simp only [pe_zero_extend h, pe_bvsub, BitVec.sub_eq, BitVec.natCast_eq_ofNat]
+private theorem pe_ipaddr_range {w : Nat} {cidr : Ext.IPAddr.CIDR w} :
+ IPAddr.range w (Term.prim (TermPrim.bitvec cidr.addr)) (cidrPrefixTerm cidr) =
+ (Ext.IPAddr.CIDR.rang... | {
"repo": "cedar-spec",
"git_repo": "github.com/cedar-policy/cedar-spec",
"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.