Download data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinableSubsetCertificates.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.75 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinableSubsetCertificates.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinableSubsetCertificates.lean
-
curl -L -o DefinableSubsetCertificates.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/DefinableSubsetCertificates.lean
5.75 kB
| import OAI.Computability.DegreeRigidity.Constructibility.UniformInternalSatisfaction | |
| namespace OAI | |
| namespace TuringRigidity.RelativeConstructible | |
| open ElementaryModel BoundedSetTheory TransitiveNameModel SentenceCoding | |
| open BoundedDefinability SetModelFunctions | |
| universe u | |
| variable {M : ZFSet.{u}} | |
| def ParameterAdequate (Q B G c t : ZFSet.{u}) : Prop := | |
| β n β ZFSet.omega, β g β G, β b β ZFSet.omega, | |
| t = ZFSet.pair n g β§ BoundWitness Q B c b β§ β x β b, x β n β¨ x = n | |
| theorem parameterAdequate_definable (C : Context M) {Q B G : ZFSet.{u}} | |
| (hQ : Q β M) (hB : B β M) (hG : G β M) (c t : β) : | |
| Definable M (fun e => ParameterAdequate Q B G (e c) (e t)) := | |
| ((((defOrderedPair C (t+3) 2 1).and ((boundWitness_definable C hQ hB (c+3) 0).and | |
| (defAllMem (defOr (member_definable C 0 3) (equal_definable C 0 3)) 0))).existsParam | |
| C.omega_mem).existsParam hG).existsParam C.omega_mem | |
| theorem parameterAdequate_spec (Q B G c : ZFSet.{u}) | |
| (hQ : β p : SentenceForm, family p β Q) | |
| (hB : β p : SentenceForm, supportGraph p β B) | |
| {n : β} (v : Fin n β ZFSet.{u}) (hG : tupleGraph v β G) : | |
| ParameterAdequate Q B G c (tupleCode v) β | |
| β p : SentenceForm, c = natSet (Encodable.encode p) β§ p.bound β€ n+1 := by | |
| constructor | |
| Β· rintro β¨m,_,g,_,b,_,he,hb,hleβ© | |
| have hm : m = natSet n := (ZFSet.pair_inj.mp he).1.symm | |
| obtain β¨p,hp,rflβ© := (boundWitness_spec Q B c b hQ hB).mp hb | |
| refine β¨p,hp,(natSet_subset_iff p.bound (n+1)).mp ?_β© | |
| intro x hx | |
| have h := hle x hx | |
| rw [hm] at h | |
| exact ZFSet.mem_insert_iff.mpr h.symm | |
| Β· rintro β¨p,rfl,hpβ© | |
| refine β¨natSet n,(mem_omega _).mpr β¨n,rflβ©,tupleGraph v,hG, | |
| natSet p.bound,(mem_omega _).mpr β¨p.bound,rflβ©,rfl, | |
| (boundWitness_spec Q B _ _ hQ hB).mpr β¨p,rfl,rflβ©,?_β© | |
| intro x hx | |
| have hs := (natSet_subset_iff p.bound (n+1)).mpr hp hx | |
| exact (ZFSet.mem_insert_iff.mp hs).symm | |
| def DefinesSubset (A G T Z c t S : ZFSet.{u}) : Prop := | |
| S β A β§ β x β A, x β S β | |
| β s β T, TuplePrefix A G t x s β§ ZFSet.pair c s β Z | |
| theorem definesSubset_definable (C : Context M) {G : ZFSet.{u}} | |
| (hG : G β M) (a T Z c t S : β) : | |
| Definable M (fun e => DefinesSubset (e a) G (e T) (e Z) (e c) (e t) (e S)) := | |
| (defSubset C S a).and (defAllMem (defIff (member_definable C 0 (S+1)) | |
| (((tuplePrefix_definable C hG (a+2) (t+2) 1 0).and | |
| (defPairMem C (c+2) 0 (Z+2))).existsMem (T+1))) a) | |
| theorem definesSubset_spec (A G S : ZFSet.{u}) | |
| (hG : β (n : β) (v : Fin n β ZFSet.{u}), (β i, v i β A) β tupleGraph v β G) | |
| (p : SentenceForm) {n : β} (v : Fin n β ZFSet.{u}) (hv : β i, v i β A) | |
| (hb : p.bound β€ n+1) : | |
| DefinesSubset A G (tupleSpace A) (satisfactionSet A) | |
| (natSet (Encodable.encode p)) (tupleCode v) S β S = definedSubset A p v := by | |
| have hstep (x : ZFSet.{u}) (hx : x β A) : | |
| (β s β tupleSpace A, TuplePrefix A G (tupleCode v) x s β§ | |
| ZFSet.pair (natSet (Encodable.encode p)) s β satisfactionSet A) β | |
| p.Sat (A : Set ZFSet) (cons x (tupleEnv v)) := by | |
| let w : Fin (n+1) β ZFSet.{u} := Fin.cases (motive := fun _ => ZFSet.{u}) x v | |
| have hw : β i : Fin (n+1), w i β A := fun i => Fin.cases hx hv i | |
| have ht : tupleCode w β tupleSpace A := (mem_tupleSpace A _).mpr β¨n+1,w,hw,rflβ© | |
| have he : tupleEnv w = cons x (tupleEnv v) := tupleEnv_cons x v | |
| constructor | |
| Β· rintro β¨s,_,hs,hpβ© | |
| have hs' := (tuplePrefix_spec A G hG v hv x s hx).mp hs | |
| rw [hs'] at hp | |
| exact he βΈ (satisfactionSet_spec A p w hw hb).mp hp | |
| Β· intro hp | |
| refine β¨tupleCode w,ht,(tuplePrefix_spec A G hG v hv x _ hx).mpr rfl,?_β© | |
| exact (satisfactionSet_spec A p w hw hb).mpr (he βΈ hp) | |
| constructor | |
| Β· rintro β¨hsub,hdefβ© | |
| apply ZFSet.ext; intro x | |
| rw [mem_definedSubset] | |
| exact β¨fun hx => β¨hsub hx,(hstep x (hsub hx)).mp ((hdef x (hsub hx)).mp hx)β©, | |
| fun β¨hx,hpβ© => (hdef x hx).mpr ((hstep x hx).mpr hp)β© | |
| Β· rintro rfl | |
| refine β¨fun x hx => (mem_definedSubset A x p v).mp hx |>.1,?_β© | |
| intro x hx | |
| rw [mem_definedSubset] | |
| exact (and_iff_right hx).trans (hstep x hx).symm | |
| def DefinitionWitness (Q B G A T Z S : ZFSet.{u}) : Prop := | |
| β c β ZFSet.omega, β t β T, | |
| ParameterAdequate Q B G c t β§ DefinesSubset A G T Z c t S | |
| theorem definitionWitness_definable (C : Context M) {Q B G : ZFSet.{u}} | |
| (hQ : Q β M) (hB : B β M) (hG : G β M) (a T Z S : β) : | |
| Definable M (fun e => DefinitionWitness Q B G (e a) (e T) (e Z) (e S)) := | |
| (((parameterAdequate_definable C hQ hB hG 1 0).and | |
| (definesSubset_definable C hG (a+2) (T+2) (Z+2) 1 0 (S+2))).existsMem (T+1)).existsParam C.omega_mem | |
| theorem definitionWitness_spec (Q B G A S : ZFSet.{u}) | |
| (hQ : β p : SentenceForm, family p β Q) | |
| (hB : β p : SentenceForm, supportGraph p β B) | |
| (hG : β (n : β) (v : Fin n β ZFSet.{u}), (β i, v i β A) β tupleGraph v β G) : | |
| DefinitionWitness Q B G A (tupleSpace A) (satisfactionSet A) S β DefinableOver A S := by | |
| constructor | |
| Β· rintro β¨c,_,t,ht,ha,hdβ© | |
| obtain β¨n,v,hv,rflβ© := (mem_tupleSpace A t).mp ht | |
| obtain β¨p,rfl,hpβ© := (parameterAdequate_spec Q B G c hQ hB v (hG n v hv)).mp ha | |
| exact β¨n,p,v,hp,hv,(definesSubset_spec A G S hG p v hv hp).mp hdβ© | |
| Β· rintro β¨n,p,v,hp,hv,rflβ© | |
| exact β¨_,(mem_omega _).mpr β¨Encodable.encode p,rflβ©, | |
| _,(mem_tupleSpace A _).mpr β¨n,v,hv,rflβ©, | |
| (parameterAdequate_spec Q B G _ hQ hB v (hG n v hv)).mpr β¨p,rfl,hpβ©, | |
| (definesSubset_spec A G _ hG p v hv hp).mpr rflβ© | |
| end TuringRigidity.RelativeConstructible | |
| end OAI | |