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_692d63d7527c_15 | 0a6871f7be47dd88 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,35 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_16 | 3a6d8b3b170c33c1 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsStepInv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; exact interpStepInv h",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": ... | [
{
"name": "interpStepInv",
"text": "theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :\n wne T ∨\n (∃ A B, T ⇒⋆ pi A B) ∨\n (∃ i, T ⇒⋆ 𝒰 i) ∨\n (T ⇒⋆ mty) ∨\n (∃ b, T ⇒⋆ lvl b) := by\n induction h\n case ne nea => left; exact neWne nea\n case pi => right; left; exact ⟨_, _, Pars.refl _⟩\n cas... | [
{
"name": "interpsStepInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 354,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,12 +37,38 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :
+ wne T ∨
+ (∃ A B, T ⇒⋆ pi A B) ∨
+ (∃ i, T ⇒⋆ 𝒰 i) ∨
+ (T ⇒⋆ mty) ∨
+ (∃ b, T ⇒⋆ lvl b) := by
+ induction h
+ case ne nea => left; exact ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_17 | ad811f5ee1d21122 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "adequacy",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1162,
"n_subproofs": 0,
"n_tactics": 42,
"cyclomatic": 6,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 26,
"automation_only": false,
"max_nesting": ... | 4 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_18 | 91b188d5af356368 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsWnf",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2... | 5 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,8 +37,12 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_692d63d7527c_19 | c8802687665099c9 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/nondet.lean | nondet | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl nfb => injection... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "semSubstCons",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 12,
"n_chars": 396,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
"max_nesting... | 11 | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | import «src».normal
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I... | @@ -37,6 +37,23 @@
-------------------------------------------------------*-/
-- ⚠️ uses funext and propext ⚠️
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a; apply propext; construc... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_0 | 3837a5524993f319 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameExt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ ζ\n all_goals simp; try constructor\n all_goals apply_rules [liftExt]",
"n_chars": 113,... | [
{
"name": "liftExt",
"text": "theorem liftExt ξ ζ (h : ∀ x, ξ x = ζ x) : ∀ x, lift ξ x = lift ζ x := by\n intro x; cases x <;> simp [h]\n\n-- Lifting identity renaming does nothing\nomit lc in\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 170,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomat... | [
{
"name": "renameExt",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 244,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -36,6 +36,11 @@
-- Lifting respects renaming extensionality
omit lc in
+theorem liftExt ξ ζ (h : ∀ x, ξ x = ζ x) : ∀ x, lift ξ x = lift ζ x := by
+ intro x; cases x <;> simp [h]
+
+-- Lifting identity renaming does nothing
+omit lc in
theorem liftComp ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) :
∀ x, (lift ξ ∘ lift ζ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_1 | 703e95855eaf8df1 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameExt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ ζ\n all_goals simp; try constructor\n all_goals apply_rules [liftExt]",
"n_chars": 113,... | [
{
"name": "liftExt",
"text": "theorem liftExt ξ ζ (h : ∀ x, ξ x = ζ x) : ∀ x, lift ξ x = lift ζ x := by\n intro x; cases x <;> simp [h]\n\n-- Lifting identity renaming does nothing\nomit lc in\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 170,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomat... | [
{
"name": "renameId",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 215,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 5,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 3 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -36,6 +36,11 @@
-- Lifting respects renaming extensionality
omit lc in
+theorem liftExt ξ ζ (h : ∀ x, ξ x = ζ x) : ∀ x, lift ξ x = lift ζ x := by
+ intro x; cases x <;> simp [h]
+
+-- Lifting identity renaming does nothing
+omit lc in
theorem liftId ξ (h : ∀ x, ξ x = x) : ∀ x, lift ξ x = x := by
intro x; ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_2 | bcce08cdc6a8f298 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameComp'",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ ζ ς\n all_goals simp; try constructor\n all_goals apply_rules [liftComp]",
"n_chars":... | [
{
"name": "liftComp",
"text": "theorem liftComp ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) :\n ∀ x, (lift ξ ∘ lift ζ) x = lift ς x := by\n intro x; cases x <;> simp\n case succ => apply h\n\n-- Lifting commutes with succ\nomit lc in\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 206,
"n_subproofs": 0,
... | [
{
"name": "renameComp'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 272,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -36,6 +36,13 @@
-- Lifting respects renaming extensionality
omit lc in
+theorem liftComp ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) :
+ ∀ x, (lift ξ ∘ lift ζ) x = lift ς x := by
+ intro x; cases x <;> simp
+ case succ => apply h
+
+-- Lifting commutes with succ
+omit lc in
@[simp]
def rename (ξ : Nat → Nat) : Term → ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_3 | ae75460fe04da694 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameComp",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply renameComp'; simp",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "renameComp'",
"text": "theorem renameComp' ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) : ∀ s, (rename ξ ∘ rename ζ) s = rename ς s := by\n intro s; induction s generalizing ξ ζ ς\n all_goals simp; try constructor\n all_goals apply_rules [liftComp]\n\n-- Renamings compose (extensionally)\n",
"fan_in":... | [
{
"name": "upRename",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 616,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nesting": 6
... | 3 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -56,8 +56,15 @@
| lof k => lof k
-- Renaming extensionality
-theorem renameComp ξ ζ s : rename ξ (rename ζ s) = rename (ξ ∘ ζ) s := sorry
+theorem renameComp' ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) : ∀ s, (rename ξ ∘ rename ζ) s = rename ς s := by
+ intro s; induction s generalizing ξ ζ ς
+ all_goals simp; try con... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_4 | 1609d9c45a564429 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "substExt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upExt]",
"n_chars": 111,
... | [
{
"name": "upExt",
"text": "theorem upExt σ τ (h : ∀ x, σ x = τ x) : ∀ x, (⇑ σ) x = (⇑ τ) x := by\n intro n; cases n <;> simp [h]\n\n-- Lifting commutes with composition\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automati... | [
{
"name": "substExt",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 240,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -79,6 +79,10 @@
intro n; cases n <;> simp [h]
-- Lifting respects subsitution extensionality
+theorem upExt σ τ (h : ∀ x, σ x = τ x) : ∀ x, (⇑ σ) x = (⇑ τ) x := by
+ intro n; cases n <;> simp [h]
+
+-- Lifting commutes with composition
theorem upLift ξ σ τ (h : ∀ x, (σ ∘ ξ) x = τ x) : ∀ x, (⇑ σ ∘ lift ξ) x =... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_5 | 27086baf3c4119e0 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "substId'",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing σ\n all_goals simp; try constructor\n all_goals apply_rules [upId]",
"n_chars": 107,
"... | [
{
"name": "upId",
"text": "theorem upId σ (h : ∀ x, σ x = var x) : ∀ x, (⇑ σ) x = var x := by\n intro n; cases n <;> simp [h]\n\n-- Lifting respects subsitution extensionality\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_au... | [
{
"name": "substId'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 223,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -75,6 +75,10 @@
prefix:95 "⇑" => up
-- Lifting twice pushes renamings inwards
+theorem upId σ (h : ∀ x, σ x = var x) : ∀ x, (⇑ σ) x = var x := by
+ intro n; cases n <;> simp [h]
+
+-- Lifting respects subsitution extensionality
theorem upLift ξ σ τ (h : ∀ x, (σ ∘ ξ) x = τ x) : ∀ x, (⇑ σ ∘ lift ξ) x = (⇑ τ) x :... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_6 | becb71e8eb27db5d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "substRename'",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upLift]",
"n_chars": ... | [
{
"name": "upLift",
"text": "theorem upLift ξ σ τ (h : ∀ x, (σ ∘ ξ) x = τ x) : ∀ x, (⇑ σ ∘ lift ξ) x = (⇑ τ) x := by\n intro n; cases n <;> simp [← h]\n\n-- Lifting commutes with succ\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
... | [
{
"name": "substRename'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 270,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": ... | 1 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -79,6 +79,10 @@
intro n; cases n <;> simp [h]
-- Lifting respects subsitution extensionality
+theorem upLift ξ σ τ (h : ∀ x, (σ ∘ ξ) x = τ x) : ∀ x, (⇑ σ ∘ lift ξ) x = (⇑ τ) x := by
+ intro n; cases n <;> simp [← h]
+
+-- Lifting commutes with succ
theorem upRename ξ σ τ (h : ∀ x, (rename ξ ∘ σ) x = τ x) : ∀... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_7 | 531408a8ede5b633 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameToSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ\n all_goals simp [-up] <;> try constructor\n all_goals (try rw [← substExt _ _ (upVar ξ... | [
{
"name": "upVar",
"text": "theorem upVar ξ : ∀ x, (var ∘ lift ξ) x = (⇑ (var ∘ ξ)) x := by\n intro n; cases n <;> simp\n\n-- Lifting commutes with renaming\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1,
"... | [
{
"name": "renameToSubst",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 380,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 6,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 3 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -87,6 +87,10 @@
intro n; cases n <;> simp [← h]
-- Lifting commutes with succ
+theorem upVar ξ : ∀ x, (var ∘ lift ξ) x = (⇑ (var ∘ ξ)) x := by
+ intro n; cases n <;> simp
+
+-- Lifting commutes with renaming
theorem upRename ξ σ τ (h : ∀ x, (rename ξ ∘ σ) x = τ x) : ∀ x, (rename (lift ξ) ∘ ⇑ σ) x = (⇑ τ) x :... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_8 | 8e3b533d8691620d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameLiftRename",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n rename succ (rename ξ a)\n = rename (succ ∘ ξ) a := by rw [renameComp]\n _ = rename (lift ξ ... | [
{
"name": "liftSucc",
"text": "theorem liftSucc ξ : ∀ x, (lift ξ ∘ succ) x = (succ ∘ ξ) x := by\n intro x; cases x <;> simp\n\n/-*-------------------\n Applying renamings\n-------------------*-/\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 171,
"n_subproofs": 0,
"n_tactics": 4,
"cyc... | [
{
"name": "renameLiftRename",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 8,
"n_chars": 352,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_nestin... | 6 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -48,6 +48,13 @@
-- Lifting commutes with succ
omit lc in
+theorem liftSucc ξ : ∀ x, (lift ξ ∘ succ) x = (succ ∘ ξ) x := by
+ intro x; cases x <;> simp
+
+/-*-------------------
+ Applying renamings
+-------------------*-/
+
@[simp]
def rename (ξ : Nat → Nat) : Term → Term
| var s => var (ξ s)
@@ -172,7 +1... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_9 | df4df8d845a680ef | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameUpSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n rename succ (subst σ a)\n = subst (rename succ ∘ σ) a := by rw [renameSubst]\n _ = subst (⇑ σ ∘ succ) a ... | [
{
"name": "upSucc",
"text": "theorem upSucc σ : ∀ x, (⇑ σ ∘ succ) x = (rename succ ∘ σ) x := by\n intro n; cases n <;> simp\n\n-- Lifting commutes with injection of renamings into substitutions\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 174,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "renameUpSubst",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 3 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -87,6 +87,10 @@
intro n; cases n <;> simp [← h]
-- Lifting commutes with succ
+theorem upSucc σ : ∀ x, (⇑ σ ∘ succ) x = (rename succ ∘ σ) x := by
+ intro n; cases n <;> simp
+
+-- Lifting commutes with injection of renamings into substitutions
theorem upRename ξ σ τ (h : ∀ x, (rename ξ ∘ σ) x = τ x) : ∀ x, (... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_10 | bdb5d29b32d6bfa6 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 6 | [
{
"theorem_name": "renameToSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ\n all_goals simp [-up] <;> try constructor\n all_goals (try rw [← substExt _ _ (upVar ξ... | [
{
"name": "substExt",
"text": "theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by\n intro s; induction s generalizing σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upExt]\n\n-- Applying var \"substitution\" does nothing\n",
"fan_in": 6,
"n_lines": 7,
... | [
{
"name": "renameDist",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4
... | 2 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -114,6 +114,12 @@
| lof k => lof k
-- Substitution extensionality
+theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by
+ intro s; induction s generalizing σ τ
+ all_goals simp; try constructor
+ all_goals apply_rules [upExt]
+
+-- Applying var "substitution" does nothing
theorem su... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_11 | dcbadea8a0c4d5e7 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 6 | [
{
"theorem_name": "renameToSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ\n all_goals simp [-up] <;> try constructor\n all_goals (try rw [← substExt _ _ (upVar ξ... | [
{
"name": "substExt",
"text": "theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by\n intro s; induction s generalizing σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upExt]\n\n-- Applying var \"substitution\" does nothing\n",
"fan_in": 6,
"n_lines": 7,
... | [
{
"name": "substUnion",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 352,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
"max_nesting": 8... | 3 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -114,6 +114,12 @@
| lof k => lof k
-- Substitution extensionality
+theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by
+ intro s; induction s generalizing σ τ
+ all_goals simp; try constructor
+ all_goals apply_rules [upExt]
+
+-- Applying var "substitution" does nothing
theorem su... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_12 | b98e176541ec766d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 6 | [
{
"theorem_name": "renameToSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ\n all_goals simp [-up] <;> try constructor\n all_goals (try rw [← substExt _ _ (upVar ξ... | [
{
"name": "substExt",
"text": "theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by\n intro s; induction s generalizing σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upExt]\n\n-- Applying var \"substitution\" does nothing\n",
"fan_in": 6,
"n_lines": 7,
... | [
{
"name": "substDist",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 390,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 11,
"n_structural": 4,
"automation_only": false,
"max_nesting": 6
... | 4 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -114,6 +114,12 @@
| lof k => lof k
-- Substitution extensionality
+theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by
+ intro s; induction s generalizing σ τ
+ all_goals simp; try constructor
+ all_goals apply_rules [upExt]
+
+-- Applying var "substitution" does nothing
theorem su... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_13 | e16628328b816455 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 6 | [
{
"theorem_name": "renameToSubst",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro s; induction s generalizing ξ\n all_goals simp [-up] <;> try constructor\n all_goals (try rw [← substExt _ _ (upVar ξ... | [
{
"name": "substExt",
"text": "theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by\n intro s; induction s generalizing σ τ\n all_goals simp; try constructor\n all_goals apply_rules [upExt]\n\n-- Applying var \"substitution\" does nothing\n",
"fan_in": 6,
"n_lines": 7,
... | [
{
"name": "substToRename",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 339,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max_nesting"... | 4 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -118,6 +118,12 @@
| lof k => lof k
-- Substitution extensionality
+theorem substExt σ τ (h : ∀ x, σ x = τ x) : ∀ s, subst σ s = subst τ s := by
+ intro s; induction s generalizing σ τ
+ all_goals simp; try constructor
+ all_goals apply_rules [upExt]
+
+-- Applying var "substitution" does nothing
theorem su... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_a0c7b6116724_14 | 78dedc9de79eb4ae | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/syntactics.lean | syntactics | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "renameComp",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply renameComp'; simp",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "renameComp'",
"text": "theorem renameComp' ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) : ∀ s, (rename ξ ∘ rename ζ) s = rename ς s := by\n intro s; induction s generalizing ξ ζ ς\n all_goals simp; try constructor\n all_goals apply_rules [liftComp]\n\n-- Renamings compose (extensionally)\n",
"fan_in":... | [
{
"name": "wRenameLift",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 5 | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | import «src».level
open Nat
variable [lc : LevelClass]
@[simp]
def cons {A : Type} (x : A) (ξ : Nat → A) : Nat → A
| 0 => x
| n + 1 => ξ n
infixr:50 "+:" => cons
/-*------
Terms
------*-/
inductive Term : Type where
| var : Nat → Term
| 𝒰 : Term → Term
| pi : Term → Term → Term
| abs : Term → Term →... | @@ -56,8 +56,15 @@
| lof k => lof k
-- Renaming extensionality
-theorem renameComp ξ ζ s : rename ξ (rename ζ s) = rename (ξ ∘ ζ) s := sorry
+theorem renameComp' ξ ζ ς (h : ∀ x, (ξ ∘ ζ) x = ς x) : ∀ s, (rename ξ ∘ rename ζ) s = rename ς s := by
+ intro s; induction s generalizing ξ ζ ς
+ all_goals simp; try con... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_0 | df6f43179e73b49e | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "parsEqv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r\n case refl => constructor\n case trans r _ ih => exact (Eqv.trans (parEqv r) ih)",
"n_chars": 99,
"n_subproo... | [
{
"name": "parEqv",
"text": "theorem parEqv {a b} (r : a ⇒ b) : a ≈ b := by\n induction r\n case β ihb iha =>\n exact Eqv.trans (Eqv.app (Eqv.abs Eqv.refl ihb) iha) Eqv.β\n all_goals constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 190,
"n_subproofs": 0,
"n_ta... | [
{
"name": "parsEqv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 2
}... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -63,8 +63,17 @@
/-* Conversion is sound and complete with respect to definitional equality,
making conversion an appropriate implementation of definitional equality *-/
-theorem parsEqv {a b} (r : a ⇒⋆ b) : a ≈ b := sorry
+theorem parEqv {a b} (r : a ⇒ b) : a ≈ b := by
+ induction r
+ case β ihb iha =>
+ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_1 | 4ae6f605552e0d97 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtf𝒰Inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 432,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4
... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_2 | 49c962aec753b026 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfPiInvA𝒰",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 601,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_nesting":... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_3 | c658c7542492ed64 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfPiInvA",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_4 | 0221df99b7013f6d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfPiInv𝒰",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_5 | 33300ddcb7514e04 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfAbsInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 602,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 6,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_nesting": 4... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_6 | b906254f029a7fdf | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 422,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_7 | 1c2d142aa3d88c73 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 563,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_nesting": 4... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_3ac9abc30b7e_8 | d107755ac9a33f49 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/typing.lean | typing | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 6 | [
{
"theorem_name": "wtf𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 j = t at h\n induction h\n all_goals injections <;> subst_eqs <;> specialize_rfls\n case 𝒰 | sub => exact ⟨... | [
{
"name": "eqvConv",
"text": "theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by\n induction r\n case β => apply_rules [parConv, Par.β, parRefl]\n case 𝒰 => apply_rules [conv𝒰]\n case pi => apply_rules [convPi]\n case abs => apply_rules [convAbs]\n case app => apply_rules [convApp]\n case exf => apply... | [
{
"name": "wtfLofInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 417,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4... | 1 | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | import «src».reduction
open Nat
open Term
set_option autoImplicit false
set_option pp.fieldNotation false
variable [LevelClass]
/-*----------------------
Definitional equality
----------------------*-/
section
set_option hygiene false
local infix:40 (priority := 1001) "≈" => Eqv -- override HasEquiv.Equiv
induc... | @@ -77,6 +77,23 @@
theorem convEqv {a b} : a ⇔ b → a ≈ b
| ⟨_, rac, rbc⟩ => Eqv.trans (parsEqv rac) (Eqv.sym (parsEqv rbc))
+theorem eqvConv {a b} (r : a ≈ b) : a ⇔ b := by
+ induction r
+ case β => apply_rules [parConv, Par.β, parRefl]
+ case 𝒰 => apply_rules [conv𝒰]
+ case pi => apply_rules [convPi]
+ ca... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_0 | 56c9763ffa9b68d5 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interp𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e... | [
{
"name": "interp𝒰Eq",
"text": "theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =\n (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, lt, rj, h⟩ | wnea... | [
{
"name": "interp𝒰Inv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 512,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,31 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =
+ (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) :=... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_1 | c8a040bd2918b81c | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpLvlInv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 521,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,35 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a;... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_2 | 020601ce9b7d9c23 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interp𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e... | [
{
"name": "interp𝒰Eq",
"text": "theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =\n (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, lt, rj, h⟩ | wnea... | [
{
"name": "interpFwd",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 642,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 12,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 15,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,6 +33,19 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =
+ (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) :=... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_3 | 49f433d8ba3c9c0d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsFwd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 4,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -46,8 +46,38 @@
. exact Or.inl ⟨j, lt, Pars.trans r rj, h⟩
. exact Or.inr wnea
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_4 | 11164c554001196e | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsFwds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 4 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -46,8 +46,38 @@
. exact Or.inl ⟨j, lt, Pars.trans r rj, h⟩
. exact Or.inr wnea
-theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := sorry
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_5 | 6f689fa4d6606e04 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwds",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,12 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interp... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_6 | d68af3cfc82035c0 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case ne nea => constructor; exact nePar r nea\n case... | [
{
"name": "interpsConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 7 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -63,8 +63,24 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_7 | f6bb9f79f6b97a19 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwdsP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 848,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 14,
"automation_only": false,
"max_nesting... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,12 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interp... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_8 | 7bcc47f34fe96a39 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpPiInv",
"text": "theorem interpPiInv {i I a b P} (h : ⟦ pi a b ⟧ i , I ↘ P) :\n ∃ (Pa : Term → Prop) (Pf : Term → (Term → Prop) → Prop),\n (⟦ a ⟧ i , I ↘ Pa) ∧\n (∀ x, Pa x → ∃ Pb, Pf x Pb) ∧\n (∀ x Pb, Pf x Pb → ⟦ subst (x +: var) b ⟧ i, I ↘ Pb) ∧\n P = (λ f ↦ ∀ x Pb, Pa x → P... | [
{
"name": "interpDet'",
"fan_in": 2,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 24,
"n_chars": 958,
"n_subproofs": 2,
"n_tactics": 29,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 14,
"automation_only": false,
"max_nesting":... | 8 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -69,6 +69,26 @@
case step r _ ih => exact ih (nePar r nea)
all_goals first | contradiction | simp
+theorem interpPiInv {i I a b P} (h : ⟦ pi a b ⟧ i , I ↘ P) :
+ ∃ (Pa : Term → Prop) (Pf : Term → (Term → Prop) → Prop),
+ (⟦ a ⟧ i , I ↘ Pa) ∧
+ (∀ x, Pa x → ∃ Pb, Pf x Pb) ∧
+ (∀ x Pb, Pf x Pb → ⟦ su... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_9 | c4100c13c1ba1962 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e with e; subst e; e... | [
{
"name": "interpsDet'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 4,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 9 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -89,6 +89,19 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by
+ generalize e : 𝒰 b = c at h
+ induction h generalizing b
+ case ne ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_12 | 1dd2de37bbb7d905 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e with e; subst e; e... | [
{
"name": "interpPiInv'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 16,
"n_chars": 701,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 9 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -89,6 +89,19 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by
+ generalize e : 𝒰 b = c at h
+ induction h generalizing b
+ case ne ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_13 | 1b62018d180f0d33 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :\n wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e with e; subst e; e... | [
{
"name": "interpsPiInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 7,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 10 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -89,6 +89,19 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I b P} (h : ⟦ 𝒰 b ⟧ i , I ↘ P) :
+ wnf b ∧ P = (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by
+ generalize e : 𝒰 b = c at h
+ induction h generalizing b
+ case ne ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_14 | def4cf30a98080f7 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interp𝒰Inv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : 𝒰 b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case 𝒰 wnfb => injection e... | [
{
"name": "interp𝒰Eq",
"text": "theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =\n (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, lt, rj, h⟩ | wnea... | [
{
"name": "interps𝒰Inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 221,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,31 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interp𝒰Eq {i} {I : ∀ j, j < i → Term → Prop} {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j lt, b ⇒⋆ lof j ∧ I j lt a) ∨ wne a) =
+ (λ a ↦ (∃ j lt, c ⇒⋆ lof j ∧ I j lt a) ∨ wne a) :=... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_15 | 346e9c2796ba745f | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case ne nea => exact symm (interpNeInv hQ nea)\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa'... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by\n generalize e : mty = a at h\n induction h\n case ne => subst e; contradiction\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
... | [
{
"name": "interpsMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,17 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
-theorem interpsMtyInv {i P} (h : ⟦ mty ⟧ i ↘ P) : P = wne := sorry
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = wne := by
+ generalize e : mty = a at h
+ induction... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_16 | f0cbab68169e1ea6 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "interpLvlInv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n generalize e : lvl b = c at h\n induction h generalizing b\n case ne => subst e; contradiction\n case lvl wnfb => injectio... | [
{
"name": "interpLvlEq",
"text": "theorem interpLvlEq {b c} (r : b ⇒ c) :\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =\n (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by\n funext a; apply propext; constructor\n . intro Pa; rcases Pa with ⟨j, k, lt, rj, rk⟩ | wnea\n . let... | [
{
"name": "interpsLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 203,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,8 +33,35 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interpLvlEq {b c} (r : b ⇒ c) :
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ b ⇒⋆ lof k) ∨ wne a) =
+ (λ a ↦ (∃ j k, j < k ∧ a ⇒⋆ lof j ∧ c ⇒⋆ lof k) ∨ wne a) := by
+ funext a;... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_17 | c07219ef3c483d11 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "interpsStepInv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; exact interpStepInv h",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": ... | [
{
"name": "interpStepInv",
"text": "theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :\n wne T ∨\n (∃ A B, T ⇒⋆ pi A B) ∨\n (∃ i, T ⇒⋆ 𝒰 i) ∨\n (T ⇒⋆ mty) ∨\n (∃ b, T ⇒⋆ lvl b) := by\n induction h\n case ne nea => left; exact neWne nea\n case pi => right; left; exact ⟨_, _, Pars.refl _⟩\n cas... | [
{
"name": "interpsStepInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 354,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -33,12 +33,37 @@
they are the same when even when extra steps are taken
-------------------------------------------------------*-/
+theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :
+ wne T ∨
+ (∃ A B, T ⇒⋆ pi A B) ∨
+ (∃ i, T ⇒⋆ 𝒰 i) ∨
+ (T ⇒⋆ mty) ∨
+ (∃ b, T ⇒⋆ lvl b) := by
+ induction h
+ cas... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_18 | 49a201fe0d0097f3 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "adequacy",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; induction h\n case ne => intro; exact ⟨id, wneWnf⟩\n case pi hPf _ iha ihb =>\n intro f; constructor\n ... | [
{
"name": "interpWnf",
"text": "theorem interpWnf {i I a P}\n (adq : ∀ {a P}, (⟦ a ⟧ i , I ↘ P) → CR P)\n (h : ⟦ a ⟧ i , I ↘ P) : wnf a := by\n induction h\n case ne a nea => exact wneWnf (neWne nea)\n case 𝒰 wnfb => exact wnf𝒰 wnfb\n case mty => exact nfWnf ⟨⟩\n case step r _ wnfb => exact wnfBwds... | [
{
"name": "adequacy",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1171,
"n_subproofs": 0,
"n_tactics": 42,
"cyclomatic": 7,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 27,
"automation_only": false,
"max_nesting": ... | 1 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -37,6 +37,22 @@
def CR (P : Term → Prop) : Prop :=
∀ a, (wne a → P a) ∧ (P a → wnf a)
+theorem interpWnf {i I a P}
+ (adq : ∀ {a P}, (⟦ a ⟧ i , I ↘ P) → CR P)
+ (h : ⟦ a ⟧ i , I ↘ P) : wnf a := by
+ induction h
+ case ne a nea => exact wneWnf (neWne nea)
+ case 𝒰 wnfb => exact wnf𝒰 wnfb
+ case mty => e... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_162e494a7046_19 | 9f4711f68fdded54 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/candidates/naive.lean | naive | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "adequacy",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; induction h\n case ne => intro; exact ⟨id, wneWnf⟩\n case pi hPf _ iha ihb =>\n intro f; constructor\n ... | [
{
"name": "interpWnf",
"text": "theorem interpWnf {i I a P}\n (adq : ∀ {a P}, (⟦ a ⟧ i , I ↘ P) → CR P)\n (h : ⟦ a ⟧ i , I ↘ P) : wnf a := by\n induction h\n case ne a nea => exact wneWnf (neWne nea)\n case 𝒰 wnfb => exact wnf𝒰 wnfb\n case mty => exact nfWnf ⟨⟩\n case step r _ wnfb => exact wnfBwds... | [
{
"name": "interpsWnf",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2... | 2 | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | import «src».normal
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| ne a : ne a → Interp i I a wne
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → ... | @@ -37,6 +37,22 @@
def CR (P : Term → Prop) : Prop :=
∀ a, (wne a → P a) ∧ (P a → wnf a)
+theorem interpWnf {i I a P}
+ (adq : ∀ {a P}, (⟦ a ⟧ i , I ↘ P) → CR P)
+ (h : ⟦ a ⟧ i , I ↘ P) : wnf a := by
+ induction h
+ case ne a nea => exact wneWnf (neWne nea)
+ case 𝒰 wnfb => exact wnf𝒰 wnfb
+ case mty => e... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_0 | a09af8a1fb686298 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case 𝒰 => cases r; case 𝒰 r => cases r; constructor... | [
{
"name": "interpsFwd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,21 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_1 | cfdc092f18b788db | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case 𝒰 => cases r; case 𝒰 r => cases r; constructor... | [
{
"name": "interpsFwds",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 2 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,21 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_2 | f273e75dd096a7df | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwds",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,12 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> assumption
+theorem interpsBwds {i a... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_3 | 1a75da60444f7c2b | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpsFwd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at *; apply_rules [interpFwd]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "interpFwd",
"text": "theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by\n induction h generalizing b\n case pi iha ihb =>\n cases r; constructor\n all_goals intros; apply_rules [parCong, parRefl]\n case 𝒰 => cases r; case 𝒰 r => cases r; constructor... | [
{
"name": "interpsConv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 5 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,21 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsFwd {i a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i ↘ P) : ⟦ b ⟧ i ↘ P := sorry
+theorem interpFwd {i I a b P} (r : a ⇒ b) (h : ⟦ a ⟧ i , I ↘ P) : ⟦ b ⟧ i , I ↘ P := by
+ induction h generalizing b
+ case pi iha ihb =>
+ cases r; const... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_4 | 904121f52c84ec6b | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "interpsBwds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r generalizing P <;> apply_rules [interpsBwd]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "interpsBwd",
"text": "theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by\n unfold Interps at *; constructor <;> assumption\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1... | [
{
"name": "interpsBwdsP",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 603,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
"max_nesting"... | 2 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,12 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsBwds {i a b P} (r : a ⇒⋆ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := sorry
+theorem interpsBwd {i a b P} (r : a ⇒ b) (h : ⟦ b ⟧ i ↘ P) : ⟦ a ⟧ i ↘ P := by
+ unfold Interps at *; constructor <;> assumption
+theorem interpsBwds {i a... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_5 | a5d7595aee164566 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interpDet'",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 26,
"n_chars": 1018,
"n_subproofs": 2,
"n_tactics": 33,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 13,
"automation_only": false,
"max_nesting"... | 5 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -48,6 +48,17 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_6 | 14314821f0de4697 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interpsDet'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 4,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 6 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -48,6 +48,17 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_7 | 02978f77b022ca5d | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interpsDet",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 415,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting": 2... | 8 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -48,6 +48,17 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_8 | 0730d16139400479 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interpPiInv'",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 16,
"n_chars": 701,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 6 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -48,6 +48,17 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_9 | 6f2bfd925161aff9 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interpsPiInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 7 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -48,6 +48,17 @@
. intro x Pb PfxPb; constructor <;> apply_rules [parCong, parRefl]
all_goals contradiction
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_10 | 45e213153f506cea | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interp𝒰Inv",
"text": "theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :\n ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by\n generalize e : 𝒰 a = b at h\n induction h generalizing a\n case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _\n case step r _ ih =>\n subst e; let... | [
{
"name": "interps𝒰Inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,22 @@
Simple inversion lemmas
------------------------*-/
+theorem interp𝒰Inv {i I a P} (h : ⟦ 𝒰 a ⟧ i , I ↘ P) :
+ ∃ j lt, a ⇒⋆ lof j ∧ P = I j lt := by
+ generalize e : 𝒰 a = b at h
+ induction h generalizing a
+ case 𝒰 j lt => injection e with e; subst e; exists j, lt, Pars.refl _
+ case ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_11 | 264a5c95637b555f | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interpMtyInv",
"text": "theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = (λ _ ↦ False) := by\n generalize e : mty = a at h\n induction h\n case mty => rfl\n case step r _ ih => subst e; cases r; simp [ih]\n all_goals contradiction\n\n",
"fan_in": 2,
"n_lines": 8,
"n_cha... | [
{
"name": "interpsMtyInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 128,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,16 @@
Simple inversion lemmas
------------------------*-/
-theorem interpsMtyInv {i P} (h : ⟦ mty ⟧ i ↘ P) : P = (λ _ ↦ False) := sorry
+theorem interpMtyInv {i I P} (h : ⟦ mty ⟧ i , I ↘ P) : P = (λ _ ↦ False) := by
+ generalize e : mty = a at h
+ induction h
+ case mty => rfl
+ case step r _ ih ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_12 | 0dfe6f9cb6b616e8 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "interpDet'",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hP generalizing Q\n case pi Pa Pf _ hPf _ iha ihb =>\n let ⟨Pa', Pf', ha', hPf', hb', e⟩ := interpPiInv hQ\n s... | [
{
"name": "interpLvlInv",
"text": "theorem interpLvlInv {i I a P} (h : ⟦ lvl a ⟧ i , I ↘ P) :\n ∃ k, a ⇒⋆ lof k ∧ P = (λ a ↦ ∃ j, a ⇒⋆ lof j ∧ j < k) := by\n generalize e : lvl a = b at h\n induction h generalizing a\n case lvl k => injection e with e; subst e; exists k, Pars.refl _\n case step r _ ih ... | [
{
"name": "interpsLvlInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,8 +29,20 @@
Simple inversion lemmas
------------------------*-/
+theorem interpLvlInv {i I a P} (h : ⟦ lvl a ⟧ i , I ↘ P) :
+ ∃ k, a ⇒⋆ lof k ∧ P = (λ a ↦ ∃ j, a ⇒⋆ lof j ∧ j < k) := by
+ generalize e : lvl a = b at h
+ induction h generalizing a
+ case lvl k => injection e with e; subst e; exists k, P... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_d8acab614cff_13 | 5aedfd2c5e94e098 | lean | lean | github.com/ionathanch/TTBFL | 274b8d0410b7c1671f15f140e75634065bb06bf9 | src/semantics.lean | semantics | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "interpsStepInv",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Interps at h; exact interpStepInv h",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": ... | [
{
"name": "interpStepInv",
"text": "theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :\n (∃ A B, T ⇒⋆ pi A B) ∨\n (∃ i, T ⇒⋆ 𝒰 i) ∨\n (T ⇒⋆ mty) ∨\n (∃ k, T ⇒⋆ lvl (lof k)) := by\n induction h\n case pi => left; exact ⟨_, _, Pars.refl _⟩\n case 𝒰 => right; left; exact ⟨_, Pars.refl _⟩\n case ... | [
{
"name": "interpsStepInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 285,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | import «src».reduction
open Term
variable [lc : LevelClass]
inductive Interp (i : lc.L) (I : ∀ j, j < i → Term → Prop) : Term → (Term → Prop) → Prop where
| pi a b Pa (Pf : Term → (Term → Prop) → Prop) :
Interp i I a Pa →
(∀ x, Pa x → ∃ Pb, Pf x Pb) →
(∀ x Pb, Pf x Pb → Interp i I (subst (x +: var) b) ... | @@ -29,11 +29,33 @@
Simple inversion lemmas
------------------------*-/
+theorem interpStepInv {i I T P} (h : ⟦ T ⟧ i , I ↘ P) :
+ (∃ A B, T ⇒⋆ pi A B) ∨
+ (∃ i, T ⇒⋆ 𝒰 i) ∨
+ (T ⇒⋆ mty) ∨
+ (∃ k, T ⇒⋆ lvl (lof k)) := by
+ induction h
+ case pi => left; exact ⟨_, _, Pars.refl _⟩
+ case 𝒰 => right; left; ... | {
"repo": "TTBFL",
"git_repo": "github.com/ionathanch/TTBFL",
"revision": "274b8d0410b7c1671f15f140e75634065bb06bf9",
"lean_toolchain": "leanprover/lean4:v4.29.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemmas-... |
ablate_b44df21ea3de_0 | 11e0ea962fc2c31d | lean | lean | github.com/leanprover/TensorLib | 5eedd07b028057a317ae2fffbe48d6781bb34aff | TensorLib/Slice.lean | Slice | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "div_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases s <;> try omega\n simp\n rename_i n\n apply le_div_le\n omega",
"n_chars": 73,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "le_div_le",
"text": "private theorem le_div_le (c : Nat) (H : a ≤ b) : a / c ≤ b := by\n cases c ; simp\n rename_i c\n rw [Nat.div_le_iff_le_mul, Nat.mul_add] <;> try omega\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": ... | [
{
"name": "div_succ",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright TensorLib Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, soft... | /-
Copyright TensorLib Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, soft... | @@ -250,8 +250,18 @@
#guard (make! (.some 100) .none (.some (-1))).size 10 == 10 -- ok if start is past the end of the array
#guard (make! (.some 100) (.some (-2)) (.some (-1))).size 10 == 1
-private theorem div_succ (k s : Nat) : (k + s) / s ≤ k + 1 := sorry
+private theorem le_div_le (c : Nat) (H : a ≤ b) : a / c... | {
"repo": "TensorLib",
"git_repo": "github.com/leanprover/TensorLib",
"revision": "5eedd07b028057a317ae2fffbe48d6781bb34aff",
"lean_toolchain": "leanprover/lean4:v4.23.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete... |
ablate_b44df21ea3de_1 | 502c8803cf78d1a4 | lean | lean | github.com/leanprover/TensorLib | 5eedd07b028057a317ae2fffbe48d6781bb34aff | TensorLib/Slice.lean | Slice | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "sizeDim",
"depth": 1,
"n_commands": 0,
"n_lines": 124,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases H_dim : dim ; simp [size0]\n rename_i k\n unfold size defaults stopOrDefault natDivCeil startOrDefault\n simp\n cases H... | [
{
"name": "div_succ",
"text": "private theorem div_succ (k s : Nat) : (k + s) / s ≤ k + 1 := by\n cases s <;> try omega\n simp\n rename_i n\n apply le_div_le\n omega\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 4,
"n_automa... | [
{
"name": "sizeDim",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 127,
"n_chars": 5383,
"n_subproofs": 1,
"n_tactics": 211,
"cyclomatic": 86,
"n_automation": 134,
"n_rewrites": 41,
"n_structural": 41,
"automation_only": false,
"max_nesti... | 6 | /-
Copyright TensorLib Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, soft... | /-
Copyright TensorLib Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, soft... | @@ -281,6 +281,13 @@
rename_i c
rw [Nat.div_le_iff_le_mul, Nat.mul_add] <;> try omega
+private theorem div_succ (k s : Nat) : (k + s) / s ≤ k + 1 := by
+ cases s <;> try omega
+ simp
+ rename_i n
+ apply le_div_le
+ omega
+
private theorem sizeDim (s : Slice) (dim : Nat) : s.size dim <= dim := by
cases... | {
"repo": "TensorLib",
"git_repo": "github.com/leanprover/TensorLib",
"revision": "5eedd07b028057a317ae2fffbe48d6781bb34aff",
"lean_toolchain": "leanprover/lean4:v4.23.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete... |
ablate_52f37221bf14_0 | 9c39d8db048e7b3a | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Autograd/Tape/Ops/Attention/MaskedMultiHeadSelfAttention.lean | MaskedMultiHeadSelfAttention | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "projectedMaskedAttention_hasFDerivAt",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n hMerge.comp x\n (maskedCoreAfterProjection_hasFDerivAt\n (n := n) (numHeads := numHeads) (headDim... | [
{
"name": "maskedCoreAfterProjection_hasFDerivAt",
"text": "/--\nComposition theorem for the additive-bias core after a projection/split stage.\n\n`projectPack` is the mathematical interface exposed by a full MHA front half: it builds\n`[Q_heads, Kᵀ_heads, V_heads]` from an outer context. The theorem compo... | [
{
"name": "projectedMaskedAttention_hasFDerivAt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2328,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Tape.Ops.Attention.MultiHeadSelfAttention
public import NN.Proofs.Autograd.Tape.Ops.Attention.MaskedScaledDotProduct
/-!
# Additive-Bias Multi-Head Attention... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Tape.Ops.Attention.MultiHeadSelfAttention
public import NN.Proofs.Autograd.Tape.Ops.Attention.MaskedScaledDotProduct
/-!
# Additive-Bias Multi-Head Attention... | @@ -198,6 +198,65 @@
simpa using dg5
/--
+Composition theorem for the additive-bias core after a projection/split stage.
+
+`projectPack` is the mathematical interface exposed by a full MHA front half: it builds
+`[Q_heads, Kᵀ_heads, V_heads]` from an outer context. The theorem composes that front half with the
... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_6ebd4b6047c2_0 | 3db600f58e3b4d6a | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/LipschitzCertified.lean | LipschitzCertified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "abs_vecGet_sub_le_of_linf_distance",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- `tensor_distance` is the `L∞` norm of the entrywise difference.\n have hcoord :\n |Tensor.vecG... | [
{
"name": "abs_vecGet_le_tensor_linf_norm",
"text": "private lemma abs_vecGet_le_tensor_linf_norm {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (i : Fin n) :\n |Tensor.vecGet y i| ≤ tensorLinfNorm (α := ℝ) y := by\n cases y with\n | dim f =>\n have hi : i ∈ List.finRange n := List.mem_finRange i\n ... | [
{
"name": "abs_vecGet_sub_le_of_linf_distance",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1279,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 5,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": f... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | @@ -55,6 +55,22 @@
def HasLogitMargin {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (c : Fin n) (m : ℝ) : Prop :=
∀ k : Fin n, k ≠ c → Tensor.vecGet y k ≤ Tensor.vecGet y c - m
+private lemma abs_vecGet_le_tensor_linf_norm {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (i : Fin n) :
+ |Tensor.vecGet y i| ≤ tensorLinfNo... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_6ebd4b6047c2_1 | 38001d0561543f27 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/LipschitzCertified.lean | LipschitzCertified | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "argmaxClassifier_eq_of_linf_distance_lt_half_margin",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hstrict : ∀ k : Fin n, k ≠ c → Tensor.vecGet y k < Tensor.vecGet y c := by\n i... | [
{
"name": "abs_vecGet_sub_le_of_linf_distance",
"text": "private lemma abs_vecGet_sub_le_of_linf_distance\n {n : Nat} {y₀ y : Tensor ℝ (.dim n .scalar)} {δ : ℝ} (i : Fin n)\n (h : tensorDistance (α := ℝ) (tensorLinfNorm (α := ℝ)) y₀ y ≤ δ) :\n |Tensor.vecGet y₀ i - Tensor.vecGet y i| ≤ δ := by\n -... | [
{
"name": "argmaxClassifier_eq_of_linf_distance_lt_half_margin",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1505,
"n_subproofs": 8,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"au... | 5 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | @@ -71,6 +71,32 @@
simpa [Tensor.vecGet, Spec.get, Spec.getAtSpec, tensorLinfNorm, MathFunctions.abs, hfi]
using hle
+private lemma abs_vecGet_sub_le_of_linf_distance
+ {n : Nat} {y₀ y : Tensor ℝ (.dim n .scalar)} {δ : ℝ} (i : Fin n)
+ (h : tensorDistance (α := ℝ) (tensorLinfNorm (α := ℝ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_6ebd4b6047c2_2 | 8c80396495ec0dde | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/LipschitzCertified.lean | LipschitzCertified | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "argmaxClassifier_eq_of_linf_distance_lt_half_margin",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hstrict : ∀ k : Fin n, k ≠ c → Tensor.vecGet y k < Tensor.vecGet y c := by\n i... | [
{
"name": "argmax_eq_some_of_strictMax",
"text": "private lemma argmax_eq_some_of_strictMax\n {n : Nat} {y : Tensor ℝ (.dim n .scalar)} {c : Fin n}\n (hstrict : ∀ k : Fin n, k ≠ c → Tensor.vecGet y k < Tensor.vecGet y c) :\n List.argmax (fun i : Fin n => Tensor.vecGet y i) (List.finRange n) = some ... | [
{
"name": "argmaxClassifier_eq_of_hasLogitMargin",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 807,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | @@ -55,6 +55,26 @@
def HasLogitMargin {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (c : Fin n) (m : ℝ) : Prop :=
∀ k : Fin n, k ≠ c → Tensor.vecGet y k ≤ Tensor.vecGet y c - m
+private lemma argmax_eq_some_of_strictMax
+ {n : Nat} {y : Tensor ℝ (.dim n .scalar)} {c : Fin n}
+ (hstrict : ∀ k : Fin n, k ≠ c → Te... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_6ebd4b6047c2_3 | 2b40eb12c9fc1926 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/LipschitzCertified.lean | LipschitzCertified | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "abs_vecGet_sub_le_of_linf_distance",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- `tensor_distance` is the `L∞` norm of the entrywise difference.\n have hcoord :\n |Tensor.vecG... | [
{
"name": "abs_vecGet_le_tensor_linf_norm",
"text": "private lemma abs_vecGet_le_tensor_linf_norm {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (i : Fin n) :\n |Tensor.vecGet y i| ≤ tensorLinfNorm (α := ℝ) y := by\n cases y with\n | dim f =>\n have hi : i ∈ List.finRange n := List.mem_finRange i\n ... | [
{
"name": "is_certified_robust_of_lipschitz_of_logitMargin",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 62,
"n_chars": 2952,
"n_subproofs": 7,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automa... | 8 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.MinMax
public import Mathlib.Data.Real.Basic
public import NN.MLTheory.LearningTheory.Robustness.Spec
public import NN.Proofs.Analysis.Lipschitz
public import ... | @@ -79,6 +79,22 @@
def HasLogitMargin {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (c : Fin n) (m : ℝ) : Prop :=
∀ k : Fin n, k ≠ c → Tensor.vecGet y k ≤ Tensor.vecGet y c - m
+private lemma abs_vecGet_le_tensor_linf_norm {n : Nat} (y : Tensor ℝ (.dim n .scalar)) (i : Fin n) :
+ |Tensor.vecGet y i| ≤ tensorLinfNo... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b70c621089b8_0 | 435b12962bae2677 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/NonlinearOps.lean | NonlinearOps | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "tanh_strictMono_real",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Use the standard calculus lemma: `deriv > 0` everywhere implies strict monotonicity.\n refine strictMono_of_deriv... | [
{
"name": "hasDerivAt_tanh_real",
"text": "/-- Derivative of real `tanh`, stated in the form needed for monotonicity. -/\ntheorem hasDerivAt_tanh_real (x : ℝ) :\n HasDerivAt Real.tanh (1 / (Real.cosh x) ^ 2) x := by\n -- Start from `sinh / cosh` and use the quotient rule.\n have hdiv :\n HasDerivA... | [
{
"name": "tanh_strictMono_real",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 496,
"n_subproofs": 3,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | @@ -34,11 +34,40 @@
So we can reuse its monotonicity lemma.
-/
+/-- Derivative of real `tanh`, stated in the form needed for monotonicity. -/
+theorem hasDerivAt_tanh_real (x : ℝ) :
+ HasDerivAt Real.tanh (1 / (Real.cosh x) ^ 2) x := by
+ -- Start from `sinh / cosh` and use the quotient rule.
+ have hdiv :
+ ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b70c621089b8_1 | 4aa64dd5faf86337 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/NonlinearOps.lean | NonlinearOps | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "tanh_mono_real",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n tanh_strictMono_real.monotone",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automa... | [
{
"name": "tanh_strictMono_real",
"text": "theorem tanh_strictMono_real : StrictMono Real.tanh := by\n -- Use the standard calculus lemma: `deriv > 0` everywhere implies strict monotonicity.\n refine strictMono_of_deriv_pos ?_\n intro x\n have hderiv : deriv Real.tanh x = 1 / (Real.cosh x) ^ 2 :=\n (... | [
{
"name": "tanh_mono_real",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 339,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | @@ -62,8 +62,22 @@
-- Finish.
simpa [hId, div_eq_mul_inv, one_div, pow_two, mul_assoc, mul_left_comm, mul_comm] using ht'
-theorem tanh_mono_real : Monotone Real.tanh := sorry
+theorem tanh_strictMono_real : StrictMono Real.tanh := by
+ -- Use the standard calculus lemma: `deriv > 0` everywhere implies strict ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b70c621089b8_2 | 4995be7109b0eff7 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/NonlinearOps.lean | NonlinearOps | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ibp_sin_sound_real",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases xB with\n | mk lo hi =>\n cases lo with\n | dim flo =>\n cases hi with\n | dim fhi =>\n c... | [
{
"name": "sin_lipschitz_real",
"text": "lemma sin_lipschitz_real (x y : ℝ) : |Real.sin x - Real.sin y| ≤ |x - y| := by\n have h := Real.sin_sub_sin x y\n calc\n |Real.sin x - Real.sin y|\n = |2 * Real.sin ((x - y) / 2) * Real.cos ((x + y) / 2)| := by\n simp [h, mul_left_comm, mul_com... | [
{
"name": "ibp_sin_sound_real",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 66,
"n_chars": 3022,
"n_subproofs": 16,
"n_tactics": 60,
"cyclomatic": 8,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 14,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | @@ -34,6 +34,40 @@
So we can reuse its monotonicity lemma.
-/
+lemma sin_lipschitz_real (x y : ℝ) : |Real.sin x - Real.sin y| ≤ |x - y| := by
+ have h := Real.sin_sub_sin x y
+ calc
+ |Real.sin x - Real.sin y|
+ = |2 * Real.sin ((x - y) / 2) * Real.cos ((x + y) / 2)| := by
+ simp [h, mul_left... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b70c621089b8_3 | 7120529b3bd8b404 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/NonlinearOps.lean | NonlinearOps | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ibp_cos_sound_real",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases xB with\n | mk lo hi =>\n cases lo with\n | dim flo =>\n cases hi with\n | dim fhi =>\n c... | [
{
"name": "cos_lipschitz_real",
"text": "lemma cos_lipschitz_real (x y : ℝ) : |Real.cos x - Real.cos y| ≤ |x - y| := by\n have h := Real.cos_sub_cos x y\n calc\n |Real.cos x - Real.cos y|\n = |(-2) * Real.sin ((x + y) / 2) * Real.sin ((x - y) / 2)| := by\n simp [h, mul_assoc]\n _ =... | [
{
"name": "ibp_cos_sound_real",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 66,
"n_chars": 3022,
"n_subproofs": 16,
"n_tactics": 60,
"cyclomatic": 8,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 14,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.IntervalLemmas
/-!
# Nonlinear IBP Soundness Lemmas
Monotonicity and Lipschitz facts for the nonlinear graph operations handled by ... | @@ -34,6 +34,36 @@
So we can reuse its monotonicity lemma.
-/
+lemma cos_lipschitz_real (x y : ℝ) : |Real.cos x - Real.cos y| ≤ |x - y| := by
+ have h := Real.cos_sub_cos x y
+ calc
+ |Real.cos x - Real.cos y|
+ = |(-2) * Real.sin ((x + y) / 2) * Real.sin ((x - y) / 2)| := by
+ simp [h, mul_a... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e4cdf58747b8_0 | 2a6315f34df3a331 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/MlpRobustness.lean | MlpRobustness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "relu_comp_preserves",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact comp_lipschitz f (fun t => max 0 t) h relu_lipschitz_bound",
"n_chars": 70,
"n_subproofs": 0,
"n_tact... | [
{
"name": "comp_lipschitz",
"text": "/--\nComposition property for Lipschitz functions\n-/\ntheorem comp_lipschitz (f g : ℝ → ℝ)\n (h_f : ∀ x y, |f x - f y| ≤ |x - y|)\n (h_g : ∀ x y, |g x - g y| ≤ |x - y|) :\n ∀ x y, |(g ∘ f) x - (g ∘ f) y| ≤ |x - y| := by\n intro x y\n calc |(g ∘ f) x - (g ∘ f)... | [
{
"name": "relu_comp_preserves",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | @@ -94,10 +94,24 @@
simp [max_eq_left (le_of_lt hx_neg), max_eq_left (le_of_lt hy_neg)]
/--
+Composition property for Lipschitz functions
+-/
+theorem comp_lipschitz (f g : ℝ → ℝ)
+ (h_f : ∀ x y, |f x - f y| ≤ |x - y|)
+ (h_g : ∀ x y, |g x - g y| ≤ |x - y|) :
+ ∀ x y, |(g ∘ f) x - (g ∘ f) y| ≤ |x - y... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e4cdf58747b8_1 | a683580c5ca80573 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/MlpRobustness.lean | MlpRobustness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mlp_lipschitz_complete_analysis",
"depth": 1,
"n_commands": 0,
"n_lines": 69,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n\n -- Get Lipschitz constants for each layer\n obtain ⟨L1, h1_pos, h1_bound⟩ := linear_layer_lipschitz_bou... | [
{
"name": "linear_layer_lipschitz_bound",
"text": "/--\nTheorem: Linear layers are Lipschitz continuous with constant `matrix_op_norm`.\n-/\ntheorem linear_layer_lipschitz_bound {inDim outDim : ℕ}\n (layer : Spec.LinearSpec ℝ inDim outDim)\n (h_weights_nonzero : layer.weights ≠ fill (0 : ℝ) _) :\n ... | [
{
"name": "mlp_lipschitz_complete_analysis",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 79,
"n_chars": 3774,
"n_subproofs": 9,
"n_tactics": 47,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 10,
"automation_only": fal... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | @@ -59,6 +59,111 @@
(layer : Spec.LinearSpec ℝ inDim outDim) : ℝ :=
Proofs.matrixOpNorm layer.weights
+/--
+Theorem: Linear layers are Lipschitz continuous with constant `matrix_op_norm`.
+-/
+theorem linear_layer_lipschitz_bound {inDim outDim : ℕ}
+ (layer : Spec.LinearSpec ℝ inDim outDim)
+ (h_weights... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e4cdf58747b8_2 | aff450bc0c8d3cbc | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/MlpRobustness.lean | MlpRobustness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "mlp_is_lipschitz_continuous_l2",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨L, hLpos, hLip⟩ := mlp_lipschitz_complete_analysis (l1 := l1) (l2 := l2)\n h1_nonzero h2_nonzero\... | [
{
"name": "mlp_lipschitz_complete_analysis",
"text": "theorem mlp_lipschitz_complete_analysis {inDim hidDim outDim : ℕ}\n (l1 : Spec.LinearSpec ℝ inDim hidDim)\n (l2 : Spec.LinearSpec ℝ hidDim outDim)\n (h1_nonzero : l1.weights ≠ fill (0 : ℝ) _)\n (h2_nonzero : l2.weights ≠ fill (0 : ℝ) _) :\n ... | [
{
"name": "mlp_is_lipschitz_continuous_l2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1063,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | @@ -164,6 +164,84 @@
rw [h_linear_eq]
exact Proofs.linear_op_norm_bound layer.weights x y
+theorem mlp_lipschitz_complete_analysis {inDim hidDim outDim : ℕ}
+ (l1 : Spec.LinearSpec ℝ inDim hidDim)
+ (l2 : Spec.LinearSpec ℝ hidDim outDim)
+ (h1_nonzero : l1.weights ≠ fill (0 : ℝ) _)
+ (h2_nonzero : l... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e4cdf58747b8_3 | 1bb5e98ba6cffdcf | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/Proofs/Verification/Robustness/MlpRobustness.lean | MlpRobustness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "mlp_is_lipschitz_continuous_l2",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨L, hLpos, hLip⟩ := mlp_lipschitz_complete_analysis (l1 := l1) (l2 := l2)\n h1_nonzero h2_nonzero\... | [
{
"name": "mlp_lipschitz_complete_analysis",
"text": "theorem mlp_lipschitz_complete_analysis {inDim hidDim outDim : ℕ}\n (l1 : Spec.LinearSpec ℝ inDim hidDim)\n (l2 : Spec.LinearSpec ℝ hidDim outDim)\n (h1_nonzero : l1.weights ≠ fill (0 : ℝ) _)\n (h2_nonzero : l2.weights ≠ fill (0 : ℝ) _) :\n ... | [
{
"name": "adversarial_robustness_certificate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1132,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": fa... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Algebra.Order.BigOperators.Group.Finset
public import Mathlib.Data.Real.Basic
public import Mathlib.Order.Bounds.Basic
public import NN.MLTheory.LearningTheory.Robustnes... | @@ -164,6 +164,84 @@
rw [h_linear_eq]
exact Proofs.linear_op_norm_bound layer.weights x y
+theorem mlp_lipschitz_complete_analysis {inDim hidDim outDim : ℕ}
+ (l1 : Spec.LinearSpec ℝ inDim hidDim)
+ (l2 : Spec.LinearSpec ℝ hidDim outDim)
+ (h1_nonzero : l1.weights ≠ fill (0 : ℝ) _)
+ (h2_nonzero : l... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_54a7a7b7364c_0 | 88aa7ca0564e6244 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Spec/Core/TensorBridge.lean | TensorBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "unflatten_flatten",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro shape t\n induction shape with\n | nil =>\n cases t with\n | scalar x =>\n intro h\n ... | [
{
"name": "take_drop_flatMap_finRange_eq",
"text": "/-- Slice out the `i`-th `k`-block from a flatMap of equal-length blocks. -/\nprivate theorem take_drop_flatMap_finRange_eq {α : Type} :\n ∀ {n : Nat} (k : Nat) (blocks : Fin n → List α)\n (_hlen : ∀ i : Fin n, (blocks i).length = k) (i : Fin n),\n... | [
{
"name": "unflatten_flatten",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1670,
"n_subproofs": 3,
"n_tactics": 36,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Spec.Core.Shape
public import NN.Spec.Core.Tensor
public import NN.Spec.Core.TensorArray
/-!
# TensorBridge
Computable, row-major conversions between `TensorArray.Tensor` a... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Spec.Core.Shape
public import NN.Spec.Core.Tensor
public import NN.Spec.Core.TensorArray
/-!
# TensorBridge
Computable, row-major conversions between `TensorArray.Tensor` a... | @@ -175,6 +175,62 @@
simp [flatten, unflatten, flatten_unflatten (shape := ns)]
exact flatMap_drop_take_eq n k xs hx
+/-- Slice out the `i`-th `k`-block from a flatMap of equal-length blocks. -/
+private theorem take_drop_flatMap_finRange_eq {α : Type} :
+ ∀ {n : Nat} (k : Nat) (blocks : Fin n → List... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_54a7a7b7364c_1 | 4fbe1b60188a2f89 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Spec/Core/TensorBridge.lean | TensorBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "to_tensor_to_tensor_array",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [toTensor, toTensorArray, TensorArray.ofArray, unflatten_flatten]",
"n_chars": 76,
"n_subproofs": 0,... | [
{
"name": "unflatten_flatten",
"text": "/-- Unflatten after flatten returns the original tensor (for any valid length proof). -/\ntheorem unflatten_flatten {α : Type} :\n ∀ {shape : List Nat} (t : Spec.Tensor α (listToShape shape))\n {h : (flatten t).length = TensorArray.shapeProd shape},\n unf... | [
{
"name": "to_tensor_to_tensor_array",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Spec.Core.Shape
public import NN.Spec.Core.Tensor
public import NN.Spec.Core.TensorArray
/-!
# TensorBridge
Computable, row-major conversions between `TensorArray.Tensor` a... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Spec.Core.Shape
public import NN.Spec.Core.Tensor
public import NN.Spec.Core.TensorArray
/-!
# TensorBridge
Computable, row-major conversions between `TensorArray.Tensor` a... | @@ -231,6 +231,48 @@
simpa [hdrop0] using hdrop_succ
simpa [rest, hdrop] using ih'
+/-- Unflatten after flatten returns the original tensor (for any valid length proof). -/
+theorem unflatten_flatten {α : Type} :
+ ∀ {shape : List Nat} (t : Spec.Tensor α (listToShape shape))
+ {h : (flatte... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_317ec5b02bce_0 | d3c858a8f3866be1 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RuntimeApprox/NF/Ops/Elementwise/SoftplusSafeLog.lean | SoftplusSafeLog | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "abs_safe_log_sub_safe_log_le_one_div_mul_abs_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 78,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Mean value theorem on `ℝ` (derivative bounded by `1/ε` everywhere).\n have hf :\n ... | [
{
"name": "sigmoid_spec_nonneg",
"text": "private lemma sigmoid_spec_nonneg (x : ℝ) :\n 0 ≤ Activation.Math.sigmoidSpec (α := ℝ) x := by\n unfold Activation.Math.sigmoidSpec\n -- `MathFunctions.exp` is `Real.exp` on `ℝ`.\n rw [Proofs.mathfunc_exp_eq_rexp (-x)]\n have hden : 0 < (1 : ℝ) + Real.exp (-x... | [
{
"name": "abs_safe_log_sub_safe_log_le_one_div_mul_abs_sub",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 90,
"n_chars": 4224,
"n_subproofs": 14,
"n_tactics": 67,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 6,
"auto... | 3 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | @@ -228,6 +228,17 @@
(Activation.Math.safeLogSpec (α := ℝ)
(toSpec (β := β) (fexp := fexp) (rnd := rnd) xR) ε)
+private lemma sigmoid_spec_nonneg (x : ℝ) :
+ 0 ≤ Activation.Math.sigmoidSpec (α := ℝ) x := by
+ unfold Activation.Math.sigmoidSpec
+ -- `MathFunctions.exp` is `Real.exp` on `ℝ`.
+ rw [Pro... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_317ec5b02bce_1 | e8d3d974b86f2d1f | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RuntimeApprox/NF/Ops/Elementwise/SoftplusSafeLog.lean | SoftplusSafeLog | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "abs_safe_log_sub_safe_log_le_one_div_mul_abs_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 78,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Mean value theorem on `ℝ` (derivative bounded by `1/ε` everywhere).\n have hf :\n ... | [
{
"name": "sigmoid_spec_le_one",
"text": "private lemma sigmoid_spec_le_one (x : ℝ) :\n Activation.Math.sigmoidSpec (α := ℝ) x ≤ 1 := by\n unfold Activation.Math.sigmoidSpec\n simp [Proofs.mathfunc_exp_eq_rexp]\n have hden : (1 : ℝ) ≤ (1 : ℝ) + Real.exp (-x) := by\n have : 0 ≤ Real.exp (-x) := le_o... | [
{
"name": "approx_safe_log_nf",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 82,
"n_chars": 3698,
"n_subproofs": 7,
"n_tactics": 56,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | @@ -239,6 +239,16 @@
div_pos (by norm_num) hden
simpa using le_of_lt this
+private lemma sigmoid_spec_le_one (x : ℝ) :
+ Activation.Math.sigmoidSpec (α := ℝ) x ≤ 1 := by
+ unfold Activation.Math.sigmoidSpec
+ simp [Proofs.mathfunc_exp_eq_rexp]
+ have hden : (1 : ℝ) ≤ (1 : ℝ) + Real.exp (-x) := by
+ h... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_317ec5b02bce_2 | 8dcd8106827ade3f | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RuntimeApprox/NF/Ops/Elementwise/SoftplusSafeLog.lean | SoftplusSafeLog | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "abs_safe_log_sub_safe_log_le_one_div_mul_abs_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 78,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Mean value theorem on `ℝ` (derivative bounded by `1/ε` everywhere).\n have hf :\n ... | [
{
"name": "sigmoid_spec_le_one",
"text": "private lemma sigmoid_spec_le_one (x : ℝ) :\n Activation.Math.sigmoidSpec (α := ℝ) x ≤ 1 := by\n unfold Activation.Math.sigmoidSpec\n simp [Proofs.mathfunc_exp_eq_rexp]\n have hden : (1 : ℝ) ≤ (1 : ℝ) + Real.exp (-x) := by\n have : 0 ≤ Real.exp (-x) := le_o... | [
{
"name": "approxT_safe_log_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 31,
"n_chars": 1523,
"n_subproofs": 1,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 5 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.RuntimeApprox.NF.Ops.Elementwise.Core
/-!
# NF Elementwise Bounds: Softplus and Safe Log
-/
@[expose] public section
namespace Proofs
namespace RuntimeApprox
open ... | @@ -239,6 +239,16 @@
div_pos (by norm_num) hden
simpa using le_of_lt this
+private lemma sigmoid_spec_le_one (x : ℝ) :
+ Activation.Math.sigmoidSpec (α := ℝ) x ≤ 1 := by
+ unfold Activation.Math.sigmoidSpec
+ simp [Proofs.mathfunc_exp_eq_rexp]
+ have hden : (1 : ℝ) ≤ (1 : ℝ) + Real.exp (-x) := by
+ h... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_701749d48bfa_0 | e5975e591f99b8b0 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RL/Environment.lean | Environment | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "states_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [states] using statesFrom_length (env := env) (state := env.initialState) (actions := actions)",
"n_chars": 106,
... | [
{
"name": "statesFrom_length",
"text": "/-- `statesFrom` records the initial state plus one state per action. -/\ntheorem statesFrom_length\n (env : Env State Action Observation Reward) (state : State) (actions : List Action) :\n (statesFrom env state actions).length = actions.length + 1 := by\n indu... | [
{
"name": "states_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | @@ -34,10 +34,21 @@
universe u v w z
variable {State : Type u} {Action : Type v} {Observation : Type w} {Reward : Type z}
+/-- `statesFrom` records the initial state plus one state per action. -/
+theorem statesFrom_length
+ (env : Env State Action Observation Reward) (state : State) (actions : List Action) :
+ ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_701749d48bfa_1 | cd82a623e1ff5750 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RL/Environment.lean | Environment | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "rollout_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [rollout] using rolloutFrom_length (env := env) (state := env.initialState) (actions := actions)",
"n_chars": 108,... | [
{
"name": "rolloutFrom_length",
"text": "/-- `rolloutFrom` emits exactly one observed transition per action. -/\ntheorem rolloutFrom_length\n (env : Env State Action Observation Reward) (state : State) (actions : List Action) :\n (rolloutFrom env state actions).length = actions.length := by\n inducti... | [
{
"name": "rollout_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 326,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting":... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | @@ -34,10 +34,21 @@
universe u v w z
variable {State : Type u} {Action : Type v} {Observation : Type w} {Reward : Type z}
+/-- `rolloutFrom` emits exactly one observed transition per action. -/
+theorem rolloutFrom_length
+ (env : Env State Action Observation Reward) (state : State) (actions : List Action) :
+ ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_701749d48bfa_2 | bc9332e293b9a429 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RL/Environment.lean | Environment | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evolve_safe",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [evolve] using\n evolveFrom_safe (env := env) (state := env.toEnv.initialState) (actions := actions) env.init_safe hOk... | [
{
"name": "evolveFrom_safe",
"text": "/-- Safe environments preserve the invariant along any valid action path. -/\ntheorem evolveFrom_safe\n (env : SafeEnv State Action Observation Reward)\n {state : State} {actions : List Action}\n (hInv : env.Invariant state)\n (hOk : env.actionPathOk state a... | [
{
"name": "evolve_safe",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 431,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 4... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | @@ -34,12 +34,31 @@
universe u v w z
variable {State : Type u} {Action : Type v} {Observation : Type w} {Reward : Type z}
+/-- Safe environments preserve the invariant along any valid action path. -/
+theorem evolveFrom_safe
+ (env : SafeEnv State Action Observation Reward)
+ {state : State} {actions : List A... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_701749d48bfa_3 | 1b5c4208fa77d036 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/RL/Environment.lean | Environment | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "states_safe",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [states] using\n statesFrom_safe (env := env) (state := env.toEnv.initialState) (actions := actions) env.init_safe hOk... | [
{
"name": "statesFrom_safe",
"text": "/-- Every state in `statesFrom` satisfies the invariant along a valid action path. -/\ntheorem statesFrom_safe\n (env : SafeEnv State Action Observation Reward)\n {state : State} {actions : List Action}\n (hInv : env.Invariant state)\n (hOk : env.actionPathO... | [
{
"name": "states_safe",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 448,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 4... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import Mathlib.Data.List.Basic
public import NN.Spec.RL.Environment
/-!
# RL Environment Proofs
These theorems capture the first "guarantee layer" for TorchLean's Gym-style environme... | @@ -34,12 +34,31 @@
universe u v w z
variable {State : Type u} {Action : Type v} {Observation : Type w} {Reward : Type z}
+/-- Every state in `statesFrom` satisfies the invariant along a valid action path. -/
+theorem statesFrom_safe
+ (env : SafeEnv State Action Observation Reward)
+ {state : State} {actions... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_06d4e15faaba_0 | 22002416f038db55 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Analysis/FftBridge.lean | FftBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "twiddle_eq_omega_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hn0 : (n : ℂ) ≠ 0 := by exact_mod_cast hn\n set θ : ℂ := (Numbers.two : ℂ) * MathFunctions.pi * (j : ℂ) * (k : ... | [
{
"name": "FFT1D_I_eq",
"text": "/--\nTorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.\n\nWhen we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual\n`Complex.I`.\n-/\nprivate lemma FFT1D_I_eq :\n Runtime.Autograd.TorchLean.NN.FFT1D.I (α := ℂ) = (... | [
{
"name": "twiddle_eq_omega_pow",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 78,
"n_chars": 3091,
"n_subproofs": 8,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 16,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | @@ -125,6 +125,18 @@
open Runtime.Autograd.TorchLean.NN
/--
+TorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.
+
+When we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual
+`Complex.I`.
+-/
+private lemma FFT1D_I_eq :
+ Runtime.Autograd.TorchLean.NN.FFT1D... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_06d4e15faaba_1 | 3b97841605759b34 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Analysis/FftBridge.lean | FftBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "twiddle_eq_omega_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hn0 : (n : ℂ) ≠ 0 := by exact_mod_cast hn\n set θ : ℂ := (Numbers.two : ℂ) * MathFunctions.pi * (j : ℂ) * (k : ... | [
{
"name": "FFT1D_I_eq",
"text": "/--\nTorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.\n\nWhen we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual\n`Complex.I`.\n-/\nprivate lemma FFT1D_I_eq :\n Runtime.Autograd.TorchLean.NN.FFT1D.I (α := ℂ) = (... | [
{
"name": "twiddleInv_eq_zeta_pow",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 66,
"n_chars": 2800,
"n_subproofs": 8,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | @@ -125,6 +125,18 @@
open Runtime.Autograd.TorchLean.NN
/--
+TorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.
+
+When we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual
+`Complex.I`.
+-/
+private lemma FFT1D_I_eq :
+ Runtime.Autograd.TorchLean.NN.FFT1D... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_06d4e15faaba_2 | 648921df832e5db6 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Analysis/FftBridge.lean | FftBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "twiddle_eq_omega_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hn0 : (n : ℂ) ≠ 0 := by exact_mod_cast hn\n set θ : ℂ := (Numbers.two : ℂ) * MathFunctions.pi * (j : ℂ) * (k : ... | [
{
"name": "FFT1D_I_eq",
"text": "/--\nTorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.\n\nWhen we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual\n`Complex.I`.\n-/\nprivate lemma FFT1D_I_eq :\n Runtime.Autograd.TorchLean.NN.FFT1D.I (α := ℂ) = (... | [
{
"name": "dftMatrix_entry_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 661,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | @@ -125,6 +125,18 @@
open Runtime.Autograd.TorchLean.NN
/--
+TorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.
+
+When we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual
+`Complex.I`.
+-/
+private lemma FFT1D_I_eq :
+ Runtime.Autograd.TorchLean.NN.FFT1D... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_06d4e15faaba_3 | 63dea0079d44fe2a | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Analysis/FftBridge.lean | FftBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "twiddle_eq_omega_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hn0 : (n : ℂ) ≠ 0 := by exact_mod_cast hn\n set θ : ℂ := (Numbers.two : ℂ) * MathFunctions.pi * (j : ℂ) * (k : ... | [
{
"name": "FFT1D_I_eq",
"text": "/--\nTorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.\n\nWhen we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual\n`Complex.I`.\n-/\nprivate lemma FFT1D_I_eq :\n Runtime.Autograd.TorchLean.NN.FFT1D.I (α := ℂ) = (... | [
{
"name": "idftMatrix_entry_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 697,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Analysis.Fft
public import NN.Runtime.Autograd.TorchLean.Fft
public import Mathlib.Analysis.RCLike.Sqrt
/-!
# Runtime FFT transport lemmas (`NN.Runtime.*.Fft` → mathl... | @@ -125,6 +125,18 @@
open Runtime.Autograd.TorchLean.NN
/--
+TorchLean's runtime FFT uses `sqrt(-1)` as its scalar-polymorphic imaginary unit.
+
+When we instantiate the runtime definitions at mathlib `ℂ`, that value is the usual
+`Complex.I`.
+-/
+private lemma FFT1D_I_eq :
+ Runtime.Autograd.TorchLean.NN.FFT1D... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b53c6301147b_0 | 49ddc2501d10846a | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/IntervalLemmas.lean | IntervalLemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "interval_mul_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_lx : min (lx * ly) (lx * uy) ≤ lx * y ∧ lx * y ≤ max (lx * ly) (lx * uy) :=\n mul_const_bounds (a := lx) hy ... | [
{
"name": "mul_var_bounds",
"text": "lemma mul_var_bounds {lx ux x y : ℝ} (hx : lx ≤ x) (hx' : x ≤ ux) :\n min (lx * y) (ux * y) ≤ x * y ∧ x * y ≤ max (lx * y) (ux * y) := by\n by_cases hy : 0 ≤ y\n · have hlo : lx * y ≤ x * y := mul_le_mul_of_nonneg_right hx hy\n have hhi : x * y ≤ ux * y := mul_le... | [
{
"name": "interval_mul_bounds",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1878,
"n_subproofs": 11,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.CertificateStep
/-!
# Interval Soundness Lemmas
Scalar interval arithmetic, box-cast lemmas, and point-box facts used by the graph ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.CertificateStep
/-!
# Interval Soundness Lemmas
Scalar interval arithmetic, box-cast lemmas, and point-box facts used by the graph ... | @@ -51,6 +51,17 @@
have hhi : a * y ≤ a * ly := mul_le_mul_of_nonpos_left hy ha'
refine ⟨le_trans (min_le_right _ _) hlo, le_trans hhi (le_max_left _ _)⟩
+lemma mul_var_bounds {lx ux x y : ℝ} (hx : lx ≤ x) (hx' : x ≤ ux) :
+ min (lx * y) (ux * y) ≤ x * y ∧ x * y ≤ max (lx * y) (ux * y) := by
+ by_cases ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_b53c6301147b_1 | 28cbd59fe199b745 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/MLTheory/CROWN/Proofs/GraphCertSoundness/IntervalLemmas.lean | IntervalLemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "box_mul_elem_sound_real",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n cases lo1 with\n | dim l1 =>\n cases hi1 with\n | dim u1 =>\n cases lo2 with\n | dim... | [
{
"name": "max2_eq_max",
"text": "lemma max2_eq_max (a b : ℝ) : NN.MLTheory.CROWN.BoundOps.max2 a b = max a b := by\n by_cases h : a > b\n · have hab : b ≤ a := le_of_lt h\n simp [NN.MLTheory.CROWN.BoundOps.max2, h, max_eq_left hab]\n · have hab : a ≤ b := le_of_not_gt h\n simp [NN.MLTheory.CROWN.B... | [
{
"name": "box_mul_elem_sound_real",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 75,
"n_chars": 3183,
"n_subproofs": 5,
"n_tactics": 52,
"cyclomatic": 13,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 15,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.CertificateStep
/-!
# Interval Soundness Lemmas
Scalar interval arithmetic, box-cast lemmas, and point-box facts used by the graph ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.MLTheory.CROWN.Proofs.GraphCertSoundness.CertificateStep
/-!
# Interval Soundness Lemmas
Scalar interval arithmetic, box-cast lemmas, and point-box facts used by the graph ... | @@ -101,6 +101,13 @@
· have hab : a ≤ b := le_of_not_gt h
simp [NN.MLTheory.CROWN.BoundOps.min2, h, min_eq_left hab]
+lemma max2_eq_max (a b : ℝ) : NN.MLTheory.CROWN.BoundOps.max2 a b = max a b := by
+ by_cases h : a > b
+ · have hab : b ≤ a := le_of_lt h
+ simp [NN.MLTheory.CROWN.BoundOps.max2, h, max_e... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_77dc5b6504d3_0 | 85681b87af193a83 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Tensor/Basic/BoundsNorms.lean | BoundsNorms | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "dot_add_left",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dot]\n -- Reduce to distributivity of `mul_spec` and `sum_spec_add_distrib`.\n have hmul : mulSpec (addSpec a b) c = ... | [
{
"name": "sum_spec_add_distrib",
"text": "/-- Sum distributes over elementwise addition. -/\ntheorem sum_spec_add_distrib {s : Shape} (a b : Tensor ℝ s) :\n sumSpec (addSpec a b) = sumSpec a + sumSpec b := by\n unfold sumSpec addSpec\n induction s with\n | scalar =>\n cases a; cases b\n simp [ten... | [
{
"name": "dot_add_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 816,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 8,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 9,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | @@ -22,9 +22,98 @@
open Tensor
open scoped BigOperators
+/-- Sum distributes over elementwise addition. -/
+theorem sum_spec_add_distrib {s : Shape} (a b : Tensor ℝ s) :
+ sumSpec (addSpec a b) = sumSpec a + sumSpec b := by
+ unfold sumSpec addSpec
+ induction s with
+ | scalar =>
+ cases a; cases b
+ sim... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_77dc5b6504d3_1 | cb25edf5a4737254 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Tensor/Basic/BoundsNorms.lean | BoundsNorms | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "tensorAllLE_tensorMax",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by\n intro s t\n induction s with\n | scalar =>\n cases t with\n | scalar x =>\n simp [tensorAllLE, tenso... | [
{
"name": "tensorMax_le_dim",
"text": "/-- Each slice maximum is bounded by the tensor maximum of a `.dim` tensor. -/\nprivate lemma tensorMax_le_dim {n : Nat} {inner : Shape} (values : Fin n → Tensor ℝ inner) (j : Fin\n n) :\n tensorMax (values j) ≤ tensorMax (Tensor.dim values) := by\n -- `tensorMax ... | [
{
"name": "tensorAllLE_tensorMax",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 640,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | @@ -35,6 +35,21 @@
| .dim n _, .dim values =>
((List.finRange n).map (fun j => tensorMax (values j))).foldl max 0
+/-- Each slice maximum is bounded by the tensor maximum of a `.dim` tensor. -/
+private lemma tensorMax_le_dim {n : Nat} {inner : Shape} (values : Fin n → Tensor ℝ inner) (j : Fin
+ n) :
+ ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_77dc5b6504d3_2 | dee769279fe43218 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Tensor/Basic/BoundsNorms.lean | BoundsNorms | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "tensorAllLE_tensorMax",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n by\n intro s t\n induction s with\n | scalar =>\n cases t with\n | scalar x =>\n simp [tensorAllLE, tenso... | [
{
"name": "tensorAllLE_mono",
"text": "/-- Monotonicity: if `tensorAllLE b₁ t` and `b₁ ≤ b₂`, then `tensorAllLE b₂ t`. -/\nprivate lemma tensorAllLE_mono {bnd₁ bnd₂ : ℝ} :\n ∀ {s : Shape} (t : Tensor ℝ s), tensorAllLE bnd₁ t → bnd₁ ≤ bnd₂ → tensorAllLE bnd₂ t := by\n intro s t ht hle\n induction s with... | [
{
"name": "safediv_bound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 698,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 4 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | @@ -50,6 +50,21 @@
(l := (List.finRange n).map (fun k => tensorMax (values k))) (f := id)
(acc := 0) (i := tensorMax (values j)) hmem)
+/-- Monotonicity: if `tensorAllLE b₁ t` and `b₁ ≤ b₂`, then `tensorAllLE b₂ t`. -/
+private lemma tensorAllLE_mono {bnd₁ bnd₂ : ℝ} :
+ ∀ {s : Shape} (t : Tensor ℝ s)... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_77dc5b6504d3_3 | 08afb7857af0ce56 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Tensor/Basic/BoundsNorms.lean | BoundsNorms | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "tensor_norm_squared_nonneg2",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [ge_iff_le] using tensor_norm_squared_nonneg (t := t)",
"n_chars": 65,
"n_subproofs": 0,
"n_t... | [
{
"name": "tensor_norm_squared_nonneg",
"text": "/-- `tensor_norm_squared t` is nonnegative, since it is a sum of squares. -/\ntheorem tensor_norm_squared_nonneg {s : Shape} (t : Tensor ℝ s) :\n tensorNormSquared t ≥ 0 := by\n -- `tensor_norm_squared t = dot t t = sum_spec (mul_spec t t)` is a sum of squa... | [
{
"name": "tensor_norm_squared_nonneg2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 416,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | @@ -42,6 +42,77 @@
noncomputable def tensorNormSquared {s : Shape} (t : Tensor ℝ s) : ℝ :=
dot t t
+/-- `tensor_norm_squared t` is nonnegative, since it is a sum of squares. -/
+theorem tensor_norm_squared_nonneg {s : Shape} (t : Tensor ℝ s) :
+ tensorNormSquared t ≥ 0 := by
+ -- `tensor_norm_squared t = dot t ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_77dc5b6504d3_4 | 2e1c067e0c9f4187 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Tensor/Basic/BoundsNorms.lean | BoundsNorms | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "tensor_norm_squared_nonneg2",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [ge_iff_le] using tensor_norm_squared_nonneg (t := t)",
"n_chars": 65,
"n_subproofs": 0,
"n_t... | [
{
"name": "tensor_norm_squared_nonneg",
"text": "/-- `tensor_norm_squared t` is nonnegative, since it is a sum of squares. -/\ntheorem tensor_norm_squared_nonneg {s : Shape} (t : Tensor ℝ s) :\n tensorNormSquared t ≥ 0 := by\n -- `tensor_norm_squared t = dot t t = sum_spec (mul_spec t t)` is a sum of squa... | [
{
"name": "tensor_norm_squared_zero_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 245,
"n_chars": 11699,
"n_subproofs": 58,
"n_tactics": 192,
"cyclomatic": 12,
"n_automation": 37,
"n_rewrites": 10,
"n_structural": 44,
"automation_only":... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Tensor.Basic.LinearAlgebra
/-!
Bounds and norm facts for dependent tensors.
The lemmas here support proof developments that need componentwise bounds, norm estimates... | @@ -42,6 +42,77 @@
noncomputable def tensorNormSquared {s : Shape} (t : Tensor ℝ s) : ℝ :=
dot t t
+/-- `tensor_norm_squared t` is nonnegative, since it is a sum of squares. -/
+theorem tensor_norm_squared_nonneg {s : Shape} (t : Tensor ℝ s) :
+ tensorNormSquared t ≥ 0 := by
+ -- `tensor_norm_squared t = dot t ... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_ad2587c7b7ab_0 | d5ab22ed4ff80360 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Autograd/Runtime/Link/Invariants.lean | Invariants | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "compileAuxData_requires_grad_true",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t i hi\n have hall :\n t.nodes.all (fun n => n.requires_grad) = true := by\n simpa [t] usi... | [
{
"name": "compileAuxData_all_requires_grad_true",
"text": "/--\nAll nodes produced by `compileAuxData` have `requires_grad = true`.\n\nThis is a simplifying invariant: the compiled tape is meant for correctness proofs, so we mark\nevery node as eligible for gradient accumulation (including leaves for input... | [
{
"name": "compileAuxData_requires_grad_true",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 814,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Runtime.Link.Core
@[expose] public section
namespace Proofs
namespace Autograd
namespace Algebra
open Spec
open Tensor
namespace Graph
open Runtime
open ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Runtime.Link.Core
@[expose] public section
namespace Proofs
namespace Autograd
namespace Algebra
open Spec
open Tensor
namespace Graph
open Runtime
open ... | @@ -33,6 +33,47 @@
-/
/--
+All nodes produced by `compileAuxData` have `requires_grad = true`.
+
+This is a simplifying invariant: the compiled tape is meant for correctness proofs, so we mark
+every node as eligible for gradient accumulation (including leaves for inputs).
+-/
+theorem compileAuxData_all_requires_g... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_ad2587c7b7ab_1 | 4072f19fce170dcf | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/Proofs/Autograd/Runtime/Link/Invariants.lean | Invariants | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "compileAux_requires_grad_true",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro t i hi\n have hall :\n t.nodes.all (fun n => n.requires_grad) = true := by\n simpa [t] using c... | [
{
"name": "compileAux_all_requires_grad_true",
"text": "/--\nAll nodes produced by `compileAux` have `requires_grad = true`.\n\nThis mirrors `compileAuxData_all_requires_grad_true` for the `Graph` interface.\n-/\ntheorem compileAux_all_requires_grad_true {α : Type} {Δ : Type} [DecidableEq Shape]\n [CommSem... | [
{
"name": "compileAux_requires_grad_true",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 730,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Runtime.Link.Core
@[expose] public section
namespace Proofs
namespace Autograd
namespace Algebra
open Spec
open Tensor
namespace Graph
open Runtime
open ... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.Proofs.Autograd.Runtime.Link.Core
@[expose] public section
namespace Proofs
namespace Autograd
namespace Algebra
open Spec
open Tensor
namespace Graph
open Runtime
open ... | @@ -32,6 +32,50 @@
reverse-mode loop on this compiled tape matches the proved `backpropAllCtx`.
-/
+/--
+All nodes produced by `compileAux` have `requires_grad = true`.
+
+This mirrors `compileAuxData_all_requires_grad_true` for the `Graph` interface.
+-/
+theorem compileAux_all_requires_grad_true {α : Type} {Δ : T... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e67ae8ef18fd_0 | d86173544486eb19 | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/API/SelfSupervised/Core.lean | Core | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "vectorMaeMask_hidden_get_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbool : vectorMaeHiddenMask dataDim period offset j = true := by\n simpa [NN.MLTheory.SelfSupervis... | [
{
"name": "vectorMaeMask_get_eq_if_selected_hidden",
"text": "/--\nCoordinate-level bridge from the executable tensor mask to the finite mask used in the\nself-supervised theory files.\n\nFor every batch row and feature coordinate, `vectorMaeMask` returns exactly zero on hidden\ncoordinates and the original... | [
{
"name": "vectorMaeMask_hidden_get_eq_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 703,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.API.Core
public import NN.API.Public.TensorPack
public import NN.API.Tensor.Views
public import NN.MLTheory.SelfSupervised.PredictiveView
/-!
# Self-Supervised Training API
... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.API.Core
public import NN.API.Public.TensorPack
public import NN.API.Tensor.Views
public import NN.MLTheory.SelfSupervised.PredictiveView
/-!
# Self-Supervised Training API
... | @@ -76,13 +76,46 @@
j.val % period ≠ offset % period
Spec.Tensor.scalar (if keep then v else 0.0)))
+/--
+Coordinate-level bridge from the executable tensor mask to the finite mask used in the
+self-supervised theory files.
+
+For every batch row and feature coordinate, `vectorMaeMask` returns exact... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
ablate_e67ae8ef18fd_1 | 5ff1fe9cf352f5db | lean | lean | github.com/lean-dojo/TorchLean | a0c5bdf2bb02c25b270a2c89a12ad2335c86c530 | NN/API/SelfSupervised/Core.lean | Core | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "vectorMaeMask_hidden_get_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbool : vectorMaeHiddenMask dataDim period offset j = true := by\n simpa [NN.MLTheory.SelfSupervis... | [
{
"name": "vectorMaeMask_get_eq_if_selected_hidden",
"text": "/--\nCoordinate-level bridge from the executable tensor mask to the finite mask used in the\nself-supervised theory files.\n\nFor every batch row and feature coordinate, `vectorMaeMask` returns exactly zero on hidden\ncoordinates and the original... | [
{
"name": "vectorMaeMask_visible_get_eq_input",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 810,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 1 | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.API.Core
public import NN.API.Public.TensorPack
public import NN.API.Tensor.Views
public import NN.MLTheory.SelfSupervised.PredictiveView
/-!
# Self-Supervised Training API
... | /-
Copyright (c) 2026 TorchLean
Released under MIT license as described in the file LICENSE.
Authors: TorchLean Team
-/
module
public import NN.API.Core
public import NN.API.Public.TensorPack
public import NN.API.Tensor.Views
public import NN.MLTheory.SelfSupervised.PredictiveView
/-!
# Self-Supervised Training API
... | @@ -76,13 +76,47 @@
j.val % period ≠ offset % period
Spec.Tensor.scalar (if keep then v else 0.0)))
+/--
+Coordinate-level bridge from the executable tensor mask to the finite mask used in the
+self-supervised theory files.
+
+For every batch row and feature coordinate, `vectorMaeMask` returns exact... | {
"repo": "TorchLean",
"git_repo": "github.com/lean-dojo/TorchLean",
"revision": "a0c5bdf2bb02c25b270a2c89a12ad2335c86c530",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.