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_9fb3e40392d3_8 | b30ed7df297eb994 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/Rounding.lean | Rounding | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "flt_equivalent'",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n intro heq\n suffices @canonical β format ⟨|m|, e⟩ by\n rcases abs_choice m with Heq | Heq <;> rw [Heq] ... | [
{
"name": "flt_equivalent",
"text": "lemma flt_equivalent (m e : ℤ) :\n m > 0 →\n β = 2 →\n @fexp format m e = e →\n @canonical β format ⟨m, e⟩ := by\n intro Hm Hβ\n unfold fexp\n rcases lt_or_ge (digits m + e - format.precision) (-format.dexp) with Hlt | Hle\n rw [max_eq_right]\n intro Heq\n reve... | [
{
"name": "canonicalize_idemp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 8,
"n_chars": 282,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nest... | 6 | import Flops.Core.Defs
import Mathlib.Data.Int.Log
import Mathlib.Data.Real.Archimedean
/-
This file defines rounding as a relation (proposition)
between the real value to round, and the rounded floating point value
For rounding as a function
rnd : ℝ → float, see Flops.RoundOp
-/
variable {β : ℕ} {format : Format}
... | import Flops.Core.Defs
import Mathlib.Data.Int.Log
import Mathlib.Data.Real.Archimedean
/-
This file defines rounding as a relation (proposition)
between the real value to round, and the rounded floating point value
For rounding as a function
rnd : ℝ → float, see Flops.RoundOp
-/
variable {β : ℕ} {format : Format}
... | @@ -143,10 +143,145 @@
def fexp (m e : ℤ) := max (digits m + e - format.precision) (-format.dexp)
+lemma flt_equivalent (m e : ℤ) :
+ m > 0 →
+ β = 2 →
+ @fexp format m e = e →
+ @canonical β format ⟨m, e⟩ := by
+ intro Hm Hβ
+ unfold fexp
+ rcases lt_or_ge (digits m + e - format.precision) (-format.dexp) w... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_9fb3e40392d3_9 | 58396530f4aee621 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/Rounding.lean | Rounding | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "flt_equivalent'",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n intro heq\n suffices @canonical β format ⟨|m|, e⟩ by\n rcases abs_choice m with Heq | Heq <;> rw [Heq] ... | [
{
"name": "flt_equivalent",
"text": "lemma flt_equivalent (m e : ℤ) :\n m > 0 →\n β = 2 →\n @fexp format m e = e →\n @canonical β format ⟨m, e⟩ := by\n intro Hm Hβ\n unfold fexp\n rcases lt_or_ge (digits m + e - format.precision) (-format.dexp) with Hlt | Hle\n rw [max_eq_right]\n intro Heq\n reve... | [
{
"name": "canonicalize_unique",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 11,
"n_chars": 437,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_ne... | 6 | import Flops.Core.Defs
import Mathlib.Data.Int.Log
import Mathlib.Data.Real.Archimedean
/-
This file defines rounding as a relation (proposition)
between the real value to round, and the rounded floating point value
For rounding as a function
rnd : ℝ → float, see Flops.RoundOp
-/
variable {β : ℕ} {format : Format}
... | import Flops.Core.Defs
import Mathlib.Data.Int.Log
import Mathlib.Data.Real.Archimedean
/-
This file defines rounding as a relation (proposition)
between the real value to round, and the rounded floating point value
For rounding as a function
rnd : ℝ → float, see Flops.RoundOp
-/
variable {β : ℕ} {format : Format}
... | @@ -143,10 +143,145 @@
def fexp (m e : ℤ) := max (digits m + e - format.precision) (-format.dexp)
+lemma flt_equivalent (m e : ℤ) :
+ m > 0 →
+ β = 2 →
+ @fexp format m e = e →
+ @canonical β format ⟨m, e⟩ := by
+ intro Hm Hβ
+ unfold fexp
+ rcases lt_or_ge (digits m + e - format.precision) (-format.dexp) w... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_1557d663442f_0 | a4b49bb3c2f649c1 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/KApproximate.lean | KApproximate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "value_steps_eq_zero_implies_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hfa hfb heq\n by_contra hne\n revert hfa hfb\n rcases ha:a with _|_|_ <;> rcases hb:b with _|_|_ <... | [
{
"name": "hinj",
"text": "lemma hinj : Function.Injective (@to_finite_box f) := by\n simp [Function.Injective]\n clear * -\n intro a hfina b hfinb\n simp [to_finite_box]\n intro hmeq heeq\n revert hfina\n rcases a <;> simp [is_finite]\n revert hfinb\n rcases b <;> simp [is_finite... | [
{
"name": "value_steps_eq_zero_implies_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 105,
"n_chars": 3787,
"n_subproofs": 12,
"n_tactics": 141,
"cyclomatic": 13,
"n_automation": 71,
"n_rewrites": 22,
"n_structural": 53,
"automation_only"... | 1 | import Flops.P3109.Defs
import Mathlib.Data.Set.Card
import Mathlib.Order.Interval.Finset.Defs
import Mathlib.Data.Int.Interval
namespace p3109_format
namespace p3109
/--
A numeric operation `op` on P3109 values.
It takes a list of operands `x` and returns a P3109 value.
This allows for operations with multiple input... | import Flops.P3109.Defs
import Mathlib.Data.Set.Card
import Mathlib.Order.Interval.Finset.Defs
import Mathlib.Data.Int.Interval
namespace p3109_format
namespace p3109
/--
A numeric operation `op` on P3109 values.
It takes a list of operands `x` and returns a P3109 value.
This allows for operations with multiple input... | @@ -50,12 +50,123 @@
have := canonical_exp_le_emax h
simp at this; exact this⟩
+lemma hinj : Function.Injective (@to_finite_box f) := by
+ simp [Function.Injective]
+ clear * -
+ intro a hfina b hfinb
+ simp [to_finite_box]
+ intro hmeq heeq
+ revert hfina
+ rcases a <;> simp [is_finite... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_1557d663442f_1 | 7d3a6739574003e3 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/KApproximate.lean | KApproximate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "value_steps_eq_zero_implies_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hfa hfb heq\n by_contra hne\n revert hfa hfb\n rcases ha:a with _|_|_ <;> rcases hb:b with _|_|_ <... | [
{
"name": "hinj",
"text": "lemma hinj : Function.Injective (@to_finite_box f) := by\n simp [Function.Injective]\n clear * -\n intro a hfina b hfinb\n simp [to_finite_box]\n intro hmeq heeq\n revert hfina\n rcases a <;> simp [is_finite]\n revert hfinb\n rcases b <;> simp [is_finite... | [
{
"name": "op_0_approx",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 544,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 8,
"automation_only": false,
"max_nesting":... | 2 | import Flops.P3109.Defs
import Mathlib.Data.Set.Card
import Mathlib.Order.Interval.Finset.Defs
import Mathlib.Data.Int.Interval
namespace p3109_format
namespace p3109
/--
A numeric operation `op` on P3109 values.
It takes a list of operands `x` and returns a P3109 value.
This allows for operations with multiple input... | import Flops.P3109.Defs
import Mathlib.Data.Set.Card
import Mathlib.Order.Interval.Finset.Defs
import Mathlib.Data.Int.Interval
namespace p3109_format
namespace p3109
/--
A numeric operation `op` on P3109 values.
It takes a list of operands `x` and returns a P3109 value.
This allows for operations with multiple input... | @@ -50,12 +50,123 @@
have := canonical_exp_le_emax h
simp at this; exact this⟩
+lemma hinj : Function.Injective (@to_finite_box f) := by
+ simp [Function.Injective]
+ clear * -
+ intro a hfina b hfinb
+ simp [to_finite_box]
+ intro hmeq heeq
+ revert hfina
+ rcases a <;> simp [is_finite... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_0 | 34aeaf9d8bd8924d | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "fp_on_grid'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hcan\n have ⟨m, heq⟩ := fp_on_grid hcan\n rewrite (occs := .pos [1]) [heq]\n exists 2*m\n simp",
"n_chars": 110,
... | [
{
"name": "fp_on_grid",
"text": "lemma fp_on_grid {f : Format} {a : float 2} :\n @canonical 2 f a →\n ∃m:ℤ, a = 2*(m:ℝ) * eps f*ufp a := by\n intro ha\n rcases ha with _|hsub\n rw [normal_ufp (by assumption)]\n exists a.fnum\n rw [mul_comm 2]; simp [eps]\n rw [mul_assoc]\n rw [<-zpow_natCast, <-zpo... | [
{
"name": "fp_on_grid'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 222,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": ... | 1 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma fp_on_grid' {f : Format} {a : float 2} :
@canonical 2 f a →
∃m:ℤ, a = (m:ℝ) * eps f*ufp a := sorry
/-- Left-fold recu... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma fp_on_grid {f : Format} {a : float 2} :
@canonical 2 f a →
∃m:ℤ, a = 2*(m:ℝ) * eps f*ufp a := by
intro ha
rcases h... | @@ -5,9 +5,49 @@
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
+lemma fp_on_grid {f : Format} {a : float 2} :
+ @canonical 2 f a →
+ ∃m:ℤ, a = 2*(m:ℝ) * eps f*ufp a := by
+ intro ha
+ rcases ha with _|hsub
+ rw [normal_ufp (by assumption)]
+ exis... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_1 | d1c2365425ff842d | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "addition_on_grid_of_ops_on_grid",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hsigma hagrid hbgrid\n let ⟨k, hsigma_eq⟩ := hsigma\n let ⟨ma, heqa⟩ := hagrid\n let ⟨mb, heqb⟩ :... | [
{
"name": "rnd_multiple'",
"text": "lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :\n let r := @round_fp format rnd f;\n ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by\n rcases f.exp.decLt (-format.dexp) with hle|hlt\n simp at hle\n apply rnd_multiple _ hle\n simp\n have ⟨... | [
{
"name": "addition_on_grid_of_ops_on_grid",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 999,
"n_subproofs": 2,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": fals... | 1 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma addition_on_grid_of_ops_on_grid {f : Format} {a b : float 2} {σ : ℝ} :
(∃k:ℤ, (σ:ℝ) = 2^k) →
(∃ma:ℤ, a = (ma:ℝ)*eps f*... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :
let r := @round_fp format rnd f;
∃(m ... | @@ -5,11 +5,50 @@
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
+lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :
+ let r := @round_fp format rnd f;
+ ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by
+ rcases f.exp.decLt (-f... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_2 | 4816f15bf5b893aa | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "addition_on_grid",
"depth": 1,
"n_commands": 0,
"n_lines": 200,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hne ha hb\n rcases (a*b:ℝ).decidableLT 0 with hs|hn\n simp at hs\n have hle : |(a:ℝ)| ≤ |(@rne_abs f (a+b):ℝ)| ... | [
{
"name": "fp_on_grid'",
"text": "lemma fp_on_grid' {f : Format} {a : float 2} :\n @canonical 2 f a →\n ∃m:ℤ, a = (m:ℝ) * eps f*ufp a := by\n intro hcan\n have ⟨m, heq⟩ := fp_on_grid hcan\n rewrite (occs := .pos [1]) [heq]\n exists 2*m\n simp\n\n",
"fan_in": 1,
"n_lines": 10,
"n_chars": 2... | [
{
"name": "addition_on_grid",
"fan_in": 2,
"n_deps_direct": 7,
"n_deps_transitive": 8,
"n_lines": 207,
"n_chars": 7079,
"n_subproofs": 33,
"n_tactics": 256,
"cyclomatic": 11,
"n_automation": 113,
"n_rewrites": 54,
"n_structural": 54,
"automation_only": false,
... | 8 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | @@ -75,6 +75,15 @@
rw [zpow_right_inj₀ (by simp) (by simp)]
omega
+lemma fp_on_grid' {f : Format} {a : float 2} :
+ @canonical 2 f a →
+ ∃m:ℤ, a = (m:ℝ) * eps f*ufp a := by
+ intro hcan
+ have ⟨m, heq⟩ := fp_on_grid hcan
+ rewrite (occs := .pos [1]) [heq]
+ exists 2*m
+ simp
+
lemma rnd_multiple' {forma... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_3 | a7df3d0042beca77 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "addition_on_grid_of_ops_on_grid",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hsigma hagrid hbgrid\n let ⟨k, hsigma_eq⟩ := hsigma\n let ⟨ma, heqa⟩ := hagrid\n let ⟨mb, heqb⟩ :... | [
{
"name": "rnd_multiple'",
"text": "lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :\n let r := @round_fp format rnd f;\n ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by\n rcases f.exp.decLt (-format.dexp) with hle|hlt\n simp at hle\n apply rnd_multiple _ hle\n simp\n have ⟨... | [
{
"name": "sub_on_grid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 13,
"n_chars": 372,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": ... | 9 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | @@ -84,11 +84,50 @@
exists 2*m
simp
+lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :
+ let r := @round_fp format rnd f;
+ ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by
+ rcases f.exp.decLt (-format.dexp) with hle|hlt
+ simp at hle
+ apply rnd_multiple _ hle
+ simp
+ have ⟨m, ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_4 | 6b24322170e8b68e | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "addition_on_grid_of_ops_on_grid",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hsigma hagrid hbgrid\n let ⟨k, hsigma_eq⟩ := hsigma\n let ⟨ma, heqa⟩ := hagrid\n let ⟨mb, heqb⟩ :... | [
{
"name": "rnd_multiple'",
"text": "lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :\n let r := @round_fp format rnd f;\n ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by\n rcases f.exp.decLt (-format.dexp) with hle|hlt\n simp at hle\n apply rnd_multiple _ hle\n simp\n have ⟨... | [
{
"name": "sub_on_grid'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 17,
"n_chars": 501,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 9 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | @@ -84,11 +84,50 @@
exists 2*m
simp
+lemma rnd_multiple' {format : Format} {rnd : ℤ → ℝ → ℤ} [Faithful rnd] (f : float 2) :
+ let r := @round_fp format rnd f;
+ ∃(m : ℤ), r = (m:ℝ) * 2^f.exp := by
+ rcases f.exp.decLt (-format.dexp) with hle|hlt
+ simp at hle
+ apply rnd_multiple _ hle
+ simp
+ have ⟨m, ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_5 | 8394fd302a860b82 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "sub_exact_of_grid",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rintro hsigma haeq ⟨mb, hbeq⟩ ha hb hle\n set b' := fopp b with hb'\n have := fopp_correct b\n rw [<-hb'] at this\n ... | [
{
"name": "add_exact_of_grid",
"text": "lemma add_exact_of_grid {f : Format} {σ : ℝ} {a b : float 2} [ValidRound rnd] :\n (∃ e : ℤ, σ = 2^e) →\n (∃ k : ℤ, a = (k:ℝ) * eps f * σ) →\n (∃ m : ℤ, b = (m:ℝ) * eps f * σ) →\n @canonical 2 f a →\n @canonical 2 f b →\n |(a+b:ℝ)| ≤ σ →\n round_fp (format := f)... | [
{
"name": "sub_exact_of_grid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 650,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
"max_nes... | 1 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma sub_exact_of_grid {f : Format} {σ : ℝ} {a b : float 2} [ValidRound rnd] :
(∃ e : ℤ, σ = 2^e) →
(∃ k : ℤ, a = (k:ℝ) * e... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma add_exact_of_grid {f : Format} {σ : ℝ} {a b : float 2} [ValidRound rnd] :
(∃ e : ℤ, σ = 2^e) →
(∃ k : ℤ, a = (k:ℝ) * e... | @@ -5,6 +5,125 @@
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
+lemma add_exact_of_grid {f : Format} {σ : ℝ} {a b : float 2} [ValidRound rnd] :
+ (∃ e : ℤ, σ = 2^e) →
+ (∃ k : ℤ, a = (k:ℝ) * eps f * σ) →
+ (∃ m : ℤ, b = (m:ℝ) * eps f * σ) →
+ @can... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_6 | e74d300397ee6a88 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "exists_bounded_float_neg_mul_pow2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ b, hb ⟩ := exists_bounded_float_mul_pow2 hp1 hk hj;\n refine' ⟨ ⟨ -b.fnum, b.exp ⟩, _, _ ⟩ <;> ... | [
{
"name": "exists_bounded_float_mul_pow2",
"text": "private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2 : ℝ) ^ j := by\n -- For the case when $k = 2... | [
{
"name": "exists_bounded_float_neg_mul_pow2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 1021,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fal... | 1 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
/-- Left-fold recursive floating-point summation. -/
noncomputable def fl_sum {f : Format} (a : List (float 2)) : float 2 :=
a... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
/-- Left-fold recursive floating-point summation. -/
noncomputable def fl_sum {f : Format} (a : List (float 2)) : float 2 :=
a... | @@ -10,9 +10,31 @@
a.foldl (fun acc x => @rne_abs f (acc + x)) ⟨0, -f.dexp⟩
-- Helper: eps is positive
+private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}
+ (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :
+ ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_7 | caf3e7e3db9f9d60 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "exists_bounded_float_neg_mul_pow2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ b, hb ⟩ := exists_bounded_float_mul_pow2 hp1 hk hj;\n refine' ⟨ ⟨ -b.fnum, b.exp ⟩, _, _ ⟩ <;> ... | [
{
"name": "exists_bounded_float_mul_pow2",
"text": "private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2 : ℝ) ^ j := by\n -- For the case when $k = 2... | [
{
"name": "rne_abs_magnitude_le",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 2273,
"n_subproofs": 4,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": false,
"ma... | 4 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma bounded_le_round_monotone {a:float 2} {b:ℝ} {f : Format} [ValidRound rnd] :
@bounded_float 2 f a →
(a:ℝ) ≤ b →
(a:ℝ)... | @@ -32,9 +32,31 @@
a.foldl (fun acc x => @rne_abs f (acc + x)) ⟨0, -f.dexp⟩
-- Helper: eps is positive
+private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}
+ (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :
+ ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_8 | 845672884129dec7 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "exists_bounded_float_neg_mul_pow2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ b, hb ⟩ := exists_bounded_float_mul_pow2 hp1 hk hj;\n refine' ⟨ ⟨ -b.fnum, b.exp ⟩, _, _ ⟩ <;> ... | [
{
"name": "exists_bounded_float_mul_pow2",
"text": "private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2 : ℝ) ^ j := by\n -- For the case when $k = 2... | [
{
"name": "rne_abs_exact_of_eq_mul_pow2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1960,
"n_subproofs": 6,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
... | 1 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
/-- Left-fold recursive floating-point summation. -/
noncomputable def fl_sum {f : Format} (a : List (float 2)) : float 2 :=
a... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
/-- Left-fold recursive floating-point summation. -/
noncomputable def fl_sum {f : Format} (a : List (float 2)) : float 2 :=
a... | @@ -10,6 +10,24 @@
a.foldl (fun acc x => @rne_abs f (acc + x)) ⟨0, -f.dexp⟩
-- Helper: eps is positive
+private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}
+ (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :
+ ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_9 | 5c483198684fc7e5 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "exists_bounded_float_neg_mul_pow2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ b, hb ⟩ := exists_bounded_float_mul_pow2 hp1 hk hj;\n refine' ⟨ ⟨ -b.fnum, b.exp ⟩, _, _ ⟩ <;> ... | [
{
"name": "exists_bounded_float_mul_pow2",
"text": "private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2 : ℝ) ^ j := by\n -- For the case when $k = 2... | [
{
"name": "rne_abs_step_error",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 59,
"n_chars": 3630,
"n_subproofs": 7,
"n_tactics": 53,
"cyclomatic": 6,
"n_automation": 21,
"n_rewrites": 11,
"n_structural": 8,
"automation_only": false,
"max... | 5 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs, round_fp, to_real]
/-- Left-fold recursive floating-point s... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs, round_fp, to_real]
/-- Left-fold recursive floating-point s... | @@ -15,6 +15,24 @@
private lemma eps_pos (f : Format) : (0 : ℝ) < eps f := by
simp [eps]
-- Helper: σ = 2^j is positive
+private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}
+ (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :
+ ∃ b : float 2, @bounded_float 2 f b ∧ (... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_10 | ca9c6156eb0e102e | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "rne_abs_magnitude_le",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ j, rfl ⟩ := hσ;\n -- Use `exists_bounded_float_mul_pow2` to obtain a bounded float `b` such that `b = k * (... | [
{
"name": "exists_bounded_float_neg_mul_pow2",
"text": "private lemma exists_bounded_float_neg_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = -(↑k * (2 : ℝ) ^ j) := by\n obtain ⟨ b, hb ⟩... | [
{
"name": "sum_error_bound_acc",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 62,
"n_chars": 3740,
"n_subproofs": 3,
"n_tactics": 40,
"cyclomatic": 6,
"n_automation": 14,
"n_rewrites": 7,
"n_structural": 7,
"automation_only": false,
"ma... | 10 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs, round_fp, to_real]
lemma bounded_le_round_monotone {a:float... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs, round_fp, to_real]
lemma bounded_le_round_monotone {a:float... | @@ -55,13 +55,44 @@
PROVIDED SOLUTION
Same construction as exists_bounded_float_mul_pow2 but negate the fnum. Use bounded_negate or construct directly. Get b from exists_bounded_float_mul_pow2, then use fopp b or ⟨-b.fnum, b.exp⟩ with bounded_negate.
-/
+private lemma exists_bounded_float_neg_mul_pow2 {f : Format} {... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_0c780615d9a6_11 | 1629b26591530627 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Aux.lean | Aux | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "exists_bounded_float_neg_mul_pow2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ b, hb ⟩ := exists_bounded_float_mul_pow2 hp1 hk hj;\n refine' ⟨ ⟨ -b.fnum, b.exp ⟩, _, _ ⟩ <;> ... | [
{
"name": "exists_bounded_float_mul_pow2",
"text": "private lemma exists_bounded_float_mul_pow2 {f : Format} {k : ℕ} {j : ℤ}\n (hp1 : 1 < f.precision) (hk : k ≤ 2 ^ f.precision) (hj : -f.dexp ≤ j) :\n ∃ b : float 2, @bounded_float 2 f b ∧ (b : ℝ) = ↑k * (2 : ℝ) ^ j := by\n -- For the case when $k = 2... | [
{
"name": "sum_error_bound_2_20",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 14,
"n_lines": 53,
"n_chars": 2996,
"n_subproofs": 11,
"n_tactics": 87,
"cyclomatic": 7,
"n_automation": 24,
"n_rewrites": 8,
"n_structural": 17,
"automation_only": false,
... | 14 | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma to0 : to_real (β := 2) ⟨0, e⟩ = 0 := by simp [to_real]
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs... | import Mathlib.Analysis.SpecialFunctions.Log.Base
import Flops.Core.Fast2SumOp
def is_representable (fmt : Format) (r : ℝ) : Prop :=
∃ f : float 2, @bounded_float 2 fmt f ∧ to_real f = r
lemma to0 : to_real (β := 2) ⟨0, e⟩ = 0 := by simp [to_real]
lemma rne0 {f : Format} : @rne_abs f 0 = (0:ℝ) := by simp [rne_abs... | @@ -71,9 +71,31 @@
PROVIDED SOLUTION
Construct a bounded float with value k * 2^j by cases. If k = 0: use ⟨0, -f.dexp⟩, bounded by bounded_0, value is 0 = 0 * 2^j. If 0 < k and k < 2^f.precision: use ⟨↑k, j⟩ with value k * 2^j; bounded since |k| < 2^precision (vnum) and j ≥ -dexp. If k = 2^f.precision: then k * 2^j =... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_87b3ce926ce5_3 | 2564624e90b7b0c3 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/RtoProperty.lean | RtoProperty | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "project_rto_fails_overflow_unsigned_finite",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs hd hP hx hfin\n rcases overflow_project_eq_max_or_not_finite domain_sat_consistent x .... | [
{
"name": "overflow_project_eq_max_or_not_finite",
"text": "lemma overflow_project_eq_max_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :\n @max_finite f < x →\n @project f domain_sat_consistent x rnd sat = @max_finite f ∨\n ¬(@project f domain_sat_consistent x rnd sat).is_finit... | [
{
"name": "project_rto_fails_overflow_unsigned_finite",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 623,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_on... | 1 | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | @@ -56,6 +56,34 @@
/-! ### Main theorem: RTO property for projection (in-range case) -/
+lemma overflow_project_eq_max_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :
+ @max_finite f < x →
+ @project f domain_sat_consistent x rnd sat = @max_finite f ∨
+ ¬(@project f domain_sat_consiste... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_87b3ce926ce5_4 | c1d99938f82a1b91 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/RtoProperty.lean | RtoProperty | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "project_rto_fails_overflow_unsigned_finite",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs hd hP hx hfin\n rcases overflow_project_eq_max_or_not_finite domain_sat_consistent x .... | [
{
"name": "overflow_project_eq_max_or_not_finite",
"text": "lemma overflow_project_eq_max_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :\n @max_finite f < x →\n @project f domain_sat_consistent x rnd sat = @max_finite f ∨\n ¬(@project f domain_sat_consistent x rnd sat).is_finit... | [
{
"name": "project_rto_fails_overflow_signed_extended",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 636,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_on... | 1 | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | @@ -56,6 +56,34 @@
/-! ### Main theorem: RTO property for projection (in-range case) -/
+lemma overflow_project_eq_max_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :
+ @max_finite f < x →
+ @project f domain_sat_consistent x rnd sat = @max_finite f ∨
+ ¬(@project f domain_sat_consiste... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_87b3ce926ce5_5 | 8119349c53d69fdf | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/RtoProperty.lean | RtoProperty | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "project_rto_fails_overflow_neg_unsigned",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs hx hfin\n rcases overflow_neg_project_eq_min_or_not_finite domain_sat_consistent x .RTO s... | [
{
"name": "overflow_neg_project_eq_min_or_not_finite",
"text": "lemma overflow_neg_project_eq_min_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :\n x < @min_finite f →\n @project f domain_sat_consistent x rnd sat = @min_finite f ∨\n ¬(@project f domain_sat_consistent x rnd sat).... | [
{
"name": "project_rto_fails_overflow_neg_unsigned",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 571,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only"... | 1 | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | @@ -56,13 +56,64 @@
/-! ### Main theorem: RTO property for projection (in-range case) -/
+lemma overflow_neg_project_eq_min_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :
+ x < @min_finite f →
+ @project f domain_sat_consistent x rnd sat = @min_finite f ∨
+ ¬(@project f domain_sat_con... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_87b3ce926ce5_6 | 5eaad0a16d661bc1 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/P3109/RtoProperty.lean | RtoProperty | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "project_rto_fails_overflow_neg_unsigned",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hs hx hfin\n rcases overflow_neg_project_eq_min_or_not_finite domain_sat_consistent x .RTO s... | [
{
"name": "overflow_neg_project_eq_min_or_not_finite",
"text": "lemma overflow_neg_project_eq_min_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :\n x < @min_finite f →\n @project f domain_sat_consistent x rnd sat = @min_finite f ∨\n ¬(@project f domain_sat_consistent x rnd sat).... | [
{
"name": "project_rto_fails_overflow_neg_signed_extended",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 652,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automatio... | 1 | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | /-
RTO (Round-To-Odd) Property for P3109 Projection
The RTO property states: when a real value x is not exactly representable
in the target format, the projected result has an odd significand (fnum).
This file proves the RTO property for the `project` function, identifying
the corner cases where it fails.
... | @@ -56,6 +56,53 @@
/-! ### Main theorem: RTO property for projection (in-range case) -/
+lemma overflow_neg_project_eq_min_or_not_finite (x : ℝ) (rnd : RoundingMode) (sat : SaturationMode) :
+ x < @min_finite f →
+ @project f domain_sat_consistent x rnd sat = @min_finite f ∨
+ ¬(@project f domain_sat_cons... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_3919ebf376dc_0 | f869f69175bcdb03 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/RoundingError.lean | RoundingError | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "canonical_multiple",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hcan\n apply bounded_float_multiple (canonical_bounded hcan)",
"n_chars": 72,
"n_subproofs": 0,
"n_ta... | [
{
"name": "bounded_float_multiple",
"text": "lemma bounded_float_multiple {f : Format} {x : float 2}:\n @bounded_float 2 f x →\n ∃m:ℤ, x = (m:ℝ)*2^(-f.dexp) := by\n rintro ⟨_, he⟩\n exists x.fnum*2^(x.exp+f.dexp).toNat\n simp [to_real]\n rw [<-zpow_natCast]; simp\n rw [max_eq_left (by omega)]\n rw [... | [
{
"name": "canonical_multiple",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nest... | 1 | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | @@ -13,9 +13,22 @@
noncomputable def ulp' {f:Format} (r : ℝ) : ℝ :=
if 2^(f.emin+f.precision-1) ≤ |r| then 2*u f*ufp r else 2^f.emin
+lemma bounded_float_multiple {f : Format} {x : float 2}:
+ @bounded_float 2 f x →
+ ∃m:ℤ, x = (m:ℝ)*2^(-f.dexp) := by
+ rintro ⟨_, he⟩
+ exists x.fnum*2^(x.exp+f.dexp).toNat
+ ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_3919ebf376dc_1 | a9c3fb8a41d4cb89 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/RoundingError.lean | RoundingError | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "underflow_exact",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha hb hle\n have ⟨ma, heqa⟩ := canonical_multiple ha\n have ⟨mb, heqb⟩ := canonical_multiple hb\n simp [heqa, heq... | [
{
"name": "canonical_multiple",
"text": "lemma canonical_multiple {f : Format} {x : float 2}:\n @canonical 2 f x →\n ∃m:ℤ, x = (m:ℝ)*2^(-f.dexp) := by\n intro hcan\n apply bounded_float_multiple (canonical_bounded hcan)\n\n-- TODO: |(a+b:ℝ)| ≤ 2^(f.precision-f.dexp)\n",
"fan_in": 1,
"n_lines": 8... | [
{
"name": "underflow_exact",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 67,
"n_chars": 2047,
"n_subproofs": 9,
"n_tactics": 72,
"cyclomatic": 6,
"n_automation": 35,
"n_rewrites": 22,
"n_structural": 11,
"automation_only": false,
"max_n... | 2 | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | @@ -24,11 +24,77 @@
rw [mul_assoc, <-zpow_neg, <-zpow_add₀ (by simp)]
simp
+lemma canonical_multiple {f : Format} {x : float 2}:
+ @canonical 2 f x →
+ ∃m:ℤ, x = (m:ℝ)*2^(-f.dexp) := by
+ intro hcan
+ apply bounded_float_multiple (canonical_bounded hcan)
+
+-- TODO: |(a+b:ℝ)| ≤ 2^(f.precision-f.dexp)
lemma... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_3919ebf376dc_2 | 57c2ef1810726b7d | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/RoundingError.lean | RoundingError | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "rounding_error_lt_ulp",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set x := @round_fp format rnd r with hx\n cases (@validround_up_or_down format rnd _ r) <;> simp_rw [<-hx] at *\n e... | [
{
"name": "rounddown_error_lt_ulp",
"text": "lemma rounddown_error_lt_ulp (r : ℝ) :\n |r - @round_fp format (Function.const ℤ (⌊.⌋)) r| < @ulp format (@round_fp format (Function.const ℤ (⌊.⌋)) r) (@valid_round_fp_canonical format (Function.const ℤ (⌊.⌋)) _ r)\n := by\n have heq : r = @scaled_mantissa for... | [
{
"name": "rounding_error_lt_ulp",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 461,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max... | 2 | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | @@ -57,9 +57,62 @@
repeat (apply zpow_pos; simp)
-- rounddown one ulp
+lemma rounddown_error_lt_ulp (r : ℝ) :
+ |r - @round_fp format (Function.const ℤ (⌊.⌋)) r| < @ulp format (@round_fp format (Function.const ℤ (⌊.⌋)) r) (@valid_round_fp_canonical format (Function.const ℤ (⌊.⌋)) _ r)
+ := by
+ have heq : r = ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_3919ebf376dc_3 | b919d5a7e6e206ae | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/RoundingError.lean | RoundingError | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "rounding_error_lt_ulp",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set x := @round_fp format rnd r with hx\n cases (@validround_up_or_down format rnd _ r) <;> simp_rw [<-hx] at *\n e... | [
{
"name": "rounddown_error_lt_ulp",
"text": "lemma rounddown_error_lt_ulp (r : ℝ) :\n |r - @round_fp format (Function.const ℤ (⌊.⌋)) r| < @ulp format (@round_fp format (Function.const ℤ (⌊.⌋)) r) (@valid_round_fp_canonical format (Function.const ℤ (⌊.⌋)) _ r)\n := by\n have heq : r = @scaled_mantissa for... | [
{
"name": "epsilon_lt_ulp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 3 | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | @@ -57,9 +57,62 @@
repeat (apply zpow_pos; simp)
-- rounddown one ulp
+lemma rounddown_error_lt_ulp (r : ℝ) :
+ |r - @round_fp format (Function.const ℤ (⌊.⌋)) r| < @ulp format (@round_fp format (Function.const ℤ (⌊.⌋)) r) (@valid_round_fp_canonical format (Function.const ℤ (⌊.⌋)) _ r)
+ := by
+ have heq : r = ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_3919ebf376dc_4 | 7ea6941663241f7d | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/Core/RoundingError.lean | RoundingError | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "rne_error",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ha hb\n rcases |(a+b:ℝ)|.decidableLE (2^(f.precision-f.dexp)) with hlt|hle\n simp at hlt\n rw [sub_sub]\n apply rne_er... | [
{
"name": "underflow_exact",
"text": "lemma underflow_exact {f : Format} {a b : float 2} [ValidRound rnd] :\n @canonical 2 f a →\n @canonical 2 f b →\n |(a+b:ℝ)| ≤ 2^(f.precision-f.dexp) →\n round_fp (format := f) rnd (a+b) = (a+b:ℝ) := by\n intro ha hb hle\n have ⟨ma, heqa⟩ := canonical_multiple ha\n... | [
{
"name": "rne_error",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 795,
"n_subproofs": 3,
"n_tactics": 28,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 2,
"n_structural": 13,
"automation_only": false,
"max_nesting":... | 4 | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | import Flops.Core.RoundOp
variable {β : ℕ} {format : Format}
noncomputable def eta (f : Format) : ℝ := 2^(-f.dexp)
noncomputable def ufp (x : ℝ) : ℝ :=
if x = 0 then 0 else 2 ^ (Int.log 2 |x|)
noncomputable def eps (f : Format) : ℝ := 2^(-f.precision : ℤ)
-- ulp of a *canonical* floating point value!
noncomputable ... | @@ -31,6 +31,72 @@
apply bounded_float_multiple (canonical_bounded hcan)
-- TODO: |(a+b:ℝ)| ≤ 2^(f.precision-f.dexp)
+lemma underflow_exact {f : Format} {a b : float 2} [ValidRound rnd] :
+ @canonical 2 f a →
+ @canonical 2 f b →
+ |(a+b:ℝ)| ≤ 2^(f.precision-f.dexp) →
+ round_fp (format := f) rnd (a+b) = (a+b... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_5b44c748bf5e_0 | 4cfc4112971fb682 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Scalar.lean | Scalar | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "real_nonneg_rounded_nonneg",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n contrapose; simp\n exact rounded_neg_real_neg",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "rounded_neg_real_neg",
"text": "lemma rounded_neg_real_neg {f : Format} {r : ℝ} [ValidRound rnd] :\n round_fp (format:=f) rnd r < (0:ℝ) →\n r < 0 := by\n intro hneg\n by_contra hle; simp at hle\n have := @round_monotone f rnd _ _ _ hle\n rewrite (occs := .pos [1]) [round_fp] at this\n simp... | [
{
"name": "real_nonneg_rounded_nonneg",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 1 | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma real_nonneg_rounded_no... | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma rounded_neg_real_neg {... | @@ -8,8 +8,20 @@
let p' := @rne_abs f (p-q)
(q, p')
+lemma rounded_neg_real_neg {f : Format} {r : ℝ} [ValidRound rnd] :
+ round_fp (format:=f) rnd r < (0:ℝ) →
+ r < 0 := by
+ intro hneg
+ by_contra hle; simp at hle
+ have := @round_monotone f rnd _ _ _ hle
+ rewrite (occs := .pos [1]) [round_fp] at this
+... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_5b44c748bf5e_1 | ff122e94e56bad69 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Scalar.lean | Scalar | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "real_nonpos_rounded_nonpos",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n contrapose; simp\n exact rounded_pos_real_pos",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "rounded_pos_real_pos",
"text": "lemma rounded_pos_real_pos {f : Format} {r : ℝ} [ValidRound rnd] :\n (0:ℝ) < round_fp (format:=f) rnd r →\n 0 < r := by\n intro hpos\n by_contra hle; simp at hle\n have := @round_monotone f rnd _ _ _ hle\n rewrite (occs := .pos [2]) [round_fp] at this\n simp... | [
{
"name": "real_nonpos_rounded_nonpos",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 1 | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma real_nonpos_rounded_no... | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma rounded_pos_real_pos {... | @@ -8,8 +8,20 @@
let p' := @rne_abs f (p-q)
(q, p')
+lemma rounded_pos_real_pos {f : Format} {r : ℝ} [ValidRound rnd] :
+ (0:ℝ) < round_fp (format:=f) rnd r →
+ 0 < r := by
+ intro hpos
+ by_contra hle; simp at hle
+ have := @round_monotone f rnd _ _ _ hle
+ rewrite (occs := .pos [2]) [round_fp] at this
+... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_5b44c748bf5e_2 | adad60eabc151037 | lean | lean | github.com/rutgers-apl/FLoPS | 95081ac643663da507115abe23ebd5701433587f | Flops/AccSum/Scalar.lean | Scalar | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ExtractScalar_properties",
"depth": 1,
"n_commands": 0,
"n_lines": 370,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set scalar := ExtractScalar (f := f) σ p with hscalar\n let (q, p') := scalar\n simp\n simp [ExtractScalar] a... | [
{
"name": "h_round_sigma",
"text": "lemma h_round_sigma {f : Format} {σ : float 2} {M : ℤ} :\n @canonical 2 f σ →\n (σ:ℝ) = 2^(f.precision-1+σ.exp) →\n σ.fnum = (2:ℝ) ^ (f.precision-1) →\n f.precision-1 < M →\n -f.dexp < σ.exp →\n 1 < f.precision →\n σ = @rne_abs f (σ+2^(-M)*σ) := by\n intro hsigma_... | [
{
"name": "ExtractScalar_properties",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 386,
"n_chars": 14328,
"n_subproofs": 57,
"n_tactics": 515,
"cyclomatic": 21,
"n_automation": 261,
"n_rewrites": 115,
"n_structural": 109,
"automation_only": ... | 2 | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma h_round_sigma_neg {f :... | import Flops.AccSum.Aux
import Flops.Core.Order
import Mathlib.Analysis.SpecialFunctions.Log.Base
noncomputable def ExtractScalar {f : Format} (σ p : float 2) : float 2 × float 2 :=
let s := rne_abs (format := f) (σ + p)
let q := @rne_abs f (s-σ)
let p' := @rne_abs f (p-q)
(q, p')
lemma h_round_sigma {f : For... | @@ -8,6 +8,106 @@
let p' := @rne_abs f (p-q)
(q, p')
+lemma h_round_sigma {f : Format} {σ : float 2} {M : ℤ} :
+ @canonical 2 f σ →
+ (σ:ℝ) = 2^(f.precision-1+σ.exp) →
+ σ.fnum = (2:ℝ) ^ (f.precision-1) →
+ f.precision-1 < M →
+ -f.dexp < σ.exp →
+ 1 < f.precision →
+ σ = @rne_abs f (σ+2^(-M)*σ) := by
+ ... | {
"repo": "FLoPS",
"git_repo": "github.com/rutgers-apl/FLoPS",
"revision": "95081ac643663da507115abe23ebd5701433587f",
"lean_toolchain": "leanprover/lean4:v4.28.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas... |
ablate_23b7ce314d05_0 | 0c49cecc667c6620 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Wheels.lean | Wheels | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "le_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Vec.le_cons_aux eq₁ eq₂ h",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
... | [
{
"name": "le_cons_aux",
"text": "/--\nAn unnecessarily specific technical lemma that simplifies reasoning with clumsy vectors equipped\nwith the custom clumsy preorder.\n\nSee `Vec.le_cons` to see what this 'really' does.\n-/\nprivate lemma le_cons_aux \n (eq₁ : v₁ = ⟨hd₁ :: tl₁, len₁⟩) (eq₂ : v₂ = ⟨hd₂ :... | [
{
"name": "le_cons",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 402,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | import Mathlib.Algebra.Order.Ring.Unbundled.Nonneg
import Mathlib.Data.Finite.Defs
import Mathlib.Data.Finmap
import Mathlib.Data.List.Intervals
import Mathlib.Data.Set.Image
import Mathlib.Logic.Embedding.Basic
import Mathlib.Tactic
import FVIntmax.Wheels.Wheels
namespace Intmax
noncomputable opaque H {α : Type} ... | import Mathlib.Algebra.Order.Ring.Unbundled.Nonneg
import Mathlib.Data.Finite.Defs
import Mathlib.Data.Finmap
import Mathlib.Data.List.Intervals
import Mathlib.Data.Set.Image
import Mathlib.Logic.Embedding.Basic
import Mathlib.Tactic
import FVIntmax.Wheels.Wheels
namespace Intmax
noncomputable opaque H {α : Type} ... | @@ -166,12 +166,33 @@
{v₁ v₂ : Vector α n.succ} {len₁} {len₂}
/--
+An unnecessarily specific technical lemma that simplifies reasoning with clumsy vectors equipped
+with the custom clumsy preorder.
+
+See `Vec.le_cons` to see what this 'really' does.
+-/
+private lemma le_cons_aux
+ (eq₁ : v₁ = ⟨hd₁ :: t... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_0 | ea3915288f7967d1 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "length_transactionsInBlock",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold TransactionsInBlock\n split <;> try simp\n rw [length_TransactionsInBlock_transfer]",
"n_chars": 96... | [
{
"name": "length_TransactionsInBlock_transfer",
"text": "lemma length_TransactionsInBlock_transfer\n {b : { b : Block K₁ K₂ C Sigma V // b.isTransferBlock }} :\n ∀ (π₁ π₂ : BalanceProof K₁ K₂ C Pi V),\n (TransactionsInBlock_transfer π₁ b).length =\n (TransactionsInBlock_transfer π₂ b).length := λ π... | [
{
"name": "length_transactionsInBlock",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 213,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -84,6 +84,17 @@
sorted.attach.map λ ⟨(s, r), h⟩ ↦ ⟨(s, r, v s r), by valid⟩
| .deposit .. | .withdrawal .. => by aesop
+lemma length_TransactionsInBlock_transfer
+ {b : { b : Block K₁ K₂ C Sigma V // b.isTransferBlock }} :
+ ∀ (π₁ π₂ : BalanceProof K₁ K₂ C Pi V),
+ (TransactionsInBlock_transfer π₁ b).... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_1 | d4fda33d5bcc864b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "length_transactionsInBlock",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold TransactionsInBlock\n split <;> try simp\n rw [length_TransactionsInBlock_transfer]",
"n_chars": 96... | [
{
"name": "length_TransactionsInBlock_transfer",
"text": "lemma length_TransactionsInBlock_transfer\n {b : { b : Block K₁ K₂ C Sigma V // b.isTransferBlock }} :\n ∀ (π₁ π₂ : BalanceProof K₁ K₂ C Pi V),\n (TransactionsInBlock_transfer π₁ b).length =\n (TransactionsInBlock_transfer π₂ b).length := λ π... | [
{
"name": "length_transactionsInBlocks",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 535,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -84,6 +84,17 @@
sorted.attach.map λ ⟨(s, r), h⟩ ↦ ⟨(s, r, v s r), by valid⟩
| .deposit .. | .withdrawal .. => by aesop
+lemma length_TransactionsInBlock_transfer
+ {b : { b : Block K₁ K₂ C Sigma V // b.isTransferBlock }} :
+ ∀ (π₁ π₂ : BalanceProof K₁ K₂ C Pi V),
+ (TransactionsInBlock_transfer π₁ b).... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_2 | 6698dc4780c22735 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "V'_sset_V'_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp [V']\n exact Set.subset_image_iff.2 ⟨\n boundedBelow b₂ T₂,\n ⟨boundedBelow_sset_boundedBelow_of_le h h₁, by ... | [
{
"name": "boundedBelow_sset_boundedBelow_of_le",
"text": "lemma boundedBelow_sset_boundedBelow_of_le {b₁ b₂ : S K₁ K₂ V} {T₁ T₂ : Τ K₁ K₂ V}\n (h : b₁ ≤ b₂) (h₁ : T₁ ≤ T₂) : boundedBelow b₂ T₂ ⊆ boundedBelow b₁ T₁ := by\n unfold boundedBelow\n rintro ⟨⟨T₃, eq⟩, b₃⟩ ⟨h₂, h₃⟩\n simp at *\n exact ⟨le_tra... | [
{
"name": "V'_sset_V'_of_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 337,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -409,6 +409,13 @@
abbrev boundedBelow (b : S K₁ K₂ V) (T : Τ K₁ K₂ V) :=
{ a : Τc K₁ K₂ V × S K₁ K₂ V | (T, b) ≤ (↑a.1, a.2) }
+lemma boundedBelow_sset_boundedBelow_of_le {b₁ b₂ : S K₁ K₂ V} {T₁ T₂ : Τ K₁ K₂ V}
+ (h : b₁ ≤ b₂) (h₁ : T₁ ≤ T₂) : boundedBelow b₂ T₂ ⊆ boundedBelow b₁ T₁ := by
+ unfold boundedB... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_3 | 4711e07b24426a8e | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_deposit_source",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 584,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 6,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nest... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,16 @@
lemma f_deposit_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isDepositBloc... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_4 | c0000f74ccce7f76 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_deposit_source'",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 241,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,16 @@
lemma f_deposit_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isDepositBloc... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_5 | c11dc9c112cacefe | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_deposit_source''",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 6,
"n_chars": 231,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,16 @@
lemma f_deposit_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isDepositBloc... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_6 | bd4dc29290d3e705 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_withdraw_source",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 633,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 6,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,17 @@
lemma f_withdraw_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isWithdrawal... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_7 | c27784aa0516f5cf | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_withdraw_source'",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 271,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,17 @@
lemma f_withdraw_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isWithdrawal... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_8 | bdfcc1b7b51b6b75 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_withdraw_source''",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 6,
"n_chars": 261,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -583,6 +583,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -618,7 +622,17 @@
lemma f_withdraw_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isWithdrawal... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_9 | 7a6eac32b583317b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_transfer_source",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1051,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 7,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_ne... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -607,7 +611,20 @@
lemma f_transfer_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isTransferBl... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_10 | 9e04d2dc37bb1c7d | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_transfer_source'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -607,7 +611,20 @@
lemma f_transfer_source
(h : ∃ block : {b : Block K₁ K₂ C Sigma V // b.isTransferBl... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_12 | ab36bedc4811db66 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_withdrawal_block_source",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 731,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 3,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -626,7 +630,17 @@
exact Finset.sum_congr rfl (by aesop)
lemma f_withdrawal_block_source (h : b.is... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_14 | 4c132c5242eb048e | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "fold_f_any_transaction_transfer",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 791,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 7,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false... | 1 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -606,7 +610,22 @@
private lemma fold_f_any_transaction_transfer {acc : S K₁ K₂ V} {l : List (Τ K₁ K₂ V... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_15 | 997f29f615d6be70 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_transfer_block_source",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 740,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"m... | 2 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -606,7 +610,22 @@
private lemma fold_f_any_transaction_transfer {acc : S K₁ K₂ V} {l : List (Τ K₁ K₂ V... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_c8b4cc7f4248_16 | f330a93b90734f3b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Balance.lean | Balance | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "f_deposit_source",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨⟨b, hb⟩, h₁⟩\n rcases T with ⟨⟨s, r, v⟩, hT⟩\n unfold Block.isDepositBlock at hb\n simp [TransactionsIn... | [
{
"name": "f_eq_f'",
"text": "lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by\n ext b T k\n simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_autom... | [
{
"name": "f_transfer_block_source'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 4,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 3 | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | import Mathlib
import Mathlib.Algebra.Group.Int
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Key
import FVIntmax.Propositions
import FVIntmax.State
import FVIntmax.Transaction
import FVIntmax.Wheels
import FVIntmax.Wheels.Dictionary
namespace Intmax
/-
Honestly just saves a bit of time. There'... | @@ -572,6 +572,10 @@
· simp
⟩
+lemma f_eq_f' : f = f' (K₁ := K₁) (K₂ := K₂) (V := V) := by
+ ext b T k
+ simp [f, f', infV, exists_inf, iInf, V'_eq_range, if_pos rfl, f']
+
end f
section fStar
@@ -606,7 +610,22 @@
private lemma fold_f_any_transaction_transfer {acc : S K₁ K₂ V} {l : List (Τ K₁ K₂ V... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_0 | 16727b5396d30171 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "Block.updateBalance_transfer",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Block.updateBalance_of_transfer rfl",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "Block.updateBalance_of_transfer",
"text": "lemma Block.updateBalance_of_transfer (h : block.isTransferBlock) :\n block.updateBalance v = v := by\n unfold Block.updateBalance\n match block with\n | .transfer .. => simp\n | .withdrawal .. | .deposit .. => aesop\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "Block.updateBalance_transfer",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 200,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -83,9 +83,17 @@
| .transfer .. => simp
| .withdrawal B => simp; exact sub_eq_add_neg v (∑ x : K₁, ↑(B x))
+lemma Block.updateBalance_of_transfer (h : block.isTransferBlock) :
+ block.updateBalance v = v := by
+ unfold Block.updateBalance
+ match block with
+ | .transfer .. => simp
+ | .withdrawal .. | ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_1 | d909083310a46061 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "computeBalance'_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction' σ with hd tl ih generalizing v\n · simp\n · rw [computeBalance'_cons, computeBalance'_cons, ih, Block.... | [
{
"name": "Block.updateBalance_eq_zero",
"text": "lemma Block.updateBalance_eq_zero :\n block.updateBalance v = v + block.updateBalance 0 := by\n unfold Block.updateBalance\n match block with\n | .deposit .. => simp\n | .transfer .. => simp\n | .withdrawal B => simp; exact sub_eq_add_neg v (∑ x : K... | [
{
"name": "computeBalance'_eq_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 272,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 1 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -75,6 +75,14 @@
section Lemmas
+lemma Block.updateBalance_eq_zero :
+ block.updateBalance v = v + block.updateBalance 0 := by
+ unfold Block.updateBalance
+ match block with
+ | .deposit .. => simp
+ | .transfer .. => simp
+ | .withdrawal B => simp; exact sub_eq_add_neg v (∑ x : K₁, ↑(B x))
+
lemma Bl... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_2 | 264735f397527e28 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "attackGameR_eq_attackGameBlocks'",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction' requests with hd tl ih generalizing σ <;> simp [attackGameR, attackGameBlocks'!r]\n simp [ih.s... | [
{
"name": "appendBlock!_def",
"text": "lemma appendBlock!_def : σ.appendBlock! request = σ ++ [request.toBlock! σ] := rfl\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 87,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural":... | [
{
"name": "attackGameR_eq_attackGameBlocks'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -148,6 +148,8 @@
lemma length_appendBlock :
(appendBlock! σ request).length = σ.length + 1 := by simp [appendBlock!]
+lemma appendBlock!_def : σ.appendBlock! request = σ ++ [request.toBlock! σ] := rfl
+
@[simp]
lemma appendBlock!_nil : Scontract.appendBlock! [] request = [request.toBlock! []] := rfl
@@ -49... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_3 | e098c7c9f4d163df | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "attackGameR_eq_attackGameBlocks'",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction' requests with hd tl ih generalizing σ <;> simp [attackGameR, attackGameBlocks'!r]\n simp [ih.s... | [
{
"name": "appendBlock!_def",
"text": "lemma appendBlock!_def : σ.appendBlock! request = σ ++ [request.toBlock! σ] := rfl\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 87,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural":... | [
{
"name": "attackGameBlocks_eq_attackGameR",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 192,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 3 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -148,6 +148,8 @@
lemma length_appendBlock :
(appendBlock! σ request).length = σ.length + 1 := by simp [appendBlock!]
+lemma appendBlock!_def : σ.appendBlock! request = σ ++ [request.toBlock! σ] := rfl
+
@[simp]
lemma appendBlock!_nil : Scontract.appendBlock! [] request = [request.toBlock! []] := rfl
@@ -49... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_4 | bcf3df01031bb8bb | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "attackGameBlocks'_eq_attackGameBlocks'!_normalise",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold attackGameBlocks' attackGameBlocks'!\n unfold normalise\n induction' requests wi... | [
{
"name": "appendBlock_eq_appendBlock!_of_isValid",
"text": "lemma appendBlock_eq_appendBlock!_of_isValid (h : request.isValid) :\n appendBlock σ request = appendBlock! σ request := by\n unfold appendBlock\n rw [Request.toBlock_eq_toBlock!_of_isValid h]\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "attackGameBlocks'_eq_attackGameBlocks'!_normalise",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 517,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 0,
"autom... | 2 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -131,6 +131,12 @@
variable {σ : Scontract K₁ K₂ V C Sigma} {request : Request K₁ K₂ C Sigma Pi V}
+lemma appendBlock_eq_appendBlock!_of_isValid (h : request.isValid) :
+ appendBlock σ request = appendBlock! σ request := by
+ unfold appendBlock
+ rw [Request.toBlock_eq_toBlock!_of_isValid h]
+ rfl
+
lemma a... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_5 | c9328fb870a74bfd | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "attackGameBlocks'_eq_attackGameBlocks'!_normalise",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold attackGameBlocks' attackGameBlocks'!\n unfold normalise\n induction' requests wi... | [
{
"name": "appendBlock_eq_appendBlock!_of_isValid",
"text": "lemma appendBlock_eq_appendBlock!_of_isValid (h : request.isValid) :\n appendBlock σ request = appendBlock! σ request := by\n unfold appendBlock\n rw [Request.toBlock_eq_toBlock!_of_isValid h]\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "attackGame_eq_attackGameBlocks!_normalise",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 169,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 3 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -131,6 +131,12 @@
variable {σ : Scontract K₁ K₂ V C Sigma} {request : Request K₁ K₂ C Sigma Pi V}
+lemma appendBlock_eq_appendBlock!_of_isValid (h : request.isValid) :
+ appendBlock σ request = appendBlock! σ request := by
+ unfold appendBlock
+ rw [Request.toBlock_eq_toBlock!_of_isValid h]
+ rfl
+
lemma a... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_5519fbb7131e_6 | 28bf7ca1ed2a98fb | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/AttackGame.lean | AttackGame | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "isWithdrawalRequest_of_isWithdrawalBlock_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [attackGameR] at h₁\n induction' requests with hd tl ih generalizing i\n · simp at hi₂... | [
{
"name": "attackGameRGo_isWithdrawal_iff",
"text": "lemma attackGameRGo_isWithdrawal_iff (σ σ' : Scontract K₁ K₂ V C Sigma)\n (h : i < (attackGameRGo requests σ).length) :\n (attackGameRGo requests σ)[i].isWithdrawalBlock ↔\n (attackGameRGo requests σ')[i].isWithdrawal... | [
{
"name": "isWithdrawalRequest_of_isWithdrawalBlock_aux",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2020,
"n_subproofs": 0,
"n_tactics": 45,
"cyclomatic": 12,
"n_automation": 24,
"n_rewrites": 2,
"n_structural": 9,
"automat... | 1 | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import FVIntmax.BalanceProof
import FVIntmax.Block
import FVIntmax.Request
import FVIntmax.Wheels
/-!
NB the attack game infrastructure is ever so slightly different from the paper version as it came
to exist in its current for... | @@ -517,6 +517,14 @@
lemma length_attackGameR : (attackGameR requests σ).length = σ.length + requests.length := by
simp [attackGameR]
+lemma attackGameRGo_isWithdrawal_iff (σ σ' : Scontract K₁ K₂ V C Sigma)
+ (h : i < (attackGameRGo requests σ).length) :
+ (attackGameRGo reque... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_a3daa171919f_0 | 4906f230ac379e3f | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Lemma3.lean | Lemma3 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "sum_fStar_le_zero_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [fStar]\n induction Tstar generalizing b with\n | nil => aesop\n | cons _ _ ih => exact ih (le_trans sum_f_le... | [
{
"name": "sum_f_le_sum",
"text": "lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by\n by_cases eq : T.isComplete\n · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]\n refine' Finset.sum_le_sum (λ k _ ↦ _)\n have fcInV' : fc (⟨T, eq⟩, b) k ∈ V' b T k := by\n dsimp... | [
{
"name": "sum_fStar_le_zero_aux",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 405,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_... | 1 | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | @@ -28,12 +28,48 @@
/-
PAPER: This implies the following fact about the transition function for partial transactions f:
-/
+lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by
+ by_cases eq : T.isComplete
+ · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]
+ refine' Finset.sum_le_s... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_a3daa171919f_1 | 714577ca696b461c | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Lemma3.lean | Lemma3 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "sum_fStar_le_zero_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [fStar]\n induction Tstar generalizing b with\n | nil => aesop\n | cons _ _ ih => exact ih (le_trans sum_f_le... | [
{
"name": "sum_f_le_sum",
"text": "lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by\n by_cases eq : T.isComplete\n · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]\n refine' Finset.sum_le_sum (λ k _ ↦ _)\n have fcInV' : fc (⟨T, eq⟩, b) k ∈ V' b T k := by\n dsimp... | [
{
"name": "sum_fStar_le_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 134,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 2 | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | @@ -28,12 +28,48 @@
/-
PAPER: This implies the following fact about the transition function for partial transactions f:
-/
+lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by
+ by_cases eq : T.isComplete
+ · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]
+ refine' Finset.sum_le_s... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_a3daa171919f_2 | b31ff9ebd86d2e83 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Lemma3.lean | Lemma3 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "sum_fStar_le_zero_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [fStar]\n induction Tstar generalizing b with\n | nil => aesop\n | cons _ _ ih => exact ih (le_trans sum_f_le... | [
{
"name": "sum_f_le_sum",
"text": "lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by\n by_cases eq : T.isComplete\n · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]\n refine' Finset.sum_le_sum (λ k _ ↦ _)\n have fcInV' : fc (⟨T, eq⟩, b) k ∈ V' b T k := by\n dsimp... | [
{
"name": "lemma3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 685,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 9
... | 2 | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | import FVIntmax.Balance
namespace Intmax
section Lemma3
variable
{Pi C Sigma : Type}
{K₁ : Type} [Finite K₁]
{K₂ : Type} [Finite K₂]
{V : Type} [Lattice V] [AddCommGroup V]
[CovariantClass V V (· + ·) (· ≤ ·)]
[CovariantClass V V (Function.swap (· + ·)) (· ≤ ·)]
variable {Tc : Τc K... | @@ -28,12 +28,48 @@
/-
PAPER: This implies the following fact about the transition function for partial transactions f:
-/
+lemma sum_f_le_sum : ∑ (k : Kbar K₁ K₂), f b T k ≤ ∑ (k : Kbar K₁ K₂), b k := by
+ by_cases eq : T.isComplete
+ · conv_rhs => rw [←sum_fc_eq_sum (Tc := ⟨T, eq⟩)]
+ refine' Finset.sum_le_s... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_e24ab942700a_0 | 1ca40a4a633437b0 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Lemma4.lean | Lemma4 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "monotone_TransactionsInBlocksFixed",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros π π' h\n dsimp\n apply TransactionsInBlocksFixed_le_of_TransactionsInBlocks; rintro ⟨i, hi⟩; s... | [
{
"name": "senderReceiver_transactionsInBlocks",
"text": "/--\nPAPER: Notice first that we have (s, r) = (s′, r′), since by construction, we have that the\nsender and recipient of the transaction at a given index in the list of partial\ntransactions extracted from a balance proof and block list is only dete... | [
{
"name": "monotone_TransactionsInBlocksFixed",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 649,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": fa... | 3 | import FVIntmax.Balance
namespace Intmax
open Mathlib
noncomputable section Lemma4
/-
To follow the argument in the paper, one has to emulate the set-theoretical set-switching by
abusing the underlying DTT of Lean.
This entire section is not really worth the headache.
-/
section HicSuntDracones
section
variabl... | import FVIntmax.Balance
namespace Intmax
open Mathlib
noncomputable section Lemma4
/-
To follow the argument in the paper, one has to emulate the set-theoretical set-switching by
abusing the underlying DTT of Lean.
This entire section is not really worth the headache.
-/
section HicSuntDracones
section
variabl... | @@ -105,6 +105,23 @@
(TransactionsInBlocks π' bs)[i]'(by blast with π' i)) :
TransactionsInBlocksFixed π bs ≤ TransactionsInBlocksFixed π' bs := Vec.le_of_ext_le h
+/--
+PAPER: Notice first that we have (s, r) = (s′, r′), since by construction, we have that the
+sender and recipient of the transaction at a gi... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_e24ab942700a_1 | d122a349beea3cf4 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Lemma4.lean | Lemma4 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "monotone_TransactionsInBlocksFixed",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros π π' h\n dsimp\n apply TransactionsInBlocksFixed_le_of_TransactionsInBlocks; rintro ⟨i, hi⟩; s... | [
{
"name": "TransactionsInBlocksFixed_le_of_TransactionsInBlocks",
"text": "/--\nWe reason about order of `n`-long vectors generated by `TransactionsInBlocksFixed` by\nextensionally observing the underlying arbitrarily-sized lists for all indices `i < n`.\n-/\nlemma TransactionsInBlocksFixed_le_of_Transactio... | [
{
"name": "lemma4",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 377,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}... | 7 | import FVIntmax.Balance
namespace Intmax
open Mathlib
noncomputable section Lemma4
/-
To follow the argument in the paper, one has to emulate the set-theoretical set-switching by
abusing the underlying DTT of Lean.
This entire section is not really worth the headache.
-/
section HicSuntDracones
section
variabl... | import FVIntmax.Balance
namespace Intmax
open Mathlib
noncomputable section Lemma4
/-
To follow the argument in the paper, one has to emulate the set-theoretical set-switching by
abusing the underlying DTT of Lean.
This entire section is not really worth the headache.
-/
section HicSuntDracones
section
variabl... | @@ -106,6 +106,16 @@
end HelperFunctionsToAppeaseLean
/--
+We reason about order of `n`-long vectors generated by `TransactionsInBlocksFixed` by
+extensionally observing the underlying arbitrarily-sized lists for all indices `i < n`.
+-/
+lemma TransactionsInBlocksFixed_le_of_TransactionsInBlocks
+ (h : ∀ i : Fin ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_0 | 85070f678be9b950 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "iso_of_isLUB",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 117,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -91,8 +91,24 @@
variable {X Y : Type}
-lemma iso_of_isLUB [Setoid' X] {x y join : X} (h : IsLUB {x, y} join) : x ≅ y := sorry
+/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X,... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_1 | 9b055713c275d784 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "proposition4",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 22,
"n_chars": 824,
"n_subproofs": 1,
"n_tactics": 24,
"cyclomatic": 9,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 3 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -92,6 +92,21 @@
variable {X Y : Type}
/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by
+ refine' Iff.intro (λ h ↦ _) (λ h ↦ _)
+ · rcases h w... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_2 | 90336b1db31181a3 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "proposition4'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 388,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 7,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting"... | 4 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -92,6 +92,21 @@
variable {X Y : Type}
/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by
+ refine' Iff.intro (λ h ↦ _) (λ h ↦ _)
+ · rcases h w... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_3 | 34ae98a412c4e050 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "proposition6",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 15,
"n_chars": 584,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 6 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -92,6 +92,21 @@
variable {X Y : Type}
/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by
+ refine' Iff.intro (λ h ↦ _) (λ h ↦ _)
+ · rcases h w... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_4 | 53b7e53393f8adc8 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "proposition6'",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 10,
"n_lines": 15,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesting... | 7 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -92,6 +92,21 @@
variable {X Y : Type}
/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by
+ refine' Iff.intro (λ h ↦ _) (λ h ↦ _)
+ · rcases h w... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_8ef57c6dc818_5 | 0893b812b350d3f5 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Propositions.lean | Propositions | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "iso_of_isLUB",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by rw [←proposition2]; tauto",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "proposition2",
"text": "/--\nPAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x\nand y have a join in X iff x ≃ y\n-/\nlemma proposition2 [Setoid' X] {x y : X} :\n (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by\n refine' Iff.intro (λ h ↦ _) (λ h ↦ _)\n · rcases h... | [
{
"name": "merge_ne_none_of_join_ne_none_iso",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 5,
"n_chars": 220,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fals... | 9 | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | import Mathlib.Order.Bounds.Basic
import Mathlib.Order.Bounds.Defs
import Mathlib.Order.Defs
import Aesop
import FVIntmax.Wheels.Dictionary
namespace Intmax
/--
Definition 15
Let (X, ≤X) be a proset. We define the induced preorder ≤ on
Maybe(X) where for all x, y ∈ M aybe(X) we have
x ≤ y ⇔ x = ⊥ ∨ (x, y ∈ X ∧ x ≤X... | @@ -92,6 +92,21 @@
variable {X Y : Type}
/--
+PAPER: Proposition 2 Let (X, ≃) be a setoid, and let x, y ∈ X. Then we have that x
+and y have a join in X iff x ≃ y
+-/
+lemma proposition2 [Setoid' X] {x y : X} :
+ (∃ join : X, IsLUB {x, y} join) ↔ x ≅ y := by
+ refine' Iff.intro (λ h ↦ _) (λ h ↦ _)
+ · rcases h w... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_0 | 7e63c41ded0de88b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "mergeR''_append",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mergeR''_eq_foldl, mergeR''_eq_foldl, mergeR''_eq_foldl]\n unfold mergeR'''\n rw [←List.foldl_append]",
"n_... | [
{
"name": "mergeR''_eq_foldl",
"text": "lemma mergeR''_eq_foldl :\n mergeR'' πs acc = mergeR''' πs acc := by\n induction' πs with hd tl ih generalizing acc\n · rfl\n · unfold mergeR'' mergeR'''\n simp\n rw [List.foldl_assoc]\n rw [ih]\n conv_lhs => unfold mergeR'''\n\n",
"fan_in": 1,
... | [
{
"name": "mergeR''_append",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 219,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -71,13 +71,26 @@
(Dict.Merge (α := (C × K₂)) (ω := ((Pi × ExtraDataT) × TransactionBatch K₁ K₂ V))) :=
⟨λ _ _ _ ↦ Dict.Merge_assoc⟩
+lemma mergeR''_eq_foldl :
+ mergeR'' πs acc = mergeR''' πs acc := by
+ induction' πs with hd tl ih generalizing acc
+ · rfl
+ · unfold mergeR'' mergeR'''
+ si... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_1 | cc5924d955c54ffa | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "Merge_mergeR''_comm",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction' πs with hd tl ih generalizing acc\n · simp; exact Merge_comm_of_compat (BalanceProof.compat_comm.1 h)\n · ... | [
{
"name": "Merge_iso_of_iso",
"text": "lemma Merge_iso_of_iso (h : π₁ ≅ π₂) :\n π₁ <+> π₃ ≅ π₂ <+> π₃ := by\n simp [iso] at *\n unfold LE.le Preorder.toLE instPreorderBalanceProof id inferInstance _root_.Pi.preorder at *\n simp [inferInstanceAs, id, _root_.Pi.hasLe, -Prod.forall] at *\n rcases h with ⟨... | [
{
"name": "Merge_mergeR''_comm",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 423,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_ne... | 2 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -136,11 +136,23 @@
intros x; specialize h x; specialize h₁ x
aesop
+lemma Merge_iso_of_iso (h : π₁ ≅ π₂) :
+ π₁ <+> π₃ ≅ π₂ <+> π₃ := by
+ simp [iso] at *
+ unfold LE.le Preorder.toLE instPreorderBalanceProof id inferInstance _root_.Pi.preorder at *
+ simp [inferInstanceAs, id, _root_.Pi.hasLe, -Prod.for... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_2 | a18007f98562d093 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "merge_le",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h₃ : π₁ <≅> π₂ := by\n intros k hk\n simp [-Prod.forall, (·≤·)] at h₁ h₂\n specialize h₁ k\n specialize h₂ k\n ... | [
{
"name": "existsLUB_iff_compat",
"text": "lemma existsLUB_iff_compat :\n (∃ join, IsLUB {π₁, π₂} join) ↔ π₁ <≅> π₂ := proposition6\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 108,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_... | [
{
"name": "merge_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 823,
"n_subproofs": 6,
"n_tactics": 23,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 9,
"automation_only": false,
"max_nesting": 4
... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -127,6 +127,9 @@
@[simp]
lemma BalanceProof.compat_rfl : π₁ <≅> π₁ := by unfold BalanceProof.compat; tauto
+lemma existsLUB_iff_compat :
+ (∃ join, IsLUB {π₁, π₂} join) ↔ π₁ <≅> π₂ := proposition6
+
@[simp]
lemma snd_eq_of_iso {d₁ d₂ : (Pi × ExtraDataT) × TransactionBatch K₁ K₂ V} :
d₁.2 = d₂.2 ↔ (d₁ ≅ d₂)... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_3 | 69c48e0fe785655b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "mergeR''_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction πs generalizing acc <;> aesop (add simp merge_K)",
"n_chars": 65,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "merge_K",
"text": "lemma merge_K : (π <+> acc) K = Dict.First (π K) (acc K) := rfl\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": t... | [
{
"name": "mergeR''_eq_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -228,13 +228,22 @@
(mergeR'' πs acc) K = none ↔ acc K = none ∧ ∀ π ∈ πs, π K = none := by
induction' πs with hd tl ih generalizing acc <;> aesop
+lemma merge_K : (π <+> acc) K = Dict.First (π K) (acc K) := rfl
+
@[simp]
lemma mergeR''_eq_some {x} :
- acc K = some x → (mergeR'' πs acc) K = acc K := sorry
+... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_4 | a6980f1a1d6f7fd4 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "mergeR''_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction πs generalizing acc <;> aesop (add simp merge_K)",
"n_chars": 65,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "merge_K",
"text": "lemma merge_K : (π <+> acc) K = Dict.First (π K) (acc K) := rfl\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": t... | [
{
"name": "iso_K_merge_right_of_ne_none_compat",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 210,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -228,16 +228,30 @@
(mergeR'' πs acc) K = none ↔ acc K = none ∧ ∀ π ∈ πs, π K = none := by
induction' πs with hd tl ih generalizing acc <;> aesop
+lemma merge_K : (π <+> acc) K = Dict.First (π K) (acc K) := rfl
+
@[simp]
lemma mergeR''_eq_some {x} :
- acc K = some x → (mergeR'' πs acc) K = acc K := sorry
+... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_5 | 317095441eae952f | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "valid_mergeR'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases n with ⟨n, hn⟩\n induction' n with n ih generalizing πs\n · unfold mergeR'; aesop (add safe apply List.getElem_mem)\... | [
{
"name": "verify_merge_of_valid",
"text": "lemma verify_merge_of_valid {π₁ π₂ : BalanceProof K₁ K₂ C Pi V}\n (h₁ : π₁.Verify (M := (C × K₁ × ExtraDataT)))\n (h₂ : π₂.Verify (M := (C × K₁ × ExtraDataT))) :\n BalanceProof.Verify... | [
{
"name": "valid_mergeR'",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_nesting"... | 2 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -253,13 +253,28 @@
variable [AD : ADScheme K₂ (C × K₁ × ExtraDataT) C Pi]
+lemma verify_merge_of_valid {π₁ π₂ : BalanceProof K₁ K₂ C Pi V}
+ (h₁ : π₁.Verify (M := (C × K₁ × ExtraDataT)))
+ (h₂ : π₂.Verify (M := (C × K₁ × ExtraDataT))) :
+ ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_6 | a2ccfed1af0f70c9 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "valid_mergeR'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases n with ⟨n, hn⟩\n induction' n with n ih generalizing πs\n · unfold mergeR'; aesop (add safe apply List.getElem_mem)\... | [
{
"name": "verify_merge_of_valid",
"text": "lemma verify_merge_of_valid {π₁ π₂ : BalanceProof K₁ K₂ C Pi V}\n (h₁ : π₁.Verify (M := (C × K₁ × ExtraDataT)))\n (h₂ : π₂.Verify (M := (C × K₁ × ExtraDataT))) :\n BalanceProof.Verify... | [
{
"name": "valid_mergeR''_aux",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 612,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -249,6 +249,20 @@
variable [AD : ADScheme K₂ (C × K₁ × ExtraDataT) C Pi]
+lemma verify_merge_of_valid {π₁ π₂ : BalanceProof K₁ K₂ C Pi V}
+ (h₁ : π₁.Verify (M := (C × K₁ × ExtraDataT)))
+ (h₂ : π₂.Verify (M := (C × K₁ × ExtraDataT))) :
+ ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_7 | 3e6cb899c3a4f9a5 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "le_mergeR''_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction' πs with hd tl ih generalizing π acc\n · simp [mergeR'', h, h₀]\n · simp\n apply le_Merge_of_le_le h₀\n a... | [
{
"name": "le_Merge_of_le_le",
"text": "lemma le_Merge_of_le_le\n {π π₁ π₂ : BalanceProof K₁ K₂ C Pi V}\n {k : C × K₂}\n (h : π k ≤ π₁ k)\n (h₁ : π k ≤ π₂ k) :\n π k ≤ Dict.Merge π₁ π₂ k := by\n unfold Dict.Merge Dict.Merge.D Dict.First\n aesop\n\n",
"fan_in": 1,
... | [
{
"name": "le_mergeR''_aux",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 507,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -282,6 +282,15 @@
(mergeR'' (πs.take n) .initial).Verify (M := (C × K₁ × ExtraDataT)) :=
valid_mergeR''_aux hn (by simp) h
+lemma le_Merge_of_le_le
+ {π π₁ π₂ : BalanceProof K₁ K₂ C Pi V}
+ {k : C × K₂}
+ (h : π k ≤ π₁ k)
+ (h₁ : π k ≤ π₂ k) :
+ π k ≤ Dict.Merge π₁ π₂ k := ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_8 | 18b06ba7c64c9a8f | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "merge_lem",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [merge_lem_aux]; simp",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "merge_lem_aux",
"text": "private lemma merge_lem_aux :\n mergeR'' (π :: πs) acc = acc <+> π <+> (mergeR'' πs BalanceProof.initial) := by\n rcases πs with ⟨hd, tl⟩ <;> simp [Dict.Merge_assoc]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "merge_lem",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -296,8 +296,13 @@
have := (Dict.Merge_assoc (D₁ := acc) (D₂ := mergeR'' (List.take i πs) π) (D₃ := πs[i])).symm
aesop
+private lemma merge_lem_aux :
+ mergeR'' (π :: πs) acc = acc <+> π <+> (mergeR'' πs BalanceProof.initial) := by
+ rcases πs with ⟨hd, tl⟩ <;> simp [Dict.Merge_assoc]
+
lemma merge_lem... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_87cb2997800d_9 | 5548f208b7eb8663 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Theorem1.lean | Theorem1 | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "compat_merge_of_compat",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction πs generalizing π with\n | nil =>\n intros π\n unfold BalanceProof.compat BalanceProof.initial\n ... | [
{
"name": "merge_lem",
"text": "lemma merge_lem :\n mergeR'' (π :: πs) BalanceProof.initial = π <+> (mergeR'' πs BalanceProof.initial) := by\n rw [merge_lem_aux]; simp\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automat... | [
{
"name": "compat_merge_of_compat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"ma... | 3 | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | import FVIntmax.AttackGame
import FVIntmax.Lemma3
import FVIntmax.Lemma4
import FVIntmax.Lemma5
import FVIntmax.Propositions
import FVIntmax.Request
import FVIntmax.Wheels
import FVIntmax.Wheels.AuthenticatedDictionary
import FVIntmax.Wheels.SignatureAggregation
import Mathlib
set_option lang.lemmaCmd true
set_optio... | @@ -300,6 +300,10 @@
mergeR'' (π :: πs) acc = acc <+> π <+> (mergeR'' πs BalanceProof.initial) := by
rcases πs with ⟨hd, tl⟩ <;> simp [Dict.Merge_assoc]
+lemma merge_lem :
+ mergeR'' (π :: πs) BalanceProof.initial = π <+> (mergeR'' πs BalanceProof.initial) := by
+ rw [merge_lem_aux]; simp
+
lemma compat_lem ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_1aca4db3f9f8_0 | 4e8a736d9b75b81b | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Wheels/Dictionary.lean | Dictionary | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "keys_Merge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Merge Merge.D keys\n simp [is_mem, mem_iff_isSome]\n rfl",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "mem_iff_isSome",
"text": "lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 85,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "keys_Merge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 206,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 1 | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | @@ -50,8 +50,13 @@
def Merge (D₁ D₂ : Dict α ω) : Dict α ω := D
where D := λ x ↦ First (D₁ x) (D₂ x)
+lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl
+
@[simp]
-lemma keys_Merge {D₁ D₂ : Dict α ω} : (Merge D₁ D₂).keys = D₁.keys ∪ D₂.keys := sorry
+lemma keys_Merge {D₁ D₂ : Dict α ω} ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_1aca4db3f9f8_1 | d270527bb39b37e4 | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Wheels/Dictionary.lean | Dictionary | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "keys_Merge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Merge Merge.D keys\n simp [is_mem, mem_iff_isSome]\n rfl",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "mem_iff_isSome",
"text": "lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 85,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "keys_Merge_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 286,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | @@ -50,8 +50,13 @@
def Merge (D₁ D₂ : Dict α ω) : Dict α ω := D
where D := λ x ↦ First (D₁ x) (D₂ x)
+lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl
+
@[simp]
-lemma keys_Merge {D₁ D₂ : Dict α ω} : (Merge D₁ D₂).keys = D₁.keys ∪ D₂.keys := sorry
+lemma keys_Merge {D₁ D₂ : Dict α ω} ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_1aca4db3f9f8_2 | 07d6027f3931d90d | lean | lean | github.com/NethermindEth/FVIntmax | d7c4cbc5ec449471952ac5468f3b55bf61f5868e | FVIntmax/Wheels/Dictionary.lean | Dictionary | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "keys_Merge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Merge Merge.D keys\n simp [is_mem, mem_iff_isSome]\n rfl",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 4,... | [
{
"name": "mem_iff_isSome",
"text": "lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 85,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "keys_Merge_right'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 235,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 1 | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | import FVIntmax.Wheels.Wheels
import Mathlib.Data.Set.Basic
namespace Intmax
/-
NB PAPER: Definition 1 - Let X be a set. We define Maybe ...
This is Lean's `Option` type, for which we have a litany of lemmas.
As such, we use this without abbreviating to `Maybe`.
-/
/--
PAPER: Given two sets X and Y, we define Dict(X... | @@ -50,8 +50,13 @@
def Merge (D₁ D₂ : Dict α ω) : Dict α ω := D
where D := λ x ↦ First (D₁ x) (D₂ x)
+lemma mem_iff_isSome {m : Dict α ω} {x : α} : x ∈ m ↔ (m x).isSome := by rfl
+
@[simp]
-lemma keys_Merge {D₁ D₂ : Dict α ω} : (Merge D₁ D₂).keys = D₁.keys ∪ D₂.keys := sorry
+lemma keys_Merge {D₁ D₂ : Dict α ω} ... | {
"repo": "FVIntmax",
"git_repo": "github.com/NethermindEth/FVIntmax",
"revision": "d7c4cbc5ec449471952ac5468f3b55bf61f5868e",
"lean_toolchain": "leanprover/lean4:v4.14.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-d... |
ablate_13b5918fd9b1_0 | 465e6e7d6507c119 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/SecondOrder/Syntax/Rew.lean | Rew | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "app_comm_subst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction φ using Semiformula.rec' generalizing N₂ n₂ <;>\n simp [*, ←FirstOrder.TransitiveRewriting.comp_app, FirstOrder... | [
{
"name": "q_subst",
"text": "lemma q_subst (Φ : Fin N₁ → Semiformula L Ξ₁ ξ N₂ 1) :\n (subst Φ)𐞥 = subst ((#0 ∈# 0) :> fun X ↦ (Φ X).bmap .succ) := by\n ext X\n · cases X using Fin.cases <;> simp [subst]\n · simp [subst]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 217,
"n_subproofs":... | [
{
"name": "app_comm_subst",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 470,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | @@ -287,7 +287,10 @@
end
lemma app_comm_subst {N₁ N₂} (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) (v : Fin n₁ → Semiterm L ξ n₂) (φ : Semiformula L Ξ₁ ξ N₁ n₁) :
- Ω • (FirstOrder.Rew.subst v ▹ φ) = FirstOrder.Rew.subst v ▹ (Ω • φ) := sorry
+ Ω • (FirstOrder.Rew.subst v ▹ φ) = FirstOrder.Rew.subst v ▹ (Ω • φ) := by
+ inductio... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_13b5918fd9b1_1 | f69214ea831f5221 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/SecondOrder/Syntax/Rew.lean | Rew | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "bLeft_q",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext X\n · cases X using Fin.cases <;> simp [q_bv_succ, bLeft_bv, bmap_comp]\n · simp [q_fv, bLeft_fv, bmap_comp]",
"n_chars":... | [
{
"name": "bmap_comp",
"text": "lemma bmap_comp {M N n} (f : Fin N → Fin M) (g : Fin M → Fin P) (φ : Semiformula L Ξ ξ N n) :\n (φ.bmap f).bmap g = φ.bmap (g ∘ f) := by\n induction φ using Semiformula.rec' generalizing M P <;> simp [*]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 219,
"n_... | [
{
"name": "bLeft_q",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 260,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
}... | 1 | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | @@ -167,6 +167,10 @@
@[simp] lemma bmap_exs₁ (φ : Semiformula L Ξ ξ (N + 1) n) :
(∃¹ φ).bmap f = ∃¹ (φ.bmap (Fin.retrusion f)) := rfl
+lemma bmap_comp {M N n} (f : Fin N → Fin M) (g : Fin M → Fin P) (φ : Semiformula L Ξ ξ N n) :
+ (φ.bmap f).bmap g = φ.bmap (g ∘ f) := by
+ induction φ using Semiformula.rec'... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_13b5918fd9b1_2 | efe914b33f507b6c | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/SecondOrder/Syntax/Rew.lean | Rew | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "bmap_app_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction φ using Semiformula.rec' generalizing N₁ N₂ <;> simp [*, bRight_q]",
"n_chars": 87,
"n_subproofs": 0,
"n_... | [
{
"name": "bRight_q",
"text": "lemma bRight_q (f : Fin N₀ → Fin N₁) (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) :\n (Ω.bRight f)𐞥 = Ω𐞥.bRight (Fin.retrusion f) := by\n ext X\n · cases X using Fin.cases <;> simp [bRight_bv]\n · simp [bRight_fv]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 226,
"n_subpro... | [
{
"name": "bmap_app_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | @@ -346,8 +346,15 @@
@[simp] lemma bRight_fv (f : Fin N₀ → Fin N₁) (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) (X : Ξ₁) :
(Ω.bRight f).fv X = Ω.fv X := rfl
+lemma bRight_q (f : Fin N₀ → Fin N₁) (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) :
+ (Ω.bRight f)𐞥 = Ω𐞥.bRight (Fin.retrusion f) := by
+ ext X
+ · cases X using Fin.cases <;> simp [bRi... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_13b5918fd9b1_3 | 1ad716e146672442 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/SecondOrder/Syntax/Rew.lean | Rew | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "app_comp",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction φ using Semiformula.rec' generalizing N₂ N₃ <;> simp [*, app_comm_subst]",
"n_chars": 93,
"n_subproofs": 0,
... | [
{
"name": "app_comm_subst",
"text": "lemma app_comm_subst {N₁ N₂} (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) (v : Fin n₁ → Semiterm L ξ n₂) (φ : Semiformula L Ξ₁ ξ N₁ n₁) :\n Ω • (FirstOrder.Rew.subst v ▹ φ) = FirstOrder.Rew.subst v ▹ (Ω • φ) := by\n induction φ using Semiformula.rec' generalizing N₂ n₂ <;>\n simp [*... | [
{
"name": "app_comp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 5,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | module
public import Foundation.SecondOrder.Syntax.Formula
@[expose] public section
namespace Fin
def retrusion (f : Fin n → Fin m) : Fin (n + 1) → Fin (m + 1) := 0 :> fun i ↦ (f i).succ
@[simp] lemma retrusion_zero (f : Fin n → Fin m) : retrusion f 0 = 0 := rfl
@[simp] lemma retrusion_succ (f : Fin n → Fin m) (i... | @@ -286,6 +286,12 @@
end
+lemma app_comm_subst {N₁ N₂} (Ω : Rew L Ξ₁ N₁ Ξ₂ N₂ ξ) (v : Fin n₁ → Semiterm L ξ n₂) (φ : Semiformula L Ξ₁ ξ N₁ n₁) :
+ Ω • (FirstOrder.Rew.subst v ▹ φ) = FirstOrder.Rew.subst v ▹ (Ω • φ) := by
+ induction φ using Semiformula.rec' generalizing N₂ n₂ <;>
+ simp [*, ←FirstOrder.Tran... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_4205a1ec96c0_0 | b0f6804930b71d22 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/Entailment/E.lean | E | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "diaItr_duality!_mp",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " C_of_E_mp! diaItr_duality!",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automati... | [
{
"name": "diaItr_duality!",
"text": "lemma diaItr_duality! : 𝓢 ⊢ ◇^[n]φ 🡘 ∼(□^[n](∼φ)) := ⟨multiDiaDuality⟩\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"au... | [
{
"name": "diaItr_duality!_mp",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 2,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | module
public import Foundation.Modal.Entailment.DiaDuality
@[expose] public section
namespace LO.Modal.Entailment
open LO.Entailment LO.Entailment.FiniteContext
variable {S F : Type*} [BasicModalLogicalConnective F] [Entailment S F]
variable {𝓢 : S} [Entailment.E 𝓢] {n : ℕ} {φ ψ ξ χ: F}
variable [DecidableEq F... | module
public import Foundation.Modal.Entailment.DiaDuality
@[expose] public section
namespace LO.Modal.Entailment
open LO.Entailment LO.Entailment.FiniteContext
variable {S F : Type*} [BasicModalLogicalConnective F] [Entailment S F]
variable {𝓢 : S} [Entailment.E 𝓢] {n : ℕ} {φ ψ ξ χ: F}
variable [DecidableEq F... | @@ -59,6 +59,8 @@
apply E_intro;
. exact CN_of_CN_left $ K_right ih;
. exact CN_of_CN_right $ K_left ih;
+lemma diaItr_duality! : 𝓢 ⊢ ◇^[n]φ 🡘 ∼(□^[n](∼φ)) := ⟨multiDiaDuality⟩
+
def diaItrDuality_mp : 𝓢 ⊢! ◇^[n]φ 🡒 ∼(□^[n](∼φ)) := K_left multiDiaDuality
def diaDuality_mp : 𝓢 ⊢! ◇φ 🡒 ∼(□(∼φ)) := ... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_4205a1ec96c0_1 | 80cd21da722ee852 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/Entailment/E.lean | E | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "diaItr_duality!_mp",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " C_of_E_mp! diaItr_duality!",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automati... | [
{
"name": "diaItr_duality!",
"text": "lemma diaItr_duality! : 𝓢 ⊢ ◇^[n]φ 🡘 ∼(□^[n](∼φ)) := ⟨multiDiaDuality⟩\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"au... | [
{
"name": "diaItr_duality'!",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 205,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 1 | module
public import Foundation.Modal.Entailment.DiaDuality
@[expose] public section
namespace LO.Modal.Entailment
open LO.Entailment LO.Entailment.FiniteContext
variable {S F : Type*} [BasicModalLogicalConnective F] [Entailment S F]
variable {𝓢 : S} [Entailment.E 𝓢] {n : ℕ} {φ ψ ξ χ: F}
variable [DecidableEq F... | module
public import Foundation.Modal.Entailment.DiaDuality
@[expose] public section
namespace LO.Modal.Entailment
open LO.Entailment LO.Entailment.FiniteContext
variable {S F : Type*} [BasicModalLogicalConnective F] [Entailment S F]
variable {𝓢 : S} [Entailment.E 𝓢] {n : ℕ} {φ ψ ξ χ: F}
variable [DecidableEq F... | @@ -59,6 +59,8 @@
apply E_intro;
. exact CN_of_CN_left $ K_right ih;
. exact CN_of_CN_right $ K_left ih;
+lemma diaItr_duality! : 𝓢 ⊢ ◇^[n]φ 🡘 ∼(□^[n](∼φ)) := ⟨multiDiaDuality⟩
+
def diaItrDuality_mp : 𝓢 ⊢! ◇^[n]φ 🡒 ∼(□^[n](∼φ)) := K_left multiDiaDuality
def diaDuality_mp : 𝓢 ⊢! ◇φ 🡒 ∼(□(∼φ)) := ... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_feaf69d482c5_0 | 560e9f0948104c6c | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/SetTheory/Basic/Misc.lean | Misc | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "standardStructure_unique",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n standardStructure_unique' M s hEq hMem",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic... | [
{
"name": "standardStructure_unique'",
"text": "lemma standardStructure_unique' (s : Structure ℒₛₑₜ M)\n (hEq : Structure.Eq ℒₛₑₜ M) (hMem : Structure.Mem ℒₛₑₜ M) : s = standardStructure M := Structure.ext\n (funext₃ fun k f ↦ Empty.elim f)\n (funext₃ fun k r _ =>\n match k, r with\n | _, Languag... | [
{
"name": "standardStructure_unique",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 233,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | @@ -142,8 +142,17 @@
instance : Structure.Mem ℒₛₑₜ M := ⟨fun _ _ ↦ iff_of_eq rfl⟩
-lemma standardStructure_unique (s : Structure ℒₛₑₜ M) [hEq : Structure.Eq ℒₛₑₜ M] [hMem : Structure.Mem ℒₛₑₜ M] : s = standardStructure M := sorry
+lemma standardStructure_unique' (s : Structure ℒₛₑₜ M)
+ (hEq : Structure.Eq ℒₛₑₜ... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_feaf69d482c5_1 | aaee9ba4f5de75f4 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/SetTheory/Basic/Misc.lean | Misc | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "countable_of_countable",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n have : #M ≤ ℵ₀ := mk_le_aleph0_iff.mpr c\n mk_le_aleph0_iff.mp <| le_trans (card_le M) this",
"n_chars": 100,
... | [
{
"name": "card_le",
"text": "lemma card_le : #(QuotNormalize M) ≤ #M := calc\n #(QuotNormalize M) = #(Structure.Eq.QuotEq ℒₛₑₜ M) := by\n simpa using Cardinal.mk_congr_lift equiv'\n _ ≤ #M := Cardinal.mk_quotient_le\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 203,
"n_subproofs": 0,
... | [
{
"name": "countable_of_countable",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 181,
"n_subproofs": 1,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | @@ -189,8 +189,15 @@
variable (M)
-lemma countable_of_countable [c : Countable M] : Countable (QuotNormalize M) := sorry
+lemma card_le : #(QuotNormalize M) ≤ #M := calc
+ #(QuotNormalize M) = #(Structure.Eq.QuotEq ℒₛₑₜ M) := by
+ simpa using Cardinal.mk_congr_lift equiv'
+ _ ≤ #M := Cardinal.mk_quotient_le
... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_feaf69d482c5_2 | 11ccc1c9ddff04b4 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/SetTheory/Basic/Misc.lean | Misc | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "consequence_of_models",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " consequence_of_aux T φ fun M _ s _ _ ↦ by\n rcases standardStructure_unique M s\n exact H M",
"n_chars": 95,
"n_s... | [
{
"name": "standardStructure_unique",
"text": "lemma standardStructure_unique (s : Structure ℒₛₑₜ M) [hEq : Structure.Eq ℒₛₑₜ M] [hMem : Structure.Mem ℒₛₑₜ M] : s = standardStructure M :=\n standardStructure_unique' M s hEq hMem\n\n\n/- ### Normalization -/\n\n",
"fan_in": 1,
"n_lines": 7,
"n_c... | [
{
"name": "consequence_of_models",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 309,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 3 | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | @@ -161,6 +161,11 @@
| _, Language.Eq.eq => by simp
| _, Language.Mem.mem => by simp)
+lemma standardStructure_unique (s : Structure ℒₛₑₜ M) [hEq : Structure.Eq ℒₛₑₜ M] [hMem : Structure.Mem ℒₛₑₜ M] : s = standardStructure M :=
+ standardStructure_unique' M s hEq hMem
+
+/- ### Normalization -/
+
/-- Norm... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_feaf69d482c5_3 | 756065b3e2c70219 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/SetTheory/Basic/Misc.lean | Misc | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "provable_of_models",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " Theory.Proof.complete <| consequence_of_models _ _ H",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 1,
"cyclo... | [
{
"name": "consequence_of_models",
"text": "lemma consequence_of_models (T : SetTheory) [𝗘𝗤 _ ⪯ T] (φ : SetTheorySentence) (H : ∀ (M : Type*) [SetStructure M] [Nonempty M] [M↓[ℒₛₑₜ] ⊧* T], M↓[ℒₛₑₜ] ⊧ φ) :\n T ⊨ φ := consequence_of_aux T φ fun M _ s _ _ ↦ by\n rcases standardStructure_unique M s\n exa... | [
{
"name": "provable_of_models",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 4,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 4 | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | module
public import Foundation.FirstOrder.Completeness.CounterModel
public import Mathlib.SetTheory.Cardinal.Basic
@[expose] public section
/-! # Preperations for set theory
- *NOTE*:
To avoid the duplicate definitions of `Structure ℒₛₑₜ` for models,
we basically use `SetStructure`, and generated `standardStruc... | @@ -217,8 +217,13 @@
end semantics
+lemma consequence_of_models (T : SetTheory) [𝗘𝗤 _ ⪯ T] (φ : SetTheorySentence) (H : ∀ (M : Type*) [SetStructure M] [Nonempty M] [M↓[ℒₛₑₜ] ⊧* T], M↓[ℒₛₑₜ] ⊧ φ) :
+ T ⊨ φ := consequence_of_aux T φ fun M _ s _ _ ↦ by
+ rcases standardStructure_unique M s
+ exact H M
+
lemma... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_c14777bfe4dc_0 | 751a23f45cac898c | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/Kripke/WeakForcing.lean | WeakForcing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "emb",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp [rew, Empty.eq_elim]",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"... | [
{
"name": "rew",
"text": "lemma rew {bv : Fin n₂ → Name} {fv : ξ₂ → Name} {ω : Rew L ξ₁ n₁ ξ₂ n₂} {φ : Semiformula L ξ₁ n₁} :\n p ⊩ᶜ[bv|fv] (ω ▹ φ) ↔\n p ⊩ᶜ[fun x ↦ (ω #x).relationalVal bv fv|fun x ↦ (ω &x).relationalVal bv fv] φ := by\n simp [WeaklyForces, ←Semiformula.rew_doubleNegation, Forces.rew... | [
{
"name": "emb",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 195,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 1
}
] | 1 | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | @@ -54,9 +54,14 @@
@[simp] lemma all_of_constantDomain [ConstantDomain ℙ] {φ : Semiformula L ξ (n + 1)} :
p ⊩ᶜ[bv|fv] ∀⁰ φ ↔ ∀ x : Name, p ⊩ᶜ[x :> bv|fv] φ := by simp [WeaklyForces, -Forces.all]
+lemma rew {bv : Fin n₂ → Name} {fv : ξ₂ → Name} {ω : Rew L ξ₁ n₁ ξ₂ n₂} {φ : Semiformula L ξ₁ n₁} :
+ p ⊩ᶜ[bv|fv]... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_c14777bfe4dc_1 | bcf5186ebee39dc0 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/Kripke/WeakForcing.lean | WeakForcing | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "not",
"depth": 1,
"n_commands": 0,
"n_lines": 81,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n match φ with\n | .rel R v => by\n suffices\n (∀ q ≤ p, ¬Rel q R fun i ↦ (v i).relationalVal bv fv) ↔\n (∀ q ≤ p, ∃ r ≤ q, ∀... | [
{
"name": "generic_iff_not",
"text": "lemma generic_iff_not {φ : Semiformula L ξ n} :\n ¬p ⊩ᶜ[bv|fv] φ ↔ ∃ q ≤ p, ∀ r ≤ q, ¬r ⊩ᶜ[bv|fv] φ := by simpa using generic_iff.not\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "not",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 84,
"n_chars": 3476,
"n_subproofs": 6,
"n_tactics": 84,
"cyclomatic": 19,
"n_automation": 19,
"n_rewrites": 0,
"n_structural": 54,
"automation_only": false,
"max_nesting": 8
... | 1 | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | @@ -141,6 +141,9 @@
p ⊩ᶜ[bv|fv] φ ↔ ∀ q ≤ p, ∃ r ≤ q, r ⊩ᶜ[bv|fv] φ :=
⟨fun H q hqp ↦ ⟨q, by rfl, H.monotone q hqp⟩, generic⟩
+lemma generic_iff_not {φ : Semiformula L ξ n} :
+ ¬p ⊩ᶜ[bv|fv] φ ↔ ∃ q ≤ p, ∀ r ≤ q, ¬r ⊩ᶜ[bv|fv] φ := by simpa using generic_iff.not
+
@[simp] lemma not {p : ℙ} {n} {bv : Fin n →... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_c14777bfe4dc_2 | 578791b57da2e23b | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/Kripke/WeakForcing.lean | WeakForcing | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "not",
"depth": 1,
"n_commands": 0,
"n_lines": 81,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n match φ with\n | .rel R v => by\n suffices\n (∀ q ≤ p, ¬Rel q R fun i ↦ (v i).relationalVal bv fv) ↔\n (∀ q ≤ p, ∃ r ≤ q, ∀... | [
{
"name": "generic_iff_not",
"text": "lemma generic_iff_not {φ : Semiformula L ξ n} :\n ¬p ⊩ᶜ[bv|fv] φ ↔ ∃ q ≤ p, ∀ r ≤ q, ¬r ⊩ᶜ[bv|fv] φ := by simpa using generic_iff.not\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "generic_iff_not'",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 4,
"n_chars": 150,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | @@ -141,6 +141,9 @@
p ⊩ᶜ[bv|fv] φ ↔ ∀ q ≤ p, ∃ r ≤ q, r ⊩ᶜ[bv|fv] φ :=
⟨fun H q hqp ↦ ⟨q, by rfl, H.monotone q hqp⟩, generic⟩
+lemma generic_iff_not {φ : Semiformula L ξ n} :
+ ¬p ⊩ᶜ[bv|fv] φ ↔ ∃ q ≤ p, ∀ r ≤ q, ¬r ⊩ᶜ[bv|fv] φ := by simpa using generic_iff.not
+
@[simp] lemma not {p : ℙ} {n} {bv : Fin n →... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_c14777bfe4dc_3 | b2cf9675f892552b | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/Kripke/WeakForcing.lean | WeakForcing | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "sound",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n WeaklyForces₀.sound₀",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_r... | [
{
"name": "sound₀",
"text": "lemma sound₀ {σ : Sentence L} : 𝐋𝐊¹ ⊢ (σ : Proposition L) → ℙ ∀⊩ᶜ σ := fun b p ↦ by\n simpa using! sound b p (fun _ ↦ (Classical.ofNonempty : p).val) fun _ ↦ by simp\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 197,
"n_subproofs": 0,
"n_tactics": 2,
"cy... | [
{
"name": "sound",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 114,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}
] | 1 | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | module
public import Foundation.FirstOrder.Kripke.Intuitionistic
public import Foundation.FirstOrder.NegationTranslation.GoedelGentzen
@[expose] public section
/-! # Weak forcing
Main reference: Jeremy Avigad, "Forcing in proof theory" [Avi04]
-/
namespace LO.FirstOrder
variable {L : Language.{u}} [L.Relational]
... | @@ -282,6 +282,9 @@
have : 𝗜𝗻𝘁¹ ⊢ φᴺ := Provable.gödel_gentzen b
exact Forces.sound p fv Hfv this
+lemma sound₀ {σ : Sentence L} : 𝐋𝐊¹ ⊢ (σ : Proposition L) → ℙ ∀⊩ᶜ σ := fun b p ↦ by
+ simpa using! sound b p (fun _ ↦ (Classical.ofNonempty : p).val) fun _ ↦ by simp
+
end WeaklyForces₀
end KripkeModel
@... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_fd03b6803bbe_0 | d78b2ebd91c48657 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/ModalCompanion/Standard/Cl.lean | Cl | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "modalCompanion_S5",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply modalCompanion_via_kripkeSemantics (P := λ F => IsRightEuclidean F);\n . apply provable_S5_of_mem;\n . intro φ;\... | [
{
"name": "provable_S5_of_mem",
"text": "lemma provable_S5_of_mem : φ ∈ Propositional.Cl → Modal.S5 ⊢ φᵍ := by\n apply Propositional.Hilbert.provable_gödelTranslated_of_mem_logic;\n rintro _ ⟨a, (⟨_, rfl⟩ | ⟨_, _, rfl⟩), rfl⟩ <;> simp;\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 219,
"n_su... | [
{
"name": "modalCompanion_S5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 398,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 8,
"automation_only": false,
"max_nes... | 1 | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | @@ -37,9 +37,13 @@
namespace Propositional.Cl
+lemma provable_S5_of_mem : φ ∈ Propositional.Cl → Modal.S5 ⊢ φᵍ := by
+ apply Propositional.Hilbert.provable_gödelTranslated_of_mem_logic;
+ rintro _ ⟨a, (⟨_, rfl⟩ | ⟨_, _, rfl⟩), rfl⟩ <;> simp;
+
theorem modalCompanion_S5 : ModalCompanion Propositional.Cl Modal.S5... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_fd03b6803bbe_1 | 5cc2cac371742058 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/ModalCompanion/Standard/Cl.lean | Cl | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "modalCompanion_S5",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply modalCompanion_via_kripkeSemantics (P := λ F => IsRightEuclidean F);\n . apply provable_S5_of_mem;\n . intro φ;\... | [
{
"name": "provable_S5_of_mem",
"text": "lemma provable_S5_of_mem : φ ∈ Propositional.Cl → Modal.S5 ⊢ φᵍ := by\n apply Propositional.Hilbert.provable_gödelTranslated_of_mem_logic;\n rintro _ ⟨a, (⟨_, rfl⟩ | ⟨_, _, rfl⟩), rfl⟩ <;> simp;\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 219,
"n_su... | [
{
"name": "provable_S5Grz_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 3,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | @@ -37,8 +37,12 @@
namespace Propositional.Cl
-lemma provable_S5Grz_of_mem : φ ∈ Propositional.Cl → Modal.S5Grz ⊢ φᵍ := sorry
+lemma provable_S5_of_mem : φ ∈ Propositional.Cl → Modal.S5 ⊢ φᵍ := by
+ apply Propositional.Hilbert.provable_gödelTranslated_of_mem_logic;
+ rintro _ ⟨a, (⟨_, rfl⟩ | ⟨_, _, rfl⟩), rfl⟩ <... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_fd03b6803bbe_2 | d4356dce04dd09b2 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/ModalCompanion/Standard/Cl.lean | Cl | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "modalCompanion_S5Grz",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply modalCompanion_via_kripkeSemantics (P := λ {κ} F => Finite κ ∧ Std.Symm F);\n . apply provable_S5Grz_of_mem;\n... | [
{
"name": "provable_S5Grz_of_mem",
"text": "lemma provable_S5Grz_of_mem : φ ∈ Propositional.Cl → Modal.S5Grz ⊢ φᵍ := fun h ↦ WeakerThan.pbl $ provable_S5_of_mem h\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0... | [
{
"name": "modalCompanion_S5Grz",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 440,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 8,
"automation_only": false,
"max_... | 2 | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | @@ -41,9 +41,11 @@
apply Propositional.Hilbert.provable_gödelTranslated_of_mem_logic;
rintro _ ⟨a, (⟨_, rfl⟩ | ⟨_, _, rfl⟩), rfl⟩ <;> simp;
+lemma provable_S5Grz_of_mem : φ ∈ Propositional.Cl → Modal.S5Grz ⊢ φᵍ := fun h ↦ WeakerThan.pbl $ provable_S5_of_mem h
+
theorem modalCompanion_S5Grz : ModalCompanion Pro... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_fd03b6803bbe_3 | 8c7c2c523252a0d9 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/ModalCompanion/Standard/Cl.lean | Cl | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "modalCompanion_Triv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro φ;\n apply Iff.trans modalCompanion_S5Grz;\n apply Entailment.Equiv.iff.mp;\n infer_instance;",
"n_chars":... | [
{
"name": "modalCompanion_S5Grz",
"text": "theorem modalCompanion_S5Grz : ModalCompanion Propositional.Cl Modal.S5Grz := by\n apply modalCompanion_via_kripkeSemantics (P := λ {κ} F => Finite κ ∧ Std.Symm F);\n . apply provable_S5Grz_of_mem;\n . intro φ;\n apply Hilbert.Cl.instKripkeCompleteFinite.comp... | [
{
"name": "modalCompanion_Triv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nes... | 3 | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | @@ -43,8 +43,23 @@
lemma provable_S5Grz_of_mem : φ ∈ Propositional.Cl → Modal.S5Grz ⊢ φᵍ := fun h ↦ WeakerThan.pbl $ provable_S5_of_mem h
-theorem modalCompanion_Triv : ModalCompanion Propositional.Cl Modal.Triv := sorry
+theorem modalCompanion_S5Grz : ModalCompanion Propositional.Cl Modal.S5Grz := by
+ apply mod... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_fd03b6803bbe_4 | 0a1d42408edf99ec | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Modal/ModalCompanion/Standard/Cl.lean | Cl | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "boxdotModalCompanion_Ver",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n λ _ => Iff.trans modalCompanion_Triv $ Modal.Logic.iff_boxdotTranslated_Ver_Triv.symm",
"n_chars": 89,
"n_sub... | [
{
"name": "modalCompanion_Triv",
"text": "theorem modalCompanion_Triv : ModalCompanion Propositional.Cl Modal.Triv := by\n intro φ;\n apply Iff.trans modalCompanion_S5Grz;\n apply Entailment.Equiv.iff.mp;\n infer_instance;\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0... | [
{
"name": "boxdotModalCompanion_Ver",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 4 | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | module
public import Foundation.Logic.Embedding
public import Foundation.Modal.Boxdot.GL_Grz
public import Foundation.Modal.Kripke.Logic.S5
public import Foundation.Modal.Kripke.Logic.S5Grz
public import Foundation.Modal.ModalCompanion.Standard.Basic
public import Foundation.Modal.Boxdot.Ver_Triv
public import Foundat... | @@ -54,8 +54,15 @@
. apply Set.mem_setOf_eq.mpr;
exact {};
-theorem boxdotModalCompanion_Ver : ∀ φ, φ ∈ Propositional.Cl ↔ Modal.Ver ⊢ φᵍᵇ := sorry
+theorem modalCompanion_Triv : ModalCompanion Propositional.Cl Modal.Triv := by
+ intro φ;
+ apply Iff.trans modalCompanion_S5Grz;
+ apply Entailment.Equiv... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_396cc845e0ae_0 | 23036de8f9c86b14 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/LinearLogic/FirstOrder/Calculus.lean | Calculus | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "quest_append",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by simp [quest_def]",
"n_chars": 20,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"... | [
{
"name": "quest_def",
"text": "lemma quest_def (Γ : Sequent L) : ？Γ = Γ.map (？·) := rfl\n\n",
"fan_in": 2,
"n_lines": 3,
"n_chars": 66,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | [
{
"name": "quest_append",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 108,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 1... | 1 | module
public import Foundation.Vorspiel.List.Perm
public import Foundation.LinearLogic.FirstOrder.Rew
/-! # One-sided sequent calculus for first-order linear logic -/
@[expose] public section
namespace LO.FirstOrder.LinearLogic
variable {L : Language}
abbrev Sequent (L : Language) := List (Proposition L)
def Se... | module
public import Foundation.Vorspiel.List.Perm
public import Foundation.LinearLogic.FirstOrder.Rew
/-! # One-sided sequent calculus for first-order linear logic -/
@[expose] public section
namespace LO.FirstOrder.LinearLogic
variable {L : Language}
abbrev Sequent (L : Language) := List (Proposition L)
def Se... | @@ -41,15 +41,17 @@
instance : Quest (Sequent L) := ⟨quest⟩
+lemma quest_def (Γ : Sequent L) : ？Γ = Γ.map (？·) := rfl
+
@[simp] lemma quest_nil : ？([] : Sequent L) = [] := rfl
@[simp] lemma quest_cons (φ : Proposition L) (Γ : Sequent L) :
？(φ :: Γ) = ？φ :: ？Γ := rfl
@[simp] lemma quest_append (Γ Δ : Se... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_b114d31242b6_0 | 90f40c89aea17920 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Propositional/Entailment/Minimal/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 1 | [
{
"theorem_name": "provable_iff_provable",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " ⟨of!, emptyPrf!⟩",
"n_chars": 21,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,... | [
{
"name": "of!",
"text": "lemma of! (b : 𝓢 ⊢ φ) : Γ *⊢[𝓢] φ := ⟨Context.of b.some⟩\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | [
{
"name": "of'!",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 3,
"n_chars": 117,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 1
}
] | 2 | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | @@ -631,6 +631,8 @@
def of {φ : F} (b : 𝓢 ⊢! φ) : Γ *⊢[𝓢]! φ := ⟨[], by simp, FiniteContext.of b⟩
+lemma of! (b : 𝓢 ⊢ φ) : Γ *⊢[𝓢] φ := ⟨Context.of b.some⟩
+
def mdp [DecidableEq F] {Γ : Set F} (bpq : Γ *⊢[𝓢]! φ 🡒 ψ) (bp : Γ *⊢[𝓢]! φ) : Γ *⊢[𝓢]! ψ :=
⟨ bpq.ctx ++ bp.ctx, by
simp only [List.mem_app... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_b114d31242b6_1 | 42aef79dd410301e | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Propositional/Entailment/Minimal/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 4 | [
{
"theorem_name": "id!",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " nth_axm! 0",
"n_chars": 11,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | [
{
"name": "nth_axm!",
"text": "lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 103,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | [
{
"name": "id!",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 3,
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}
] | 1 | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | @@ -437,6 +437,8 @@
core_finite := by rintro ⟨Γ⟩; simp [AdjunctiveSet.Finite, AdjunctiveSet.set]
def nthAxm {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢]! Γ[n] := conj₂Nth Γ n h
+lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩
+
def byAxm [DecidableEq F] {φ} (h : φ ∈... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_b114d31242b6_2 | b54ffe3c15fc5037 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Propositional/Entailment/Minimal/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 4 | [
{
"theorem_name": "id!",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " nth_axm! 0",
"n_chars": 11,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | [
{
"name": "nth_axm!",
"text": "lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 103,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | [
{
"name": "by_axm₀!",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 3,
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}... | 1 | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | @@ -437,6 +437,8 @@
core_finite := by rintro ⟨Γ⟩; simp [AdjunctiveSet.Finite, AdjunctiveSet.set]
def nthAxm {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢]! Γ[n] := conj₂Nth Γ n h
+lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩
+
def byAxm [DecidableEq F] {φ} (h : φ ∈... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_b114d31242b6_3 | 08defca86fb44e67 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Propositional/Entailment/Minimal/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 4 | [
{
"theorem_name": "id!",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " nth_axm! 0",
"n_chars": 11,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | [
{
"name": "nth_axm!",
"text": "lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 103,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | [
{
"name": "by_axm₁!",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 3,
"n_chars": 64,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}... | 1 | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | @@ -437,6 +437,8 @@
core_finite := by rintro ⟨Γ⟩; simp [AdjunctiveSet.Finite, AdjunctiveSet.set]
def nthAxm {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢]! Γ[n] := conj₂Nth Γ n h
+lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩
+
def byAxm [DecidableEq F] {φ} (h : φ ∈... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_b114d31242b6_4 | 4986dff92c0eef4b | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/Propositional/Entailment/Minimal/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 43 | 4 | [
{
"theorem_name": "id!",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " nth_axm! 0",
"n_chars": 11,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | [
{
"name": "nth_axm!",
"text": "lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 103,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | [
{
"name": "by_axm₂!",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 3,
"n_chars": 70,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}... | 1 | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | module
public import Foundation.Logic.Entailment
public import Foundation.Vorspiel.Finset.Basic
@[expose] public section
namespace LO.Axioms
variable {F : Type*} [LogicalConnective F]
variable (φ ψ χ : F)
protected abbrev NegEquiv := ∼φ 🡘 (φ 🡒 ⊥)
protected abbrev Verum : F := ⊤
protected abbrev ImplyK := φ 🡒 ... | @@ -437,6 +437,8 @@
core_finite := by rintro ⟨Γ⟩; simp [AdjunctiveSet.Finite, AdjunctiveSet.set]
def nthAxm {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢]! Γ[n] := conj₂Nth Γ n h
+lemma nth_axm! {Γ} (n : ℕ) (h : n < Γ.length := by simp) : Γ ⊢[𝓢] Γ[n] := ⟨nthAxm n h⟩
+
def byAxm [DecidableEq F] {φ} (h : φ ∈... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.