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_08b6cca5facb_2 | 2c9349dfabf5e4f0 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Normalize.lean | Normalize | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "LinExpr.norm_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [LinExpr.norm, LinExpr.eval, dropZero_eval, mergeTerms_eval]",
"n_chars": 76,
"n_subproofs": 0,
"n_... | [
{
"name": "mergeTerms_eval",
"text": "theorem mergeTerms_eval (ts : List (Variable × ZMod p)) (env : Variable → ZMod p) :\n ((mergeTerms ts).map (fun t => t.2 * env t.1)).sum\n = (ts.map (fun t => t.2 * env t.1)).sum := by\n simp [mergeTerms, foldl_addCoeff_eval]\n\n",
"fan_in": 1,
"n_lines":... | [
{
"name": "LinExpr.norm_eval",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 219,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 4 | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | @@ -53,6 +53,11 @@
simp only [List.foldl_cons, List.map_cons, List.sum_cons, ih, addCoeff_eval]
ring
+theorem mergeTerms_eval (ts : List (Variable × ZMod p)) (env : Variable → ZMod p) :
+ ((mergeTerms ts).map (fun t => t.2 * env t.1)).sum
+ = (ts.map (fun t => t.2 * env t.1)).sum := by
+ simp [me... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_08b6cca5facb_3 | 99d75a6604f8035b | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Normalize.lean | Normalize | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "foldl_addCoeff_fst",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction ts with\n | nil => intro init x hx; exact Or.inl hx\n | cons t rest ih =>\n intro init x hx\n sim... | [
{
"name": "addCoeff_fst",
"text": "theorem addCoeff_fst (v : Variable) (c : ZMod p) (ts : List (Variable × ZMod p)) (x : Variable)\n (h : x ∈ (addCoeff v c ts).map Prod.fst) : x = v ∨ x ∈ ts.map Prod.fst := by\n induction ts with\n | nil => simp only [addCoeff, List.map_cons, List.map_nil, List.mem_sin... | [
{
"name": "foldl_addCoeff_fst",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 617,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": false,
"max_ne... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | @@ -113,6 +113,22 @@
/-! ## Variable bounds -/
+theorem addCoeff_fst (v : Variable) (c : ZMod p) (ts : List (Variable × ZMod p)) (x : Variable)
+ (h : x ∈ (addCoeff v c ts).map Prod.fst) : x = v ∨ x ∈ ts.map Prod.fst := by
+ induction ts with
+ | nil => simp only [addCoeff, List.map_cons, List.map_nil, List.m... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_08b6cca5facb_4 | 496183946e3ecdba | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Normalize.lean | Normalize | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "mergeTerms_fst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases foldl_addCoeff_fst ts [] x h with h | h\n · simp at h\n · exact h",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "foldl_addCoeff_fst",
"text": "theorem foldl_addCoeff_fst (ts : List (Variable × ZMod p)) :\n ∀ (init : List (Variable × ZMod p)) (x : Variable),\n x ∈ (ts.foldl (fun acc t => addCoeff t.1 t.2 acc) init).map Prod.fst →\n x ∈ init.map Prod.fst ∨ x ∈ ts.map Prod.fst := by\n induction t... | [
{
"name": "mergeTerms_fst",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 2 | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | import ApcOptimizer.Implementation.OptimizerPasses.Affine
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
set_option autoImplicit false
/-! # Affine normalization (collect like terms)
An eval-preserving rewrite that replaces every maximal *affine* subexpression by its **merged**
normal form: `linearize`, ... | @@ -129,8 +129,26 @@
· exact Or.inr (Or.inl h)
· exact (ih h).imp id (Or.inr ·)
+theorem foldl_addCoeff_fst (ts : List (Variable × ZMod p)) :
+ ∀ (init : List (Variable × ZMod p)) (x : Variable),
+ x ∈ (ts.foldl (fun acc t => addCoeff t.1 t.2 acc) init).map Prod.fst →
+ x ∈ init.map Pro... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_325a04279cb0_0 | 1f2df17a5dd0515d | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/DisconnectedComponent.lean | DisconnectedComponent | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "dropComponent_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 88,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- the merge: keep `env` on kept variables, use the witness on removed ones\n set m : (Variable → ZMod p) → (Variab... | [
{
"name": "sideEffects_drop_eq",
"text": "/-! ## Side effects are unchanged when dropping stateless interactions\n\nThe evaluated stateful interactions of the filtered system (under `e1`) equal those of the original\n(under `e2`), given that every dropped interaction is stateless and every *stateful* intera... | [
{
"name": "dropComponent_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 110,
"n_chars": 6539,
"n_subproofs": 13,
"n_tactics": 85,
"cyclomatic": 3,
"n_automation": 12,
"n_rewrites": 8,
"n_structural": 32,
"automation_only": false,
... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Basic
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Utils.Size
set_option autoImplicit false
/-! # Disconnected-component removal
A *disconnected component* is a set of al... | import ApcOptimizer.Implementation.OptimizerPasses.Basic
import ApcOptimizer.Implementation.OptimizerPasses.Rewrite
import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Utils.Size
set_option autoImplicit false
/-! # Disconnected-component removal
A *disconnected component* is a set of al... | @@ -28,6 +28,46 @@
variable {p : ℕ}
+/-! ## Side effects are unchanged when dropping stateless interactions
+
+The evaluated stateful interactions of the filtered system (under `e1`) equal those of the original
+(under `e2`), given that every dropped interaction is stateless and every *stateful* interaction
+evalu... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_0 | d4235a3761086947 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "Expression.evalFast_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Expression.evalWith_eq _ _ (fun _ _ => rfl) (fun _ _ => rfl) env e",
"n_chars": 69,
"n_subproofs": 0,
"n_ta... | [
{
"name": "Expression.evalWith_eq",
"text": "theorem Expression.evalWith_eq (add mul : ZMod p → ZMod p → ZMod p)\n (hadd : ∀ a b, add a b = a + b) (hmul : ∀ a b, mul a b = a * b)\n (env : Variable → ZMod p) (e : Expression p) : e.evalWith add mul env = e.eval env := by\n induction e with\n | const n... | [
{
"name": "Expression.evalFast_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -105,6 +105,15 @@
| .add a b => add (a.evalWith add mul env) (b.evalWith add mul env)
| .mul a b => mul (a.evalWith add mul env) (b.evalWith add mul env)
+theorem Expression.evalWith_eq (add mul : ZMod p → ZMod p → ZMod p)
+ (hadd : ∀ a b, add a b = a + b) (hmul : ∀ a b, mul a b = a * b)
+ (env : Varia... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_1 | 3d85fb3bf31a9c9a | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "groupRewriteCand_agree",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hnotbits : ∀ y ∈ e.vars, y ∉ bits := by\n intro y hy hyb\n exact absurd hy (mentions_false_not_mem_vars ... | [
{
"name": "zip_map_self_mem",
"text": "/-- Membership of the graph pairs in the zip of a list with its image. -/\ntheorem zip_map_self_mem {α β : Type} (f : α → β) (l : List α) (a : α) (ha : a ∈ l) :\n (a, f a) ∈ l.zip (l.map f) := by\n induction l with\n | nil => simp at ha\n | cons x rest ih =>\n ... | [
{
"name": "groupRewriteCand_agree",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 51,
"n_chars": 2344,
"n_subproofs": 8,
"n_tactics": 41,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 15,
"automation_only": false,
"... | 5 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -592,6 +592,17 @@
let vals := patts.map (fun aβ => sub.evalFast (envOf aβ))
candSelect bits patts sub ((interpOfV patts vals).fold) vals
+/-- Membership of the graph pairs in the zip of a list with its image. -/
+theorem zip_map_self_mem {α β : Type} (f : α → β) (l : List α) (a : α) (ha : a ∈ l) :
+ (a, f... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_2 | ef9700ced2f438a3 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "groupRewrite_agree",
"depth": 1,
"n_commands": 0,
"n_lines": 63,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction e with\n | const n => rfl\n | var y =>\n simp only [groupRewrite]\n by_cases hyx : containsFast x... | [
{
"name": "groupRewriteCand_agree",
"text": "theorem groupRewriteCand_agree (xs bits : List Variable)\n (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))\n (env₀ env₁ : Variable → ZMod p) (aβ : List (Variable × ZMod p)) (haβ : aβ ∈ patts)\n (hbitsagree : ∀ b ∈ bits,... | [
{
"name": "groupRewrite_agree",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 73,
"n_chars": 3267,
"n_subproofs": 12,
"n_tactics": 63,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 12,
"n_structural": 15,
"automation_only": false,
"m... | 6 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -617,6 +617,56 @@
if (Expression.mul a b).varsInF xs then groupRewriteCand bits σfn patts (.mul a b)
else .mul (groupRewrite xs bits σfn patts a) (groupRewrite xs bits σfn patts b)
+theorem groupRewriteCand_agree (xs bits : List Variable)
+ (σfn : Variable → Option (Expression p)) (patts : List (L... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_3 | e902e9d1c8aed547 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 2 | [
{
"theorem_name": "groupRewrite_bi_agree",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold BusInteraction.mapExpr BusInteraction.eval\n simp only [List.map_map]\n congr 1\n · exact groupRewrite_agr... | [
{
"name": "groupRewrite_agree",
"text": "theorem groupRewrite_agree (xs bits : List Variable)\n (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))\n (hσnone : ∀ y, y ∉ xs → σfn y = none)\n (env₀ env₁ : Variable → ZMod p) (aβ : List (Variable × ZMod p)) (haβ : aβ ∈ pa... | [
{
"name": "groupRewrite_bi_agree",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 23,
"n_chars": 1250,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"ma... | 7 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -667,6 +667,78 @@
exact hpoint y (hnotbits y hy)
· exact hsubstF
+theorem groupRewrite_agree (xs bits : List Variable)
+ (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))
+ (hσnone : ∀ y, y ∉ xs → σfn y = none)
+ (env₀ env₁ : Variable → ZMod p) (aβ : List (Variable... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_4 | bc557726c0c45489 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "bitCM_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction patts with\n | nil => rfl\n | cons aβ rest ih =>\n show (matchCM xs (imgVal xs hm aβ) (.const (envOf aβ b)) (b... | [
{
"name": "matchCM_eval",
"text": "theorem matchCM_eval (xs : List Variable) (imgFn : Variable → ZMod p)\n (thenM elseM : ComputationMethod p) (env : Variable → ZMod p) :\n (matchCM xs imgFn thenM elseM).eval env\n = if xs.all (fun x => decide (imgFn x = env x)) then thenM.eval env else elseM.eval ... | [
{
"name": "bitCM_eval",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 751,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -865,6 +865,24 @@
| x :: rest =>
.ifEqZero (.add (.var x) (.const (-(imgFn x)))) (matchCM rest imgFn thenM elseM) elseM
+theorem matchCM_eval (xs : List Variable) (imgFn : Variable → ZMod p)
+ (thenM elseM : ComputationMethod p) (env : Variable → ZMod p) :
+ (matchCM xs imgFn thenM elseM).eval env
... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_5 | 0439cbbcddb33319 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "bitCM_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction patts with\n | nil => intro v hv; simp [bitCM, ComputationMethod.vars] at hv\n | cons aβ rest ih =>\n intro v ... | [
{
"name": "matchCM_vars",
"text": "/-- Variables of `matchCM` lie in `xs` together with those of the branches. -/\ntheorem matchCM_vars (xs : List Variable) (imgFn : Variable → ZMod p)\n (thenM elseM : ComputationMethod p) :\n ∀ v ∈ (matchCM xs imgFn thenM elseM).vars, v ∈ xs ∨ v ∈ thenM.vars ∨ v ∈ el... | [
{
"name": "bitCM_vars",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 599,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
"max_nesting": ... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -883,6 +883,24 @@
List.all_cons]
simp [hx]
+/-- Variables of `matchCM` lie in `xs` together with those of the branches. -/
+theorem matchCM_vars (xs : List Variable) (imgFn : Variable → ZMod p)
+ (thenM elseM : ComputationMethod p) :
+ ∀ v ∈ (matchCM xs imgFn thenM elseM).vars, v ∈ xs ∨... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_6 | 19fe8265c1e6f2c2 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "groupRewriteCand_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro v hv\n simp only [groupRewriteCand] at hv\n unfold candSelect at hv\n split at hv\n · next hchk =>\n r... | [
{
"name": "Expression.substF_varsIn_bits",
"text": "/-- Substituting a wholly-in-group expression (whose group variables `σfn` maps into the bits)\n yields an expression over the bits only. -/\ntheorem Expression.substF_varsIn_bits (xs bits : List Variable)\n (σfn : Variable → Option (Expression p))\n... | [
{
"name": "groupRewriteCand_vars",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 697,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -938,6 +938,33 @@
· simp [ComputationMethod.vars] at h
· exact ih v h
+/-- Substituting a wholly-in-group expression (whose group variables `σfn` maps into the bits)
+ yields an expression over the bits only. -/
+theorem Expression.substF_varsIn_bits (xs bits : List Variable)
+ (σfn : Variable ... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_7 | ae46b9c6f80a4439 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "groupRewrite_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction e with\n | const n => simp [groupRewrite, Expression.vars]\n | var y =>\n simp only [groupRewrite]\n ... | [
{
"name": "groupRewriteCand_vars",
"text": "/-- A rewritten wholly-in-group expression is over the bits only. -/\ntheorem groupRewriteCand_vars (xs bits : List Variable)\n (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))\n (hσ : ∀ y ∈ xs, ∀ v ∈ ((Expression.var y).sub... | [
{
"name": "groupRewrite_vars",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2133,
"n_subproofs": 0,
"n_tactics": 49,
"cyclomatic": 8,
"n_automation": 7,
"n_rewrites": 6,
"n_structural": 26,
"automation_only": false,
"max_n... | 2 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -965,6 +965,21 @@
· exact iha hin.1 v hv
· exact ihb hin.2 v hv
+/-- A rewritten wholly-in-group expression is over the bits only. -/
+theorem groupRewriteCand_vars (xs bits : List Variable)
+ (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))
+ (hσ : ∀ y ∈ xs, ∀... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_2fbd870ec752_8 | 22a14c408322cdc2 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Reencode.lean | Reencode | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 32 | 1 | [
{
"theorem_name": "reencodeOut_vars_subset",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro v hv\n have gr := groupRewrite_vars xs bits (groupSubst xs hm) (assignments (bitBox bits)) hσ\n rcases Con... | [
{
"name": "groupRewrite_vars",
"text": "/-- Every variable of a group-rewritten expression is either an original variable of `e` or a\n fresh bit. -/\ntheorem groupRewrite_vars (xs bits : List Variable)\n (σfn : Variable → Option (Expression p)) (patts : List (List (Variable × ZMod p)))\n (hσ : ∀ y... | [
{
"name": "reencodeOut_vars_subset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 33,
"n_chars": 1712,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 11,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 18,
"automation_only": false,
... | 3 | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | import ApcOptimizer.Implementation.OptimizerPasses.DomainBatch
set_option autoImplicit false
/-! # Witness re-encoding (fewer variables for enumerable witness sets)
A new *kind* of optimization: all passes so far eliminate variables whose values are
**entailed**. This pass eliminates *witness freedom* that is merely... | @@ -980,12 +980,86 @@
exact Expression.varsIn_sound bits _ hchk.1 v hv
· exact Expression.substF_varsIn_bits xs bits σfn hσ e hin v hv
+/-- Every variable of a group-rewritten expression is either an original variable of `e` or a
+ fresh bit. -/
+theorem groupRewrite_vars (xs bits : List Variable)
+ (... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_cd3d8c9712f6_0 | 6c058c432d71a74d | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Dedup.lean | Dedup | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ConstraintSystem.dedup_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hiff : ∀ env, (cs.dedup bs).satisfies bs env ↔ cs.satisfies bs env := by\n intro env\n simp only... | [
{
"name": "dedupStateless_covers",
"text": "/-- Every original interaction is either kept or was already in `seen`. -/\ntheorem dedupStateless_covers (bs : BusSemantics p) :\n ∀ (seen l : List (BusInteraction (Expression p))),\n ∀ bi ∈ l, bi ∈ dedupStateless bs seen l ∨ bi ∈ seen := by\n intro seen... | [
{
"name": "ConstraintSystem.dedup_correct",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 41,
"n_chars": 2009,
"n_subproofs": 4,
"n_tactics": 39,
"cyclomatic": 6,
"n_automation": 4,
"n_rewrites": 6,
"n_structural": 23,
"automation_only": fals... | 4 | import ApcOptimizer.Implementation.OptimizerPasses.FactPass
set_option autoImplicit false
/-! # Syntactic duplicate removal
Two syntactically identical algebraic constraints impose the same equation twice; two identical
*stateless* interactions impose the same lookup obligation twice. Keeping one of each changes
nei... | import ApcOptimizer.Implementation.OptimizerPasses.FactPass
set_option autoImplicit false
/-! # Syntactic duplicate removal
Two syntactically identical algebraic constraints impose the same equation twice; two identical
*stateless* interactions impose the same lookup obligation twice. Keeping one of each changes
nei... | @@ -53,6 +53,31 @@
· exact List.mem_cons_self ..
· exact List.mem_cons_of_mem _ (ih (b :: seen) bi h')
+/-- Every original interaction is either kept or was already in `seen`. -/
+theorem dedupStateless_covers (bs : BusSemantics p) :
+ ∀ (seen l : List (BusInteraction (Expression p))),
+ ∀ bi ∈ ... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_ceaaf0bc7202_0 | 03e7c3dd5a2b5bcd | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Rewrite.lean | Rewrite | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "ConstraintSystem.filterBus_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hiff : ∀ env, (cs.filterBus keep).satisfies bs env ↔ cs.satisfies bs env := by\n intro env\n ... | [
{
"name": "multiplicitySum_filterBus",
"text": "/-- Net multiplicity is unchanged by dropping (via `keep = false`) bus interactions whose evaluated\n multiplicity is `0`: such an interaction contributes `0` to every message's net multiplicity, so\n the two bus states are `≈`-equal. -/\ntheorem multipl... | [
{
"name": "ConstraintSystem.filterBus_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 2133,
"n_subproofs": 3,
"n_tactics": 29,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 18,
"automation_only": ... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Basic
set_option autoImplicit false
/-! # Generic equivalence-preserving rewrites
Two reusable, proof-carrying building blocks that (unlike substitution) keep the environment
fixed:
* `ConstraintSystem.mapExpr` — apply an **eval-preserving** expression transform `g... | import ApcOptimizer.Implementation.OptimizerPasses.Basic
set_option autoImplicit false
/-! # Generic equivalence-preserving rewrites
Two reusable, proof-carrying building blocks that (unlike substitution) keep the environment
fixed:
* `ConstraintSystem.mapExpr` — apply an **eval-preserving** expression transform `g... | @@ -102,6 +102,45 @@
exact hrest
rw [key cs.busInteractions h]
+/-- Net multiplicity is unchanged by dropping (via `keep = false`) bus interactions whose evaluated
+ multiplicity is `0`: such an interaction contributes `0` to every message's net multiplicity, so
+ the two bus states are `≈`-equal. -... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_6d74a9e204c8_0 | f0025195b4a3261a | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/MemoryUnify.lean | MemoryUnify | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "constDiff_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold constDiff at h\n split at h\n · exact absurd h (by simp)\n · rename_i l hl\n split_ifs at h with ht\n simp... | [
{
"name": "eqExpr_eval",
"text": "theorem eqExpr_eval (e2 e1 : Expression p) (env : Variable → ZMod p) :\n (eqExpr e2 e1).eval env = e2.eval env - e1.eval env := by\n show e2.eval env + (-1) * e1.eval env = _\n ring\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 187,
"n_subproofs": 0,
... | [
{
"name": "constDiff_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 612,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.TrivialConstraint
import ApcOptimizer.MemoryBus
set_option autoImplicit false
/-! # Memory send/receive unification
The consumer of the audited memory discipline (`ConstraintSystem.isIntended`,
`ApcOptimi... | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.TrivialConstraint
import ApcOptimizer.MemoryBus
set_option autoImplicit false
/-! # Memory send/receive unification
The consumer of the audited memory discipline (`ConstraintSystem.isIntended`,
`ApcOptimi... | @@ -31,6 +31,11 @@
/-- `e₂ - e₁` as an expression. -/
def eqExpr (e2 e1 : Expression p) : Expression p := .add e2 (.mul (.const (-1)) e1)
+theorem eqExpr_eval (e2 e1 : Expression p) (env : Variable → ZMod p) :
+ (eqExpr e2 e1).eval env = e2.eval env - e1.eval env := by
+ show e2.eval env + (-1) * e1.eval env = ... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_6d74a9e204c8_1 | 6f679a9d2aa3aef5 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/MemoryUnify.lean | MemoryUnify | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "linNeverZero",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h0\n haveI : NeZero p := ⟨hp.ne'⟩\n have hMp : M < p := lt_trans hlt (ZMod.val_lt l.const)\n obtain ⟨s, hsum, hsle⟩ ... | [
{
"name": "boundedSum_val",
"text": "theorem boundedSum_val (B : Std.HashMap Variable Nat)\n (terms : List (Variable × ZMod p)) (M : Nat)\n (hM : boundedSumMax B terms = some M) (hMp : M < p) (env : Variable → ZMod p)\n (hB : ∀ v bound, B[v]? = some bound → (env v).val < bound) :\n ∃ s : ZMod p,... | [
{
"name": "linNeverZero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 747,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.TrivialConstraint
import ApcOptimizer.MemoryBus
set_option autoImplicit false
/-! # Memory send/receive unification
The consumer of the audited memory discipline (`ConstraintSystem.isIntended`,
`ApcOptimi... | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.TrivialConstraint
import ApcOptimizer.MemoryBus
set_option autoImplicit false
/-! # Memory send/receive unification
The consumer of the audited memory discipline (`ConstraintSystem.isIntended`,
`ApcOptimi... | @@ -122,13 +122,60 @@
if 1 ≤ bound then some ((-a).val * (bound - 1) + m) else none
| _, _ => none
+theorem boundedSum_val (B : Std.HashMap Variable Nat)
+ (terms : List (Variable × ZMod p)) (M : Nat)
+ (hM : boundedSumMax B terms = some M) (hMp : M < p) (env : Variable → ZMod p)
+ (hB : ∀ v bo... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_c74f30a84fa2_0 | 09ae5c04ebb0a34b | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/TupleRange.lean | TupleRange | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "tupleKey",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro env\n obtain ⟨-, -, htriff⟩ := facts.tupleRangeBus_sound trBus s1 s2 htr\n obtain ⟨-, -, hbciff⟩ := facts.byteCheck_sound... | [
{
"name": "rangeCheck1_eval",
"text": "theorem rangeCheck1_eval (busId : Nat) (y b : Expression p) (env : Variable → ZMod p) :\n (rangeCheck1 busId y b).eval env\n = { busId := busId, multiplicity := 1, payload := [y.eval env, b.eval env] } := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_char... | [
{
"name": "tupleKey",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1539,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 9,
"automation_only": false,
"max_nesting": 8... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.BytePack
set_option autoImplicit false
/-! # Tuple-range packing (`tupleRangePass`)
A tuple range checker (OpenVM's `TupleRangeChecker (s1, s2)`) accepts the 2-ary message `[x, y]`
iff `x < s1 ∧ y < s2`. When `s1 = 256`, that is *exactly* the conjunction of a single... | import ApcOptimizer.Implementation.OptimizerPasses.BytePack
set_option autoImplicit false
/-! # Tuple-range packing (`tupleRangePass`)
A tuple range checker (OpenVM's `TupleRangeChecker (s1, s2)`) accepts the 2-ary message `[x, y]`
iff `x < s1 ∧ y < s2`. When `s1 = 256`, that is *exactly* the conjunction of a single... | @@ -32,6 +32,10 @@
def tupleCheck (busId : Nat) (x y : Expression p) : BusInteraction (Expression p) :=
{ busId := busId, multiplicity := .const 1, payload := [x, y] }
+theorem rangeCheck1_eval (busId : Nat) (y b : Expression p) (env : Variable → ZMod p) :
+ (rangeCheck1 busId y b).eval env
+ = { busId :=... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_0 | 1cde5627d58e2c9e | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "linearize_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction e generalizing l with\n | const n => simp only [linearize, Option.some.injEq] at h; subst h; simp [LinExpr.eval,... | [
{
"name": "LinExpr.scale_eval",
"text": "theorem LinExpr.scale_eval (k : ZMod p) (a : LinExpr p) (env : Variable → ZMod p) :\n (a.scale k).eval env = k * a.eval env := by\n simp only [LinExpr.scale, LinExpr.eval, List.map_map, mul_add]\n congr 1\n induction a.terms with\n | nil => simp\n | cons t re... | [
{
"name": "linearize_eval",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 2033,
"n_subproofs": 4,
"n_tactics": 42,
"cyclomatic": 6,
"n_automation": 15,
"n_rewrites": 9,
"n_structural": 6,
"automation_only": false,
"max_nest... | 2 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -45,6 +45,14 @@
simp only [LinExpr.add, LinExpr.eval, List.map_append, List.sum_append]
ring
+theorem LinExpr.scale_eval (k : ZMod p) (a : LinExpr p) (env : Variable → ZMod p) :
+ (a.scale k).eval env = k * a.eval env := by
+ simp only [LinExpr.scale, LinExpr.eval, List.map_map, mul_add]
+ congr 1
+ in... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_1 | 31fa976137601ee5 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "LinExpr.eval_split",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [LinExpr.eval, LinExpr.coeff, LinExpr.others, eval_terms_split x env l.terms]\n ring",
"n_chars": 100,
... | [
{
"name": "eval_terms_split",
"text": "/-- Partition the evaluation of a term list by whether the variable is `x`. -/\ntheorem eval_terms_split (x : Variable) (env : Variable → ZMod p)\n (terms : List (Variable × ZMod p)) :\n (terms.map (fun t => t.2 * env t.1)).sum\n = ((terms.filter (fun t => t.1... | [
{
"name": "LinExpr.eval_split",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -109,6 +109,25 @@
rw [if_neg h1, if_neg h2] at h
exact absurd h (by simp)
+/-- Partition the evaluation of a term list by whether the variable is `x`. -/
+theorem eval_terms_split (x : Variable) (env : Variable → ZMod p)
+ (terms : List (Variable × ZMod p)) :
+ (terms.map (fun t... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_2 | 741284ddff3e8c8d | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "LinExpr.toExpr_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [LinExpr.toExpr, LinExpr.eval, toExpr_foldl_eval, Expression.eval]",
"n_chars": 82,
"n_subproofs": 0,... | [
{
"name": "toExpr_foldl_eval",
"text": "theorem toExpr_foldl_eval (env : Variable → ZMod p) (terms : List (Variable × ZMod p)) :\n ∀ init : Expression p,\n (terms.foldl (fun acc t => .add acc (.mul (.const t.2) (.var t.1))) init).eval env\n = init.eval env + (terms.map (fun t => t.2 * env t.1))... | [
{
"name": "LinExpr.toExpr_eval",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -145,8 +145,21 @@
def LinExpr.toExpr (l : LinExpr p) : Expression p :=
l.terms.foldl (fun acc t => .add acc (.mul (.const t.2) (.var t.1))) (.const l.const)
+theorem toExpr_foldl_eval (env : Variable → ZMod p) (terms : List (Variable × ZMod p)) :
+ ∀ init : Expression p,
+ (terms.foldl (fun acc t => .a... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_3 | 7be650e991b8db82 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "LinExpr.toExpr_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro x hx\n rcases toExpr_foldl_vars l.terms _ x hx with h | h\n · simp [Expression.vars] at h\n · exact h",
"n... | [
{
"name": "toExpr_foldl_vars",
"text": "theorem toExpr_foldl_vars (terms : List (Variable × ZMod p)) :\n ∀ (init : Expression p) (x : Variable),\n x ∈ (terms.foldl (fun acc t => .add acc (.mul (.const t.2) (.var t.1))) init).vars →\n x ∈ init.vars ∨ x ∈ terms.map Prod.fst := by\n induction ter... | [
{
"name": "LinExpr.toExpr_vars",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 267,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -163,8 +163,28 @@
/-! ## Variable bounds (for `out.vars ⊆ cs.vars`) -/
+theorem toExpr_foldl_vars (terms : List (Variable × ZMod p)) :
+ ∀ (init : Expression p) (x : Variable),
+ x ∈ (terms.foldl (fun acc t => .add acc (.mul (.const t.2) (.var t.1))) init).vars →
+ x ∈ init.vars ∨ x ∈ terms.map Pro... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_4 | 931b30924eccdf57 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "linearize_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction e generalizing l with\n | const n => simp only [linearize, Option.some.injEq] at h; subst h; simp\n | var y =>\... | [
{
"name": "LinExpr.scale_terms_fst",
"text": "theorem LinExpr.scale_terms_fst (k : ZMod p) (l : LinExpr p) :\n (l.scale k).terms.map Prod.fst = l.terms.map Prod.fst := by\n simp [LinExpr.scale, List.map_map, Function.comp]\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 180,
"n_subproofs": 0... | [
{
"name": "linearize_vars",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1895,
"n_subproofs": 0,
"n_tactics": 43,
"cyclomatic": 6,
"n_automation": 15,
"n_rewrites": 8,
"n_structural": 13,
"automation_only": false,
"max_nes... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -186,6 +186,10 @@
· simp [Expression.vars] at h
· exact h
+theorem LinExpr.scale_terms_fst (k : ZMod p) (l : LinExpr p) :
+ (l.scale k).terms.map Prod.fst = l.terms.map Prod.fst := by
+ simp [LinExpr.scale, List.map_map, Function.comp]
+
theorem LinExpr.others_terms_fst_subset (l : LinExpr p) (v x : Var... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_5 | 7c6b4b889ae2a21e | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "LinExpr.trySolve_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold LinExpr.trySolve at h\n split_ifs at h with h1 h2\n · simp only [Option.some.injEq, Prod.mk.injEq] at h\n ... | [
{
"name": "LinExpr.toExpr_eval",
"text": "theorem LinExpr.toExpr_eval (l : LinExpr p) (env : Variable → ZMod p) :\n l.toExpr.eval env = l.eval env := by\n simp only [LinExpr.toExpr, LinExpr.eval, toExpr_foldl_eval, Expression.eval]\n\n/-! ## Variable bounds (for `out.vars ⊆ cs.vars`) -/\n\n",
"fan_i... | [
{
"name": "LinExpr.trySolve_sound",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 707,
"n_subproofs": 4,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
"ma... | 3 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -157,6 +157,12 @@
simp only [Expression.eval]
ring
+theorem LinExpr.toExpr_eval (l : LinExpr p) (env : Variable → ZMod p) :
+ l.toExpr.eval env = l.eval env := by
+ simp only [LinExpr.toExpr, LinExpr.eval, toExpr_foldl_eval, Expression.eval]
+
+/-! ## Variable bounds (for `out.vars ⊆ cs.vars`) -/... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_6 | 664de8a7a94ac52c | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "solveAffine_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [solveAffine, Option.bind_eq_some_iff] at h\n obtain ⟨l, hlin, hsl⟩ := h\n have hl : l.eval env = 0 := by rw ... | [
{
"name": "solveAffineLin_sound",
"text": "theorem solveAffineLin_sound (l : LinExpr p) (x : Variable) (t : Expression p)\n (h : solveAffineLin l = some (x, t)) (env : Variable → ZMod p) (hl : l.eval env = 0) :\n env x = t.eval env := by\n unfold solveAffineLin at h\n split at h\n · rename_i v _\n ... | [
{
"name": "solveAffine_sound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 931,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nest... | 4 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -319,13 +319,29 @@
| some v => l.trySolveUnit v
| none => none
+theorem solveAffineLin_sound (l : LinExpr p) (x : Variable) (t : Expression p)
+ (h : solveAffineLin l = some (x, t)) (env : Variable → ZMod p) (hl : l.eval env = 0) :
+ env x = t.eval env := by
+ unfold solveAffineLin at h
+ split a... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_7 | 08f017db2715bb88 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 3 | [
{
"theorem_name": "solveAffine_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [solveAffine, Option.bind_eq_some_iff] at h\n obtain ⟨l, hlin, hsl⟩ := h\n have hl : l.eval env = 0 := by rw ... | [
{
"name": "linearize_eval",
"text": "theorem linearize_eval (e : Expression p) (l : LinExpr p) (h : linearize e = some l)\n (env : Variable → ZMod p) : e.eval env = l.eval env := by\n induction e generalizing l with\n | const n => simp only [linearize, Option.some.injEq] at h; subst h; simp [LinExpr.ev... | [
{
"name": "pm1PivotsOf_sound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 463,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_nest... | 3 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -69,6 +69,46 @@
else none
| _, _ => none
+theorem linearize_eval (e : Expression p) (l : LinExpr p) (h : linearize e = some l)
+ (env : Variable → ZMod p) : e.eval env = l.eval env := by
+ induction e generalizing l with
+ | const n => simp only [linearize, Option.some.injEq] at h; subst h; ... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_8 | 2e028941edd89778 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "solvableFrom_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases List.mem_append.1 h with h' | h' <;> obtain ⟨c, hc, hp⟩ := List.mem_flatMap.1 h'\n · exact pm1PivotsOf_sound c x... | [
{
"name": "unitPivotsOf_sound",
"text": "theorem unitPivotsOf_sound (c : Expression p) (x : Variable) (t : Expression p)\n (h : (x, t) ∈ unitPivotsOf c) (env : Variable → ZMod p) (hc : c.eval env = 0) :\n env x = t.eval env := by\n unfold unitPivotsOf at h\n split at h\n · exact absurd h (by simp)\... | [
{
"name": "solvableFrom_sound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 429,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nest... | 5 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -350,6 +350,21 @@
| some _ => none
| none => l.trySolveUnit v)
+theorem unitPivotsOf_sound (c : Expression p) (x : Variable) (t : Expression p)
+ (h : (x, t) ∈ unitPivotsOf c) (env : Variable → ZMod p) (hc : c.eval env = 0) :
+ env x = t.eval env := by
+ unfold unitPivotsOf at h
+ split at h
... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_9 | 09eed691a192e7ac | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "pm1PivotsOf_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro y hy\n unfold pm1PivotsOf at h\n split at h\n · exact absurd h (by simp)\n · rename_i l hlin\n obtain ⟨v, _, ... | [
{
"name": "linearize_vars",
"text": "/-- Linearization introduces no variable outside the expression. -/\ntheorem linearize_vars (e : Expression p) (l : LinExpr p) (h : linearize e = some l) :\n ∀ x ∈ l.terms.map Prod.fst, x ∈ e.vars := by\n induction e generalizing l with\n | const n => simp only [lin... | [
{
"name": "pm1PivotsOf_vars",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 376,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 2 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -196,6 +196,48 @@
obtain ⟨t, ht, rfl⟩ := h
exact ⟨t, List.mem_of_mem_filter ht, rfl⟩
+/-- Linearization introduces no variable outside the expression. -/
+theorem linearize_vars (e : Expression p) (l : LinExpr p) (h : linearize e = some l) :
+ ∀ x ∈ l.terms.map Prod.fst, x ∈ e.vars := by
+ induction e ge... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_bbfc17b8619b_10 | db7a8a15d06233fd | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/Affine.lean | Affine | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "solvableFrom_vars",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro y hy\n rcases List.mem_append.1 h with h' | h' <;> obtain ⟨c, hc, hp⟩ := List.mem_flatMap.1 h'\n · exact ⟨c, hc, ... | [
{
"name": "unitPivotsOf_vars",
"text": "theorem unitPivotsOf_vars (c : Expression p) (x : Variable) (t : Expression p)\n (h : (x, t) ∈ unitPivotsOf c) : ∀ y ∈ t.vars, y ∈ c.vars := by\n intro y hy\n unfold unitPivotsOf at h\n split at h\n · exact absurd h (by simp)\n · rename_i l hlin\n obtain ⟨v... | [
{
"name": "solvableFrom_vars",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 399,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nesti... | 4 | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | import ApcOptimizer.Implementation.OptimizerPasses.Subst
import ApcOptimizer.Utils.Size
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Data.List.MinMax
set_option autoImplicit false
/-! # Affine substitution (linear/Gaussian elimi... | @@ -388,12 +388,26 @@
obtain ⟨v, _, hv⟩ := List.mem_filterMap.1 h
exact linearize_vars c l hlin y (l.trySolve_vars v x t hv y hy)
+theorem unitPivotsOf_vars (c : Expression p) (x : Variable) (t : Expression p)
+ (h : (x, t) ∈ unitPivotsOf c) : ∀ y ∈ t.vars, y ∈ c.vars := by
+ intro y hy
+ unfold unitPi... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_b5e1554ef056_0 | d128af95a8e629a1 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/SubsumedRange.lean | SubsumedRange | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "rangeCheck?_stateless",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (facts.varRangeBus_sound bi.busId (rangeCheck?_spec bs facts bi x cv h).1).1",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "rangeCheck?_spec",
"text": "/-- Structure of a recognized check: it lives on a `varRangeBus`, has multiplicity `1`, a\n satisfiable width, and payload `[x, c]` with `c` the constant `cv`. -/\ntheorem rangeCheck?_spec (bs : BusSemantics p) (facts : BusFacts p bs)\n (bi : BusInteraction (Expr... | [
{
"name": "rangeCheck?_stateless",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.FlagFold
set_option autoImplicit false
/-! # Subsumed range-check removal (idea 4(c))
After unification and packing, blocks keep a variable range check `[x, w]` on the variable range
checker whose bound `... | import ApcOptimizer.Implementation.OptimizerPasses.DomainProp
import ApcOptimizer.Implementation.OptimizerPasses.FlagFold
set_option autoImplicit false
/-! # Subsumed range-check removal (idea 4(c))
After unification and packing, blocks keep a variable range check `[x, w]` on the variable range
checker whose bound `... | @@ -53,16 +53,47 @@
| _ => none
| _ => none
+/-- Structure of a recognized check: it lives on a `varRangeBus`, has multiplicity `1`, a
+ satisfiable width, and payload `[x, c]` with `c` the constant `cv`. -/
+theorem rangeCheck?_spec (bs : BusSemantics p) (facts : BusFacts p bs)
+ (bi : BusInteraction (... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_e1ccde81edf4_0 | d8f6e8ad6d30d455 | lean | lean | github.com/powdr-labs/apc-optimizer | bd367dd92ecaabcdc3a308473fbe966da9a1c03c | ApcOptimizer/Implementation/OptimizerPasses/RedundantByteDrop.lean | RedundantByteDrop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "byteCheckOperands?_accepted",
"depth": 1,
"n_commands": 0,
"n_lines": 90,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨busId, mult, payload⟩ := bi\n unfold byteCheckOperands? at h\n split at h\n case h_2 => exact absur... | [
{
"name": "isByteCompl_sound",
"text": "theorem isByteCompl_sound (a b : Expression p) (h : isByteCompl a b = true)\n (env : Variable → ZMod p) : b.eval env = 255 - a.eval env := by\n unfold isByteCompl at h\n have hc : (Expression.add b (.mul (.const (-1)) (complExpr a))).normalize.constValue? = some ... | [
{
"name": "byteCheckOperands?_accepted",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 99,
"n_chars": 5542,
"n_subproofs": 30,
"n_tactics": 90,
"cyclomatic": 2,
"n_automation": 36,
"n_rewrites": 20,
"n_structural": 25,
"automation_only": fals... | 1 | import ApcOptimizer.Implementation.OptimizerPasses.BusPairCancel
import ApcOptimizer.Implementation.OptimizerPasses.FlagFold
set_option autoImplicit false
/-! # Redundant byte-check removal (C2)
After optimization, blocks keep stateless bitwise-lookup interactions whose *only* obligation is
"this operand is a byte" ... | import ApcOptimizer.Implementation.OptimizerPasses.BusPairCancel
import ApcOptimizer.Implementation.OptimizerPasses.FlagFold
set_option autoImplicit false
/-! # Redundant byte-check removal (C2)
After optimization, blocks keep stateless bitwise-lookup interactions whose *only* obligation is
"this operand is a byte" ... | @@ -51,6 +51,19 @@
def isByteCompl (a b : Expression p) : Bool :=
(Expression.add b (.mul (.const (-1)) (complExpr a))).normalize.constValue? == some 0
+theorem isByteCompl_sound (a b : Expression p) (h : isByteCompl a b = true)
+ (env : Variable → ZMod p) : b.eval env = 255 - a.eval env := by
+ unfold isByte... | {
"repo": "apc-optimizer",
"git_repo": "github.com/powdr-labs/apc-optimizer",
"revision": "bd367dd92ecaabcdc3a308473fbe966da9a1c03c",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_0 | f0a4b8f4835ca879 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeSegwit_encode",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeSegwit encodeSegwitBody\n simp only [List.append_assoc, Option.bind_eq_bind, Codec.decode_encode, Option.... | [
{
"name": "zipInputs_segwit",
"text": "/-- Rebundling the unbundled inputs and witnesses recovers the SegWit inputs. -/\ntheorem zipInputs_segwit (ins : CountedList SegwitInput) :\n zipInputs (segwitInputs ins) (segwitWitnesses ins) = ins := by\n apply Subtype.ext\n simp only [zipInputs, segwitInputs, ... | [
{
"name": "decodeSegwit_encode",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 762,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_ne... | 2 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -167,6 +167,13 @@
rw [List.length_zipWith]
exact lt_of_le_of_lt (Nat.min_le_left _ _) txins.property⟩
+/-- Rebundling the unbundled inputs and witnesses recovers the SegWit inputs. -/
+theorem zipInputs_segwit (ins : CountedList SegwitInput) :
+ zipInputs (segwitInputs ins) (segwitWitnesses ins) = ins... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_1 | 6f9a76291309bc04 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeLegacy_encode",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeLegacy\n simp only [List.append_assoc, Option.bind_eq_bind, Codec.decode_encode, Option.bind_some]\n rw ... | [
{
"name": "Tx.legacy?_eq_some",
"text": "/-- `Tx.legacy?` accepts any body already known to have non-empty inputs. -/\ntheorem Tx.legacy?_eq_some {body : TxBody} (h : body.inputs.val ≠ []) :\n Tx.legacy? body = some (Tx.legacy body h) := by\n simp only [Tx.legacy?, dif_pos h]\n\n",
"fan_in": 1,
... | [
{
"name": "decodeLegacy_encode",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 581,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -202,6 +202,11 @@
def Tx.legacy? (body : TxBody) : Option Tx :=
if h : body.inputs.val ≠ [] then some (Tx.legacy body h) else none
+/-- `Tx.legacy?` accepts any body already known to have non-empty inputs. -/
+theorem Tx.legacy?_eq_some {body : TxBody} (h : body.inputs.val ≠ []) :
+ Tx.legacy? body = some (... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_2 | 90ca86a5a1c58c56 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeSegwit_encode",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeSegwit encodeSegwitBody\n simp only [List.append_assoc, Option.bind_eq_bind, Codec.decode_encode, Option.... | [
{
"name": "segwitInputs_length",
"text": "/-- Unbundling a SegWit input list yields exactly as many inputs as witnesses. -/\ntheorem segwitInputs_length (ins : CountedList SegwitInput) :\n (segwitInputs ins).val.length = (segwitWitnesses ins).length := by\n simp only [segwitInputs, segwitWitnesses, List... | [
{
"name": "decodeTx_encodeTx",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 30,
"n_chars": 1380,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 4,
"automation_only": false,
"max_ne... | 7 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -189,6 +189,13 @@
simp only [segwitWitnesses, zipInputs]
exact List.map_zipWith_right (fun _ _ => rfl) txins.val wits h.symm
+/-- Unbundling a SegWit input list yields exactly as many inputs as witnesses. -/
+theorem segwitInputs_length (ins : CountedList SegwitInput) :
+ (segwitInputs ins).val.length = (... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_3 | 770f8ed79d92f82f | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeSegwit_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeSegwit at h\n simp only [Option.bind_eq_bind, Option.pure_def, Option.bind_eq_some_iff] at h\n obtai... | [
{
"name": "segwitInputs_zipInputs",
"text": "/-- The unbundled inputs of a rebundling are the inputs we started from. -/\ntheorem segwitInputs_zipInputs (txins : CountedList TxIn) (wits : List WitnessStack)\n (h : wits.length = txins.val.length) :\n segwitInputs (zipInputs txins wits) = txins := by\n ... | [
{
"name": "decodeSegwit_canonical",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1560,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"m... | 2 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -174,6 +174,14 @@
simp only [zipInputs, segwitInputs, segwitWitnesses]
exact List.zipWith_map_map_left_right (fun _ => rfl) ins.val
+/-- The unbundled inputs of a rebundling are the inputs we started from. -/
+theorem segwitInputs_zipInputs (txins : CountedList TxIn) (wits : List WitnessStack)
+ (h : wits... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_4 | 813d77ef0033bd15 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeLegacy_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeLegacy at h\n simp only [Option.bind_eq_bind, Option.pure_def, Option.bind_eq_some_iff,\n Option.s... | [
{
"name": "Tx.legacy_of_legacy?",
"text": "/-- An accepted `Tx.legacy?` returns a legacy transaction on exactly the body it\nwas given — so the body's inputs were non-empty. -/\ntheorem Tx.legacy_of_legacy? {body : TxBody} {tx : Tx}\n (h : Tx.legacy? body = some tx) :\n ∃ hne : body.inputs.val ≠ [], t... | [
{
"name": "decodeLegacy_canonical",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1295,
"n_subproofs": 5,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"m... | 1 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -207,6 +207,16 @@
Tx.legacy? body = some (Tx.legacy body h) := by
simp only [Tx.legacy?, dif_pos h]
+/-- An accepted `Tx.legacy?` returns a legacy transaction on exactly the body it
+was given — so the body's inputs were non-empty. -/
+theorem Tx.legacy_of_legacy? {body : TxBody} {tx : Tx}
+ (h : Tx.leg... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_9b3a8a866a78_5 | 39bc33ca4dcc74f7 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Transaction/Tx.lean | Tx | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "decodeSegwit_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeSegwit at h\n simp only [Option.bind_eq_bind, Option.pure_def, Option.bind_eq_some_iff] at h\n obtai... | [
{
"name": "segwitWitnesses_zipInputs",
"text": "/-- The unbundled witnesses of a rebundling are the witnesses we started from. -/\ntheorem segwitWitnesses_zipInputs (txins : CountedList TxIn) (wits : List WitnessStack)\n (h : wits.length = txins.val.length) :\n segwitWitnesses (zipInputs txins wits) =... | [
{
"name": "decodeTx_canonical",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 26,
"n_chars": 1163,
"n_subproofs": 4,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"max_n... | 5 | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | import BtcVerified.Transaction.TxBody
import BtcVerified.Transaction.SegwitInput
import BtcVerified.Serialize.CompactSize
import BtcVerified.Ext.List
/-!
# The transaction type and its codec
A transaction is era-aware from the start: an inductive with a `legacy` and a
`segwit` constructor over a shared, witness-... | @@ -182,6 +182,13 @@
simp only [segwitInputs, zipInputs]
exact List.map_zipWith_left (fun _ _ => rfl) txins.val wits h.symm
+/-- The unbundled witnesses of a rebundling are the witnesses we started from. -/
+theorem segwitWitnesses_zipInputs (txins : CountedList TxIn) (wits : List WitnessStack)
+ (h : wits.l... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_eccaa959912b_0 | ba76362821816dbd | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/Codec.lean | Codec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "decodeBitVecLE_encodeBitVecLE",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero =>\n intro v rest\n have hv : v = 0#0 := by\n apply BitVec.... | [
{
"name": "append_split",
"text": "/-- A word equals its high `8 * n` bits appended to its low byte. -/\nprivate theorem append_split {n : Nat} (v : BitVec (8 * (n + 1))) :\n ((v >>> 8).setWidth (8 * n)) ++ (v.setWidth 8) = v := by\n apply BitVec.eq_of_getLsbD_eq\n intro i hilt\n rw [BitVec.getLsbD_ap... | [
{
"name": "decodeBitVecLE_encodeBitVecLE",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 719,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 7,
"automation_only": false,
... | 1 | import Mathlib.Logic.Equiv.Basic
/-!
# The serialization codec discipline
Bitcoin structures are serialized to byte strings and parsed back. Across the
many substructures of a block, the same two correctness obligations recur:
* **round-trip** — encoding a value and then decoding returns it, leaving any
t... | import Mathlib.Logic.Equiv.Basic
/-!
# The serialization codec discipline
Bitcoin structures are serialized to byte strings and parsed back. Across the
many substructures of a block, the same two correctness obligations recur:
* **round-trip** — encoding a value and then decoding returns it, leaving any
t... | @@ -143,6 +143,19 @@
rw [if_neg h1, h2]
simp [hin]
+/-- A word equals its high `8 * n` bits appended to its low byte. -/
+private theorem append_split {n : Nat} (v : BitVec (8 * (n + 1))) :
+ ((v >>> 8).setWidth (8 * n)) ++ (v.setWidth 8) = v := by
+ apply BitVec.eq_of_getLsbD_eq
+ intro i hilt
+ rw [BitV... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_eccaa959912b_1 | 31d1b165c7356622 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/Codec.lean | Codec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "decodeBitVecLE_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero =>\n intro bs v rest h\n simp only [decodeBitVecLE, Option.some.injEq... | [
{
"name": "setWidth_ushiftRight_append",
"text": "/-- Shifting `high ++ low` past its low byte and truncating recovers `high`. -/\nprivate theorem setWidth_ushiftRight_append {n : Nat} (hi : BitVec (8 * n)) (lo : BitVec 8) :\n ((hi ++ lo) >>> 8).setWidth (8 * n) = hi := by\n apply BitVec.eq_of_getLsbD_e... | [
{
"name": "decodeBitVecLE_canonical",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1090,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 6,
"automation_only": false,
... | 2 | import Mathlib.Logic.Equiv.Basic
/-!
# The serialization codec discipline
Bitcoin structures are serialized to byte strings and parsed back. Across the
many substructures of a block, the same two correctness obligations recur:
* **round-trip** — encoding a value and then decoding returns it, leaving any
t... | import Mathlib.Logic.Equiv.Basic
/-!
# The serialization codec discipline
Bitcoin structures are serialized to byte strings and parsed back. Across the
many substructures of a block, the same two correctness obligations recur:
* **round-trip** — encoding a value and then decoding returns it, leaving any
t... | @@ -132,6 +132,17 @@
rw [BitVec.getLsbD_setWidth, BitVec.getLsbD_append]
simp [hi8]
+/-- Shifting `high ++ low` past its low byte and truncating recovers `high`. -/
+private theorem setWidth_ushiftRight_append {n : Nat} (hi : BitVec (8 * n)) (lo : BitVec 8) :
+ ((hi ++ lo) >>> 8).setWidth (8 * n) = hi := by
... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_e503924c623f_0 | 6c29c764ad9c6967 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Impl/BitcoinCore/Merkle.lean | Merkle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "spineCanonical_ofList_of_treeMutation",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero => intro xs _; simp [ofList, Tree.spineCanonical]\n | succ k ... | [
{
"name": "root_eq_of_virtualLeaves_eq",
"text": "/-- Equal materialized leaf sequences at one width force equal roots: the forward\n(collision-free) mirror of the spec's `virtualLeaves_eq_of_root_eq`. Applying\n`combine` to equal inputs gives equal outputs, so no hash is ever inverted. -/\nprivate theorem ... | [
{
"name": "spineCanonical_ofList_of_treeMutation",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1285,
"n_subproofs": 1,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 10,
"n_structural": 8,
"automation_only... | 1 | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | @@ -270,6 +270,54 @@
simp only [List.cons_append, levelMutation,
levelMutation_append rest (b :: bs') hrest, Bool.or_assoc]
+/-- Equal materialized leaf sequences at one width force equal roots: the forward
+(collision-free) mirror of the spec's `virtualLeaves_eq_of_root_eq`. Applying
+`combine` to eq... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_e503924c623f_1 | 744267abb8ebc86e | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Impl/BitcoinCore/Merkle.lean | Merkle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "canonical_of_not_mutated",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmut : treeMutation (tree xs) = false := by\n rw [← computeMerkleRoot_snd_eq_treeMutation]; exact hm\n h... | [
{
"name": "spineCanonical_ofList_of_treeMutation",
"text": "/-- A tree Core accepts (whole-tree flag clear) is spine-canonical: with no\ngenuine node joining equal-root children, no right-spine node joins two\nidentical materialized leaf sequences either, since equal sequences at equal\nwidth give equal roo... | [
{
"name": "canonical_of_not_mutated",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 825,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"... | 2 | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | @@ -414,6 +414,39 @@
termination_by xs => xs.length
decreasing_by simp [foldLevel_length]; omega
+/-- A tree Core accepts (whole-tree flag clear) is spine-canonical: with no
+genuine node joining equal-root children, no right-spine node joins two
+identical materialized leaf sequences either, since equal sequen... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_e503924c623f_2 | 169aaf776fc15607 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Impl/BitcoinCore/Merkle.lean | Merkle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "eq_of_computeMerkleRoot_eq_of_not_mutated",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrx : (computeMerkleRoot xs).1 = root xs := by\n rw [computeMerkleRoot_fst, computeRoot_e... | [
{
"name": "canonical_of_not_mutated",
"text": "/-- A leaf list Bitcoin Core accepts (no mutation) is `Canonical` —\nunconditionally, with no distinctness hypothesis and no collision caveat. The\nconverse fails: Core's scan is strictly stronger (e.g. `[a, a]` is canonical yet\nmutates), so `Canonical` does n... | [
{
"name": "eq_of_computeMerkleRoot_eq_of_not_mutated",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 1035,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_on... | 3 | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | import BtcVerified.Crypto.Merkle
/-!
# Bitcoin Core's `ComputeMerkleRoot`, checked against the spec
`BtcVerified.Merkle` is the platonic merkle spec: the root as a tree fold
(`root`), with canonicality a separate decidable property of the leaf list
(`Canonical`). This module holds Bitcoin's *vector* computatio... | @@ -460,6 +460,24 @@
termination_by xs => xs.length
decreasing_by simp [foldLevel_length]; omega
+/-- A leaf list Bitcoin Core accepts (no mutation) is `Canonical` —
+unconditionally, with no distinctness hypothesis and no collision caveat. The
+converse fails: Core's scan is strictly stronger (e.g. `[a, a]` is... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_0228bef94e81_0 | ad28af06b9b7ed02 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/CompactSize.lean | CompactSize | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "decode_encode",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold encode\n split_ifs with h1 h2 h3\n · have hb : n.toUInt8 < (0xFD : UInt8) := by bv_decide\n have hv : n.toUInt8.... | [
{
"name": "decode_FF",
"text": "private theorem decode_FF (t : List UInt8) :\n decode (0xFF :: t) = decodeFixedWidth 8 (2 ^ 32) t := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 108,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "decode_encode",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1167,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 4 | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | @@ -132,6 +132,9 @@
private theorem decode_FE (t : List UInt8) :
decode (0xFE :: t) = decodeFixedWidth 4 (2 ^ 16) t := rfl
+private theorem decode_FF (t : List UInt8) :
+ decode (0xFF :: t) = decodeFixedWidth 8 (2 ^ 32) t := rfl
+
/-- Round-trip correctness for canonical encodings.
Encoding `n` and appen... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_0228bef94e81_1 | db0e67a77961175f | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/CompactSize.lean | CompactSize | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "encode_length_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold encode\n split_ifs <;> simp only [List.length_cons, List.length_nil, encodeFixedWidth_length] <;> omega",
"n_c... | [
{
"name": "encodeFixedWidth_length",
"text": "/-- A fixed-width payload is exactly `byteWidth` bytes long. -/\ntheorem encodeFixedWidth_length (byteWidth : Nat) (n : UInt64) :\n (encodeFixedWidth byteWidth n).length = byteWidth :=\n encodeBitVecLE_length byteWidth (n.toBitVec.setWidth (8 * byteWidth))\n... | [
{
"name": "encode_length_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 271,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | @@ -44,6 +44,11 @@
def encodeFixedWidth (byteWidth : Nat) (n : UInt64) : List UInt8 :=
encodeBitVecLE byteWidth (n.toBitVec.setWidth (8 * byteWidth))
+/-- A fixed-width payload is exactly `byteWidth` bytes long. -/
+theorem encodeFixedWidth_length (byteWidth : Nat) (n : UInt64) :
+ (encodeFixedWidth byteWidth ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_0228bef94e81_2 | 12bf9f7ea5d805dc | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/CompactSize.lean | CompactSize | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "decode_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro parses\n match bs with\n | [] => simp [decode] at parses\n | h :: t =>\n simp only [decode] at parses\n sp... | [
{
"name": "decodeFixedWidth_canonical",
"text": "/-- If the fixed-width decoder accepts `bs` as `n` with tail `rest`, then `n`\nlies in this form's range and `bs` is exactly its payload encoding followed by\n`rest` — an accepted payload is never a longer form's value in disguise. -/\ntheorem decodeFixedWidt... | [
{
"name": "decode_canonical",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1905,
"n_subproofs": 13,
"n_tactics": 28,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 3,
"n_structural": 5,
"automation_only": false,
"max_n... | 1 | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | import Std.Tactic.BVDecide
import Mathlib.Tactic.SplitIfs
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.WidthCast
/-!
# Bitcoin CompactSize encoding
This module formalizes Bitcoin's CompactSize variable-length integer
encoding over `UInt64`. CompactSize is the count prefix used throughout
Bit... | @@ -67,6 +67,40 @@
rw [if_pos hlo]
simp [setWidth_setWidth_eq_self hhi, UInt64.ofBitVec_toBitVec]
+/-- If the fixed-width decoder accepts `bs` as `n` with tail `rest`, then `n`
+lies in this form's range and `bs` is exactly its payload encoding followed by
+`rest` — an accepted payload is never a longer form's ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_56d6803d6ebd_0 | 7feaa37c6b92b2ff | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/CountedList.lean | CountedList | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "decodeCountedList_encodeCountedList",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨l, hl⟩ := cl\n unfold encodeCountedList decodeCountedList\n rw [List.append_assoc]\n have hc... | [
{
"name": "decodeElems_encodeElems",
"text": "/-- Round-trip for the element sequence: encoding a list and decoding exactly its\nlength returns it, tail preserved. -/\ntheorem decodeElems_encodeElems {α : Type} [Codec α] (xs : List α) (rest : List UInt8) :\n decodeElems xs.length (encodeElems xs ++ rest)... | [
{
"name": "decodeCountedList_encodeCountedList",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 622,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fa... | 2 | import Mathlib.Data.UInt
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.CompactSize
/-!
# CompactSize-prefixed lists
Every variable-length Bitcoin field — scripts, the input/output lists, a
witness stack — is serialized the same way: a CompactSize count prefix,
followed by the contents back to... | import Mathlib.Data.UInt
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.CompactSize
/-!
# CompactSize-prefixed lists
Every variable-length Bitcoin field — scripts, the input/output lists, a
witness stack — is serialized the same way: a CompactSize count prefix,
followed by the contents back to... | @@ -93,6 +93,16 @@
simp only [List.length_cons]
rw [ih r1 xs' r2 hd2]
+/-- Round-trip for the element sequence: encoding a list and decoding exactly its
+length returns it, tail preserved. -/
+theorem decodeElems_encodeElems {α : Type} [Codec α] (xs : List α) (rest : List UInt8) :
+ decodeElems xs.length... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_56d6803d6ebd_1 | 903471e8df96f7c0 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Serialize/CountedList.lean | CountedList | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "decodeCountedList_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold decodeCountedList at h\n simp only [Option.bind_eq_bind, Option.pure_def, Option.bind_eq_some_iff,\n ... | [
{
"name": "decodeElems_length",
"text": "/-- Decoding exactly `n` elements yields exactly `n` of them. -/\ntheorem decodeElems_length {α : Type} [Codec α] (n : Nat) (bs : List UInt8)\n (xs : List α) (rest : List UInt8) (h : decodeElems n bs = some (xs, rest)) :\n xs.length = n := by\n induction n gen... | [
{
"name": "decodeCountedList_canonical",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1022,
"n_subproofs": 6,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 3 | import Mathlib.Data.UInt
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.CompactSize
/-!
# CompactSize-prefixed lists
Every variable-length Bitcoin field — scripts, the input/output lists, a
witness stack — is serialized the same way: a CompactSize count prefix,
followed by the contents back to... | import Mathlib.Data.UInt
import BtcVerified.Serialize.Codec
import BtcVerified.Serialize.CompactSize
/-!
# CompactSize-prefixed lists
Every variable-length Bitcoin field — scripts, the input/output lists, a
witness stack — is serialized the same way: a CompactSize count prefix,
followed by the contents back to... | @@ -78,6 +78,21 @@
let (xs, rest') ← decodeElems n rest
return (x :: xs, rest')
+/-- Decoding exactly `n` elements yields exactly `n` of them. -/
+theorem decodeElems_length {α : Type} [Codec α] (n : Nat) (bs : List UInt8)
+ (xs : List α) (rest : List UInt8) (h : decodeElems n bs = some (xs, rest)) :
+ ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_a0efe28a6328_0 | 01e225184b6c6195 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Chainstate/Apply.lean | Apply | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "UtxoSet.lookup_apply_of_mem_creates",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hkeys : ((body.creates.map fun entry =>\n (entry.1, (⟨entry.2, provenance⟩ : Coin))).map Prod... | [
{
"name": "TxBody.creates_stamped_keys",
"text": "/-- Stamping a provenance onto a transaction's created outputs re-keys\nnothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/\ntheorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :\n ((body.creates.map fun e... | [
{
"name": "UtxoSet.lookup_apply_of_mem_creates",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 739,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fa... | 1 | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | @@ -93,6 +93,17 @@
simp [hv]
exact Prod.ext_iff.mpr ⟨hfst, hv⟩
+/-- Stamping a provenance onto a transaction's created outputs re-keys
+nothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/
+theorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :
+ ((body.creat... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_a0efe28a6328_1 | 478ac34bede166a3 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Chainstate/Apply.lean | Apply | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "UtxoSet.lookup_apply_of_mem_creates",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hkeys : ((body.creates.map fun entry =>\n (entry.1, (⟨entry.2, provenance⟩ : Coin))).map Prod... | [
{
"name": "TxBody.creates_stamped_keys",
"text": "/-- Stamping a provenance onto a transaction's created outputs re-keys\nnothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/\ntheorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :\n ((body.creates.map fun e... | [
{
"name": "UtxoSet.lookup_apply_of_mem_spends",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 688,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | @@ -73,6 +73,17 @@
/-! ## The created outpoints -/
+/-- Stamping a provenance onto a transaction's created outputs re-keys
+nothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/
+theorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :
+ ((body.creates.map fun entry ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_a0efe28a6328_2 | 8c9be5d509762abc | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Chainstate/Apply.lean | Apply | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "UtxoSet.lookup_apply_of_mem_creates",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hkeys : ((body.creates.map fun entry =>\n (entry.1, (⟨entry.2, provenance⟩ : Coin))).map Prod... | [
{
"name": "TxBody.creates_stamped_keys",
"text": "/-- Stamping a provenance onto a transaction's created outputs re-keys\nnothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/\ntheorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :\n ((body.creates.map fun e... | [
{
"name": "UtxoSet.lookup_apply_of_notMem",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 588,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | @@ -73,12 +73,27 @@
/-! ## The created outpoints -/
+/-- Stamping a provenance onto a transaction's created outputs re-keys
+nothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/
+theorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :
+ ((body.creates.map fun entry... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_a0efe28a6328_3 | a0aeed955e0e9e0b | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Chainstate/Apply.lean | Apply | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "UtxoSet.lookup_apply_of_mem_creates",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hkeys : ((body.creates.map fun entry =>\n (entry.1, (⟨entry.2, provenance⟩ : Coin))).map Prod... | [
{
"name": "TxBody.creates_stamped_keys",
"text": "/-- Stamping a provenance onto a transaction's created outputs re-keys\nnothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/\ntheorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :\n ((body.creates.map fun e... | [
{
"name": "UtxoSet.totalValue_apply",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 2003,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
... | 1 | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | import BtcVerified.Transaction.Txid
import BtcVerified.Chainstate.UtxoSet
/-!
# The uniform UTXO action of a transaction
What a transaction *does* to the UTXO set: erase the outpoints its inputs
consume (`TxBody.spends`), insert one coin per output, keyed by txid and
output index (`TxBody.creates`). Every tran... | @@ -102,6 +102,17 @@
rw [creates, List.map_map, List.map_map]
rfl
+/-- Stamping a provenance onto a transaction's created outputs re-keys
+nothing: the stamped list's outpoints are exactly `creates`'s outpoints. -/
+theorem TxBody.creates_stamped_keys (body : TxBody) (provenance : Provenance) :
+ ((body.crea... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_acad8799be59_0 | e4ff1ff1e2a2c3f7 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Crypto/Merkle.lean | Merkle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "virtualLeaves_ofList_append",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro xs hlen\n match xs, hlen with\n | [], _ => exact ⟨[0... | [
{
"name": "virtualLeaves_ofList_of_length_eq",
"text": "/-- A full slice needs no padding: its materialized leaves are itself. -/\ntheorem virtualLeaves_ofList_of_length_eq :\n ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →\n (ofList xs k).virtualLeaves = xs := by\n intro k\n induction k wit... | [
{
"name": "virtualLeaves_ofList_append",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 958,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 10,
"automation_only": false,
... | 1 | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | @@ -131,6 +131,26 @@
/-! ## Injectivity -/
+/-- A full slice needs no padding: its materialized leaves are itself. -/
+theorem virtualLeaves_ofList_of_length_eq :
+ ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →
+ (ofList xs k).virtualLeaves = xs := by
+ intro k
+ induction k with
+ | zero =>
+ ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_acad8799be59_1 | 4c5afcb27f2cf81f | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Crypto/Merkle.lean | Merkle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "virtualLeaves_eq_of_root_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro xs ys h\n exact Or.inl (by simpa [ofList, Tree.root, Tr... | [
{
"name": "combine_binding",
"text": "/-- Equal merkle nodes have equal children — or their two 64-byte preimages\ncollide under double-SHA-256. -/\ntheorem combine_binding {l r l' r' : Hash256} (h : combine l r = combine l' r') :\n (l = l' ∧ r = r') ∨ Sha256.Collision := by\n have hd : Sha256.sha256d (... | [
{
"name": "virtualLeaves_eq_of_root_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 56,
"n_chars": 2302,
"n_subproofs": 0,
"n_tactics": 49,
"cyclomatic": 14,
"n_automation": 2,
"n_rewrites": 16,
"n_structural": 31,
"automation_only": false... | 1 | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | @@ -55,6 +55,19 @@
def combine (l r : Hash256) : Hash256 :=
⟨Sha256.sha256d (l.1 ++ r.1), Sha256.sha256d_length _⟩
+/-- Equal merkle nodes have equal children — or their two 64-byte preimages
+collide under double-SHA-256. -/
+theorem combine_binding {l r l' r' : Hash256} (h : combine l r = combine l' r') :
+ ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_acad8799be59_2 | 929a50d0b6a01c2e | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Crypto/Merkle.lean | Merkle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "virtualLeaves_ofList_append",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro xs hlen\n match xs, hlen with\n | [], _ => exact ⟨[0... | [
{
"name": "virtualLeaves_ofList_of_length_eq",
"text": "/-- A full slice needs no padding: its materialized leaves are itself. -/\ntheorem virtualLeaves_ofList_of_length_eq :\n ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →\n (ofList xs k).virtualLeaves = xs := by\n intro k\n induction k wit... | [
{
"name": "eq_of_virtualLeaves_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 73,
"n_chars": 3850,
"n_subproofs": 13,
"n_tactics": 67,
"cyclomatic": 3,
"n_automation": 15,
"n_rewrites": 25,
"n_structural": 12,
"automation_only": false,
... | 2 | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | @@ -144,6 +144,26 @@
· simp [Tree.virtualLeaves, ih, Nat.two_pow_succ]
· simp [Tree.virtualLeaves, ih, Nat.two_pow_succ]
+/-- A full slice needs no padding: its materialized leaves are itself. -/
+theorem virtualLeaves_ofList_of_length_eq :
+ ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →
+ (o... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_acad8799be59_3 | fb440258e8c8e448 | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Crypto/Merkle.lean | Merkle | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "virtualLeaves_ofList_append",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro xs hlen\n match xs, hlen with\n | [], _ => exact ⟨[0... | [
{
"name": "virtualLeaves_ofList_of_length_eq",
"text": "/-- A full slice needs no padding: its materialized leaves are itself. -/\ntheorem virtualLeaves_ofList_of_length_eq :\n ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →\n (ofList xs k).virtualLeaves = xs := by\n intro k\n induction k wit... | [
{
"name": "root_binding_of_length_eq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 881,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": false,
... | 4 | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | @@ -144,6 +144,26 @@
/-! ## Injectivity -/
+/-- A full slice needs no padding: its materialized leaves are itself. -/
+theorem virtualLeaves_ofList_of_length_eq :
+ ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →
+ (ofList xs k).virtualLeaves = xs := by
+ intro k
+ induction k with
+ | zero =>
+ ... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_acad8799be59_4 | 934331a8c5babf8b | lean | lean | github.com/ProofOfKeags/btc-verified | 251ae35b2caf564608f0c6bc35933d7837bfe0c4 | BtcVerified/Crypto/Merkle.lean | Merkle | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "virtualLeaves_ofList_append",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro xs hlen\n match xs, hlen with\n | [], _ => exact ⟨[0... | [
{
"name": "virtualLeaves_ofList_of_length_eq",
"text": "/-- A full slice needs no padding: its materialized leaves are itself. -/\ntheorem virtualLeaves_ofList_of_length_eq :\n ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →\n (ofList xs k).virtualLeaves = xs := by\n intro k\n induction k wit... | [
{
"name": "root_binding_of_canonical",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 73,
"n_chars": 3869,
"n_subproofs": 21,
"n_tactics": 66,
"cyclomatic": 5,
"n_automation": 29,
"n_rewrites": 12,
"n_structural": 12,
"automation_only": false,... | 5 | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | import BtcVerified.Crypto.Hash256
import BtcVerified.Crypto.Sha256
import Mathlib.Data.Nat.Log
/-!
# Bitcoin's merkle tree
The merkle root is how a block header commits to its transaction list:
leaves are txids, and each node is the double-SHA-256 of its two children's
digests. Bitcoin pads an odd level by has... | @@ -157,6 +157,26 @@
· simp [Tree.virtualLeaves, ih, Nat.two_pow_succ]
· simp [Tree.virtualLeaves, ih, Nat.two_pow_succ]
+/-- A full slice needs no padding: its materialized leaves are itself. -/
+theorem virtualLeaves_ofList_of_length_eq :
+ ∀ (k : Nat) (xs : List Hash256), xs.length = 2 ^ k →
+ (o... | {
"repo": "btc-verified",
"git_repo": "github.com/ProofOfKeags/btc-verified",
"revision": "251ae35b2caf564608f0c6bc35933d7837bfe0c4",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--coro... |
ablate_25cb8974d8e8_0 | 223498df9e043b60 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Context.lean | Context | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "Context.cvar_bound_var_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.cvar_bound_var_inv' rfl hb",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic":... | [
{
"name": "Context.cvar_bound_var_inv'",
"text": "theorem Context.cvar_bound_var_inv'\n (he : Γ0 = Context.cvar Γ b)\n (hb : Context.Bound Γ0 x E) :\n ∃ E0, Context.Bound Γ x E0 ∧ E = E0.cweaken := by\n cases hb <;> try (solve | cases he)\n case there_cvar =>\n cases he\n rename_i E0 _\n exist... | [
{
"name": "Context.cvar_bound_var_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 1 | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | @@ -226,9 +226,20 @@
The `@[simp]` lemmas provide automatic simplification for weakening operations on concrete binding constructors.
-/
+theorem Context.cvar_bound_var_inv'
+ (he : Γ0 = Context.cvar Γ b)
+ (hb : Context.Bound Γ0 x E) :
+ ∃ E0, Context.Bound Γ x E0 ∧ E = E0.cweaken := by
+ cases hb <;> try (sol... | {
"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_25cb8974d8e8_1 | c1464c782570f0ac | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Context.lean | Context | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "Context.cvar_bound_cvar_inst_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hb <;> try (solve | cases he1)\n case here =>\n have h := CBinding.eq_inst_cweaken_inv (Eq.sym... | [
{
"name": "CBinding.eq_inst_cweaken_inv",
"text": "theorem CBinding.eq_inst_cweaken_inv {b : CBinding n k}\n (h : CBinding.inst C = b.cweaken) :\n ∃ C0, b = CBinding.inst C0 := by\n cases b <;> try (solve | cases h)\n case inst C0 =>\n exists C0\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars":... | [
{
"name": "Context.cvar_bound_cvar_inst_inv'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 660,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 6,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": fal... | 1 | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | @@ -226,11 +226,28 @@
The `@[simp]` lemmas provide automatic simplification for weakening operations on concrete binding constructors.
-/
+theorem CBinding.eq_inst_cweaken_inv {b : CBinding n k}
+ (h : CBinding.inst C = b.cweaken) :
+ ∃ C0, b = CBinding.inst C0 := by
+ cases b <;> try (solve | cases h)
+ case i... | {
"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_25cb8974d8e8_2 | d9734352260f276f | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Context.lean | Context | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "Context.cvar_bound_cvar_inst_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Context.cvar_bound_cvar_inst_inv' rfl rfl hb",
"n_chars": 56,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "Context.cvar_bound_cvar_inst_inv'",
"text": "theorem Context.cvar_bound_cvar_inst_inv' {Γ : Context n m k}\n (he1 : Γ' = Context.cvar Γ (CBinding.bound b0))\n (he2 : b' = CBinding.inst C)\n (hb : Context.CBound Γ' c b') :\n ∃ c0 C0, c = c0.succ ∧ C = C0.cweaken ∧ Context.CBound Γ c0 (CBinding... | [
{
"name": "Context.cvar_bound_cvar_inst_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 295,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,... | 2 | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | import Capless.Type
import Capless.CaptureSet
namespace Capless
/-!
# Typing Contexts
This module defines the syntax of typing contexts `Γ` (Fig. 1) in System Capless.
A `Context` is a list of bindings. The `Context n m k` type is parameterized by the number of binders defined in this context, in each category:
- `n... | @@ -233,9 +233,26 @@
case inst C0 =>
exists C0
+theorem Context.cvar_bound_cvar_inst_inv' {Γ : Context n m k}
+ (he1 : Γ' = Context.cvar Γ (CBinding.bound b0))
+ (he2 : b' = CBinding.inst C)
+ (hb : Context.CBound Γ' c b') :
+ ∃ c0 C0, c = c0.succ ∧ C = C0.cweaken ∧ Context.CBound Γ c0 (CBinding.inst C0) ... | {
"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_84dcb419a2d4_0 | cd4ab15ecd0f1637 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.app_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.app_inv' rfl h",
"n_chars": 23,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "Typed.app_inv'",
"text": "theorem Typed.app_inv'\n (he : t0 = Term.app x y)\n (h : Typed Γ t0 E Ct0) :\n ∃ T Cf F E0, Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.forall T F))) {x=x}\n ∧ Typed Γ (Term.var y) (EType.type T) {x=y}\n ∧ E0 = F.open y\n ∧ ESubtyp Γ E0 E := by\n ... | [
{
"name": "Typed.app_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 278,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,12 +25,34 @@
-/
namespace Capless
+theorem Typed.app_inv'
+ (he : t0 = Term.app x y)
+ (h : Typed Γ t0 E Ct0) :
+ ∃ T Cf F E0, Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.forall T F))) {x=x}
+ ∧ Typed Γ (Term.var y) (EType.type T) {x=y}
+ ∧ E0 = F.open y
+ ∧ ESubtyp Γ E0 E := by
+ i... | {
"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_84dcb419a2d4_1 | 982d6b0488105c45 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.tapp_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.tapp_inv' rfl h",
"n_chars": 24,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1... | [
{
"name": "Typed.tapp_inv'",
"text": "theorem Typed.tapp_inv'\n (he : t0 = Term.tapp x X)\n (h : Typed Γ t0 E Ct) :\n ∃ Cf F E0,\n Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.tforall (SType.tvar X) F))) {x=x}\n ∧ E0 = F.topen X\n ∧ ESubtyp Γ E0 E := by\n induction h <;> try (solve | ... | [
{
"name": "Typed.tapp_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 247,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,12 +25,35 @@
-/
namespace Capless
+theorem Typed.tapp_inv'
+ (he : t0 = Term.tapp x X)
+ (h : Typed Γ t0 E Ct) :
+ ∃ Cf F E0,
+ Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.tforall (SType.tvar X) F))) {x=x}
+ ∧ E0 = F.topen X
+ ∧ ESubtyp Γ E0 E := by
+ induction h <;> try (solve | 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_84dcb419a2d4_2 | 92c2438964221f3c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.var_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Typed.var_inv' rfl rfl h hb",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_... | [
{
"name": "Typed.var_inv'",
"text": "theorem Typed.var_inv'\n (he1 : t0 = Term.var x)\n (he2 : E0 = EType.type T)\n (h : Typed Γ t0 E0 Ct0) (hb : Γ.Bound x T0) :\n ∃ C0 S0, Γ.Bound x (S0^C0) ∧ (Γ ⊢ (S0^{x=x}) <: T) := by\n induction h <;> try (solve | cases he1 | cases he2)\n case var C0 S0 hb =>\n ... | [
{
"name": "Typed.var_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 218,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,38 @@
-/
namespace Capless
+theorem Typed.var_inv'
+ (he1 : t0 = Term.var x)
+ (he2 : E0 = EType.type T)
+ (h : Typed Γ t0 E0 Ct0) (hb : Γ.Bound x T0) :
+ ∃ C0 S0, Γ.Bound x (S0^C0) ∧ (Γ ⊢ (S0^{x=x}) <: T) := by
+ induction h <;> try (solve | cases he1 | cases he2)
+ case var C0 S0 hb =>
+ 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_84dcb419a2d4_3 | dca1aa6e36926e3f | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.canonical_form_lam",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Typed.canonical_form_lam' <;> try trivial\n constructor",
"n_chars": 67,
"n_subproofs": 0,
"n_t... | [
{
"name": "Typed.canonical_form_lam'",
"text": "theorem Typed.canonical_form_lam'\n (ht : Γ.IsTight)\n (he1 : t0 = Term.lam T t) (hd2 : SType.Dealias Γ S0 (SType.forall T' E))\n (he2 : E0 = EType.type (CType.capt Cf S0))\n (h : Typed Γ t0 E0 Ct0) :\n CSubtyp Γ T' T ∧\n Typed (Γ.var T') t E (Cf.weaken ... | [
{
"name": "Typed.canonical_form_lam",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 260,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,47 @@
-/
namespace Capless
+theorem Typed.canonical_form_lam'
+ (ht : Γ.IsTight)
+ (he1 : t0 = Term.lam T t) (hd2 : SType.Dealias Γ S0 (SType.forall T' E))
+ (he2 : E0 = EType.type (CType.capt Cf S0))
+ (h : Typed Γ t0 E0 Ct0) :
+ CSubtyp Γ T' T ∧
+ Typed (Γ.var T') t E (Cf.weaken ∪ {x=0}) := by... | {
"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_84dcb419a2d4_4 | 931eeacfc9a3100d | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.canonical_form_tlam",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Typed.canonical_form_tlam' <;> try trivial\n constructor",
"n_chars": 68,
"n_subproofs": 0,
"n... | [
{
"name": "Typed.canonical_form_tlam'",
"text": "theorem Typed.canonical_form_tlam'\n (ht : Γ.IsTight)\n (hd : SType.Dealias Γ S0 (SType.tforall S' E))\n (he1 : t0 = Term.tlam S t)\n (he2 : E0 = EType.type (CType.capt Cf S0))\n (h : Typed Γ t0 E0 Ct0) :\n SSubtyp Γ S' S ∧\n Typed (Γ.tvar (TBinding.bo... | [
{
"name": "Typed.canonical_form_tlam",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 245,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"m... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,47 @@
-/
namespace Capless
+theorem Typed.canonical_form_tlam'
+ (ht : Γ.IsTight)
+ (hd : SType.Dealias Γ S0 (SType.tforall S' E))
+ (he1 : t0 = Term.tlam S t)
+ (he2 : E0 = EType.type (CType.capt Cf S0))
+ (h : Typed Γ t0 E0 Ct0) :
+ SSubtyp Γ S' S ∧
+ Typed (Γ.tvar (TBinding.bound S')) t E Cf... | {
"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_84dcb419a2d4_5 | 613e191bbda48fc2 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.capp_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.capp_inv' rfl h",
"n_chars": 24,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1... | [
{
"name": "Typed.capp_inv'",
"text": "theorem Typed.capp_inv'\n (he : t0 = Term.capp x c)\n (h : Typed Γ t0 E Ct0) :\n ∃ Cf F E0,\n Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.cforall (CBound.upper {c=c}) F))) {x=x} ∧\n E0 = F.copen c ∧\n ESubtyp Γ E0 E := by\n induction h <;> try (s... | [
{
"name": "Typed.capp_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 254,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,12 +25,35 @@
-/
namespace Capless
+theorem Typed.capp_inv'
+ (he : t0 = Term.capp x c)
+ (h : Typed Γ t0 E Ct0) :
+ ∃ Cf F E0,
+ Typed Γ (Term.var x) (EType.type (CType.capt Cf (SType.cforall (CBound.upper {c=c}) F))) {x=x} ∧
+ E0 = F.copen c ∧
+ ESubtyp Γ E0 E := by
+ induction h <;> try (solve... | {
"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_84dcb419a2d4_6 | abe14cc5c66753fb | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.letin_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.letin_inv' rfl h",
"n_chars": 25,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "Typed.letin_inv'",
"text": "theorem Typed.letin_inv' {Γ : Context n m k}\n (he : t0 = Term.letin t u)\n (h : Typed Γ t0 E Ct0) :\n ∃ T E0,\n Typed Γ t (EType.type T) Ct0 ∧\n Typed (Γ.var T) u E0.weaken Ct0.weaken ∧\n ESubtyp Γ E0 E := by\n induction h <;> try (solve | cases he)\n ca... | [
{
"name": "Typed.letin_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 231,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,12 +25,43 @@
-/
namespace Capless
+theorem Typed.letin_inv' {Γ : Context n m k}
+ (he : t0 = Term.letin t u)
+ (h : Typed Γ t0 E Ct0) :
+ ∃ T E0,
+ Typed Γ t (EType.type T) Ct0 ∧
+ Typed (Γ.var T) u E0.weaken Ct0.weaken ∧
+ ESubtyp Γ E0 E := by
+ induction h <;> try (solve | cases he)
+ case le... | {
"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_84dcb419a2d4_7 | 7da0be2650780b3a | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.letex_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.letex_inv' rfl h",
"n_chars": 25,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "Typed.letex_inv'",
"text": "theorem Typed.letex_inv' {Γ : Context n m k}\n (he : t0 = Term.letex t u)\n (h : Typed Γ t0 E Ct0) :\n ∃ T E0,\n Typed Γ t (EType.ex T) Ct0 ∧\n Typed ((Γ.cvar (CBinding.bound CBound.star)).var T) u E0.cweaken.weaken Ct0.cweaken.weaken ∧\n ESubtyp Γ E0 E := ... | [
{
"name": "Typed.letex_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 252,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,12 +25,43 @@
-/
namespace Capless
+theorem Typed.letex_inv' {Γ : Context n m k}
+ (he : t0 = Term.letex t u)
+ (h : Typed Γ t0 E Ct0) :
+ ∃ T E0,
+ Typed Γ t (EType.ex T) Ct0 ∧
+ Typed ((Γ.cvar (CBinding.bound CBound.star)).var T) u E0.cweaken.weaken Ct0.cweaken.weaken ∧
+ ESubtyp Γ E0 E := by
+ ... | {
"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_84dcb419a2d4_8 | 86de732575b11545 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.bindt_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.bindt_inv' rfl h",
"n_chars": 25,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "Typed.bindt_inv'",
"text": "theorem Typed.bindt_inv' {Γ : Context n m k}\n (he : t0 = Term.bindt T t)\n (h : Typed Γ t0 E Ct0) :\n ∃ E0,\n Typed (Γ.tvar (TBinding.inst T)) t E0.tweaken Ct0 ∧\n ESubtyp Γ E0 E := by\n induction h <;> try (solve | cases he)\n case bindt =>\n cases he\n... | [
{
"name": "Typed.bindt_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 185,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,35 @@
-/
namespace Capless
+theorem Typed.bindt_inv' {Γ : Context n m k}
+ (he : t0 = Term.bindt T t)
+ (h : Typed Γ t0 E Ct0) :
+ ∃ E0,
+ Typed (Γ.tvar (TBinding.inst T)) t E0.tweaken Ct0 ∧
+ ESubtyp Γ E0 E := by
+ induction h <;> try (solve | cases he)
+ case bindt =>
+ cases he
+ r... | {
"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_84dcb419a2d4_9 | 152770c4c112ed0a | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.bindc_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.bindc_inv' rfl h",
"n_chars": 25,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "Typed.bindc_inv'",
"text": "theorem Typed.bindc_inv' {Γ : Context n m k}\n (he : t0 = Term.bindc C t)\n (h : Typed Γ t0 E Ct) :\n ∃ E0,\n Typed (Γ.cvar (CBinding.inst C)) t E0.cweaken Ct.cweaken ∧\n ESubtyp Γ E0 E := by\n induction h <;> try (solve | cases he)\n case bindc =>\n case... | [
{
"name": "Typed.bindc_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 193,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,35 @@
-/
namespace Capless
+theorem Typed.bindc_inv' {Γ : Context n m k}
+ (he : t0 = Term.bindc C t)
+ (h : Typed Γ t0 E Ct) :
+ ∃ E0,
+ Typed (Γ.cvar (CBinding.inst C)) t E0.cweaken Ct.cweaken ∧
+ ESubtyp Γ E0 E := by
+ induction h <;> try (solve | cases he)
+ case bindc =>
+ 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_84dcb419a2d4_10 | b30484c7136bdcf0 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.canonical_form_clam",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Typed.canonical_form_clam' <;> try trivial\n constructor",
"n_chars": 68,
"n_subproofs": 0,
"n... | [
{
"name": "Typed.canonical_form_clam'",
"text": "theorem Typed.canonical_form_clam'\n (ht : Γ.IsTight)\n (hd : SType.Dealias Γ S0 (SType.cforall B' E))\n (he1 : t0 = Term.clam B t)\n (he2 : E0 = EType.type (CType.capt Cf S0))\n (h : Typed Γ t0 E0 Ct0) :\n Subbound Γ B' B ∧ Typed (Γ.cvar (CBinding.boun... | [
{
"name": "Typed.canonical_form_clam",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"m... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,43 @@
-/
namespace Capless
+theorem Typed.canonical_form_clam'
+ (ht : Γ.IsTight)
+ (hd : SType.Dealias Γ S0 (SType.cforall B' E))
+ (he1 : t0 = Term.clam B t)
+ (he2 : E0 = EType.type (CType.capt Cf S0))
+ (h : Typed Γ t0 E0 Ct0) :
+ Subbound Γ B' B ∧ Typed (Γ.cvar (CBinding.bound B')) t E Cf.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_84dcb419a2d4_11 | d51993e5c2728d85 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.canonical_form_pack",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.canonical_form_pack' ht rfl rfl h",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomat... | [
{
"name": "Typed.canonical_form_pack'",
"text": "theorem Typed.canonical_form_pack'\n (ht : Γ.IsTight)\n (he1 : t0 = Term.pack C x)\n (he2 : E0 = EType.ex T)\n (h : Typed Γ t0 E0 Ct) :\n Typed (Γ.cvar (CBinding.inst C)) (Term.var x) (EType.type T) {x=x} := by\n induction h <;> try (solve | cases he1 |... | [
{
"name": "Typed.canonical_form_pack",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 221,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,10 +25,32 @@
-/
namespace Capless
+theorem Typed.canonical_form_pack'
+ (ht : Γ.IsTight)
+ (he1 : t0 = Term.pack C x)
+ (he2 : E0 = EType.ex T)
+ (h : Typed Γ t0 E0 Ct) :
+ Typed (Γ.cvar (CBinding.inst C)) (Term.var x) (EType.type T) {x=x} := by
+ induction h <;> try (solve | cases he1 | cases he2)
+ ... | {
"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_84dcb419a2d4_12 | 7a127fe21e8de768 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.forall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.forall_inv' hg (by constructor) rfl hv ht",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "Typed.forall_inv'",
"text": "theorem Typed.forall_inv' {v : Term n m k}\n (ht : Γ.IsTight)\n (hd : SType.Dealias Γ S0 (SType.forall T E))\n (he : E0 = EType.type (CType.capt Cv S0))\n (hv : v.IsValue)\n (ht : Typed Γ v E0 Ct) :\n ∃ T0 t, v = Term.lam T0 t := by\n induction ht <;> try (solv... | [
{
"name": "Typed.forall_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 238,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,30 @@
-/
namespace Capless
+theorem Typed.forall_inv' {v : Term n m k}
+ (ht : Γ.IsTight)
+ (hd : SType.Dealias Γ S0 (SType.forall T E))
+ (he : E0 = EType.type (CType.capt Cv S0))
+ (hv : v.IsValue)
+ (ht : Typed Γ v E0 Ct) :
+ ∃ T0 t, v = Term.lam T0 t := by
+ induction ht <;> try (solve | ca... | {
"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_84dcb419a2d4_13 | 933198efa6f60bd5 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.tforall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.tforall_inv' hg (by constructor) rfl hv ht",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "Typed.tforall_inv'",
"text": "theorem Typed.tforall_inv' {v : Term n m k}\n (ht : Γ.IsTight)\n (hd : SType.Dealias Γ S0 (SType.tforall X E))\n (he : E0 = EType.type (CType.capt Cv S0))\n (hv : v.IsValue)\n (ht : Typed Γ v E0 Ct) :\n ∃ X t, v = Term.tlam X t := by\n induction ht <;> try (so... | [
{
"name": "Typed.tforall_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 240,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,30 @@
-/
namespace Capless
+theorem Typed.tforall_inv' {v : Term n m k}
+ (ht : Γ.IsTight)
+ (hd : SType.Dealias Γ S0 (SType.tforall X E))
+ (he : E0 = EType.type (CType.capt Cv S0))
+ (hv : v.IsValue)
+ (ht : Typed Γ v E0 Ct) :
+ ∃ X t, v = Term.tlam X t := by
+ induction ht <;> try (solve | 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_84dcb419a2d4_14 | 9e686913f97f3d9f | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.cforall_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.cforall_inv' hg (by constructor) rfl hv ht",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "Typed.cforall_inv'",
"text": "theorem Typed.cforall_inv' {v : Term n m k}\n (ht : Γ.IsTight)\n (hd : SType.Dealias Γ S0 (SType.cforall B E))\n (he : E0 = EType.type (CType.capt Cv S0))\n (hv : v.IsValue)\n (ht : Typed Γ v E0 Ct) :\n ∃ B0 t, v = Term.clam B0 t := by\n induction ht <;> try (... | [
{
"name": "Typed.cforall_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 242,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,30 @@
-/
namespace Capless
+theorem Typed.cforall_inv' {v : Term n m k}
+ (ht : Γ.IsTight)
+ (hd : SType.Dealias Γ S0 (SType.cforall B E))
+ (he : E0 = EType.type (CType.capt Cv S0))
+ (hv : v.IsValue)
+ (ht : Typed Γ v E0 Ct) :
+ ∃ B0 t, v = Term.clam B0 t := by
+ induction ht <;> try (solve |... | {
"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_84dcb419a2d4_15 | 8a1c15d8960e1df5 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.var_inv_capt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.var_inv_capt' rfl hx",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "Typed.var_inv_capt'",
"text": "theorem Typed.var_inv_capt'\n (he : t0 = Term.var x)\n (hx : Typed Γ t0 E Cx) :\n Γ ⊢ ({x=x}) <:c Cx := by\n induction hx <;> try (solve | cases he)\n case var => cases he; apply Subcapt.refl\n case label => cases he; apply Subcapt.refl\n case sub ih =>\n ... | [
{
"name": "Typed.var_inv_capt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 122,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,21 @@
-/
namespace Capless
+theorem Typed.var_inv_capt'
+ (he : t0 = Term.var x)
+ (hx : Typed Γ t0 E Cx) :
+ Γ ⊢ ({x=x}) <:c Cx := by
+ induction hx <;> try (solve | cases he)
+ case var => cases he; apply Subcapt.refl
+ case label => cases he; apply Subcapt.refl
+ case sub ih =>
+ have 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_84dcb419a2d4_16 | ee60a547f40d27bc | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.app_inv_capt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.app_inv_capt' rfl ht",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "Typed.app_inv_capt'",
"text": "theorem Typed.app_inv_capt'\n (he : t0 = Term.app x y)\n (ht : Typed Γ t0 E Ct) :\n Γ ⊢ ({x=x}∪{x=y}) <:c Ct := by\n induction ht <;> try (solve | cases he)\n case app => cases he; apply Subcapt.refl\n case sub ih =>\n have ih := ih he\n apply! Subcapt.t... | [
{
"name": "Typed.app_inv_capt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,20 @@
-/
namespace Capless
+theorem Typed.app_inv_capt'
+ (he : t0 = Term.app x y)
+ (ht : Typed Γ t0 E Ct) :
+ Γ ⊢ ({x=x}∪{x=y}) <:c Ct := by
+ induction ht <;> try (solve | cases he)
+ case app => cases he; apply Subcapt.refl
+ case sub ih =>
+ have ih := ih he
+ apply! Subcapt.trans
+
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_84dcb419a2d4_17 | 97badb1294dd3a91 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.tapp_inv_capt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.tapp_inv_capt' rfl ht",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "Typed.tapp_inv_capt'",
"text": "theorem Typed.tapp_inv_capt'\n (he : t0 = Term.tapp x X)\n (ht : Typed Γ t0 E Ct) :\n Γ ⊢ ({x=x}) <:c Ct := by\n induction ht <;> try (solve | cases he)\n case tapp => cases he; apply Subcapt.refl\n case sub ih =>\n have ih := ih he\n apply! Subcapt.tra... | [
{
"name": "Typed.tapp_inv_capt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,20 @@
-/
namespace Capless
+theorem Typed.tapp_inv_capt'
+ (he : t0 = Term.tapp x X)
+ (ht : Typed Γ t0 E Ct) :
+ Γ ⊢ ({x=x}) <:c Ct := by
+ induction ht <;> try (solve | cases he)
+ case tapp => cases he; apply Subcapt.refl
+ case sub ih =>
+ have ih := ih he
+ apply! Subcapt.trans
+
theo... | {
"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_84dcb419a2d4_18 | 66262cafc38a56bb | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.capp_inv_capt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.capp_inv_capt' rfl ht",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "Typed.capp_inv_capt'",
"text": "theorem Typed.capp_inv_capt'\n (he : t0 = Term.capp x c)\n (ht : Typed Γ t0 E Ct) :\n Γ ⊢ ({x=x}) <:c Ct := by\n induction ht <;> try (solve | cases he)\n case capp => cases he; apply Subcapt.refl\n case sub ih =>\n have ih := ih he\n apply! Subcapt.tra... | [
{
"name": "Typed.capp_inv_capt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,20 @@
-/
namespace Capless
+theorem Typed.capp_inv_capt'
+ (he : t0 = Term.capp x c)
+ (ht : Typed Γ t0 E Ct) :
+ Γ ⊢ ({x=x}) <:c Ct := by
+ induction ht <;> try (solve | cases he)
+ case capp => cases he; apply Subcapt.refl
+ case sub ih =>
+ have ih := ih he
+ apply! Subcapt.trans
+
theo... | {
"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_84dcb419a2d4_19 | 11848a4d07f68c70 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.var_inv_cs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.var_inv_cs' rfl rfl hx",
"n_chars": 31,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "Typed.var_inv_cs'",
"text": "theorem Typed.var_inv_cs'\n (he1 : t0 = Term.var x)\n (he2 : E0 = EType.type (S^C))\n (hx : Typed Γ t0 E0 Cx) :\n Γ ⊢ ({x=x}) <:c C := by\n induction hx <;> try (solve | cases he1 | cases he2)\n case var => cases he1; cases he2; apply Subcapt.refl\n case label ... | [
{
"name": "Typed.var_inv_cs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,27 @@
-/
namespace Capless
+theorem Typed.var_inv_cs'
+ (he1 : t0 = Term.var x)
+ (he2 : E0 = EType.type (S^C))
+ (hx : Typed Γ t0 E0 Cx) :
+ Γ ⊢ ({x=x}) <:c C := by
+ induction hx <;> try (solve | cases he1 | cases he2)
+ case var => cases he1; cases he2; apply Subcapt.refl
+ case label => 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_84dcb419a2d4_20 | 0f5693b3d1850071 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.val_precise_cv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.val_precise_cv' rfl ht hv",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"... | [
{
"name": "Typed.val_precise_cv'",
"text": "theorem Typed.val_precise_cv'\n (he : E0 = EType.type T)\n (ht : Typed Γ t E0 Ct)\n (hv : t.IsValue) :\n Typed Γ t E0 {} := by\n induction ht <;> try (solve | cases he | cases hv)\n case abs =>\n cases he\n apply Typed.abs; easy\n case tabs =>\n ca... | [
{
"name": "Typed.val_precise_cv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,10 +25,35 @@
-/
namespace Capless
+theorem Typed.val_precise_cv'
+ (he : E0 = EType.type T)
+ (ht : Typed Γ t E0 Ct)
+ (hv : t.IsValue) :
+ Typed Γ t E0 {} := by
+ induction ht <;> try (solve | cases he | cases hv)
+ case abs =>
+ cases he
+ apply Typed.abs; easy
+ case tabs =>
+ 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_84dcb419a2d4_21 | 1996ecabf9d1908f | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.invoke_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.invoke_inv' rfl ht",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "Typed.invoke_inv'",
"text": "theorem Typed.invoke_inv' {Γ : Context n m k}\n (he : t0 = Term.invoke x y)\n (ht : Typed Γ t0 E Ct) :\n ∃ S0 C0,\n Typed Γ (Term.var x) (Label[S0]^C0) {x=x} ∧\n Typed Γ (Term.var y) (EType.type (S0^{})) {x=y} := by\n induction ht <;> try (solve | cases he)\... | [
{
"name": "Typed.invoke_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 237,
"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.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,11 +25,24 @@
-/
namespace Capless
+theorem Typed.invoke_inv' {Γ : Context n m k}
+ (he : t0 = Term.invoke x y)
+ (ht : Typed Γ t0 E Ct) :
+ ∃ S0 C0,
+ Typed Γ (Term.var x) (Label[S0]^C0) {x=x} ∧
+ Typed Γ (Term.var y) (EType.type (S0^{})) {x=y} := by
+ induction ht <;> try (solve | cases he)
+ 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_84dcb419a2d4_22 | 59c32414df97d2dc | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.label_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.label_inv' rfl rfl ht hb",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_auto... | [
{
"name": "Typed.label_inv'",
"text": "theorem Typed.label_inv'\n (he1 : t0 = Term.var x)\n (he2 : E0 = EType.type T)\n (ht : Typed Γ t0 E0 Ct) (hb : Γ.LBound x S1) :\n ∃ S0, Γ.LBound x S0 ∧ (Γ ⊢ (Label[S0]^{x=x}) <: T) := by\n induction ht <;> try (solve | cases he1 | cases he2)\n case var hb0 =>\n ... | [
{
"name": "Typed.label_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 195,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting"... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,9 +25,34 @@
-/
namespace Capless
+theorem Typed.label_inv'
+ (he1 : t0 = Term.var x)
+ (he2 : E0 = EType.type T)
+ (ht : Typed Γ t0 E0 Ct) (hb : Γ.LBound x S1) :
+ ∃ S0, Γ.LBound x S0 ∧ (Γ ⊢ (Label[S0]^{x=x}) <: T) := by
+ induction ht <;> try (solve | cases he1 | cases he2)
+ case var hb0 =>
+ 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_84dcb419a2d4_23 | 96bd4f33d6455907 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.label_inv_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨S0, hl, hs⟩ := Typed.label_inv ht hb\n cases hs; rename_i hs\n have h1 := SSubtyp.sub_dealias_label_inv hg (by ... | [
{
"name": "Typed.label_inv",
"text": "theorem Typed.label_inv\n (ht : Typed Γ (Term.var x) (EType.type T) Ct) (hb : Γ.LBound x S1) :\n ∃ S0, Γ.LBound x S0 ∧ (Γ ⊢ (Label[S0]^{x=x}) <: T) :=\n Typed.label_inv' rfl rfl ht hb\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 195,
"n_subproofs": 0,
... | [
{
"name": "Typed.label_inv_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 337,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_ne... | 2 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -49,10 +49,19 @@
{ easy }
{ apply CSubtyp.trans <;> easy }
+theorem Typed.label_inv
+ (ht : Typed Γ (Term.var x) (EType.type T) Ct) (hb : Γ.LBound x S1) :
+ ∃ S0, Γ.LBound x S0 ∧ (Γ ⊢ (Label[S0]^{x=x}) <: T) :=
+ Typed.label_inv' rfl rfl ht hb
+
theorem Typed.label_inv_sub
(ht : Typed Γ (Term.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_84dcb419a2d4_24 | 1f7dcc7181ec615c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Typing.lean | Typing | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Typed.boundary_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Typed.boundary_inv' rfl ht",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "Typed.boundary_inv'",
"text": "theorem Typed.boundary_inv' {Γ : Context n m k} {S : SType n m k}\n (he : t0 = (boundary:S in t))\n (ht : Typed Γ t0 E Ct) :\n Typed\n ((Γ,c<:*),x: Label[S.cweaken]^{c=0})\n t\n (S.cweaken.weaken^{})\n (Ct.cweaken.weaken ∪ {c=0} ∪ {x=0}) ∧\n (Γ ⊢ (... | [
{
"name": "Typed.boundary_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 298,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | import Capless.Tactics
import Capless.Typing
import Capless.Subtyping.Basic
import Capless.Subcapturing.Basic
import Capless.Narrowing
import Capless.Weakening.Subcapturing
import Capless.Inversion.Context
import Capless.Inversion.Subtyping
/-! # Typing Inversion Lemmas
This file contains comprehensive inversion lemm... | @@ -25,6 +25,32 @@
-/
namespace Capless
+theorem Typed.boundary_inv' {Γ : Context n m k} {S : SType n m k}
+ (he : t0 = (boundary:S in t))
+ (ht : Typed Γ t0 E Ct) :
+ Typed
+ ((Γ,c<:*),x: Label[S.cweaken]^{c=0})
+ t
+ (S.cweaken.weaken^{})
+ (Ct.cweaken.weaken ∪ {c=0} ∪ {x=0}) ∧
+ (Γ ⊢ (S^{}) <:e... | {
"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_a541b43856ca_0 | 8574007b9f300927 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subtyping/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "ESubtyp.type_inv_subcapt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ESubtyp.type_inv_subcapt' rfl h",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "ESubtyp.type_inv_subcapt'",
"text": "theorem ESubtyp.type_inv_subcapt'\n (heq : E1 = EType.type (CType.capt C S))\n (h : ESubtyp Γ E E1) :\n ∃ C0 S0, E = EType.type (CType.capt C0 S0) ∧ Subcapt Γ C0 C := by\n cases h\n case type T1 _ _ =>\n cases T1\n cases heq\n constructor; constr... | [
{
"name": "ESubtyp.type_inv_subcapt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 191,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 1 | import Capless.Subtyping
import Capless.Subcapturing
import Capless.Subcapturing.Basic
/-!
# Basic Properties of Subtyping
This file contains basic properties of the subtyping relation.
-/
namespace Capless
theorem ESubtyp.type_inv_subcapt
(h : ESubtyp Γ E (EType.type (CType.capt C S))) :
∃ C0 S0, E = EType.typ... | import Capless.Subtyping
import Capless.Subcapturing
import Capless.Subcapturing.Basic
/-!
# Basic Properties of Subtyping
This file contains basic properties of the subtyping relation.
-/
namespace Capless
theorem ESubtyp.type_inv_subcapt'
(heq : E1 = EType.type (CType.capt C S))
(h : ESubtyp Γ E E1) :
∃ C0 ... | @@ -10,9 +10,23 @@
namespace Capless
+theorem ESubtyp.type_inv_subcapt'
+ (heq : E1 = EType.type (CType.capt C S))
+ (h : ESubtyp Γ E E1) :
+ ∃ C0 S0, E = EType.type (CType.capt C0 S0) ∧ Subcapt Γ C0 C := by
+ cases h
+ case type T1 _ _ =>
+ cases T1
+ cases heq
+ constructor; constructor; constructo... | {
"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_a40547fb3ed2_0 | c636c8950bfe3af1 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Lookup.lean | Lookup | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "Store.lookup_inv_typing",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨Tx, hbx⟩ := Store.bound_type hl ht\n have ⟨C0, S0, hb, hsub⟩ := Typed.var_inv hx hbx\n have ⟨Cv0, hv⟩ := St... | [
{
"name": "Store.bound_type",
"text": "theorem Store.bound_type\n (hl : Store.Bound σ x v)\n (ht : TypedStore σ Γ) :\n ∃ T0, Context.Bound Γ x T0 := by\n induction ht\n case empty => cases hl\n case val ih =>\n cases hl\n case here => constructor; constructor\n case there_val hb0 _ =>\n ... | [
{
"name": "Store.lookup_inv_typing",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 506,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | import Capless.Store
import Capless.Renaming.Term.Typing
import Capless.Renaming.Type.Typing
import Capless.Renaming.Capture.Typing
import Capless.Inversion.Context
import Capless.Inversion.Typing
/-! # Store and Continuation Lookup Inversion
This file provides inversion lemmas for store lookups and continuation anal... | import Capless.Store
import Capless.Renaming.Term.Typing
import Capless.Renaming.Type.Typing
import Capless.Renaming.Capture.Typing
import Capless.Inversion.Context
import Capless.Inversion.Typing
/-! # Store and Continuation Lookup Inversion
This file provides inversion lemmas for store lookups and continuation anal... | @@ -64,6 +64,42 @@
have ih := ih.lweaken (S := S)
aesop
+theorem Store.bound_type
+ (hl : Store.Bound σ x v)
+ (ht : TypedStore σ Γ) :
+ ∃ T0, Context.Bound Γ x T0 := by
+ induction ht
+ case empty => cases hl
+ case val ih =>
+ cases hl
+ case here => constructor; constructor
+ case there_va... | {
"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_a40547fb3ed2_1 | a71f811333c37da5 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Lookup.lean | Lookup | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "Store.lookup_inv_typing",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨Tx, hbx⟩ := Store.bound_type hl ht\n have ⟨C0, S0, hb, hsub⟩ := Typed.var_inv hx hbx\n have ⟨Cv0, hv⟩ := St... | [
{
"name": "Store.bound_type",
"text": "theorem Store.bound_type\n (hl : Store.Bound σ x v)\n (ht : TypedStore σ Γ) :\n ∃ T0, Context.Bound Γ x T0 := by\n induction ht\n case empty => cases hl\n case val ih =>\n cases hl\n case here => constructor; constructor\n case there_val hb0 _ =>\n ... | [
{
"name": "Store.lookup_inv_typing_alt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 445,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 8,
"automation_only": false,
... | 2 | import Capless.Store
import Capless.Renaming.Term.Typing
import Capless.Renaming.Type.Typing
import Capless.Renaming.Capture.Typing
import Capless.Inversion.Context
import Capless.Inversion.Typing
/-! # Store and Continuation Lookup Inversion
This file provides inversion lemmas for store lookups and continuation anal... | import Capless.Store
import Capless.Renaming.Term.Typing
import Capless.Renaming.Type.Typing
import Capless.Renaming.Capture.Typing
import Capless.Inversion.Context
import Capless.Inversion.Typing
/-! # Store and Continuation Lookup Inversion
This file provides inversion lemmas for store lookups and continuation anal... | @@ -64,6 +64,42 @@
have ih := ih.lweaken (S := S)
aesop
+theorem Store.bound_type
+ (hl : Store.Bound σ x v)
+ (ht : TypedStore σ Γ) :
+ ∃ T0, Context.Bound Γ x T0 := by
+ induction ht
+ case empty => cases hl
+ case val ih =>
+ cases hl
+ case here => constructor; constructor
+ case there_va... | {
"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_e8185bd68da1_0 | 7939de3898560301 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subst/Term/Typing.lean | Typing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "Typed.open",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [Term.open, EType.open]\n apply Typed.subst\n { exact h }\n { apply VarSubst.open\n trivial }",
"n_chars": 106,
... | [
{
"name": "Typed.subst",
"text": "theorem Typed.subst\n {Γ : Context n m k} {Δ : Context n' m k}\n (h : Typed Γ t E Ct)\n (σ : VarSubst Γ f Δ) :\n Typed Δ (t.rename f) (E.rename f) (Ct.rename f) := by\n induction h generalizing n'\n case var hb =>\n simp [Term.rename, EType.rename, CType.rename]\n ... | [
{
"name": "Typed.open",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 4... | 1 | import Capless.Typing
import Capless.Subst.Basic
import Capless.Subst.Term.Subtyping
import Capless.Renaming.Term.Typing
/-
Substitution theorems for term variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.open
(h : Typed (Γ,x: P) t E Ct)
(hx : Typed Γ (Term.var x) (EType.type P) Cx) :... | import Capless.Typing
import Capless.Subst.Basic
import Capless.Subst.Term.Subtyping
import Capless.Renaming.Term.Typing
/-
Substitution theorems for term variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.subst
{Γ : Context n m k} {Δ : Context n' m k}
(h : Typed Γ t E Ct)
(σ : VarSu... | @@ -9,10 +9,145 @@
namespace Capless
+theorem Typed.subst
+ {Γ : Context n m k} {Δ : Context n' m k}
+ (h : Typed Γ t E Ct)
+ (σ : VarSubst Γ f Δ) :
+ Typed Δ (t.rename f) (E.rename f) (Ct.rename f) := by
+ induction h generalizing n'
+ case var hb =>
+ simp [Term.rename, EType.rename, CType.rename]
+ ... | {
"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_03a9c4987561_0 | b5a8e6be69d3c2ba | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Subst/Type/Typing.lean | Typing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "Typed.topen",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply? Typed.tsubst\n apply? TVarSubst.open",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1... | [
{
"name": "Typed.tsubst",
"text": "theorem Typed.tsubst\n {Γ : Context n m k} {Δ : Context n m' k}\n (h : Typed Γ t E Ct)\n (σ : TVarSubst Γ f Δ) :\n Typed Δ (t.trename f) (E.trename f) Ct := by\n induction h generalizing m'\n case var hb =>\n simp [Term.trename, EType.trename, CType.trename]... | [
{
"name": "Typed.topen",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 158,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 1 | import Capless.Subst.Basic
import Capless.Subst.Type.Subtyping
import Capless.Typing
/-
Substitution theorems for type variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.topen
(h : Typed (Γ,X<: (SType.tvar X)) t E Ct) :
Typed Γ (t.topen X) (E.topen X) Ct := sorry
end Capless
| import Capless.Subst.Basic
import Capless.Subst.Type.Subtyping
import Capless.Typing
/-
Substitution theorems for type variable substitution in typing judgments.
-/
namespace Capless
theorem Typed.tsubst
{Γ : Context n m k} {Δ : Context n m' k}
(h : Typed Γ t E Ct)
(σ : TVarSubst Γ f Δ) :
Typed Δ (t.trename ... | @@ -8,9 +8,125 @@
namespace Capless
+theorem Typed.tsubst
+ {Γ : Context n m k} {Δ : Context n m' k}
+ (h : Typed Γ t E Ct)
+ (σ : TVarSubst Γ f Δ) :
+ Typed Δ (t.trename f) (E.trename f) Ct := by
+ induction h generalizing m'
+ case var hb =>
+ simp [Term.trename, EType.trename, CType.trename]
+ ... | {
"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_0e18dd3067cf_0 | fa7debdc6d11b1f6 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/CaptureSet.lean | CaptureSet | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "CaptureSet.cweaken_union",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [CaptureSet.cweaken, CaptureSet.crename_union]",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "CaptureSet.crename_union",
"text": "theorem CaptureSet.crename_union {C1 C2 : CaptureSet n k} {f : FinFun k k'} :\n (C1 ∪ C2).crename f = C1.crename f ∪ C2.crename f := by simp\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic"... | [
{
"name": "CaptureSet.cweaken_union",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 171,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 1 | import Mathlib.Data.Finset.Basic
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.PImage
import Capless.Basic
import Capless.Tactics
namespace Capless
/-!
# Capture Sets
This file contains the definition of capture sets.
-/
/-- Capture sets in System Capless.
The type of capture sets is parameterized by:... | import Mathlib.Data.Finset.Basic
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.PImage
import Capless.Basic
import Capless.Tactics
namespace Capless
/-!
# Capture Sets
This file contains the definition of capture sets.
-/
/-- Capture sets in System Capless.
The type of capture sets is parameterized by:... | @@ -104,8 +104,12 @@
## Basic Properties
-/
+theorem CaptureSet.crename_union {C1 C2 : CaptureSet n k} {f : FinFun k k'} :
+ (C1 ∪ C2).crename f = C1.crename f ∪ C2.crename f := by simp
+
theorem CaptureSet.cweaken_union {C1 C2 : CaptureSet n k} :
- (C1 ∪ C2).cweaken = C1.cweaken ∪ C2.cweaken := sorry
+ (C1 ∪ 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_7ef84044b49c_0 | bbf9c59258049c0c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.var_bound_succ_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.var_bound_succ_inv' rfl rfl hb",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomat... | [
{
"name": "Context.var_bound_succ_inv'",
"text": "theorem Context.var_bound_succ_inv'\n (he1 : Γ0 = Γ.var P) (he1 : 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 | aesop)\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "Context.var_bound_succ_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 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,16 @@
namespace Capless
+theorem Context.var_bound_succ_inv'
+ (he1 : Γ0 = Γ.var P) (he1 : 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 | aesop)
+
theorem Context.var_bound_succ_inv
(hb : Cont... | {
"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_1 | 7de5f5e49a6a0a61 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.var_tbound_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.var_tbound_inv' rfl hb",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "Context.var_tbound_inv'",
"text": "theorem Context.var_tbound_inv'\n (he : Γ0 = Γ.var P)\n (hb : Context.TBound Γ0 X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken := by\n cases hb <;> try (solve | cases he)\n case there_var b0 _ hb0 => cases he; exists b0\n\n",
"fan_in": 1,
"n_l... | [
{
"name": "Context.var_tbound_inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 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_tbound_inv'
+ (he : Γ0 = Γ.var P)
+ (hb : Context.TBound Γ0 X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken := by
+ cases hb <;> try (solve | cases he)
+ case there_var b0 _ hb0 => cases he; exists b0
+
theorem Context.var_tbound_inv
(hb : Con... | {
"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_2 | d5264ad3aede8687 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.var_tbound_inv_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := Context.var_tbound_inv hb\n have ⟨b0, hb0, he0⟩ := h\n cases b0\n case bound S0 =>\n simp [TBi... | [
{
"name": "Context.var_tbound_inv",
"text": "theorem Context.var_tbound_inv\n (hb : Context.TBound (Γ.var P) X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=\n Context.var_tbound_inv' rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "Context.var_tbound_inv_bound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 426,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"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,22 @@
cases hb <;> try (solve | cases he)
case there_var b0 _ hb0 => cases he; exists b0
+theorem Context.var_tbound_inv
+ (hb : Context.TBound (Γ.var P) X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=
+ Context.var_tbound_inv' rfl hb
+
theorem Context.var_tbound_inv_bound
(hb : Cont... | {
"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_3 | 9989eacda6c8407c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.var_cbound_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.var_cbound_inv' rfl hb",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "Context.var_cbound_inv'",
"text": "theorem Context.var_cbound_inv'\n (he : Γ0 = Γ.var P)\n (hb : Context.CBound Γ0 X b) :\n ∃ b0, Context.CBound Γ X b0 ∧ b = b0.weaken := by\n cases hb <;> try (solve | cases he)\n case there_var b0 _ _ hb0 => cases he; exists b0\n\n",
"fan_in": 1,
"... | [
{
"name": "Context.var_cbound_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 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_cbound_inv'
+ (he : Γ0 = Γ.var P)
+ (hb : Context.CBound Γ0 X b) :
+ ∃ b0, Context.CBound Γ X b0 ∧ b = b0.weaken := by
+ cases hb <;> try (solve | cases he)
+ case there_var b0 _ _ hb0 => cases he; exists b0
+
theorem Context.var_cbound_inv
(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_7ef84044b49c_4 | 7e6691bdc8f8d23f | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "Context.var_tbound_inv_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := Context.var_tbound_inv hb\n have ⟨b0, hb0, he0⟩ := h\n cases b0\n case bound S0 =>\n simp [TBi... | [
{
"name": "Context.var_tbound_inv",
"text": "theorem Context.var_tbound_inv\n (hb : Context.TBound (Γ.var P) X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=\n Context.var_tbound_inv' rfl hb\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "Context.var_cbound_inv_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 426,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"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,22 @@
cases hb <;> try (solve | cases he)
case there_var b0 _ hb0 => cases he; exists b0
+theorem Context.var_tbound_inv
+ (hb : Context.TBound (Γ.var P) X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken :=
+ Context.var_tbound_inv' rfl hb
+
theorem Context.var_cbound_inv_bound
(hb : Cont... | {
"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_5 | 9824e0ace81becb0 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.tinst_tbound_bound_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.tinst_tbound_bound_inv' rfl rfl hb",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "Context.tinst_tbound_bound_inv'",
"text": "theorem Context.tinst_tbound_bound_inv'\n (he1 : Γ0 = Γ.tvar (TBinding.inst P))\n (he2 : b0 = TBinding.bound S)\n (hb : Context.TBound Γ0 X b0) :\n ∃ X0 S0, Context.TBound Γ X0 (TBinding.bound S0)\n ∧ S = SType.tweaken S0\n ∧ X = X0.succ := by\... | [
{
"name": "Context.tinst_tbound_bound_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 266,
"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,11 +16,36 @@
namespace Capless
+theorem Context.tinst_tbound_bound_inv'
+ (he1 : Γ0 = Γ.tvar (TBinding.inst P))
+ (he2 : b0 = TBinding.bound S)
+ (hb : Context.TBound Γ0 X b0) :
+ ∃ X0 S0, Context.TBound Γ X0 (TBinding.bound S0)
+ ∧ S = SType.tweaken S0
+ ∧ X = X0.succ := by
+ cases hb <;> try (s... | {
"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_6 | f18097c8824ccabc | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.tbound_tbound_inst_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.tbound_tbound_inst_inv' rfl rfl hb",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "Context.tbound_tbound_inst_inv'",
"text": "theorem Context.tbound_tbound_inst_inv'\n (he1 : Γ0 = Γ.tvar (TBinding.bound P))\n (he2 : b0 = TBinding.inst S)\n (hb : Context.TBound Γ0 X b0) :\n ∃ X0 S0, Context.TBound Γ X0 (TBinding.inst S0)\n ∧ S = SType.tweaken S0\n ∧ X = X0.succ := by\n... | [
{
"name": "Context.tbound_tbound_inst_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 265,
"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,11 +16,35 @@
namespace Capless
+theorem Context.tbound_tbound_inst_inv'
+ (he1 : Γ0 = Γ.tvar (TBinding.bound P))
+ (he2 : b0 = TBinding.inst S)
+ (hb : Context.TBound Γ0 X b0) :
+ ∃ X0 S0, Context.TBound Γ X0 (TBinding.inst S0)
+ ∧ S = SType.tweaken S0
+ ∧ X = X0.succ := 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_7 | 829260564c5c0b3c | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 7 | 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.cvar_tbound_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 164,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 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.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
+ exists b0
+
theorem Context.cvar_tbound_inv
... | {
"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_8 | 56b469401d14e999 | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.cvar_tbound_inv_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨b0, hb0, he0⟩ := Context.cvar_tbound_inv hb\n cases b0\n case bound S0 =>\n simp [TBinding.cweaken... | [
{
"name": "Context.cvar_tbound_inv",
"text": "theorem Context.cvar_tbound_inv\n (hb : Context.TBound (Γ.cvar p) X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.cweaken :=\n Context.cvar_tbound_inv' rfl hb\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 164,
"n_subproofs": 0,
"n_tactics": 1,... | [
{
"name": "Context.cvar_tbound_inv_bound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 416,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"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... | @@ -25,9 +25,22 @@
cases he
exists b0
+theorem Context.cvar_tbound_inv
+ (hb : Context.TBound (Γ.cvar p) X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.cweaken :=
+ Context.cvar_tbound_inv' rfl hb
+
theorem Context.cvar_tbound_inv_bound
(hb : Context.TBound (Γ.cvar p) X (TBinding.bound S)) :
- ∃ S0, ... | {
"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_9 | 523fc9e8de6d6cec | lean | lean | github.com/Linyxus/capless-lean | 9beeba12d520c447791349f079256254fc413f1b | Capless/Inversion/Context.lean | Context | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "Context.label_tbound_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Context.label_tbound_inv' rfl hb",
"n_chars": 35,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "Context.label_tbound_inv'",
"text": "theorem Context.label_tbound_inv'\n (he : Γ0 = Γ.label l)\n (hb : Context.TBound Γ0 X b) :\n ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken := by\n cases hb <;> try (solve | cases he)\n case there_label b0 hb0 => aesop\n\n",
"fan_in": 1,
"n_lines": 8... | [
{
"name": "Context.label_tbound_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 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_tbound_inv'
+ (he : Γ0 = Γ.label l)
+ (hb : Context.TBound Γ0 X b) :
+ ∃ b0, Context.TBound Γ X b0 ∧ b = b0.weaken := by
+ cases hb <;> try (solve | cases he)
+ case there_label b0 hb0 => aesop
+
theorem Context.label_tbound_inv
(hb : Context.TBo... | {
"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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.