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_00654c838389_5 | 858eddde9a6326a7 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "mass'_series_exp",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mass'\n rw [ENNReal.tsum_toReal_eq]\n · conv =>\n left\n arg 1\n intro a\n rw [ENNReal.toRea... | [
{
"name": "mass'_neq_top",
"text": "theorem mass'_neq_top (n : ℕ) (γ : ENNReal) (h : γ ≠ ⊤) :\n mass' n γ ≠ ⊤ := by\n unfold mass'\n rw [ne_iff_lt_or_gt]\n left\n rw [ENNReal.mul_lt_top_iff]\n left\n constructor\n · induction n\n · simp\n · rename_i n IH\n rw [_root_.pow_succ]\n rw [... | [
{
"name": "mass'_series_exp",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 578,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 11,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -577,6 +577,28 @@
noncomputable def mass' (n : ℕ) (γ : ENNReal) := (γ^n * (((n)!) : ENNReal)⁻¹)
+theorem mass'_neq_top (n : ℕ) (γ : ENNReal) (h : γ ≠ ⊤) :
+ mass' n γ ≠ ⊤ := by
+ unfold mass'
+ rw [ne_iff_lt_or_gt]
+ left
+ rw [ENNReal.mul_lt_top_iff]
+ left
+ constructor
+ · induction n
+ · simp
+ ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_6 | 68918926206d7fc4 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "mass'_series_exp",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mass'\n rw [ENNReal.tsum_toReal_eq]\n · conv =>\n left\n arg 1\n intro a\n rw [ENNReal.toRea... | [
{
"name": "mass'_neq_top",
"text": "theorem mass'_neq_top (n : ℕ) (γ : ENNReal) (h : γ ≠ ⊤) :\n mass' n γ ≠ ⊤ := by\n unfold mass'\n rw [ne_iff_lt_or_gt]\n left\n rw [ENNReal.mul_lt_top_iff]\n left\n constructor\n · induction n\n · simp\n · rename_i n IH\n rw [_root_.pow_succ]\n rw [... | [
{
"name": "mass'_series_exp'",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 755,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 12,
"n_structural": 4,
"automation_only": false,
"max_ne... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -577,6 +577,28 @@
noncomputable def mass' (n : ℕ) (γ : ENNReal) := (γ^n * (((n)!) : ENNReal)⁻¹)
+theorem mass'_neq_top (n : ℕ) (γ : ENNReal) (h : γ ≠ ⊤) :
+ mass' n γ ≠ ⊤ := by
+ unfold mass'
+ rw [ne_iff_lt_or_gt]
+ left
+ rw [ENNReal.mul_lt_top_iff]
+ left
+ constructor
+ · induction n
+ · simp
+ ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_7 | 97b9fac411694fae | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "BernoulliExpNegSampleUnitAux_progress'",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have prog := BernoulliExpNegSampleUnitAux_progress num den (n - 2) 0 wf\n have A := nm2p2 n h\n r... | [
{
"name": "adhoc'",
"text": "theorem adhoc' (n : ℕ) (h : n > 1) :\n (n : ENNReal) - 2 + 1 = (n : ENNReal) - 1 := by\n have C := @congrArg ℕ ENNReal (n - 2 + 1) (n - 1) Nat.cast (adhoc n h)\n simp at C\n trivial\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 188,
"n_subproofs": 1,
"n_ta... | [
{
"name": "BernoulliExpNegSampleUnitAux_normalizes",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 28,
"n_lines": 47,
"n_chars": 1239,
"n_subproofs": 2,
"n_tactics": 44,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 17,
"n_structural": 9,
"automation_o... | 20 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -250,9 +250,29 @@
· exact h
· exact le.step le.refl
+theorem adhoc' (n : ℕ) (h : n > 1) :
+ (n : ENNReal) - 2 + 1 = (n : ENNReal) - 1 := by
+ have C := @congrArg ℕ ENNReal (n - 2 + 1) (n - 1) Nat.cast (adhoc n h)
+ simp at C
+ trivial
+
@[simp]
theorem BernoulliExpNegSampleUnitAux_progress' (num : ℕ) ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_8 | c4fd501b51b304d8 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "mass'_series_converges",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h'\n have A := mass'_series_exp γ h\n rw [h'] at A\n simp at A\n have B := Real.exp_pos (ENNReal.toRea... | [
{
"name": "mass'_series_exp",
"text": "theorem mass'_series_exp (γ : ENNReal) (h : γ ≠ ⊤) :\n (∑' (i : ℕ), mass' i γ).toReal = Real.exp (γ.toReal) := by\n unfold mass'\n rw [ENNReal.tsum_toReal_eq]\n · conv =>\n left\n arg 1\n intro a\n rw [ENNReal.toReal_mul]\n rw [ENNReal.toRe... | [
{
"name": "series_step_4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 322,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 8 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -599,8 +599,36 @@
simp
exact A
+theorem mass'_series_exp (γ : ENNReal) (h : γ ≠ ⊤) :
+ (∑' (i : ℕ), mass' i γ).toReal = Real.exp (γ.toReal) := by
+ unfold mass'
+ rw [ENNReal.tsum_toReal_eq]
+ · conv =>
+ left
+ arg 1
+ intro a
+ rw [ENNReal.toReal_mul]
+ rw [ENNReal.toReal_p... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_9 | 085df2d01bef84d2 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "BernoulliExpNegSampleUnitAux_apply",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [BernoulliExpNegSampleUnitAux]\n rw [ENNReal.tsum_prod']\n rw [tsum_bool]\n simp [probWhile]\n ... | [
{
"name": "BernoulliExpNegSampleUnitAux_sup",
"text": "theorem BernoulliExpNegSampleUnitAux_sup (num : ℕ) (den : ℕ+) (n : ℕ+) (wf : num ≤ den) :\n ⨆ i, probWhileCut (fun state => state.1) (BernoulliExpNegSampleUnitLoop num den wf) i (true, 1) (false, n)\n = if n = 1 then 0 else (∏ i ∈ range (n - 2), (nu... | [
{
"name": "BernoulliExpNegSampleUnit_apply_true",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 35,
"n_lines": 11,
"n_chars": 459,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": ... | 25 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -386,6 +386,40 @@
· trivial
· exact Nat.le_add_left n extra
+theorem BernoulliExpNegSampleUnitAux_sup (num : ℕ) (den : ℕ+) (n : ℕ+) (wf : num ≤ den) :
+ ⨆ i, probWhileCut (fun state => state.1) (BernoulliExpNegSampleUnitLoop num den wf) i (true, 1) (false, n)
+ = if n = 1 then 0 else (∏ i ∈ range (n ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_10 | f37b30fe5b849b1b | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "BernoulliExpNegSampleUnitAux_apply",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [BernoulliExpNegSampleUnitAux]\n rw [ENNReal.tsum_prod']\n rw [tsum_bool]\n simp [probWhile]\n ... | [
{
"name": "if_simpl'",
"text": "theorem if_simpl' (num : ℕ) (den : ℕ+) (x n : ℕ+) :\n @ite ENNReal (x = n) (Classical.propDecidable (x = n)) 0\n (if n = x then\n (if x = 1 then 0\n else ((∏ i ∈ range (↑x - 2), ↑num / (((1 : ENNReal) + ↑i) * ↑↑den)) * (1 - ↑num / ((↑↑x - 1) * ↑↑den)))) else 0) = 0 :=... | [
{
"name": "BernoulliExpNegSampleUnit_apply_false",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 41,
"n_lines": 9,
"n_chars": 478,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 30 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -437,9 +437,38 @@
contradiction
simp only
+theorem if_simpl' (num : ℕ) (den : ℕ+) (x n : ℕ+) :
+ @ite ENNReal (x = n) (Classical.propDecidable (x = n)) 0
+ (if n = x then
+ (if x = 1 then 0
+ else ((∏ i ∈ range (↑x - 2), ↑num / (((1 : ENNReal) + ↑i) * ↑↑den)) * (1 - ↑num / ((↑↑x - 1) * ↑↑den)))) el... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_00654c838389_11 | 6ba8d6ab31313bfb | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/BernoulliNegativeExponential/Properties.lean | Properties | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "BernoulliExpNegSampleGenLoop_apply_false",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have A := BernoulliExpNegSampleGenLoop_normalizes iter\n simp at A\n rw [BernoulliExpNegSampleGe... | [
{
"name": "BernoulliExpNegSampleGenLoop_normalizes",
"text": "theorem BernoulliExpNegSampleGenLoop_normalizes (iter : Nat) :\n (∑' b : Bool, (BernoulliExpNegSampleGenLoop iter) b) = 1 := by\n induction iter\n · simp [BernoulliExpNegSampleGenLoop]\n · rename_i iter IH\n rw [BernoulliExpNegSampleGenLoo... | [
{
"name": "BernoulliExpNegSampleGenLoop_apply_false",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 297,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only"... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Uniform.Basic
import SampCert.Samplers.Bernoulli.Basic
import SampCert.Samplers.... | @@ -1075,6 +1075,19 @@
rw [BernoulliExpNegSampleUnit_apply_true num den wf γ gam] at A
exact ENNReal.eq_sub_of_add_eq ENNReal.ofReal_ne_top A
+theorem BernoulliExpNegSampleGenLoop_normalizes (iter : Nat) :
+ (∑' b : Bool, (BernoulliExpNegSampleGenLoop iter) b) = 1 := by
+ induction iter
+ · simp [BernoulliEx... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e297749cc19e_0 | b86b0f9f21979d2e | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Util/Gaussian/GaussBound.lean | GaussBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "sum_gauss_term_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 123,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have A : (∑' (n : ℤ), (gauss_term_ℝ σ μ) n) = (∑' (n : ℤ), (gauss_term_ℝ σ 0) ((- μ) + n)) := by\n apply tsum_con... | [
{
"name": "local_ext_iff",
"text": "theorem local_ext_iff {z w : ℂ} : z = w ↔ z.re = w.re ∧ z.im = w.im :=\n ⟨fun H => by simp [H], fun h => Complex.ext h.1 h.2⟩\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1... | [
{
"name": "sum_gauss_term_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 128,
"n_chars": 5325,
"n_subproofs": 23,
"n_tactics": 116,
"cyclomatic": 2,
"n_automation": 21,
"n_rewrites": 45,
"n_structural": 20,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Util.Gaussian.DiscreteGaussian
/-!
# Gauss Bound
This file contains a proof that the sum of Gaussian terms with any mean ... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Util.Gaussian.DiscreteGaussian
/-!
# Gauss Bound
This file contains a proof that the sum of Gaussian terms with any mean ... | @@ -29,6 +29,9 @@
See: https://github.com/leanprover-community/mathlib4/pull/15340
-/
+theorem local_ext_iff {z w : ℂ} : z = w ↔ z.re = w.re ∧ z.im = w.im :=
+ ⟨fun H => by simp [H], fun h => Complex.ext h.1 h.2⟩
+
/--
The sum of any gaussian function over ℤ is bounded above by the sum of the mean-zero gaussian ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_41c3615998a7_0 | fc5a32d0e3ffb034 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Queries/Count/Properties.lean | Properties | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "privNoisedCount_DP",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold privNoisedCount\n apply dpn.noise_prop HP\n apply exactCount_1_sensitive",
"n_chars": 85,
"n_subproofs"... | [
{
"name": "exactCount_1_sensitive",
"text": "/--\nThe counting query is 1-sensitive\n-/\ntheorem exactCount_1_sensitive :\n @sensitivity T exactCount 1 := by\n simp [exactCount, sensitivity]\n intros l₁ l₂ H\n cases H\n · rename_i a b n h1 h2\n subst h1 h2\n simp\n · rename_i a b n h1 h2\n su... | [
{
"name": "privNoisedCount_DP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Queries.Count.Code
import SampCert.DifferentialPrivacy.Sensitivity
import SampCert.DifferentialPrivacy.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Queries.Count.Code
import SampCert.DifferentialPrivacy.Sensitivity
import SampCert.DifferentialPrivacy.... | @@ -21,6 +21,21 @@
variable {T : Type}
+/--
+The counting query is 1-sensitive
+-/
+theorem exactCount_1_sensitive :
+ @sensitivity T exactCount 1 := by
+ simp [exactCount, sensitivity]
+ intros l₁ l₂ H
+ cases H
+ · rename_i a b n h1 h2
+ subst h1 h2
+ simp
+ · rename_i a b n h1 h2
+ subst h1 h2
+ ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_0961d252a712_0 | 53d5788056ddf3a6 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Pure/Mechanism/Properties.lean | Properties | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "privNoisedQueryPure_DP_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [event_eq_singleton] at *\n simp [DP_singleton] at *\n intros l₁ l₂ neighbours x\n simp [privNoisedQuer... | [
{
"name": "natAbs_to_abs",
"text": "lemma natAbs_to_abs (a b : ℤ) :\n (a - b).natAbs = |(a : ℝ) - (b : ℝ)| := by\n rw [Nat.cast_natAbs]\n simp only [cast_abs, Int.cast_sub]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_a... | [
{
"name": "privNoisedQueryPure_DP_bound",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 74,
"n_chars": 2023,
"n_subproofs": 3,
"n_tactics": 63,
"cyclomatic": 3,
"n_automation": 14,
"n_rewrites": 23,
"n_structural": 11,
"automation_only": fals... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Pure.DP
import SampCert.DifferentialPrivacy.Pure.Mechanism.Code
import SampCert.Samplers.LaplaceGen.Bas... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Pure.DP
import SampCert.DifferentialPrivacy.Pure.Mechanism.Code
import SampCert.Samplers.LaplaceGen.Bas... | @@ -19,6 +19,11 @@
namespace SLang
+lemma natAbs_to_abs (a b : ℤ) :
+ (a - b).natAbs = |(a : ℝ) - (b : ℝ)| := by
+ rw [Nat.cast_natAbs]
+ simp only [cast_abs, Int.cast_sub]
+
lemma normalizing_constant_nonzero (ε₁ ε₂ Δ : ℕ+) :
(rexp (ε₁ / (Δ * ε₂)) - 1) / (rexp (ε₁ / (Δ * ε₂)) + 1) ≠ 0 := by
field_simp
@... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_0961d252a712_1 | b9894a08330a50e2 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Pure/Mechanism/Properties.lean | Properties | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "privNoisedQueryPure_DP_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [event_eq_singleton] at *\n simp [DP_singleton] at *\n intros l₁ l₂ neighbours x\n simp [privNoisedQuer... | [
{
"name": "normalizing_constant_nonzero",
"text": "lemma normalizing_constant_nonzero (ε₁ ε₂ Δ : ℕ+) :\n (rexp (ε₁ / (Δ * ε₂)) - 1) / (rexp (ε₁ / (Δ * ε₂)) + 1) ≠ 0 := by\n field_simp\n intro h\n have A : 0 < (ε₁ : ℝ) / (Δ * ε₂) := by\n simp\n have B : rexp 0 < rexp ((ε₁ : ℝ) / (Δ * ε₂)) := by\n ... | [
{
"name": "privNoisedQueryPure_DP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 517,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Pure.DP
import SampCert.DifferentialPrivacy.Pure.Mechanism.Code
import SampCert.Samplers.LaplaceGen.Bas... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.DifferentialPrivacy.Pure.DP
import SampCert.DifferentialPrivacy.Pure.Mechanism.Code
import SampCert.Samplers.LaplaceGen.Bas... | @@ -24,6 +24,27 @@
rw [Nat.cast_natAbs]
simp only [cast_abs, Int.cast_sub]
+lemma normalizing_constant_nonzero (ε₁ ε₂ Δ : ℕ+) :
+ (rexp (ε₁ / (Δ * ε₂)) - 1) / (rexp (ε₁ / (Δ * ε₂)) + 1) ≠ 0 := by
+ field_simp
+ intro h
+ have A : 0 < (ε₁ : ℝ) / (Δ * ε₂) := by
+ simp
+ have B : rexp 0 < rexp ((ε₁ : ℝ) / ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_5924cc30a770_0 | a1ac5b83956b44f1 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Pure/DP.lean | DP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "event_eq_singleton",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · apply event_to_singleton\n · apply singleton_to_event",
"n_chars": 77,
"n_subproofs": 0,
"... | [
{
"name": "event_to_singleton",
"text": "theorem event_to_singleton (m : Mechanism T U) (ε : ℝ) (h : DP m ε) :\n DP_singleton m ε := by\n simp [DP_singleton]\n simp [DP] at h\n intros l₁ l₂ h1 x\n replace h1 := h l₁ l₂ h1 {x}\n simp at h1\n trivial\n\n",
"fan_in": 1,
"n_lines": 10,
"n_cha... | [
{
"name": "event_eq_singleton",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 173,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | @@ -55,10 +55,19 @@
simp
exact Real.exp_pos ε
+theorem event_to_singleton (m : Mechanism T U) (ε : ℝ) (h : DP m ε) :
+ DP_singleton m ε := by
+ simp [DP_singleton]
+ simp [DP] at h
+ intros l₁ l₂ h1 x
+ replace h1 := h l₁ l₂ h1 {x}
+ simp at h1
+ trivial
+
theorem event_eq_singleton (m : Mechanism T... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_5924cc30a770_1 | 2f571b391d8da30e | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Pure/DP.lean | DP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "PureDP_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [PureDP] at *\n apply (event_eq_singleton _ _).mpr\n apply (event_eq_singleton _ _).mp at Hε\n simp [DP_singleton] at *\... | [
{
"name": "event_eq_singleton",
"text": "theorem event_eq_singleton (m : Mechanism T U) (ε : ℝ) :\n DP m ε ↔ DP_singleton m ε := by\n constructor\n · apply event_to_singleton\n · apply singleton_to_event\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 173,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "PureDP_mono",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 514,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 8,
"automation_only": false,
"max_nesting":... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | @@ -64,8 +64,24 @@
simp at h1
trivial
-lemma PureDP_mono {m : Mechanism T U} {ε₁ ε₂ : NNReal} (H : ε₁ ≤ ε₂) (Hε : PureDP m ε₁) : PureDP m ε₂ := sorry
+theorem event_eq_singleton (m : Mechanism T U) (ε : ℝ) :
+ DP m ε ↔ DP_singleton m ε := by
+ constructor
+ · apply event_to_singleton
+ · apply singleton_to_... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_5924cc30a770_2 | 4e06a9cdb157d55b | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/DifferentialPrivacy/Pure/DP.lean | DP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "pure_ApproximateDP",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro _ _ _ HDP\n rw [ApproximateDP]\n apply ApproximateDP_of_DP\n simp [pure_of_adp] at HDP\n trivial",
"n_char... | [
{
"name": "ApproximateDP_of_DP",
"text": "theorem ApproximateDP_of_DP (m : Mechanism T U) (ε : ℝ) (h : DP m ε) :\n ∀ δ : NNReal, DP' m ε δ := by\n simp [DP] at h\n simp [DP']\n intros δ l₁ l₂ neighs S\n replace h := h l₁ l₂ neighs S\n rw [ENNReal.div_le_iff_le_mul ?G1 ?G2] at h\n case G1 =>\n righ... | [
{
"name": "pure_ApproximateDP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 355,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.SLang
import SampCert.DifferentialPrivacy.Generic
import SampCert.DifferentialPrivacy.Neighbours
import SampCert.Differenti... | @@ -28,6 +28,29 @@
∀ l₁ l₂ : List T, Neighbour l₁ l₂ → ∀ x : U,
(m l₁ x) / (m l₂ x) ≤ ENNReal.ofReal (Real.exp ε)
+theorem ApproximateDP_of_DP (m : Mechanism T U) (ε : ℝ) (h : DP m ε) :
+ ∀ δ : NNReal, DP' m ε δ := by
+ simp [DP] at h
+ simp [DP']
+ intros δ l₁ l₂ neighs S
+ replace h := h l₁ l₂ neighs S
+... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_c4f48d98bd6e_0 | b1446cbd5a57b058 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Util/UtilMathlib.lean | UtilMathlib | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "summable_exp_mul_sq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, h, h'⟩ := exists_summable_bound_exp_mul_sq hτ\n .of_norm_bounded h (h' <| le_refl _)",
"n_chars": 100,
"n... | [
{
"name": "exists_summable_bound_exp_mul_sq",
"text": "theorem exists_summable_bound_exp_mul_sq {R : ℝ} (hR : 0 < R) :\n ∃ bd : ℤ → ℝ, Summable bd ∧ ∀ {τ : ℂ} (_ : R ≤ τ.im) (n : ℤ),\n ‖cexp (π * I * (n : ℂ) ^ 2 * τ)‖ ≤ bd n := by\n let y := rexp (-π * R)\n have h : y < 1 := exp_lt_one_iff.mpr (mu... | [
{
"name": "summable_exp_mul_sq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | import Mathlib.NumberTheory.ModularForms.JacobiTheta.OneVariable
import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
import Mathlib.Analysis.Complex.UpperHalfPlane.Basic
/-!
# Mathlib Util
This file contains a lemma which was in Mathlib at one point, but was removed.
-/
open Complex Real Asymptotics Filt... | import Mathlib.NumberTheory.ModularForms.JacobiTheta.OneVariable
import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
import Mathlib.Analysis.Complex.UpperHalfPlane.Basic
/-!
# Mathlib Util
This file contains a lemma which was in Mathlib at one point, but was removed.
-/
open Complex Real Asymptotics Filt... | @@ -11,6 +11,24 @@
open scoped Real BigOperators UpperHalfPlane
+theorem exists_summable_bound_exp_mul_sq {R : ℝ} (hR : 0 < R) :
+ ∃ bd : ℤ → ℝ, Summable bd ∧ ∀ {τ : ℂ} (_ : R ≤ τ.im) (n : ℤ),
+ ‖cexp (π * I * (n : ℂ) ^ 2 * τ)‖ ≤ bd n := by
+ let y := rexp (-π * R)
+ have h : y < 1 := exp_lt_one_iff.mpr ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_c0fde4083a11_0 | 4f349bac1f39fdad | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/Geometric/Properties.lean | Properties | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "trial_sum_ne_top'",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have A := trial_sum_ne_top trial trial_spec'\n rw [ENNReal.tsum_eq_add_tsum_ite 0] at A\n simp [ite_test, tsum_shift'_1... | [
{
"name": "ite_test",
"text": "lemma ite_test (a b : ℕ) (x y : ENNReal) :\n @ite ENNReal (a = b) (propDecidable (a = b)) x y\n = @ite ENNReal (a = b) (instDecidableEqNat a b) x y := by\n split ; any_goals { trivial }\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 190,
"n_subproofs": 0,
... | [
{
"name": "trial_sum_ne_top'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 265,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | @@ -18,6 +18,11 @@
namespace SLang
+lemma ite_test (a b : ℕ) (x y : ENNReal) :
+ @ite ENNReal (a = b) (propDecidable (a = b)) x y
+ = @ite ENNReal (a = b) (instDecidableEqNat a b) x y := by
+ split ; any_goals { trivial }
+
section Geometric
variable (trial : SLang Bool)
@@ -64,7 +69,11 @@
contradiction... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_c0fde4083a11_2 | b9257c66cf4bac45 | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/Geometric/Properties.lean | Properties | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "probGeometric_normalizes",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [probGeometric_apply]\n rw [tsum_shift'_1]\n simp only [add_tsub_cancel_right]\n rw [trial_one_minus... | [
{
"name": "trial_one_minus",
"text": "lemma trial_one_minus (trial_spec : trial false + trial true = 1) :\n trial false = 1 - trial true := by\n by_contra h\n rw [← trial_spec] at h\n rw [ENNReal.add_sub_cancel_right] at h\n · contradiction\n · by_contra h'\n rw [h'] at trial_spec\n simp at tria... | [
{
"name": "probGeometric_normalizes",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 16,
"n_lines": 41,
"n_chars": 1206,
"n_subproofs": 5,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 9,
"n_structural": 6,
"automation_only": false,
... | 16 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | @@ -27,6 +27,16 @@
variable (trial : SLang Bool)
+lemma trial_one_minus (trial_spec : trial false + trial true = 1) :
+ trial false = 1 - trial true := by
+ by_contra h
+ rw [← trial_spec] at h
+ rw [ENNReal.add_sub_cancel_right] at h
+ · contradiction
+ · by_contra h'
+ rw [h'] at trial_spec
+ simp at... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_c0fde4083a11_3 | 2701b2b904d271ce | lean | lean | github.com/leanprover/SampCert | 6e2392c165652063fefc628d8f047b77ca393b0f | SampCert/Samplers/Geometric/Properties.lean | Properties | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "probGeometric_normalizes",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [probGeometric_apply]\n rw [tsum_shift'_1]\n simp only [add_tsub_cancel_right]\n rw [trial_one_minus... | [
{
"name": "trial_le_1",
"text": "lemma trial_le_1 (trial_spec : trial false + trial true = 1) (i : ℕ) :\n trial true ^ i ≤ 1 := by\n induction i\n · simp\n · rename_i i IH\n rw [_root_.pow_succ]\n have A : trial true ≤ 1 := by\n by_contra h\n simp at h\n have B : 1 < trial false + t... | [
{
"name": "probGeometric_normalizes'",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 17,
"n_lines": 16,
"n_chars": 654,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 17 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean-Baptiste Tristan
-/
import SampCert.Foundations.Basic
import SampCert.Samplers.Geometric.Code
/-!
# ``probGeometric`` properties
This file proves normalizati... | @@ -37,6 +37,25 @@
rw [h'] at trial_spec
simp at trial_spec
+lemma trial_le_1 (trial_spec : trial false + trial true = 1) (i : ℕ) :
+ trial true ^ i ≤ 1 := by
+ induction i
+ · simp
+ · rename_i i IH
+ rw [_root_.pow_succ]
+ have A : trial true ≤ 1 := by
+ by_contra h
+ simp at h
+ ... | {
"repo": "SampCert",
"git_repo": "github.com/leanprover/SampCert",
"revision": "6e2392c165652063fefc628d8f047b77ca393b0f",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_a789bd58ebe6_0 | 291a9e183a104ffc | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/SizzLean/SizzLean/Proofs/ContainerFixed.lean | ContainerFixed | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "encode_size_le_max_containerFixed",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_var_empty := (size_serializeFieldsAux_fix h_fs vs\n (SSZType.fixedSectionS... | [
{
"name": "fixedByteSizeFields_le_maxByteLengthFields",
"text": "/-- Field-list version of the size bound, taking the concrete\nvalue `vs` as a source of per-field inhabitants. -/\ntheorem fixedByteSizeFields_le_maxByteLengthFields :\n ∀ {fs : List SSZType} (_h_fs : SSZType.BasicSupportedFieldsFixed fs)\... | [
{
"name": "encode_size_le_max_containerFixed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1132,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": fa... | 1 | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Spec.MaxByteLength
import SizzLean.Proofs.SerializeSize
/-!
# `SizzLean.Proofs.ContainerFixed`: general `.container fs` arm
Closes `decode_encode` and `encode_size_le_max` for `.container fs`
when each field is `BasicSupported` and fix... | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Spec.MaxByteLength
import SizzLean.Proofs.SerializeSize
/-!
# `SizzLean.Proofs.ContainerFixed`: general `.container fs` arm
Closes `decode_encode` and `encode_size_le_max` for `.container fs`
when each field is `BasicSupported` and fix... | @@ -43,6 +43,34 @@
open SizzLean.Spec
+/-- Field-list version of the size bound, taking the concrete
+value `vs` as a source of per-field inhabitants. -/
+theorem fixedByteSizeFields_le_maxByteLengthFields :
+ ∀ {fs : List SSZType} (_h_fs : SSZType.BasicSupportedFieldsFixed fs)
+ (_vs : SSZType.interpField... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_91020331f8dc_0 | 5cd1ea3baef5200a | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/LeanSha256/LeanSha256/Core.lean | Core | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "messageSchedule_size",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n show (extendSchedule block 48).size = 64\n rw [extendSchedule_size]; omega",
"n_chars": 80,
"n_subproofs": 0,... | [
{
"name": "extendSchedule_size",
"text": "theorem extendSchedule_size (acc : Array (BitVec 32)) (steps : Nat) :\n (extendSchedule acc steps).size = acc.size + steps := by\n induction steps generalizing acc with\n | zero => rfl\n | succ k ih =>\n show (extendSchedule (acc.push _) k).size = acc.siz... | [
{
"name": "messageSchedule_size",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 209,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | @@ -345,9 +345,22 @@
in the FIPS form. The theorem ensures any future refactor that
changes the shape is caught at proof check time. -/
+theorem extendSchedule_size (acc : Array (BitVec 32)) (steps : Nat) :
+ (extendSchedule acc steps).size = acc.size + steps := by
+ induction steps generalizing acc with
+ | z... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_91020331f8dc_1 | a418bdf6d00dab5f | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/LeanSha256/LeanSha256/Core.lean | Core | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "pad_size_multiple_of_64",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pad\n simp only [ByteArray.size_append, ByteArray.size_push,\n byteArray_mk_size_eq, Array.size... | [
{
"name": "byteArray_mk_size_eq",
"text": "private theorem byteArray_mk_size_eq {arr : Array UInt8} :\n (ByteArray.mk arr).size = arr.size := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 106,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewri... | [
{
"name": "pad_size_multiple_of_64",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 557,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 2 | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | @@ -348,8 +348,16 @@
theorem uint64ToBytesBE_size (n : Nat) :
(uint64ToBytesBE n).size = 8 := rfl
+private theorem byteArray_mk_size_eq {arr : Array UInt8} :
+ (ByteArray.mk arr).size = arr.size := rfl
+
theorem pad_size_multiple_of_64 (input : ByteArray) :
- (pad input).size % 64 = 0 := sorry
+ (pad ... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_91020331f8dc_2 | f0d5a57ec35bbf49 | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/LeanSha256/LeanSha256/Core.lean | Core | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "packState_size",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold packState\n exact Array.foldl_induction\n (motive := fun i (acc : ByteArray) => acc.size = i * 4)\n (h0 := rfl... | [
{
"name": "wordToBytesBE_size",
"text": "theorem wordToBytesBE_size (w : BitVec 32) :\n (wordToBytesBE w).size = 4 := rfl\n\n/-! ### `extendSchedule` size\n\nEach step pushes one element, so the result has size `acc.size +\nsteps`. Proven by structural induction on `steps`. -/\n\n",
"fan_in": 1,
... | [
{
"name": "packState_size",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 577,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 1 | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | @@ -345,8 +345,24 @@
in the FIPS form. The theorem ensures any future refactor that
changes the shape is caught at proof check time. -/
+theorem wordToBytesBE_size (w : BitVec 32) :
+ (wordToBytesBE w).size = 4 := rfl
+
+/-! ### `extendSchedule` size
+
+Each step pushes one element, so the result has size `acc.s... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_91020331f8dc_3 | 0ac64dc4dfaf4ade | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/LeanSha256/LeanSha256/Core.lean | Core | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "hash_size_eq_32",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold hash\n rw [packState_size,\n nat_fold_array_size _ _ 8\n (fun _ _ _ => compressBlock_size _ _) _ h0Cons... | [
{
"name": "compressBlock_size",
"text": "theorem compressBlock_size (hIn : Array (BitVec 32))\n (block : Array (BitVec 32)) :\n (compressBlock hIn block).size = 8 := by\n unfold compressBlock\n simp [Array.size_ofFn]\n\n/-! ### Padding ends on a 64-byte boundary\n\nMerkle–Damgård padding emits `0x80... | [
{
"name": "hash_size_eq_32",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 5 | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | @@ -355,6 +355,18 @@
Each step pushes one element, so the result has size `acc.size +
steps`. Proven by structural induction on `steps`. -/
+theorem compressBlock_size (hIn : Array (BitVec 32))
+ (block : Array (BitVec 32)) :
+ (compressBlock hIn block).size = 8 := by
+ unfold compressBlock
+ simp [Array.si... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_91020331f8dc_4 | ab77b779ec7953a9 | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/LeanSha256/LeanSha256/Core.lean | Core | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "hash_size_eq_32",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold hash\n rw [packState_size,\n nat_fold_array_size _ _ 8\n (fun _ _ _ => compressBlock_size _ _) _ h0Cons... | [
{
"name": "packState_size",
"text": "theorem packState_size (state : Array (BitVec 32)) :\n (packState state).size = state.size * 4 := by\n unfold packState\n exact Array.foldl_induction\n (motive := fun i (acc : ByteArray) => acc.size = i * 4)\n (h0 := rfl)\n (hf := by\n intro i acc ih\n... | [
{
"name": "combine_size_eq_32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 4,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 6 | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | /-!
# `LeanSha256`: pure-Lean SHA-256 reference
A *kernel-reducible* SHA-256 implementation. No FFI, no
typeclasses, no SSZ coupling, just `hash : ByteArray → ByteArray`
and `combine : ByteArray → ByteArray → ByteArray` plus a handful of
structural conformance lemmas against FIPS 180-4.
## Why this exists
SHA-256 is... | @@ -367,6 +367,23 @@
message at length ≡ 56 (mod 64), then the 8-byte length suffix.
Total `% 64 = 0` by construction. -/
+theorem packState_size (state : Array (BitVec 32)) :
+ (packState state).size = state.size * 4 := by
+ unfold packState
+ exact Array.foldl_induction
+ (motive := fun i (acc : ByteArray... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_256a0062d941_0 | 83f97f349caa71e9 | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/SizzLean/SizzLean/Proofs/SerializeSize.lean | SerializeSize | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "size_serialize_eq_fixedByteSize",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s h_s h_fixed x\n cases h_s with\n | uintN8 =>\n let x' : UInt8 := x\n show (SSZType.seriali... | [
{
"name": "serializeFixedElems_size_aux",
"text": "/-- For any `t` whose serialization has constant size `sz` per\nelement, `serializeFixedElems t xs` has size `xs.length * sz`.\nNot mutually recursive, induct on `xs` directly; the\nelement-size hypothesis is provided by the caller. Used both by\nthe main m... | [
{
"name": "size_serialize_eq_fixedByteSize",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 70,
"n_chars": 3296,
"n_subproofs": 3,
"n_tactics": 61,
"cyclomatic": 4,
"n_automation": 11,
"n_rewrites": 13,
"n_structural": 3,
"automation_only": fa... | 2 | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Spec.MaxByteLength
import SizzLean.Proofs.SimpAttrs
import SizzLean.Proofs.BitPack
/-!
# `SizzLean.Proofs.SerializeSize`: the shared size-prereq lemma
For any `s` that is *both* `BasicSupported` and `isFixedSize`, the
serialized output... | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Spec.MaxByteLength
import SizzLean.Proofs.SimpAttrs
import SizzLean.Proofs.BitPack
/-!
# `SizzLean.Proofs.SerializeSize`: the shared size-prereq lemma
For any `s` that is *both* `BasicSupported` and `isFixedSize`, the
serialized output... | @@ -53,6 +53,27 @@
open SizzLean.Spec
+/-- For any `t` whose serialization has constant size `sz` per
+element, `serializeFixedElems t xs` has size `xs.length * sz`.
+Not mutually recursive, induct on `xs` directly; the
+element-size hypothesis is provided by the caller. Used both by
+the main mutual block here (f... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_4f3fbcf2759a_0 | 2982d65f3b402fd0 | lean | lean | github.com/etheorem/etheorem | 032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0 | packages/SizzLean/SizzLean/Proofs/FixedElems.lean | FixedElems | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "deserializeFixedElems_serializeFixedElems",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_extract :\n ∀ i, ∀ h : i < xs.length,\n (SSZType.serializeFixedElems t xs).ex... | [
{
"name": "deserializeFixedElems_eq_of_slice",
"text": "/-- The accumulator-based decoder inverts the concatenated\nserializer, returning the elements in their original order\n(despite the internal reverse). The `h_slice` hypothesis\ndischarges the per-step buffer match. -/\ntheorem deserializeFixedElems_eq... | [
{
"name": "deserializeFixedElems_serializeFixedElems",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1191,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_o... | 2 | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Proofs.SerializeSize
/-!
# `SizzLean.Proofs.FixedElems`: the `deserializeFixedElems` inverse
Shared helper for the `VectorFixed` and `ListFixed` arms:
proves that `deserializeFixedElems` is the left inverse of
`serializeFixedElems` whe... | import SizzLean.Spec.Supported
import SizzLean.Spec.BasicSupported
import SizzLean.Proofs.SerializeSize
/-!
# `SizzLean.Proofs.FixedElems`: the `deserializeFixedElems` inverse
Shared helper for the `VectorFixed` and `ListFixed` arms:
proves that `deserializeFixedElems` is the left inverse of
`serializeFixedElems` whe... | @@ -83,6 +83,84 @@
simp only [List.getElem_cons_succ]
exact ih i' h_i'
+/-- The accumulator-based decoder inverts the concatenated
+serializer, returning the elements in their original order
+(despite the internal reverse). The `h_slice` hypothesis
+discharges the per-step buffer match. -/
+theorem dese... | {
"repo": "SizzLean",
"git_repo": "github.com/etheorem/etheorem",
"revision": "032ab6c6d67186ba60b734e0f2c44ba1bb8b6fb0",
"lean_toolchain": "leanprover/lean4:v4.29.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lem... |
ablate_8bd38857962e_0 | 7c0f10ea91c0536f | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpLvlInv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 534,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,35 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_1 | ce372cc594092529 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpFwd",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 584,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 13,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 15,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,37 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_2 | 5dd0eb08ce1c439d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsFwd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -50,8 +50,23 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_3 | 707bdcc30de508d6 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsFwds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 3 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -50,8 +50,23 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_4 | 0a7d20cf8c35ef72 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwds",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_5 | e1cbe596d99cd92a | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 6 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -67,10 +67,14 @@
theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := by
unfold Interps at *; apply_rules [interpFwd]
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> assumption
+
theorem interpsFwds {i a b P} (r : a... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_6 | 9977b46575eb4d84 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "interpsConv",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, ra, rb⟩ := r\n interpsBwds rb (interpsFwds ra h)",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "interpsBwds",
"text": "theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n induction r generalizing P <;> apply_rules [interpsBwd]\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_aut... | [
{
"name": "interpsBwdsP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 724,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -36,8 +36,23 @@
theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
unfold Interps at *; constructor <;> assumption
-theorem interpsBwdsP {i a x y P} (r : x ⇒⋆ y) (h : ⟦ a ⟧ i ↘ P) : P y → P x := sorry
+theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_7 | cb0ce433802e4f50 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case ne => subst e; contradiction\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n ... | [
{
"name": "interpDet'",
"fan_in": 2,
"n_deps_direct": 6,
"n_deps_transitive": 7,
"n_lines": 26,
"n_chars": 1015,
"n_subproofs": 2,
"n_tactics": 32,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 14,
"automation_only": false,
"max_nesting"... | 7 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -76,6 +76,18 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case ne => subst e; contradiction
+ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_8 | f6c2ba9d41edaba0 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsDet'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 4,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 8 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -88,6 +88,14 @@
exact ⟨j, lt, Pars.trans r₁ r₂, e⟩
all_goals contradiction
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e; contradiction
+ case mty => rfl
+ case step r _ ih => subst e; cases r; simp [ih]
+ all_go... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_9 | 09dce844e413e626 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsDet",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 12,
"n_chars": 415,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 10 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -88,6 +88,14 @@
exact ⟨j, lt, Pars.trans r₁ r₂, e⟩
all_goals contradiction
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e; contradiction
+ case mty => rfl
+ case step r _ ih => subst e; cases r; simp [ih]
+ all_go... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_10 | 28a3d1dccdb83b0a | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpPiInv'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 16,
"n_chars": 701,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 8 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -88,6 +88,14 @@
exact ⟨j, lt, Pars.trans r₁ r₂, e⟩
all_goals contradiction
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e; contradiction
+ case mty => rfl
+ case step r _ ih => subst e; cases r; simp [ih]
+ all_go... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_11 | fcb9db8b66008a72 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsPiInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 7,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 9 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -88,6 +88,14 @@
exact ⟨j, lt, Pars.trans r₁ r₂, e⟩
all_goals contradiction
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e; contradiction
+ case mty => rfl
+ case step r _ ih => subst e; cases r; simp [ih]
+ all_go... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_12 | 96a0921d19477375 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case ne => subst e; contradiction\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n ... | [
{
"name": "interps𝒰Inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case ne => subst e; contradiction
+ case... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_13 | c168cfd223080d93 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,17 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsMtyInv {i P} (h : ⟦ mty ⟧ i ↘ P) : P = wne := sorry
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_14 | c6b3b7dc743c6b23 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpLvlInv",
"text": "theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection e with ... | [
{
"name": "interpsLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -50,8 +50,22 @@
Simple inversion lemmas
------------------------*-/
+theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by
+ generalize e : lvl b = c at h
+ induction h generalizing b
+ case ne => subst e; contradiction
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_15 | 8617fbd4a330a89a | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsStepInv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; exact interpStepInv h",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": ... | [
{
"name": "interpStepInv",
"text": "theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :\n wne T ∨\n (∃ A B, T ⇒⋆ pi A B) ∨\n (∃ i, T ⇒⋆ 𝒰 i) ∨\n (T ⇒⋆ mty) ∨\n (∃ b, T ⇒⋆ lvl b) := by\n induction h\n case ne nea => left; exact neWne nea\n case pi => right; left; exact ⟨_, _, Pars.refl _⟩\n cas... | [
{
"name": "interpsStepInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 354,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,12 +33,37 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :
+ wne T ∨
+ (∃ A B, T ⇒⋆ pi A B) ∨
+ (∃ i, T ⇒⋆ 𝒰 i) ∨
+ (T ⇒⋆ mty) ∨
+ (∃ b, T ⇒⋆ lvl b) := by
+ induction h
+ case ne nea => left; exact ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_16 | 564a36c7e911ccb6 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "interpsConv",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, ra, rb⟩ := r\n interpsBwds rb (interpsFwds ra h)",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "interpsBwds",
"text": "theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n induction r generalizing P <;> apply_rules [interpsBwd]\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_aut... | [
{
"name": "adequacy",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 37,
"n_chars": 1206,
"n_subproofs": 0,
"n_tactics": 43,
"cyclomatic": 6,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 26,
"automation_only": false,
"max_nesting": ... | 4 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -39,6 +39,9 @@
theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
unfold Interps at *; constructor <;> assumption
+theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ induction r generalizing P <;> apply_rules [interpsBwd]
+
@[simp]
def CR (P : Term... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_17 | 7e6cde84e98d1ec4 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "interpsConv",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, ra, rb⟩ := r\n interpsBwds rb (interpsFwds ra h)",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "interpsBwds",
"text": "theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n induction r generalizing P <;> apply_rules [interpsBwd]\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_aut... | [
{
"name": "interpsWnf",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2... | 5 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -39,6 +39,9 @@
theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
unfold Interps at *; constructor <;> assumption
+theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ induction r generalizing P <;> apply_rules [interpsBwd]
+
@[simp]
def CR (P : Term... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_8bd38857962e_18 | 98b0c49bffe7ad6f | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates.lean | candidates | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpLvlInv",
"text": "theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection e with ... | [
{
"name": "semSubstCons",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 12,
"n_chars": 396,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
"max_nesting... | 11 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -96,6 +96,19 @@
case step r _ ih => subst e; cases r; simp [ih]
all_goals contradiction
+theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by
+ generalize e : lvl b = c at h
+ induction h generalizing b
+ case ne => subst ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_614df09eede6_0 | bc203660ad3965de | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/canonicity.lean | canonicity | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evaluation",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n match normalization h with\n | ⟨⟨b, nfb, r⟩, _⟩ =>\n let hb := wtPars r h\n cases wtProgress hb\n case inl => exists b... | [
{
"name": "nfCBN",
"text": "theorem nfCBN {a b} (nfa : nf a) (r : a ⇒β b) : False := by\n induction r <;> simp at *\n case app ih => let ⟨neb, _⟩ := nfa; exact ih (neNf neb)\n case exf ih => let ⟨_, neb⟩ := nfa; exact ih (neNf neb)\n\n-- Forward preservation of values\n",
"fan_in": 1,
"n_lines": ... | [
{
"name": "evaluation",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 344,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 4... | 1 | import «src».safety
import «src».normalization
open Term
open Nat
variable [lc : LevelClass]
-- Normal forms do not reduce
theorem valuePars {a b} (r : a ⇒⋆ b) (v : Value a) : Nonempty (Value b) := by
cases v
case 𝒰 => let ⟨_, e, _⟩ := pars𝒰Inv r; subst e; constructor; constructor
case pi => let ⟨_, _, e, _⟩... | import «src».safety
import «src».normalization
open Term
open Nat
variable [lc : LevelClass]
-- Normal forms do not reduce
theorem nfCBN {a b} (nfa : nf a) (r : a ⇒β b) : False := by
induction r <;> simp at *
case app ih => let ⟨neb, _⟩ := nfa; exact ih (neNf neb)
case exf ih => let ⟨_, neb⟩ := nfa; exact ih (... | @@ -7,6 +7,12 @@
variable [lc : LevelClass]
-- Normal forms do not reduce
+theorem nfCBN {a b} (nfa : nf a) (r : a ⇒β b) : False := by
+ induction r <;> simp at *
+ case app ih => let ⟨neb, _⟩ := nfa; exact ih (neNf neb)
+ case exf ih => let ⟨_, neb⟩ := nfa; exact ih (neNf neb)
+
+-- Forward preservation of valu... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_68561eaa6f9d_0 | b54a16f6d0a82f26 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/reduction.lean | reduction | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "parLift",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n; cases n\n case zero => constructor\n case succ n => apply parRename; apply h",
"n_chars": 91,
"n_subproofs": 0,
... | [
{
"name": "parRename",
"text": "theorem parRename {a b} ξ (r : a ⇒ b) : rename ξ a ⇒ rename ξ b := by\n induction r generalizing ξ <;> try constructor\n case β ihb iha => rw [← renameDist]; constructor; apply ihb; apply iha\n all_goals apply_assumption\n\n",
"fan_in": 2,
"n_lines": 6,
"n_char... | [
{
"name": "parLift",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 179,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nesting": 2
}... | 1 | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | @@ -57,8 +57,16 @@
theorem parRefl a : a ⇒ a := by
induction a <;> constructor <;> assumption
-theorem parLift σ τ (h : ∀ x, σ x ⇒ τ x) : ∀ x, (⇑ σ) x ⇒ (⇑ τ) x := sorry
+theorem parRename {a b} ξ (r : a ⇒ b) : rename ξ a ⇒ rename ξ b := by
+ induction r generalizing ξ <;> try constructor
+ case β ihb iha => rw... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_68561eaa6f9d_1 | e3c661614a592475 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/reduction.lean | reduction | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "parSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply parMorphing (r := r); intros; apply parRefl",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic":... | [
{
"name": "parRefl",
"text": "theorem parRefl a : a ⇒ a := by\n induction a <;> constructor <;> assumption\n\n",
"fan_in": 8,
"n_lines": 4,
"n_chars": 80,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 5,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | [
{
"name": "parSubst",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 4,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 4 | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | @@ -54,6 +54,9 @@
infix:40 "⇒" => Par
+theorem parRefl a : a ⇒ a := by
+ induction a <;> constructor <;> assumption
+
theorem parRename {a b} ξ (r : a ⇒ b) : rename ξ a ⇒ rename ξ b := by
induction r generalizing ξ <;> try constructor
case β ihb iha => rw [← renameDist]; constructor; apply ihb; apply iha
@... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_68561eaa6f9d_2 | 1aa418171a0bb3ae | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/reduction.lean | reduction | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "parSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply parMorphing (r := r); intros; apply parRefl",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic":... | [
{
"name": "parRefl",
"text": "theorem parRefl a : a ⇒ a := by\n induction a <;> constructor <;> assumption\n\n",
"fan_in": 8,
"n_lines": 4,
"n_chars": 80,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 5,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | [
{
"name": "antirenaming",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 1573,
"n_subproofs": 0,
"n_tactics": 52,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 13,
"n_structural": 13,
"automation_only": false,
"max_nesti... | 1 | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | @@ -54,6 +54,9 @@
infix:40 "⇒" => Par
+theorem parRefl a : a ⇒ a := by
+ induction a <;> constructor <;> assumption
+
theorem parRename {a b} ξ (r : a ⇒ b) : rename ξ a ⇒ rename ξ b := by
induction r generalizing ξ <;> try constructor
case β ihb iha => rw [← renameDist]; constructor; apply ihb; apply iha
@... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_68561eaa6f9d_3 | e2fd3af1a0ce8bcd | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/reduction.lean | reduction | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "parSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply parMorphing (r := r); intros; apply parRefl",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic":... | [
{
"name": "parRefl",
"text": "theorem parRefl a : a ⇒ a := by\n induction a <;> constructor <;> assumption\n\n",
"fan_in": 8,
"n_lines": 4,
"n_chars": 80,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 5,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | [
{
"name": "parsAntirenaming",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 527,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nest... | 2 | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | @@ -54,6 +54,9 @@
infix:40 "⇒" => Par
+theorem parRefl a : a ⇒ a := by
+ induction a <;> constructor <;> assumption
+
theorem parRename {a b} ξ (r : a ⇒ b) : rename ξ a ⇒ rename ξ b := by
induction r generalizing ξ <;> try constructor
case β ihb iha => rw [← renameDist]; constructor; apply ihb; apply iha
@... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_68561eaa6f9d_5 | cbde0b081790d542 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/reduction.lean | reduction | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "diacon",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r₁ generalizing c\n case refl => exact ⟨c, parPars r₂, refl c⟩\n case trans a b d r₁ _ ih =>\n let ⟨e, r₃, r₄⟩ := dia... | [
{
"name": "parPars",
"text": "theorem parPars {a b} (r : a ⇒ b) : a ⇒⋆ b := by\n constructor; assumption; constructor\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 95,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,... | [
{
"name": "parConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 73,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}
... | 2 | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | import «src».tactics
import «src».syntactics
open Term
variable [LevelClass]
/-*-------------------
Parallel reduction
-------------------*-/
section
set_option hygiene false
local infix:40 "⇒" => Par
inductive Par : Term → Term → Prop where
| β {b b' a a' c} :
b ⇒ b' →
a ⇒ a' →
-------------------... | @@ -96,6 +96,9 @@
infix:40 "⇒⋆" => Pars
open Pars
+theorem parPars {a b} (r : a ⇒ b) : a ⇒⋆ b := by
+ constructor; assumption; constructor
+
theorem parsTrans {a b c} (r₁ : a ⇒⋆ b) (r₂ : b ⇒⋆ c) : a ⇒⋆ c := by
induction r₁
case refl => assumption
@@ -230,7 +233,13 @@
f
--------------------*-/
-theor... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_0 | 25bfdfc859fa157f | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "wtWeaken",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply wtRename wRenameSucc (Wf.cons hΓ hB) h",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "wtRename",
"text": "theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}\n (hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :\n Δ ⊢ rename ξ a ∶ rename ξ A := by\n induction h generalizing ξ Δ\n case var => constructor; assumption; apply_rules [hξ]\n case 𝒰 ih => exact Wt.𝒰 (ih hξ hΔ)\n case pi ihA... | [
{
"name": "wtWeaken",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 294,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtWeaken {Γ k} {a A B : Term}
(hΓ : ⊢ Γ) (hB : Γ ⊢ B ∶ 𝒰 k) (h : Γ ⊢ a ∶ A) :
Γ ∷ B ⊢ rename succ a ∶ rename succ A := sorry
/-*-------------... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -9,9 +9,36 @@
Renaming and weakening lemmas
------------------------------*-/
+theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
+ (hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
+ Δ ⊢ rename ξ a ∶ rename ξ A := by
+ induction h generalizing ξ Δ
+ case var => constructor; assumption; apply_rules [hξ]
+ case �... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_1 | 3bf81dd46b8e6fe1 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "wSubstUp",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro x B mem; cases mem\n all_goals rw [← renameUpSubst]\n . exact Wt.var (Wf.cons (wtWf hA) hA) In.here\n . refine wtWeaken (... | [
{
"name": "wtWeaken",
"text": "theorem wtWeaken {Γ k} {a A B : Term}\n (hΓ : ⊢ Γ) (hB : Γ ⊢ B ∶ 𝒰 k) (h : Γ ⊢ a ∶ A) :\n Γ ∷ B ⊢ rename succ a ∶ rename succ A := by\n apply wtRename wRenameSucc (Wf.cons hΓ hB) h\n\n/-*-------------------------\n Well-typed substitutions\n-------------------------*-/\n\... | [
{
"name": "wSubstUp",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 314,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -35,6 +35,15 @@
exact Wt.conv (convEqv (convRename ξ (eqvConv e))) (iha hξ hΔ) (ihA hξ hΔ)
case sub ihj ihA => exact Wt.sub (ihj hξ hΔ) (ihA hξ hΔ)
+theorem wtWeaken {Γ k} {a A B : Term}
+ (hΓ : ⊢ Γ) (hB : Γ ⊢ B ∶ 𝒰 k) (h : Γ ⊢ a ∶ A) :
+ Γ ∷ B ⊢ rename succ a ∶ rename succ A := by
+ apply wtRename wRe... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_2 | 6162b510ea53a992 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "wtMorph",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h generalizing σ Δ\n case var mem _ => exact hσ _ _ mem\n case 𝒰 ih => exact Wt.𝒰 (ih hσ hΔ)\n case pi ihA ihB =>\n... | [
{
"name": "wSubstUp",
"text": "theorem wSubstUp {σ Δ Γ k A}\n (hA : Δ ⊢ subst σ A ∶ 𝒰 k)\n (h : Δ ⊢ σ ∶ Γ) :\n Δ ∷ subst σ A ⊢ ⇑ σ ∶ Γ ∷ A := by\n intro x B mem; cases mem\n all_goals rw [← renameUpSubst]\n . exact Wt.var (Wf.cons (wtWf hA) hA) In.here\n . refine wtWeaken (wtWf hA) hA (h _ _ ?_); as... | [
{
"name": "wtMorph",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1140,
"n_subproofs": 0,
"n_tactics": 24,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 14,
"automation_only": false,
"max_nesting": 4... | 3 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -47,9 +47,39 @@
def wSubst σ Γ Δ := ∀ x A, Γ ∋ x ∶ A → Δ ⊢ σ x ∶ subst σ A
notation:40 Δ:41 "⊢" σ:41 "∶" Γ:41 => wSubst σ Γ Δ
+theorem wSubstUp {σ Δ Γ k A}
+ (hA : Δ ⊢ subst σ A ∶ 𝒰 k)
+ (h : Δ ⊢ σ ∶ Γ) :
+ Δ ∷ subst σ A ⊢ ⇑ σ ∶ Γ ∷ A := by
+ intro x B mem; cases mem
+ all_goals rw [← renameUpSubst]
+ . e... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_3 | de2011681ad98a4b | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "wtSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply wtMorph (wSubstCons hb) (wtWf hb) h",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"... | [
{
"name": "wtMorph",
"text": "theorem wtMorph {σ : ℕ → Term} {Γ Δ} {a A : Term}\n (hσ : Δ ⊢ σ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :\n Δ ⊢ subst σ a ∶ subst σ A := by\n induction h generalizing σ Δ\n case var mem _ => exact hσ _ _ mem\n case 𝒰 ih => exact Wt.𝒰 (ih hσ hΔ)\n case pi ihA ihB =>\n let ihA... | [
{
"name": "wtSubst",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 6,
"n_chars": 193,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}... | 5 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -69,9 +69,35 @@
(corollary: replacement)
---------------------------------*-/
+theorem wtMorph {σ : ℕ → Term} {Γ Δ} {a A : Term}
+ (hσ : Δ ⊢ σ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
+ Δ ⊢ subst σ a ∶ subst σ A := by
+ induction h generalizing σ Δ
+ case var mem _ => exact hσ _ _ mem
+ case 𝒰 ih => exact Wt.𝒰... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_4 | 362e7f2edb3649a4 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "wtSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply wtMorph (wSubstCons hb) (wtWf hb) h",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"... | [
{
"name": "wtMorph",
"text": "theorem wtMorph {σ : ℕ → Term} {Γ Δ} {a A : Term}\n (hσ : Δ ⊢ σ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :\n Δ ⊢ subst σ a ∶ subst σ A := by\n induction h generalizing σ Δ\n case var mem _ => exact hσ _ _ mem\n case 𝒰 ih => exact Wt.𝒰 (ih hσ hΔ)\n case pi ihA ihB =>\n let ihA... | [
{
"name": "wtReplace",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 22,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 6,
"automation_only": false,
"max_nesting": 6... | 4 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -56,11 +56,47 @@
. exact Wt.var (Wf.cons (wtWf hA) hA) In.here
. refine wtWeaken (wtWf hA) hA (h _ _ ?_); assumption
+theorem wtMorph {σ : ℕ → Term} {Γ Δ} {a A : Term}
+ (hσ : Δ ⊢ σ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
+ Δ ⊢ subst σ a ∶ subst σ A := by
+ induction h generalizing σ Δ
+ case var mem _ => exac... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_5 | 11ec70f80c0c1392 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "wSubstUp",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro x B mem; cases mem\n all_goals rw [← renameUpSubst]\n . exact Wt.var (Wf.cons (wtWf hA) hA) In.here\n . refine wtWeaken (... | [
{
"name": "wtWeaken",
"text": "theorem wtWeaken {Γ k} {a A B : Term}\n (hΓ : ⊢ Γ) (hB : Γ ⊢ B ∶ 𝒰 k) (h : Γ ⊢ a ∶ A) :\n Γ ∷ B ⊢ rename succ a ∶ rename succ A := by\n apply wtRename wRenameSucc (Wf.cons hΓ hB) h\n\n/-*-------------------------\n Well-typed substitutions\n-------------------------*-/\n\... | [
{
"name": "wtMem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 357,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nesting": 6
}... | 2 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -35,6 +35,15 @@
exact Wt.conv (convEqv (convRename ξ (eqvConv e))) (iha hξ hΔ) (ihA hξ hΔ)
case sub ihj ihA => exact Wt.sub (ihj hξ hΔ) (ihA hξ hΔ)
+theorem wtWeaken {Γ k} {a A B : Term}
+ (hΓ : ⊢ Γ) (hB : Γ ⊢ B ∶ 𝒰 k) (h : Γ ⊢ a ∶ A) :
+ Γ ∷ B ⊢ rename succ a ∶ rename succ A := by
+ apply wtRename wRe... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_6 | 325bfd6a0614318e | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "wtRegularity",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h\n case var wf mem _ => exact wtMem mem wf\n case pi ih _ | trans ih => exact ih\n case abs h _ _ _ _ _ | exf h... | [
{
"name": "wtMem",
"text": "theorem wtMem {Γ x A} (mem : Γ ∋ x ∶ A) (h : ⊢ Γ) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by\n induction mem\n case here =>\n cases h with\n | cons hΓ hB =>\n exact ⟨rename succ _, wtWeaken hΓ hB hB⟩\n case there ih =>\n cases h with\n | cons hΓ hB =>\n let ⟨k, hA⟩ := ih ... | [
{
"name": "wtRegularity",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 27,
"n_chars": 895,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 12,
"automation_only": false,
"max_nesting... | 7 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -99,8 +99,44 @@
Γ ⊢ subst (b +: var) a ∶ subst (b +: var) A := by
apply wtMorph (wSubstCons hb) (wtWf hb) h
-theorem wtRegularity {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : ∃ k, Γ ⊢ A ∶ 𝒰 k := sorry
+theorem wtMem {Γ x A} (mem : Γ ∋ x ∶ A) (h : ⊢ Γ) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by
+ induction mem
+ case here =>
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_7 | 9af43582c804407c | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "wtfAbs",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let ⟨_, hA, e⟩ := wtfPiInvA𝒰 hpi\n let ⟨_, h𝒰⟩ := wtRegularity hpi\n refine Wt.abs hpi (Wt.conv e hA h𝒰) hb",
"n_chars": 13... | [
{
"name": "wtRegularity",
"text": "theorem wtRegularity {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by\n induction h\n case var wf mem _ => exact wtMem mem wf\n case pi ih _ | trans ih => exact ih\n case abs h _ _ _ _ _ | exf h _ _ _ | conv h _ _ => exact ⟨_, h⟩\n case 𝒰 ih =>\n let ⟨_,... | [
{
"name": "wtfAbs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 13,
"n_chars": 316,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}... | 8 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -111,10 +111,39 @@
let ⟨k, hA⟩ := ih hΓ
exact ⟨rename succ k, wtWeaken hΓ hB hA⟩
+theorem wtRegularity {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by
+ induction h
+ case var wf mem _ => exact wtMem mem wf
+ case pi ih _ | trans ih => exact ih
+ case abs h _ _ _ _ _ | exf h _ _ _ | co... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_8 | 7122d44a9e3b44a5 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "wtfAbs",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let ⟨_, hA, e⟩ := wtfPiInvA𝒰 hpi\n let ⟨_, h𝒰⟩ := wtRegularity hpi\n refine Wt.abs hpi (Wt.conv e hA h𝒰) hb",
"n_chars": 13... | [
{
"name": "wtRegularity",
"text": "theorem wtRegularity {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by\n induction h\n case var wf mem _ => exact wtMem mem wf\n case pi ih _ | trans ih => exact ih\n case abs h _ _ _ _ _ | exf h _ _ _ | conv h _ _ => exact ⟨_, h⟩\n case 𝒰 ih =>\n let ⟨_,... | [
{
"name": "wtPar",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 43,
"n_chars": 1790,
"n_subproofs": 0,
"n_tactics": 46,
"cyclomatic": 15,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 23,
"automation_only": false,
"max_nesting": 8
... | 9 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -132,8 +132,74 @@
let ⟨k, hA⟩ := ih hΓ
exact ⟨rename succ k, wtWeaken hΓ hB hA⟩
-theorem wtPar {Γ} {a b A : Term} (r : a ⇒ b) (h : Γ ⊢ a ∶ A) : Γ ⊢ b ∶ A := sorry
+theorem wtRegularity {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : ∃ k, Γ ⊢ A ∶ 𝒰 k := by
+ induction h
+ case var wf mem _ => exact wtMem mem wf... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_9 | f2816ff9d4d5f033 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "wtPars",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r\n case refl => exact h\n case trans r _ ih => exact ih (wtPar r h)",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wtPar",
"text": "theorem wtPar {Γ} {a b A : Term} (r : a ⇒ b) (h : Γ ⊢ a ∶ A) : Γ ⊢ b ∶ A := by\n induction h generalizing b\n case var => cases r; constructor <;> assumption\n case 𝒰 ih => cases r with | 𝒰 r' => exact Wt.𝒰 (ih r')\n case pi ihA ihB =>\n cases r with | pi ra rb =>\n ... | [
{
"name": "wtPars",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 12,
"n_chars": 289,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 10 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -158,8 +158,53 @@
let ⟨l, _, hk, _⟩ := wtfLvlInv ihk
exact ⟨l, Wt.𝒰 hk⟩
-theorem wtPars {Γ} {a b A : Term} (r : a ⇒⋆ b) (h : Γ ⊢ a ∶ A) : Γ ⊢ b ∶ A := sorry
+theorem wtPar {Γ} {a b A : Term} (r : a ⇒ b) (h : Γ ⊢ a ∶ A) : Γ ⊢ b ∶ A := by
+ induction h generalizing b
+ case var => cases r; constructor <... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_10 | 607376581da476eb | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "wtProgress",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : (⬝) = Γ at h\n induction h\n all_goals subst e; specialize_rfls\n case var mem => cases mem\n case 𝒰 | pi |... | [
{
"name": "wtMty",
"text": "theorem wtMty {Γ} {b : Term} (v : Value b) (h : Γ ⊢ b ∶ mty) : False := by\n generalize e : mty = T at h\n induction h\n all_goals try first | subst e | injection e\n case var | app | exf => contradiction\n case conv h v emty _ _ =>\n let _e := wtValue h emty v\n cases... | [
{
"name": "wtProgress",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 774,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 10,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 14,
"automation_only": false,
"max_nesting"... | 2 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
def wSubst σ Γ Δ := ∀ x A, Γ ∋ x ∶ A → Δ ⊢ σ x ∶ subst σ A
notation:40 Δ:41 "⊢" σ:41 "∶" Γ:41 => wSubst σ Γ Δ
inductive Value : Term → Type where
| 𝒰 {... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
def wSubst σ Γ Δ := ∀ x A, Γ ∋ x ∶ A → Δ ⊢ σ x ∶ subst σ A
notation:40 Δ:41 "⊢" σ:41 "∶" Γ:41 => wSubst σ Γ Δ
inductive Value : Term → Type where
| 𝒰 {... | @@ -71,8 +71,37 @@
case abs => exact ⟨_, _, rfl⟩
case lof => cases convLvlPi (eqvConv e)
-theorem wtProgress {a A : Term} (h : ⬝ ⊢ a ∶ A) : Nonempty (Value a) ∨ ∃ b, a ⇒β b := sorry
+theorem wtMty {Γ} {b : Term} (v : Value b) (h : Γ ⊢ b ∶ mty) : False := by
+ generalize e : mty = T at h
+ induction h
+ a... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_6b54a22359a3_11 | dab11cff0f9dd1d7 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/safety.lean | safety | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "wtProgress",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : (⬝) = Γ at h\n induction h\n all_goals subst e; specialize_rfls\n case var mem => cases mem\n case 𝒰 | pi |... | [
{
"name": "wtMty",
"text": "theorem wtMty {Γ} {b : Term} (v : Value b) (h : Γ ⊢ b ∶ mty) : False := by\n generalize e : mty = T at h\n induction h\n all_goals try first | subst e | injection e\n case var | app | exf => contradiction\n case conv h v emty _ _ =>\n let _e := wtValue h emty v\n cases... | [
{
"name": "wtSafety",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 6,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 13 | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | import «src».typing
open Nat
open Term
variable [LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem wtRename {ξ : ℕ → ℕ} {Γ Δ} {a A : Term}
(hξ : Δ ⊢ ξ ∶ Γ) (hΔ : ⊢ Δ) (h : Γ ⊢ a ∶ A) :
Δ ⊢ rename ξ a ∶ rename ξ A := by
induction h generaliz... | @@ -259,8 +259,37 @@
case abs => exact ⟨_, _, rfl⟩
case lof => cases convLvlPi (eqvConv e)
-theorem wtProgress {a A : Term} (h : ⬝ ⊢ a ∶ A) : Nonempty (Value a) ∨ ∃ b, a ⇒β b := sorry
+theorem wtMty {Γ} {b : Term} (v : Value b) (h : Γ ⊢ b ∶ mty) : False := by
+ generalize e : mty = T at h
+ induction h
+ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_20004b231408_0 | 4c256f0a17574912 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/normalization.lean | normalization | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "semRename",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro σ hσ\n rw [substRename, substRename]\n exact ha (σ ∘ ξ) (semComp hξ hσ)",
"n_chars": 91,
"n_subproofs": 0,
"n... | [
{
"name": "semComp",
"text": "theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}\n (h : Δ ⊢ ξ ∶ Γ)\n (hζ : σ ⊨ Δ) :\n σ ∘ ξ ⊨ Γ := by\n intro x A mem\n rw [← substRename]\n exact hζ (ξ x) (rename ξ A) (h x A mem)\n\n",
"fan_in": 1,
"n_lines": 9,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "semRename",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 234,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semRename {ξ : ℕ → ℕ} {Γ Δ a A}
(hξ : Δ ⊢ ξ ∶ Γ)
(ha : Γ ⊨ a ∶ A) :
Δ ⊨ rename ξ a ∶ rename ξ A := sorry
| import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
(h : Δ ⊢ ξ ∶ Γ)
(hζ : σ ⊨ Δ) :
σ ∘ ξ ⊨ Γ := by
intro x A mem
rw [← substRename]
... | @@ -10,9 +10,20 @@
Renaming and weakening lemmas
------------------------------*-/
+theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
+ (h : Δ ⊢ ξ ∶ Γ)
+ (hζ : σ ⊨ Δ) :
+ σ ∘ ξ ⊨ Γ := by
+ intro x A mem
+ rw [← substRename]
+ exact hζ (ξ x) (rename ξ A) (h x A mem)
+
theorem semRename {ξ : ℕ → ℕ} {Γ Δ a A}
(hξ : Δ ⊢ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_20004b231408_1 | 521c43e686b76526 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/normalization.lean | normalization | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "semWeaken",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact semRename wRenameSucc ha",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automat... | [
{
"name": "semRename",
"text": "theorem semRename {ξ : ℕ → ℕ} {Γ Δ a A}\n (hξ : Δ ⊢ ξ ∶ Γ)\n (ha : Γ ⊨ a ∶ A) :\n Δ ⊨ rename ξ a ∶ rename ξ A := by\n intro σ hσ\n rw [substRename, substRename]\n exact ha (σ ∘ ξ) (semComp hξ hσ)\n\n",
"fan_in": 1,
"n_lines": 9,
"n_chars": 234,
"n_subpro... | [
{
"name": "semWeaken",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
(h : Δ ⊢ ξ ∶ Γ)
(hζ : σ ⊨ Δ) :
σ ∘ ξ ⊨ Γ := by
intro x A mem
rw [← substRename]
... | import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
(h : Δ ⊢ ξ ∶ Γ)
(hζ : σ ⊨ Δ) :
σ ∘ ξ ⊨ Γ := by
intro x A mem
rw [← substRename]
... | @@ -18,9 +18,18 @@
rw [← substRename]
exact hζ (ξ x) (rename ξ A) (h x A mem)
+theorem semRename {ξ : ℕ → ℕ} {Γ Δ a A}
+ (hξ : Δ ⊢ ξ ∶ Γ)
+ (ha : Γ ⊨ a ∶ A) :
+ Δ ⊨ rename ξ a ∶ rename ξ A := by
+ intro σ hσ
+ rw [substRename, substRename]
+ exact ha (σ ∘ ξ) (semComp hξ hσ)
+
theorem semWeaken {Γ a A B}
... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_20004b231408_2 | 3946d07227addb23 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/normalization.lean | normalization | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "semWfCons",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros x A mem\n cases mem\n case here =>\n exists rename succ k\n exact semWeaken (A := 𝒰 k) hA\n case there x B mem ... | [
{
"name": "semWeaken",
"text": "theorem semWeaken {Γ a A B}\n (ha : Γ ⊨ a ∶ A) :\n Γ ∷ B ⊨ rename succ a ∶ rename succ A := by\n exact semRename wRenameSucc ha\n\n/-*---------------------------------------------\n Soundness of typing wrt the logical relation\n--------------------------------------------... | [
{
"name": "semWfCons",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 318,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
"max_nesting": 4... | 3 | import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
(h : Δ ⊢ ξ ∶ Γ)
(hζ : σ ⊨ Δ) :
σ ∘ ξ ⊨ Γ := by
intro x A mem
rw [← substRename]
... | import «src».typing
import «src».candidates
open Term
open Nat
variable [lc : LevelClass]
/-*------------------------------
Renaming and weakening lemmas
------------------------------*-/
theorem semComp {ξ : ℕ → ℕ} {σ Γ Δ}
(h : Δ ⊢ ξ ∶ Γ)
(hζ : σ ⊨ Δ) :
σ ∘ ξ ⊨ Γ := by
intro x A mem
rw [← substRename]
... | @@ -26,6 +26,24 @@
rw [substRename, substRename]
exact ha (σ ∘ ξ) (semComp hξ hσ)
-theorem semWfCons {Γ A k} (hΓ : ⊨ Γ) (hA : Γ ⊨ A ∶ 𝒰 k) : ⊨ Γ ∷ A := sorry
+theorem semWeaken {Γ a A B}
+ (ha : Γ ⊨ a ∶ A) :
+ Γ ∷ B ⊨ rename succ a ∶ rename succ A := by
+ exact semRename wRenameSucc ha
+/-*---------------... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_0 | b7c7abf7284fadbf | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interp𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e... | [
{
"name": "interp𝒰Eq",
"text": "theorem interp𝒰Eq {I : lc.L → Term → Prop} {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j, b ⇒⋆ lof j ∧ I j a) ∨ wne a) =\n (λ a ↦ (∃ j, c ⇒⋆ lof j ∧ I j a) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, rj, h⟩ | wnea\n . let ⟨k', rk', r₂⟩ ... | [
{
"name": "interp𝒰Inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 506,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -30,8 +30,32 @@
termination_by i
notation:40 "⟦" a "⟧" i "↘" P => Interps i a P
+theorem interp𝒰Eq {I : lc.L → Term → Prop} {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j, b ⇒⋆ lof j ∧ I j a) ∨ wne a) =
+ (λ a ↦ (∃ j, c ⇒⋆ lof j ∧ I j a) ∨ wne a) := by
+ funext a; apply propext; constructor
+ . intro Pa; rcases Pa with ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_1 | a3bfd0d6a4d3f2d8 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpLvlInv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 521,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -30,8 +30,35 @@
termination_by i
notation:40 "⟦" a "⟧" i "↘" P => Interps i a P
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; constructor
+ . intro Pa; rcases Pa... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_3 | b07dba99a74cc352 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpFwd",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 642,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 12,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 15,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -44,8 +44,38 @@
. exact Or.inr wnea
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ l... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_4 | 96170107e7d594e7 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsFwd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -61,8 +61,24 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_5 | 65a4a5db5ad1a676 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsFwds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 4 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -61,8 +61,24 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_6 | 680f1e47c4655ea9 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwds",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -30,8 +30,12 @@
termination_by i
notation:40 "⟦" a "⟧" i "↘" P => Interps i a P
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> assumption
+theorem interp... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_7 | 27df91b89125c9ca | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "interpsConv",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, ra, rb⟩ := r\n interpsBwds rb (interpsFwds ra h)",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "interpsFwds",
"text": "theorem interpsFwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := by\n induction r generalizing P <;> apply_rules [interpsFwd]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_aut... | [
{
"name": "interpsConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 7 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -82,10 +82,15 @@
theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
unfold Interps at *; constructor <;> assumption
+theorem interpsFwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := by
+ induction r generalizing P <;> apply_rules [interpsFwd]
+
theorem interpsBwds {i ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_8 | 33407b7e8c05b094 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsConv",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let ⟨_, ra, rb⟩ := r\n interpsBwds rb (interpsFwds ra h)",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "interpsBwds",
"text": "theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n induction r generalizing P <;> apply_rules [interpsBwd]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_aut... | [
{
"name": "interpsBwdsP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 928,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 6,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 15,
"automation_only": false,
"max_nesting... | 2 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -33,6 +33,9 @@
theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
unfold Interps at *; constructor <;> assumption
+theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ induction r generalizing P <;> apply_rules [interpsBwd]
+
theorem interpsBwdsP {i a... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_9 | 5cd7f7344338f84c | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpLvlInv",
"text": "theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injection e with... | [
{
"name": "interpDet'",
"fan_in": 2,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 24,
"n_chars": 958,
"n_subproofs": 2,
"n_tactics": 29,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 14,
"automation_only": false,
"max_nesting":... | 8 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -108,6 +108,19 @@
case step r _ ih => subst e; cases r; simp [ih]
all_goals contradiction
+theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by
+ generalize e : lvl b = c at h
+ induction h generalizing b
+ case ne => subs... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_10 | 454febc3105dc779 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsDet'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 4,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 9 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -121,8 +121,44 @@
exact ⟨wnfBwds (parPars r₁) wnfc, e⟩
all_goals contradiction
-theorem interpDet' {i I a P Q} (hP : ⟦ a ⟧ i , I ↘ P) (hQ : ⟦ a ⟧ i , I ↘ Q) : P = Q := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_13 | 47f49f0dfbe3a7ca | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpPiInv'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 16,
"n_chars": 701,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 9 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -121,8 +121,44 @@
exact ⟨wnfBwds (parPars r₁) wnfc, e⟩
all_goals contradiction
-theorem interpDet' {i I a P Q} (hP : ⟦ a ⟧ i , I ↘ P) (hQ : ⟦ a ⟧ i , I ↘ Q) : P = Q := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_14 | e74d049475547958 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsPiInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 7,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 10 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -121,8 +121,44 @@
exact ⟨wnfBwds (parPars r₁) wnfc, e⟩
all_goals contradiction
-theorem interpDet' {i I a P Q} (hP : ⟦ a ⟧ i , I ↘ P) (hQ : ⟦ a ⟧ i , I ↘ Q) : P = Q := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_16 | 347ddec363af8515 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -30,8 +30,17 @@
termination_by i
notation:40 "⟦" a "⟧" i "↘" P => Interps i a P
-theorem interpsMtyInv {i P} (h : ⟦ mty ⟧ i ↘ P) : P = wne := sorry
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e; contradiction
+ case mty ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_17 | 34961e6ea888724c | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpLvlInv",
"text": "theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injection e with... | [
{
"name": "interpsLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -47,8 +47,22 @@
Simple inversion lemmas
------------------------*-/
+theorem interpLvlInv {i I b P} (h : ⟦ lvl b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) := by
+ generalize e : lvl b = c at h
+ induction h generalizing b
+ case ne => subst e; contradiction
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_7ba0d42016c0_18 | 50c51c06898836df | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nolt.lean | nolt | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "interpsStepInv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; exact interpStepInv h",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": ... | [
{
"name": "interpStepInv",
"text": "theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :\n wne T ∨\n (∃ A B, T ⇒⋆ pi A B) ∨\n (∃ i, T ⇒⋆ 𝒰 i) ∨\n (T ⇒⋆ mty) ∨\n (∃ b, T ⇒⋆ lvl b) := by\n induction h\n case ne nea => left; exact neWne nea\n case pi => right; left; exact ⟨_, _, Pars.refl _⟩\n cas... | [
{
"name": "interpsStepInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 354,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | import «src».normal
open Term
set_option linter.unusedSectionVars false
variable [lc : LevelClass]
variable [dc : DecidableRel (lc.lc.lt)]
inductive Interp (i : lc.L) (I : lc.L → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
... | @@ -30,12 +30,37 @@
termination_by i
notation:40 "⟦" a "⟧" i "↘" P => Interps i a P
+theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :
+ wne T ∨
+ (∃ A B, T ⇒⋆ pi A B) ∨
+ (∃ i, T ⇒⋆ 𝒰 i) ∨
+ (T ⇒⋆ mty) ∨
+ (∃ b, T ⇒⋆ lvl b) := by
+ induction h
+ case ne nea => left; exact neWne nea
+ case pi => righ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_24f338c0dcff_0 | 8f1b6c5200f0349e | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/example.lean | example | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "wtfMty",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Wt.var\n . exact wfMty\n . apply inHere; rfl",
"n_chars": 56,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic"... | [
{
"name": "wfMty",
"text": "theorem wfMty : ⊢ ⬝ ∷ mty := by\n apply Wf.cons\n apply Wf.nil\n apply Wt.mty\n apply Wt.𝒰\n apply Wt.lof (j := 69) (k := 70)\n apply Wf.nil\n exact (by omega : 69 < 70)\n\n",
"fan_in": 1,
"n_lines": 10,
"n_chars": 180,
"n_subproofs": 0,
"n_tactics": 8... | [
{
"name": "wtfMty",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 1209,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».typing
open Term
theorem wtfMty : ⬝ ∷ mty ⊢ var 0 ∶ mty := by
apply Wt.var
. sorry
. apply inHere; rfl
/-
-- in an inconsistent context b : ⊥, absurd b : Level< (absurd b)
theorem loopLvl : ⬝ ∷ mty ⊢ exf (var 0) ∶ lvl (exf (var 0)) := by
apply Wt.exf
. apply Wtf.lvl (j := lof 69)
apply Wtf... | import «src».typing
open Term
theorem wfMty : ⊢ ⬝ ∷ mty := by
apply Wf.cons
apply Wf.nil
apply Wt.mty
apply Wt.𝒰
apply Wt.lof (j := 69) (k := 70)
apply Wf.nil
exact (by omega : 69 < 70)
theorem wtfMty : ⬝ ∷ mty ⊢ var 0 ∶ mty := by
apply Wt.var
. exact wfMty
. apply inHere; rfl
/-
-- in an incon... | @@ -2,9 +2,18 @@
open Term
+theorem wfMty : ⊢ ⬝ ∷ mty := by
+ apply Wf.cons
+ apply Wf.nil
+ apply Wt.mty
+ apply Wt.𝒰
+ apply Wt.lof (j := 69) (k := 70)
+ apply Wf.nil
+ exact (by omega : 69 < 70)
+
theorem wtfMty : ⬝ ∷ mty ⊢ var 0 ∶ mty := by
apply Wt.var
- . sorry
+ . exact wfMty
. apply inHere... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_4a230e9b4e92_0 | 221c97debfb83988 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/soundness.lean | soundness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "consistency",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n let ⟨_, _, hmty, hb⟩ := soundness h var (semSubstNil _)\n simp [interpsMtyInv hmty] at hb",
"n_chars": 109,
... | [
{
"name": "soundness",
"text": "theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by\n induction h <;> intro σ hσ\n case var mem _ => exact hσ _ _ mem\n case pi ihA ihB =>\n let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ\n let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰\n refine ⟨_, _, h𝒰, ?_⟩; subst e\... | [
{
"name": "consistency",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem consistency {b} : ¬ ⬝ ⊢ b ∶ mty := sorry
| import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
induction h <;> intro σ hσ
case var mem _ => exact hσ _ _ mem
case pi ihA ihB =>
let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰
... | @@ -5,6 +5,116 @@
variable [lc : LevelClass]
-theorem consistency {b} : ¬ ⬝ ⊢ b ∶ mty := sorry
+theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
+ induction h <;> intro σ hσ
+ case var mem _ => exact hσ _ _ mem
+ case pi ihA ihB =>
+ let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
+ let ⟨_, _, ra, e⟩ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_4a230e9b4e92_1 | b845d4bb660e7fb5 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/soundness.lean | soundness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "consistency",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n let ⟨_, _, hmty, hb⟩ := soundness h var (semSubstNil _)\n simp [interpsMtyInv hmty] at hb",
"n_chars": 109,
... | [
{
"name": "soundness",
"text": "theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by\n induction h <;> intro σ hσ\n case var mem _ => exact hσ _ _ mem\n case pi ihA ihB =>\n let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ\n let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰\n refine ⟨_, _, h𝒰, ?_⟩; subst e\... | [
{
"name": "canon𝒰",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 366,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem canon𝒰 {T j} (h : ⬝ ⊢ T ∶ 𝒰 j) :
(∃ A B, T ⇒⋆ pi A B) ∨
(∃ i, T ⇒⋆ 𝒰 i) ∨
(T ⇒⋆ mty) ∨
(∃ k, T ⇒⋆ lvl (lof k)) := sorry
| import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
induction h <;> intro σ hσ
case var mem _ => exact hσ _ _ mem
case pi ihA ihB =>
let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰
... | @@ -5,10 +5,121 @@
variable [lc : LevelClass]
+theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
+ induction h <;> intro σ hσ
+ case var mem _ => exact hσ _ _ mem
+ case pi ihA ihB =>
+ let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
+ let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰
+ refine ⟨_, _, h𝒰, ?_⟩; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_4a230e9b4e92_2 | f674a1e96ce8164d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/soundness.lean | soundness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "consistency",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n let ⟨_, _, hmty, hb⟩ := soundness h var (semSubstNil _)\n simp [interpsMtyInv hmty] at hb",
"n_chars": 109,
... | [
{
"name": "soundness",
"text": "theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by\n induction h <;> intro σ hσ\n case var mem _ => exact hσ _ _ mem\n case pi ihA ihB =>\n let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ\n let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰\n refine ⟨_, _, h𝒰, ?_⟩; subst e\... | [
{
"name": "canonLvl",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem canonLvl {a k} (h : ⬝ ⊢ a ∶ lvl k) : ∃ j, a ⇒⋆ lof j := sorry
| import «src».typing
import «src».semantics
open Term
variable [lc : LevelClass]
theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
induction h <;> intro σ hσ
case var mem _ => exact hσ _ _ mem
case pi ihA ihB =>
let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
let ⟨_, _, ra, e⟩ := interps𝒰Inv h𝒰
... | @@ -5,5 +5,116 @@
variable [lc : LevelClass]
-theorem canonLvl {a k} (h : ⬝ ⊢ a ∶ lvl k) : ∃ j, a ⇒⋆ lof j := sorry
+theorem soundness {Γ} {a A : Term} (h : Γ ⊢ a ∶ A) : Γ ⊨ a ∶ A := by
+ induction h <;> intro σ hσ
+ case var mem _ => exact hσ _ _ mem
+ case pi ihA ihB =>
+ let ⟨_, _, h𝒰, hA⟩ := ihA σ hσ
+ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_0 | 2ead6a87edbe0a39 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpLvlInv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 536,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,35 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_1 | 7f133d6fa7e991e9 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpFwd",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 683,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 14,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 18,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,39 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_2 | 2c9e9e67f58a1483 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsFwd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,39 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_3 | 12047121eae69e79 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsFwds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 3 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,39 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_4 | f979e50530318046 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwds",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_5 | dd4e24d4533ae43e | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 6 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,39 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_6 | c254346941fe5e81 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwdsP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 680,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 12,
"automation_only": false,
"max_nesting... | 2 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_7 | 6ad8c5a6386c06b4 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsWne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_8 | 40da4009d10861a0 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpDet'",
"fan_in": 2,
"n_deps_direct": 6,
"n_deps_transitive": 7,
"n_lines": 31,
"n_chars": 1233,
"n_subproofs": 2,
"n_tactics": 39,
"cyclomatic": 7,
"n_automation": 3,
"n_rewrites": 8,
"n_structural": 18,
"automation_only": false,
"max_nesting"... | 7 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_9 | 9d31d203e91d9e71 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsDet'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 4,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 8 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_10 | 5309898cb8c79ef8 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsDet",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 12,
"n_chars": 415,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 10 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_11 | 9348cecbb8d41e11 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpPiInv'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 16,
"n_chars": 701,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 8 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_12 | 2e39c2f003fabc68 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsPiInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 7,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 9 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_13 | 3180a3004b944b49 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n (∃ j lt, a ⇒⋆ lof j ∧ P = I j lt) ∨ (wne a ∧ P = wne) := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case ne => subst e; contradiction\n case 𝒰 j lt =>\n injection e with e; subst e\n ... | [
{
"name": "interps𝒰Inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nesting": ... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,30 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ (∃ j lt, a ⇒⋆ lof j ∧ P = I j lt) ∨ (wne a ∧ P = wne) := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case ne => subst e;... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_14 | 8ed5fcb753070b65 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,17 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsMtyInv {i P} (h : ⟦ mty ⟧ i ↘ P) : P = wne := sorry
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction h
+ case ne => subst e... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.