Download data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinedPrefixRemoval.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.29 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinedPrefixRemoval.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinedPrefixRemoval.lean
-
curl -L -o DefinedPrefixRemoval.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinedPrefixRemoval.lean
4.29 kB
| import OAI.Computability.DegreeRigidity.CohenForcing.CohenPrefixOverwrite | |
| import OAI.Computability.DegreeRigidity.Effective.UniformTableSimulation | |
| import OAI.Computability.DegreeRigidity.SetModels.ModelDegreeUniverse | |
| import OAI.Computability.DegreeRigidity.Constructibility.ConstructibleGroundReals | |
| namespace OAI | |
| namespace TuringRigidity.RelativeConstructible | |
| open TransitiveNameModel BoundedSetTheory CountableForcing RecursiveNames AtomicForcing | |
| open CohenGroundPoset CohenColumnRealName CohenFiniteFlip FiniteOverwrite | |
| open TableIndices IndexMatrix | |
| open ElementaryModel | |
| attribute [local instance] InternalCollapse.order InternalCollapse.collapsePreorder | |
| CohenNiceNameConstruction.cohenTop | |
| theorem equidegree_mem_ownDegree (E u : ZFSet.{0}) (hE : Transitive E) (hT : SourceT E) | |
| (hu : u β degreeUniverse (groundReals E)) (A B : Oracle) | |
| (hB : realCode B β u) (he : degree A = degree B) : realCode A β u := by | |
| obtain β¨C,hC,rflβ© := (mem_degreeUniverse _ _).mp hu | |
| have hmem := actual_degreeCode_membership E hE hT (groundReals E) | |
| (realCode_mem_groundReals E) ((realCode_mem_groundReals E C).mp hC) | |
| exact (hmem A).mpr (he.trans ((hmem B).mp hB)) | |
| theorem defined_value_extension_eq (M c : ZFSet.{0}) (Ξ΄ : Ordinal.{0}) | |
| (Z : ZFSet.{0}) (Ο : SentenceForm) (f : Name (Conditions c)) | |
| (hfv : β H : GenericFilter (Conditions c), GroundGeneric M H β | |
| f.val H.carrier = definedSubset (level (groundReals (genericExtensionSet M c H.carrier)) Ξ΄) | |
| Ο (fun _ : Fin Ο.bound => Z)) | |
| (G H : GenericFilter (Conditions c)) (hG : GroundGeneric M G) (hH : GroundGeneric M H) | |
| (he : genericExtensionSet M c G.carrier = genericExtensionSet M c H.carrier) : | |
| f.val G.carrier = f.val H.carrier := by | |
| rw [hfv G hG,hfv H hH,he] | |
| theorem remove_defined_program_prefix (M K a : ZFSet.{0}) | |
| (hM : Transitive M) (hT : SourceT M) (hK : K β M) (ha : a β K) | |
| (Ξ΄ : Ordinal.{0}) (Z : ZFSet.{0}) (Ο : SentenceForm) | |
| (f : Name (Conditions (poset K))) | |
| (hfv : β H : GenericFilter (Conditions (poset K)), GroundGeneric M H β | |
| f.val H.carrier = definedSubset | |
| (level (groundReals (genericExtensionSet M (poset K) H.carrier)) Ξ΄) | |
| Ο (fun _ : Fin Ο.bound => Z)) | |
| (R Aβ : Oracle) (d β : β) | |
| (hprog : β H : GenericFilter (Conditions (poset K)), GroundGeneric M H β | |
| β A : Oracle, (realName K a).val H.carrier = realCode A β | |
| (β n < β, A n = Aβ n) β β X : Oracle, | |
| Represents (join A R) (machine d) X β§ | |
| β u β degreeUniverse (groundReals (genericExtensionSet M (poset K) H.carrier)), | |
| β v β degreeUniverse (groundReals (genericExtensionSet M (poset K) H.carrier)), | |
| realCode A β u β§ realCode X β v β§ ZFSet.pair u v β f.val H.carrier) : | |
| β e : β, β H : GenericFilter (Conditions (poset K)), GroundGeneric M H β | |
| β A : Oracle, (realName K a).val H.carrier = realCode A β β X : Oracle, | |
| Represents (join A R) (machine e) X β§ | |
| β u β degreeUniverse (groundReals (genericExtensionSet M (poset K) H.carrier)), | |
| β v β degreeUniverse (groundReals (genericExtensionSet M (poset K) H.carrier)), | |
| realCode A β u β§ realCode X β v β§ ZFSet.pair u v β f.val H.carrier := by | |
| let s := FiniteShuffle.initial Aβ β | |
| obtain β¨e,heβ© := (overwrite_join_program s R).table_simulation d | |
| refine β¨e,fun H hH A hv => ?_β© | |
| let Hs := prefixFilter K a s A H | |
| obtain β¨hHs,hExt,hvalβ© := prefixFilter_properties M K a hM hT hK ha s A H hH hv | |
| have hprefix : β n < β, overwrite s A n = Aβ n := by | |
| intro n hn | |
| rw [overwrite_below _ _ _ (by simpa [s] using hn),FiniteShuffle.prefix_getD _ _ _ hn] | |
| obtain β¨X,hX,u,hu,v,hv',hAu,hXv,hpairβ© := hprog Hs hHs (overwrite s A) hval hprefix | |
| have hfEq := defined_value_extension_eq M (poset K) Ξ΄ Z Ο f hfv Hs H hHs hH hExt | |
| rw [hExt] at hu hv' | |
| rw [hfEq] at hpair | |
| obtain β¨hE,hTE,_,_β© := RegularTreeExtension.extension_properties M (poset K) hM hT | |
| (manyColumn_internal M K hM hT hK).1 H hH | |
| exact β¨X,he A X hX,u,hu,v,hv', | |
| equidegree_mem_ownDegree _ u hE hTE hu A (overwrite s A) hAu | |
| (degree_overwrite s A).symm,hXv,hpairβ© | |
| end TuringRigidity.RelativeConstructible | |
| end OAI | |