srcContext stringlengths 274 35.4k | theoremStatement stringlengths 62 1.08k | theoremName stringlengths 16 52 | fileCreated dict | theoremCreated dict | file stringlengths 26 42 | module stringlengths 15 31 | jsonFile stringlengths 21 37 | positionMetadata dict | dependencyMetadata dict | proofMetadata dict |
|---|---|---|---|---|---|---|---|---|---|---|
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | theorem TSet.symmetric {α β : Λ} (x : TSet α) (hβ : (β : TypeIndex) < α) :
Symmetric {y : TSet β | y ∈[hβ] x} hβ | ConNF.TSet.symmetric | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "b0bc9d69a413800c2ef0d0e3495ee0e71dc3fea7",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 154,
"tokenPositionInFile": 5178,
"theoremPositionInFile": 12
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 39,
"numPremises": 84
} | {
"hasProof": true,
"proof": ":= by\n obtain ⟨S, hS⟩ := exists_support x\n use S\n intro ρ hρ\n conv_rhs => rw [← hS ρ hρ]\n simp only [← forget_mem_forget, smul_forget, StrSet.mem_smul_iff]\n ext y\n rw [Set.mem_smul_set_iff_inv_smul_mem, Set.mem_setOf_eq, Set.mem_setOf_eq,\n smul_forget, allPermForget_i... |
import ConNF.Background.Rel
import ConNF.Base.Small
/-!
# Enumerations
In this file, we define enumerations of a type.
## Main declarations
* `ConNF.Enumeration`: The type family of enumerations.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type u}
@[ext]
structure Enumeration (X : ... | @[simp]
theorem not_mem_empty (x : X) : x ∉ Enumeration.empty | ConNF.Enumeration.not_mem_empty | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Enumeration.lean | ConNF.ModelData.Enumeration | ConNF.ModelData.Enumeration.jsonl | {
"lineInFile": 66,
"tokenPositionInFile": 1348,
"theoremPositionInFile": 5
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 6,
"numPremises": 13
} | {
"hasProof": true,
"proof": ":= by\n rintro ⟨i, h⟩\n cases h",
"proofType": "tactic",
"proofLengthLines": 2,
"proofLengthTokens": 31
} |
import ConNF.Levels.Path
/-!
# Trees
In this file, we define the notion of a tree on a type.
## Main declarations
* `ConNF.Tree`: The type family of trees parametrised by a given type.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type _} {α β γ : TypeIndex}
/-- An `α`-tree of `X` as... | @[simp]
theorem mul_deriv [Group X] (T₁ T₂ : Tree X α) (A : α ↝ β) :
(T₁ * T₂) ⇘ A = T₁ ⇘ A * T₂ ⇘ A | ConNF.Tree.mul_deriv | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "012929981ca97cb4447881b386c61e3bac0c6b93",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Levels/Tree.lean | ConNF.Levels.Tree | ConNF.Levels.Tree.jsonl | {
"lineInFile": 102,
"tokenPositionInFile": 2187,
"theoremPositionInFile": 13
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 7,
"numPremises": 16
} | {
"hasProof": true,
"proof": ":=\n rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 8
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_codom_iff (r : TSet α) (x : TSet δ) :
x ∈' codom hβ hγ hδ r ↔ x ∈ (ExternalRel hβ hγ hδ r).codom | ConNF.mem_codom_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 139,
"tokenPositionInFile": 4169,
"theoremPositionInFile": 23
} | {
"inFilePremises": true,
"numInFilePremises": 7,
"repositoryPremises": true,
"numRepositoryPremises": 22,
"numPremises": 57
} | {
"hasProof": true,
"proof": ":= by\n simp only [codom, mem_compl_iff, mem_typeLower_iff, not_forall, not_not]\n constructor\n · rintro ⟨y, hy⟩\n obtain ⟨a, b, rfl, hb⟩ := exists_of_mem_singletonImage lt_higherIndex hβ hγ hδ hy\n rw [singleton_inj] at hb\n subst hb\n rw [singletonImage_spec] at hy\n ... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem convAtoms_injective_of_fixes {S : Support α} {T : Support γ}
{ρ₁ ρ₂ : AllPerm β} {hγ : (γ : TypeIndex) < β}
(hρ₁ : ρ₁ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(hρ₂ : ρ₂ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(A : ↑α ↝ ⊥) :
(convAtoms
(S + (ρ₁ᵁ • ((T ↗ hγ).st... | ConNF.Support.convAtoms_injective_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 181,
"tokenPositionInFile": 7503,
"theoremPositionInFile": 5
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 71,
"numPremises": 148
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.smul_eq_iff] at hρ₁ hρ₂\n constructor\n rintro a₁ a₂ a₃ ⟨i, hi₁, hi₂⟩ ⟨j, hj₁, hj₂⟩\n simp only [add_derivBot, BaseSupport.add_atoms, Rel.inv_apply,\n Enumeration.rel_add_iff] at hi₁ hi₂ hj₁ hj₂\n obtain hi₁ | ⟨i, rfl, hi₁⟩ := hi₁\n · obtain hi₂ | ⟨i', rfl,... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem BaseSupport.le_add_left {S T : BaseSupport} :
S ≤ T + S | ConNF.BaseSupport.le_add_left | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 487,
"tokenPositionInFile": 13576,
"theoremPositionInFile": 51
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":= by\n constructor\n · intro a ha\n simp only [add_atoms, Enumeration.mem_add_iff]\n exact Or.inr ha\n · intro N hN\n simp only [add_nearLitters, Enumeration.mem_add_iff]\n exact Or.inr hN",
"proofType": "tactic",
"proofLengthLines": 7,
"proofLengthTokens": 197
} |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem BaseSupport.le_add_right {S T : BaseSupport} :
S ≤ S + T | ConNF.BaseSupport.le_add_right | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 477,
"tokenPositionInFile": 13240,
"theoremPositionInFile": 50
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":= by\n constructor\n · intro a ha\n simp only [Support.add_derivBot, BaseSupport.add_atoms, Enumeration.mem_add_iff]\n exact Or.inl ha\n · intro N hN\n simp only [Support.add_derivBot, BaseSupport.add_nearLitters, Enumeration.mem_add_iff]\n exact Or.inl hN",
"proofTyp... |
import ConNF.External.Basic
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex)... | theorem Support.Supports.ofSingleton {S : Support α} {x : TSet β}
(h : S.Supports {x}') :
letI : Level := ⟨α⟩
letI : LeLevel α := ⟨le_rfl⟩
(S.strong ↘ hβ).Supports x | ConNF.Support.Supports.ofSingleton | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/WellOrder.lean | ConNF.External.WellOrder | ConNF.External.WellOrder.jsonl | {
"lineInFile": 113,
"tokenPositionInFile": 3749,
"theoremPositionInFile": 6
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 43,
"numPremises": 114
} | {
"hasProof": true,
"proof": ":= by\n refine ⟨?_, λ h ↦ by cases h⟩\n intro ρ hρ\n open scoped Pointwise in\n have := sUnion_singleton_symmetric_aux hγ hβ {y | y ∈' x} S ?_ ρ hρ\n · apply ConNF.ext hγ\n intro z\n simp only [Set.ext_iff, Set.mem_setOf_eq, Set.mem_smul_set_iff_inv_smul_mem] at this\n rw... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem Support.le_add_right {α : TypeIndex} {S T : Support α} :
S ≤ S + T | ConNF.Support.le_add_right | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 532,
"tokenPositionInFile": 14912,
"theoremPositionInFile": 57
} | {
"inFilePremises": true,
"numInFilePremises": 9,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 23
} | {
"hasProof": true,
"proof": ":= by\n intro A\n rw [add_derivBot]\n exact BaseSupport.le_add_right",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 68
} |
import ConNF.Model.TTT
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) < γ) (hε : (ε :... | @[simp]
theorem singleton_eq_up_iff (x y z : TSet β) :
singleton hβ z = up hβ x y ↔ x = z ∧ y = z | ConNF.TSet.singleton_eq_up_iff | {
"commit": "f804f5c71cfaa98223fc227dd822801e8bf77004",
"date": "2024-03-30T00:00:00"
} | {
"commit": "79d0b7460f1a514629674a45c428d31c1a50bb03",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/Hailperin.lean | ConNF.Model.Hailperin | ConNF.Model.Hailperin.jsonl | {
"lineInFile": 114,
"tokenPositionInFile": 3103,
"theoremPositionInFile": 10
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 10,
"numPremises": 30
} | {
"hasProof": true,
"proof": ":= by\n rw [← up_eq_singleton_iff hβ x y z, eq_comm]",
"proofType": "tactic",
"proofLengthLines": 1,
"proofLengthTokens": 52
} |
import ConNF.Model.RunInduction
/-!
# Externalisation
In this file, we convert many of our *internal* results (i.e. inside the induction) to *external*
ones (i.e. defined using the global `TSet`/`AllPerm` definitions).
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Car... | theorem globalPreCoherentData_eq [Level] :
globalPreCoherentData = preCoherentData (λ β _ ↦ motive β) (λ β _ ↦ hypothesis β) | ConNF.globalPreCoherentData_eq | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "e409f3d0cd939e7218c3f39dcf3493c4b6e0b821",
"date": "2024-11-29T00:00:00"
} | ConNF/ConNF/Model/Externalise.lean | ConNF.Model.Externalise | ConNF.Model.Externalise.jsonl | {
"lineInFile": 99,
"tokenPositionInFile": 2555,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 36,
"numPremises": 61
} | {
"hasProof": true,
"proof": ":= by\n have := globalLeData_eq\n rw [LeData.ext_iff] at this\n apply PreCoherentData.ext\n · exact this.1\n · exact this.2\n · unfold globalPreCoherentData\n apply heq_funext; intro β\n apply heq_funext; intro γ\n apply heq_funext; intro hβ\n apply heq_funext; intro ... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
| theorem not_mem_scoderiv_botDeriv (S : Support γ) (N : NearLitter) :
N ∉ (S ↗ hγ ⇘. (Path.nil ↘.))ᴺ | ConNF.Support.not_mem_scoderiv_botDeriv | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 24,
"tokenPositionInFile": 274,
"theoremPositionInFile": 0
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 32,
"numPremises": 71
} | {
"hasProof": true,
"proof": ":= by\n rintro ⟨i, ⟨A, N'⟩, h₁, h₂⟩\n simp only [Prod.mk.injEq] at h₂\n cases A\n case sderiv δ A hδ _ =>\n simp only [Path.deriv_sderiv] at h₂\n cases A\n case nil => cases h₂.1\n case sderiv ζ A hζ _ =>\n simp only [Path.deriv_sderiv] at h₂\n cases h₂.1",
... |
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | theorem sUnion_singleton_symmetric_aux' {α β γ : Λ}
(hγ : (γ : TypeIndex) < β) (hβ : (β : TypeIndex) < α) (s : Set (TSet γ)) (S : Support α)
(hS : ∀ ρ : AllPerm α, ρᵁ • S = S → ρ ↘ hβ • singleton hγ '' s = singleton hγ '' s) :
letI : Level := ⟨α⟩
letI : LeLevel α := ⟨le_rfl⟩
∀ (ρ : AllPerm β), ρᵁ • ... | ConNF.sUnion_singleton_symmetric_aux' | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 216,
"tokenPositionInFile": 7508,
"theoremPositionInFile": 20
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 43,
"numPremises": 94
} | {
"hasProof": true,
"proof": ":= by\n letI : Level := ⟨α⟩\n letI : LeLevel α := ⟨le_rfl⟩\n letI : LtLevel β := ⟨hβ⟩\n rintro ρ hρ _ ⟨x, hx, rfl⟩\n obtain ⟨T, hT⟩ := exists_support x\n obtain ⟨ρ', hρ'₁, hρ'₂⟩ := Support.exists_allowable_of_fixes S.strong S.strong_strong T ρ hγ hρ\n have hρ's := hS ρ' (smul_eq... |
import ConNF.Background.Rel
import ConNF.Base.Small
/-!
# Enumerations
In this file, we define enumerations of a type.
## Main declarations
* `ConNF.Enumeration`: The type family of enumerations.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type u}
@[ext]
structure Enumeration (X : ... | theorem add_rel_dom {X : Type _} (E F : Enumeration X) :
(E + F).rel.dom = E.rel.dom ∪ (E.bound + ·) '' F.rel.dom | ConNF.Enumeration.add_rel_dom | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Enumeration.lean | ConNF.ModelData.Enumeration | ConNF.ModelData.Enumeration.jsonl | {
"lineInFile": 365,
"tokenPositionInFile": 10091,
"theoremPositionInFile": 31
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 9,
"numPremises": 49
} | {
"hasProof": true,
"proof": ":= by\n ext i\n simp only [Rel.dom, rel_add_iff, Set.mem_setOf_eq, Set.mem_union, Set.mem_image]\n aesop",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 104
} |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem mem_typeLower_iff (x : TSet α) :
∀ a, a ∈' typeLower hβ hγ hδ hε x ↔ ∀ b, ⟨ b, {a}' ⟩' ∈' x | ConNF.mem_typeLower_iff | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 109,
"tokenPositionInFile": 2983,
"theoremPositionInFile": 27
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 13,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_typeLower hβ hγ hδ hε x).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 54
} |
import ConNF.Base.TypeIndex
/-!
# Paths of type indices
In this file, we define the notion of a *path*, and the derivative and coderivative operations.
## Main declarations
* `ConNF.Path`: A path of type indices.
* `ConNF.Path.recSderiv`, `ConNF.Path.recSderivLe`, `ConNF.Path.recSderivGlobal`:
Downwards inducti... | @[simp]
theorem Path.scoderiv_left_inj {A B : β ↝ γ} {h : β < α} :
A ↗ h = B ↗ h ↔ A = B | ConNF.Path.scoderiv_left_inj | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Levels/Path.lean | ConNF.Levels.Path | ConNF.Levels.Path.jsonl | {
"lineInFile": 337,
"tokenPositionInFile": 10251,
"theoremPositionInFile": 43
} | {
"inFilePremises": true,
"numInFilePremises": 6,
"repositoryPremises": true,
"numRepositoryPremises": 11,
"numPremises": 21
} | {
"hasProof": true,
"proof": ":=\n deriv_right_inj",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 20
} |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem spec_same_of_fixes (S : Support α) (hS : S.Strong) (T : Support γ) (ρ : AllPerm β)
(hρ : ρᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim) :
(S + ((T ↗ hγ).strong +
(S ↘ LtLevel.elim + (T ↗ hγ).strong).interferenceSupport) ↗ LtLevel.elim).spec =
(S + (ρᵁ • ((T ↗ hγ).strong +
(S ↘ L... | ConNF.Support.spec_same_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 699,
"tokenPositionInFile": 34619,
"theoremPositionInFile": 13
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 46,
"numPremises": 83
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.spec_eq_spec_iff]\n apply sameSpec_antisymm\n · have := sameSpecLe_of_fixes S hS T 1 ρ hγ ?_ hρ\n · simp only [allPermForget_one, one_smul, smul_add] at this\n exact this\n · simp only [allPermForget_one, one_smul]\n · have := sameSpecLe_of_fixes S hS... |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem vCross_spec (x : TSet γ) :
∀ a, a ∈' vCross hβ hγ hδ x ↔ ∃ b c, a = ⟨b, c⟩' ∧ c ∈' x | ConNF.vCross_spec | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 101,
"tokenPositionInFile": 2742,
"theoremPositionInFile": 25
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 12,
"numPremises": 27
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_cross hβ hγ hδ x).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 47
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem membership_spec :
∀ a b, ⟨{a}', b⟩' ∈' membership hβ hγ hδ hε ↔ a ∈' b | ConNF.membership_spec | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "6dd8406a01cc28b071bb26965294469664a1b592",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 186,
"tokenPositionInFile": 5663,
"theoremPositionInFile": 31
} | {
"inFilePremises": true,
"numInFilePremises": 7,
"repositoryPremises": true,
"numRepositoryPremises": 26,
"numPremises": 64
} | {
"hasProof": true,
"proof": ":= by\n intro a b\n rw [membership, mem_inter_iff, subset_spec]\n simp only [mem_cross_iff, op_inj, mem_cardinalOne_iff, mem_univ_iff, and_true, exists_and_right,\n exists_and_left, exists_eq', exists_eq_left', singleton_inj]\n constructor\n · intro h\n exact h a ((typedMem_... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | @[simp]
theorem derivBot_nearLitters {α : TypeIndex} (S : Support α) (A : α ↝ ⊥) :
Sᴺ ⇘. A = (S ⇘. A)ᴺ | ConNF.Support.derivBot_nearLitters | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "d9f28df240ac4df047c3af0d236aed2e437e571f",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 258,
"tokenPositionInFile": 6529,
"theoremPositionInFile": 25
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 19
} | {
"hasProof": true,
"proof": ":=\n rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 8
} |
import ConNF.ModelData.Enumeration
import ConNF.Levels.StrPerm
/-!
# Enumerations over paths
In this file, we provide extra features to `Enumeration`s that take values of the form `α ↝ ⊥ × X`.
## Main declarations
* `ConNF.Enumeration.ext_path`: An extensionality principle for such `Enumeration`s.
-/
noncomputable... | @[simp]
theorem scoderiv_botDeriv_eq {X : Type _} {α β : TypeIndex} (S : Enumeration (β ↝ ⊥ × X))
(A : β ↝ ⊥) (h : β < α) :
S ↗ h ⇘. (A ↗ h) = S ⇘. A | ConNF.Enumeration.scoderiv_botDeriv_eq | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/PathEnumeration.lean | ConNF.ModelData.PathEnumeration | ConNF.ModelData.PathEnumeration.jsonl | {
"lineInFile": 131,
"tokenPositionInFile": 4177,
"theoremPositionInFile": 12
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 20,
"numPremises": 49
} | {
"hasProof": true,
"proof": ":= by\n ext i x\n · rfl\n · simp only [derivBot_rel, scoderiv_rel, Path.scoderiv_left_inj, exists_eq_left']",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 107
} |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem insertion2'_spec (x : TSet γ) :
∀ a b c, ⟨ { {a}' }', ⟨b, c⟩' ⟩' ∈' insertion2' hβ hγ hδ hε hζ x ↔
⟨a, c⟩' ∈' x | ConNF.insertion2'_spec | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 84,
"tokenPositionInFile": 2188,
"theoremPositionInFile": 21
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 13,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_insertion2 hβ hγ hδ hε hζ x).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 58
} |
import ConNF.External.Basic
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex)... | theorem exists_common_support_of_internallyWellOrdered {x : TSet δ}
(h : InternallyWellOrdered hγ hδ hε x) :
∃ S : Support δ, ∀ y, y ∈' x → S.Supports {y}' | ConNF.exists_common_support_of_internallyWellOrdered | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/WellOrder.lean | ConNF.External.WellOrder | ConNF.External.WellOrder.jsonl | {
"lineInFile": 149,
"tokenPositionInFile": 5069,
"theoremPositionInFile": 8
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 16,
"numPremises": 52
} | {
"hasProof": true,
"proof": ":= by\n obtain ⟨S, hS⟩ := exists_common_support_of_internallyWellOrdered' hγ hδ hε h\n have := supports_of_supports_singletons (S := S)\n (s := singleton hδ '' (singleton hε '' {y | y ∈' x})) hγ hδ ?_\n swap\n · simp only [Set.mem_image, Set.mem_setOf_eq, exists_exists_and_eq_... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem raise_strong' (S : Support α) (hS : S.Strong) (T : Support γ) (ρ : AllPerm β)
(hγ : (γ : TypeIndex) < β)
(hρ : ρᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim) :
(S + (ρᵁ • ((T ↗ hγ).strong +
(S ↘ LtLevel.elim + (T ↗ hγ).strong).interferenceSupport)) ↗ LtLevel.elim).Strong | ConNF.Support.raise_strong' | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 174,
"tokenPositionInFile": 7129,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 32,
"numPremises": 47
} | {
"hasProof": true,
"proof": ":=\n ⟨raise_preStrong' S hS T ρ hγ, raise_closed' S hS T ρ hγ hρ⟩",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 65
} |
import ConNF.Base.TypeIndex
/-!
# Paths of type indices
In this file, we define the notion of a *path*, and the derivative and coderivative operations.
## Main declarations
* `ConNF.Path`: A path of type indices.
* `ConNF.Path.recSderiv`, `ConNF.Path.recSderivLe`, `ConNF.Path.recSderivGlobal`:
Downwards inducti... | theorem Path.scoderiv_index_injective {A : β ↝ δ} {B : γ ↝ δ} {hβα : β < α} {hγα : γ < α}
(h : A ↗ hβα = B ↗ hγα) :
β = γ | ConNF.Path.scoderiv_index_injective | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Levels/Path.lean | ConNF.Levels.Path | ConNF.Levels.Path.jsonl | {
"lineInFile": 467,
"tokenPositionInFile": 14717,
"theoremPositionInFile": 59
} | {
"inFilePremises": true,
"numInFilePremises": 9,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 30
} | {
"hasProof": true,
"proof": ":= by\n have := congr_arg rev h\n rw [scoderiv_rev, scoderiv_rev, RevPath.cons.injEq] at this\n exact this.1",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 108
} |
import ConNF.ModelData.Enumeration
import ConNF.Levels.StrPerm
/-!
# Enumerations over paths
In this file, we provide extra features to `Enumeration`s that take values of the form `α ↝ ⊥ × X`.
## Main declarations
* `ConNF.Enumeration.ext_path`: An extensionality principle for such `Enumeration`s.
-/
noncomputable... | theorem scoderiv_rel {X : Type _} {α β : TypeIndex} (E : Enumeration (β ↝ ⊥ × X)) (h : β < α)
(i : κ) (x : α ↝ ⊥ × X) :
(E ↗ h).rel i x ↔ ∃ B, x.1 = B ↗ h ∧ E.rel i (B, x.2) | ConNF.Enumeration.scoderiv_rel | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/PathEnumeration.lean | ConNF.ModelData.PathEnumeration | ConNF.ModelData.PathEnumeration.jsonl | {
"lineInFile": 67,
"tokenPositionInFile": 1972,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 15,
"numPremises": 33
} | {
"hasProof": true,
"proof": ":=\n coderiv_rel E (.single h) i x",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 34
} |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem Support.le_add_left {α : TypeIndex} {S T : Support α} :
S ≤ T + S | ConNF.Support.le_add_left | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 538,
"tokenPositionInFile": 15061,
"theoremPositionInFile": 58
} | {
"inFilePremises": true,
"numInFilePremises": 9,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 23
} | {
"hasProof": true,
"proof": ":= by\n intro A\n rw [add_derivBot]\n exact BaseSupport.le_add_left",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 67
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem op_mem_converse_iff (x : TSet α) :
∀ a b, ⟨a, b⟩' ∈' converse hβ hγ hδ x ↔ ⟨b, a⟩' ∈' x | ConNF.op_mem_converse_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 80,
"tokenPositionInFile": 1953,
"theoremPositionInFile": 14
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 18,
"numPremises": 44
} | {
"hasProof": true,
"proof": ":= by\n intro a b\n simp only [converse, mem_inter_iff, converse'_spec, mem_orderedPairs_iff, op_inj, exists_and_left,\n exists_eq', and_true]",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 144
} |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem atomMemRel_le_of_fixes {S : Support α} {T : Support γ}
{ρ₁ ρ₂ : AllPerm β} {hγ : (γ : TypeIndex) < β}
(hρ₁ : ρ₁ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(hρ₂ : ρ₂ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(A : ↑α ↝ ⊥) :
atomMemRel (S + (ρ₁ᵁ • ((T ↗ hγ).strong +
... | ConNF.Support.atomMemRel_le_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "7965dba9f7fcbea5f6e2d5e3c622db5790f2f494",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 244,
"tokenPositionInFile": 10746,
"theoremPositionInFile": 6
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 71,
"numPremises": 146
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.smul_eq_iff] at hρ₁ hρ₂\n rintro i j ⟨N, hN, a, haN, ha⟩\n simp only [add_derivBot, BaseSupport.add_atoms, Rel.inv_apply, Enumeration.rel_add_iff,\n BaseSupport.add_nearLitters] at ha hN\n obtain hN | ⟨i, rfl, hi⟩ := hN\n · obtain ha | ⟨j, rfl, hj⟩ := ha\n ... |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_doubleSingleton_iff (x : TSet γ) :
∀ y : TSet β, y ∈' doubleSingleton hβ hγ hδ x ↔
∃ z : TSet δ, z ∈' x ∧ y = { {z}' }' | ConNF.mem_doubleSingleton_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "6dd8406a01cc28b071bb26965294469664a1b592",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 225,
"tokenPositionInFile": 7029,
"theoremPositionInFile": 35
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 19,
"numPremises": 49
} | {
"hasProof": true,
"proof": ":= by\n intro y\n rw [doubleSingleton, mem_inter_iff, mem_cross_iff, mem_cardinalOne_iff]\n constructor\n · rintro ⟨⟨b, c, h₁, h₂, h₃⟩, ⟨a, rfl⟩⟩\n obtain ⟨hbc, rfl⟩ := (op_eq_singleton_iff _ _ _ _ _).mp h₁.symm\n exact ⟨c, h₃, rfl⟩\n · rintro ⟨z, h, rfl⟩\n constructor\n ... |
import ConNF.Model.RunInduction
/-!
# Externalisation
In this file, we convert many of our *internal* results (i.e. inside the induction) to *external*
ones (i.e. defined using the global `TSet`/`AllPerm` definitions).
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Car... | @[simp]
theorem heq_cast_eq_iff {α β γ : Type _} {x : α} {y : β} {h : α = γ} :
HEq (cast h x) y ↔ HEq x y | ConNF.heq_cast_eq_iff | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "e409f3d0cd939e7218c3f39dcf3493c4b6e0b821",
"date": "2024-11-29T00:00:00"
} | ConNF/ConNF/Model/Externalise.lean | ConNF.Model.Externalise | ConNF.Model.Externalise.jsonl | {
"lineInFile": 93,
"tokenPositionInFile": 2413,
"theoremPositionInFile": 3
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": false,
"numRepositoryPremises": 0,
"numPremises": 15
} | {
"hasProof": true,
"proof": ":= by\n cases h\n rw [cast_eq]",
"proofType": "tactic",
"proofLengthLines": 2,
"proofLengthTokens": 30
} |
import ConNF.ModelData.Enumeration
import ConNF.Levels.StrPerm
/-!
# Enumerations over paths
In this file, we provide extra features to `Enumeration`s that take values of the form `α ↝ ⊥ × X`.
## Main declarations
* `ConNF.Enumeration.ext_path`: An extensionality principle for such `Enumeration`s.
-/
noncomputable... | @[simp]
theorem smulPath_rel {X : Type _} {α : TypeIndex} [MulAction BasePerm X]
(π : StrPerm α) (E : Enumeration (α ↝ ⊥ × X)) (i : κ) (x : α ↝ ⊥ × X) :
(π • E).rel i x ↔ E.rel i (x.1, (π x.1)⁻¹ • x.2) | ConNF.Enumeration.smulPath_rel | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/PathEnumeration.lean | ConNF.ModelData.PathEnumeration | ConNF.ModelData.PathEnumeration.jsonl | {
"lineInFile": 150,
"tokenPositionInFile": 4913,
"theoremPositionInFile": 14
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 12,
"numPremises": 27
} | {
"hasProof": true,
"proof": ":=\n Iff.rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 12
} |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem mem_cardinalOne_iff :
∀ a : TSet β, a ∈' cardinalOne hβ hγ ↔ ∃ b, a = {b}' | ConNF.mem_cardinalOne_iff | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 125,
"tokenPositionInFile": 3460,
"theoremPositionInFile": 31
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 12,
"numPremises": 26
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_cardinalOne hβ hγ).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 48
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_field_iff (r : TSet α) (x : TSet δ) :
x ∈' field hβ hγ hδ r ↔ x ∈ (ExternalRel hβ hγ hδ r).field | ConNF.mem_field_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 168,
"tokenPositionInFile": 5056,
"theoremPositionInFile": 27
} | {
"inFilePremises": true,
"numInFilePremises": 8,
"repositoryPremises": true,
"numRepositoryPremises": 18,
"numPremises": 46
} | {
"hasProof": true,
"proof": ":= by\n rw [field, mem_union_iff, mem_dom_iff, mem_codom_iff, Rel.field, Set.mem_union]",
"proofType": "tactic",
"proofLengthLines": 1,
"proofLengthTokens": 87
} |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem atoms_of_inflexible_of_fixes {S : Support α} (hS : S.Strong) {T : Support γ}
{ρ₁ ρ₂ : AllPerm β} {hγ : (γ : TypeIndex) < β}
(hρ₁ : ρ₁ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(hρ₂ : ρ₂ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(A : α ↝ ⊥) (N₁ N₂ : NearLitter) (P : Inflex... | ConNF.Support.atoms_of_inflexible_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "2dd04bc4e7c491b6023c78aea4cd613f00becfc4",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 378,
"tokenPositionInFile": 17816,
"theoremPositionInFile": 9
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 138,
"numPremises": 231
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.smul_eq_iff] at hρ₁ hρ₂\n obtain ⟨γ, δ, ε, hδ, hε, hδε, B⟩ := P\n haveI : LeLevel γ := ⟨B.le⟩\n haveI : LtLevel δ := ⟨hδ.trans_le LeLevel.elim⟩\n haveI : LtLevel ε := ⟨hε.trans_le LeLevel.elim⟩\n dsimp only at t ρ ⊢\n intro hA hN₁ hN₂ hN C a ha i hi\n obtain... |
import ConNF.Model.RunInduction
/-!
# Externalisation
In this file, we convert many of our *internal* results (i.e. inside the induction) to *external*
ones (i.e. defined using the global `TSet`/`AllPerm` definitions).
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Car... | theorem heq_funext {α : Sort _} {β γ : α → Sort _} {f : (x : α) → β x} {g : (x : α) → γ x}
(h : ∀ x, HEq (f x) (g x)) : HEq f g | ConNF.heq_funext | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "e409f3d0cd939e7218c3f39dcf3493c4b6e0b821",
"date": "2024-11-29T00:00:00"
} | ConNF/ConNF/Model/Externalise.lean | ConNF.Model.Externalise | ConNF.Model.Externalise.jsonl | {
"lineInFile": 39,
"tokenPositionInFile": 803,
"theoremPositionInFile": 0
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": false,
"numRepositoryPremises": 0,
"numPremises": 14
} | {
"hasProof": true,
"proof": ":= by\n cases funext λ x ↦ type_eq_of_heq (h x)\n simp only [heq_eq_eq] at h ⊢\n exact funext h",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 95
} |
import ConNF.Model.TTT
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) < γ) (hε : (ε :... | theorem exists_insertion3 (x : TSet γ) :
∃ y : TSet α, ∀ a b c, op hγ hδ (singleton hε (singleton hζ a)) (op hε hζ b c) ∈[hβ] y ↔
op hε hζ a b ∈[hδ] x | ConNF.TSet.exists_insertion3 | {
"commit": "f804f5c71cfaa98223fc227dd822801e8bf77004",
"date": "2024-03-30T00:00:00"
} | {
"commit": "f7c233c7f7fd9d8b74595bbfa2bbbd49d538ef59",
"date": "2024-12-02T00:00:00"
} | ConNF/ConNF/Model/Hailperin.lean | ConNF.Model.Hailperin | ConNF.Model.Hailperin.jsonl | {
"lineInFile": 224,
"tokenPositionInFile": 7357,
"theoremPositionInFile": 18
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 44,
"numPremises": 102
} | {
"hasProof": true,
"proof": ":= by\n have := exists_of_symmetric {u | ∃ a b c : TSet ζ, op hε hζ a b ∈[hδ] x ∧\n u = op hγ hδ (singleton hε (singleton hζ a)) (op hε hζ b c)} hβ ?_\n · obtain ⟨y, hy⟩ := this\n use y\n intro a b c\n rw [hy]\n constructor\n · rintro ⟨a', b', c', h₁, h₂⟩\n s... |
import ConNF.Background.ReflTransGen
import ConNF.FOA.Inflexible
/-!
# Strong supports
In this file, we define strong supports.
## Main declarations
* `ConNF.Support.Strong`: The property that a support is strong.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped symmDiff
namespace ConNF
var... | theorem Closed.scoderiv {γ : TypeIndex} {S : Support γ} (hS : S.Closed) (hγ : γ < β) :
(S ↗ hγ).Closed | ConNF.Support.Closed.scoderiv | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Strong/Strong.lean | ConNF.Strong.Strong | ConNF.Strong.Strong.jsonl | {
"lineInFile": 87,
"tokenPositionInFile": 2843,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 35,
"numPremises": 75
} | {
"hasProof": true,
"proof": ":= by\n constructor\n intro A\n constructor\n intro N₁ N₂ hN₁ hN₂ a ha\n obtain ⟨i, ⟨B, N₁⟩, hi, hi'⟩ := hN₁\n cases hi'\n obtain ⟨j, ⟨C, N₂⟩, hj, hj'⟩ := hN₂\n simp only [Prod.mk.injEq, Path.deriv_right_inj] at hj'\n cases hj'.1\n cases hj'.2\n simp only\n obtain ⟨k, hk⟩ :... |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_sUnion_iff (x : TSet α) :
∀ y : TSet γ, y ∈' sUnion hβ hγ x ↔ ∃ t : TSet β, t ∈' x ∧ y ∈' t | ConNF.mem_sUnion_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "d9f28df240ac4df047c3af0d236aed2e437e571f",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 276,
"tokenPositionInFile": 8540,
"theoremPositionInFile": 39
} | {
"inFilePremises": true,
"numInFilePremises": 12,
"repositoryPremises": true,
"numRepositoryPremises": 29,
"numPremises": 69
} | {
"hasProof": true,
"proof": ":= by\n intro y\n simp only [sUnion, mem_singletonUnion_iff, mem_dom_iff, Rel.dom, ExternalRel, mem_inter_iff,\n mem_cross_iff, op_inj, mem_cardinalOne_iff, Set.mem_setOf_eq, membership_spec]\n constructor\n · rintro ⟨z, h₁, a, b, ⟨rfl, rfl⟩, ⟨c, h₂⟩, h₃⟩\n rw [singleton_inj]... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem smul_eq_smul_of_le {α : TypeIndex} {S T : Support α} {π₁ π₂ : StrPerm α}
(h : S ≤ T) (h₂ : π₁ • T = π₂ • T) :
π₁ • S = π₂ • S | ConNF.smul_eq_smul_of_le | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 591,
"tokenPositionInFile": 16769,
"theoremPositionInFile": 65
} | {
"inFilePremises": true,
"numInFilePremises": 8,
"repositoryPremises": true,
"numRepositoryPremises": 23,
"numPremises": 39
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.smul_eq_smul_iff] at h₂ ⊢\n intro A\n constructor\n · intro a ha\n exact (h₂ A).1 a ((h A).1 a ha)\n · intro N hN\n exact (h₂ A).2 N ((h A).2 N hN)",
"proofType": "tactic",
"proofLengthLines": 7,
"proofLengthTokens": 171
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem singletonImage_spec (x : TSet β) :
∀ z w,
⟨ {z}', {w}' ⟩' ∈' singletonImage hβ hγ hδ hε x ↔ ⟨z, w⟩' ∈' x | ConNF.singletonImage_spec | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 107,
"tokenPositionInFile": 2947,
"theoremPositionInFile": 18
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 21,
"numPremises": 52
} | {
"hasProof": true,
"proof": ":= by\n intro z w\n rw [singletonImage, mem_inter_iff, singletonImage'_spec, and_iff_left_iff_imp]\n intro hzw\n rw [mem_cross_iff]\n refine ⟨{z}', {w}', rfl, ?_⟩\n simp only [mem_cardinalOne_iff, singleton_inj, exists_eq', and_self]",
"proofType": "tactic",
"proofLengthLines... |
import ConNF.ModelData.Enumeration
import ConNF.Levels.StrPerm
/-!
# Enumerations over paths
In this file, we provide extra features to `Enumeration`s that take values of the form `α ↝ ⊥ × X`.
## Main declarations
* `ConNF.Enumeration.ext_path`: An extensionality principle for such `Enumeration`s.
-/
noncomputable... | theorem derivBot_rel {X : Type _} {α : TypeIndex} (E : Enumeration (α ↝ ⊥ × X)) (A : α ↝ ⊥)
(i : κ) (x : X) :
(E ⇘. A).rel i x ↔ E.rel i (A, x) | ConNF.Enumeration.derivBot_rel | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/PathEnumeration.lean | ConNF.ModelData.PathEnumeration | ConNF.ModelData.PathEnumeration.jsonl | {
"lineInFile": 89,
"tokenPositionInFile": 2868,
"theoremPositionInFile": 6
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 9,
"numPremises": 15
} | {
"hasProof": true,
"proof": ":=\n Iff.rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 12
} |
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | theorem sUnion_singleton_symmetric {α β γ : Λ} (hγ : (γ : TypeIndex) < β) (hβ : (β : TypeIndex) < α)
(s : Set (TSet γ)) (hs : Symmetric (singleton hγ '' s) hβ) :
Symmetric s hγ | ConNF.sUnion_singleton_symmetric | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "2e25ffbc94af48261308cea0d8c55205cc388ef0",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 251,
"tokenPositionInFile": 9233,
"theoremPositionInFile": 22
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 27,
"numPremises": 49
} | {
"hasProof": true,
"proof": ":= by\n letI : Level := ⟨α⟩\n letI : LeLevel α := ⟨le_rfl⟩\n obtain ⟨S, hS⟩ := hs\n use S.strong ↘ hβ\n exact sUnion_singleton_symmetric_aux hγ hβ s S hS",
"proofType": "tactic",
"proofLengthLines": 5,
"proofLengthTokens": 153
} |
import ConNF.Model.TTT
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) < γ) (hε : (ε :... | theorem exists_cardinalOne :
∃ x : TSet α, ∀ a : TSet β, a ∈[hβ] x ↔ ∃ b, a = singleton hγ b | ConNF.TSet.exists_cardinalOne | {
"commit": "f804f5c71cfaa98223fc227dd822801e8bf77004",
"date": "2024-03-30T00:00:00"
} | {
"commit": "f7c233c7f7fd9d8b74595bbfa2bbbd49d538ef59",
"date": "2024-12-02T00:00:00"
} | ConNF/ConNF/Model/Hailperin.lean | ConNF.Model.Hailperin | ConNF.Model.Hailperin.jsonl | {
"lineInFile": 365,
"tokenPositionInFile": 12537,
"theoremPositionInFile": 22
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 31,
"numPremises": 83
} | {
"hasProof": true,
"proof": ":= by\n have := exists_of_symmetric {a | ∃ b, a = singleton hγ b} hβ ?_\n · obtain ⟨y, hy⟩ := this\n use y\n intro a\n rw [hy]\n rfl\n · use ⟨.empty, .empty⟩\n intro ρ hρ\n ext z\n constructor\n · rintro ⟨z, ⟨a, ha⟩, rfl⟩\n refine ⟨ρ ↘ hβ ↘ hγ • a, ?_⟩\n... |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | theorem lt_higherIndex {α : Λ} :
(α : TypeIndex) < higherIndex α | ConNF.lt_higherIndex | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 39,
"tokenPositionInFile": 817,
"theoremPositionInFile": 5
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 6,
"numPremises": 21
} | {
"hasProof": true,
"proof": ":=\n WithBot.coe_lt_coe.mpr (exists_gt α).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 53
} |
import ConNF.External.Basic
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex)... | theorem internallyWellOrdered_of_common_support {x : TSet γ}
(S : Support δ) (hS : ∀ y : TSet δ, y ∈' x → S.Supports y) :
InternallyWellOrdered hβ hγ hδ x | ConNF.internallyWellOrdered_of_common_support | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/WellOrder.lean | ConNF.External.WellOrder | ConNF.External.WellOrder.jsonl | {
"lineInFile": 251,
"tokenPositionInFile": 8640,
"theoremPositionInFile": 10
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 16,
"numPremises": 36
} | {
"hasProof": true,
"proof": ":= by\n obtain (hx | hx) := Set.subsingleton_or_nontrivial {y : TSet δ | y ∈' x}\n · exact Or.inl hx\n · exact internallyWellOrdered_of_common_support_of_nontrivial hβ hγ hδ hx S hS",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 181
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_smallUnion_iff (s : Set (TSet α)) (hs : Small s) :
∀ x : TSet β, x ∈' smallUnion hβ s hs ↔ ∃ t ∈ s, x ∈' t | ConNF.mem_smallUnion_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "6dd8406a01cc28b071bb26965294469664a1b592",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 341,
"tokenPositionInFile": 10620,
"theoremPositionInFile": 42
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 12,
"numPremises": 29
} | {
"hasProof": true,
"proof": ":=\n (exists_smallUnion hβ s hs).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 44
} |
import ConNF.External.Basic
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex)... | theorem apply_eq_of_isWellOrder' {X : Type _} {r : Rel X X} {f : X → X}
(hr : IsWellOrder r.field (InvImage r Subtype.val)) (hf : Function.Bijective f)
(hf' : ∀ x y, r x y ↔ r (f x) (f y)) :
∀ x ∈ r.field, f x = x | ConNF.apply_eq_of_isWellOrder' | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/WellOrder.lean | ConNF.External.WellOrder | ConNF.External.WellOrder.jsonl | {
"lineInFile": 52,
"tokenPositionInFile": 1567,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 2,
"numPremises": 45
} | {
"hasProof": true,
"proof": ":= by\n have : ∀ x ∈ r.field, f x ∈ r.field := by\n rintro x (⟨y, h⟩ | ⟨y, h⟩)\n · exact Or.inl ⟨f y, (hf' x y).mp h⟩\n · exact Or.inr ⟨f y, (hf' y x).mp h⟩\n have := apply_eq_of_isWellOrder (f := λ x ↦ ⟨f x.val, this x.val x.prop⟩) hr ⟨?_, ?_⟩ ?_\n · intro x hx\n exact ... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem exists_allowable_of_fixes (S : Support α) (hS : S.Strong) (T : Support γ) (ρ : AllPerm β)
(hγ : (γ : TypeIndex) < β)
(hρ : ρᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim) :
∃ ρ' : AllPerm α, ρ'ᵁ • S = S ∧ ρ'ᵁ ↘ LtLevel.elim ↘ hγ • T = ρᵁ ↘ hγ • T | ConNF.Support.exists_allowable_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "2e25ffbc94af48261308cea0d8c55205cc388ef0",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 716,
"tokenPositionInFile": 35436,
"theoremPositionInFile": 14
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 66,
"numPremises": 110
} | {
"hasProof": true,
"proof": ":= by\n have := spec_same_of_fixes (hγ := hγ) S hS T ρ hρ\n have := exists_conv this ?_ ?_\n · obtain ⟨ρ', hρ'⟩ := this\n use ρ'\n simp only [Support.smul_add] at hρ'\n obtain ⟨hρ'₁, hρ'₂⟩ := add_inj_of_bound_eq_bound (by rfl) (by rfl) hρ'\n rw [Support.smul_scoderiv, sc... |
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | @[simp]
theorem allPerm_inv_sderiv' {β γ : TypeIndex} (h : γ < β) (ρ : AllPerm β) :
ρ⁻¹ ↘ h = (ρ ↘ h)⁻¹ | ConNF.allPerm_inv_sderiv' | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "2e25ffbc94af48261308cea0d8c55205cc388ef0",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 63,
"tokenPositionInFile": 1837,
"theoremPositionInFile": 3
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 24,
"numPremises": 42
} | {
"hasProof": true,
"proof": ":= by\n apply allPermForget_injective\n rw [allPermSderiv_forget', allPermForget_inv, Tree.inv_sderiv, allPermForget_inv,\n allPermSderiv_forget']",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 148
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.