Download data/lean/OAI/Computability/DegreeRigidity/Syntax/CheckedMembershipSeparation.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.34 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/CheckedMembershipSeparation.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Syntax/CheckedMembershipSeparation.lean
-
curl -L -o CheckedMembershipSeparation.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/CheckedMembershipSeparation.lean
5.34 kB
| import OAI.Computability.DegreeRigidity.SetModels.InternalCheckedValue | |
| import OAI.Computability.DegreeRigidity.CohenForcing.FullSetForcing | |
| namespace OAI | |
| namespace TuringRigidity.FullSetForcing | |
| open RecursiveNames TransitiveNameModel BoundedSetTheory AtomicForcing CountableForcing | |
| open ElementaryModel SentenceForm | |
| universe u | |
| variable {c : ZFSet.{u}} [Preorder (Conditions c)] [Top (Conditions c)] | |
| noncomputable def checkedMembershipFormula : SentenceForm := | |
| .ex (.conj (checkedValueFormula.rename (fun i => match i with | 0 => 0 | 1 => 1 | _ => 6)) | |
| (code (.member 0 1) 2 3 4 (fun i => match i with | 0 => 0 | _ => 5))) | |
| theorem checkedMembership_spec (M : ZFSet.{u}) (hM : Transitive M) (hT : SourceT M) | |
| {o : ZFSet.{u}} (ho : β r s : Conditions c, | |
| ZFSet.pair (label c r) (label c s) β o β r β€ s) | |
| (t : Name (Conditions c)) (p : Conditions c) (x : ZFSet.{u}) | |
| (e : β β ZFSet.{u}) (he : β i, e i β M) | |
| (h0 : e 0 = x) (h1 : e 1 = c) (h2 : e 2 = o) (h3 : e 3 = label c p) | |
| (h4 : e 4 = t.encode (label c)) (h5 : e 5 = label c β€) : | |
| checkedMembershipFormula.Sat (M : Set ZFSet) e β MemForces (Name.check x) t p := by | |
| let v : β β β := fun i => match i with | 0 => 0 | _ => 5 | |
| let k : β β β := fun i => match i with | 0 => 0 | 1 => 1 | _ => 6 | |
| let names : β β Name (Conditions c) := fun i => match i with | 0 => Name.check x | _ => t | |
| have hc : c β M := h1 βΈ he 1 | |
| have hx : x β M := h0 βΈ he 0 | |
| have hcheck : (Name.check x : Name (Conditions c)).encode (label c) β M := | |
| encoded_check_mem M c hM hT.pairing hT.union hT.powerSet | |
| hT.separation.finitePrefix.bounded hT.replacement.finitePrefix hT.infinity hc hx | |
| have henv (z : ZFSet.{u}) (hz : z β M) : β i, cons z e i β M := by | |
| intro i; cases i; exact hz; exact he _ | |
| have checked (z : ZFSet.{u}) (hz : z β M) : | |
| (checkedValueFormula.rename k).Sat (M : Set ZFSet) (cons z e) β | |
| z = (Name.check x : Name (Conditions c)).encode (label c) := by | |
| rw [sat_rename,checkedValue_spec M hM hT _ (fun i => henv z hz (k i))] | |
| simp only [k,cons_zero,cons_succ,h0,h5,encode_check] | |
| have forcing (z : ZFSet.{u}) (hz : z β M) | |
| (hzv : z = (Name.check x : Name (Conditions c)).encode (label c)) : | |
| (code (.member 0 1) 2 3 4 v).Sat (M : Set ZFSet) (cons z e) β | |
| MemForces (Name.check x) t p := by | |
| exact realize_code M hM hT ho (.member 0 1) names p (cons z e) (henv z hz) | |
| 2 3 4 v h1 h2 h3 (by intro i; cases i; exact hzv; exact h4) | |
| change (β z β M, (checkedValueFormula.rename k).Sat _ (cons z e) β§ _) β _ | |
| constructor | |
| Β· rintro β¨z,hz,hzv,hfβ© | |
| exact (forcing z hz ((checked z hz).mp hzv)).mp hf | |
| Β· intro hf | |
| exact β¨_,hcheck,(checked _ hcheck).mpr rfl,(forcing _ hcheck rfl).mpr hfβ© | |
| noncomputable def checkedValueSigma : SigmaFormula := | |
| .existsSet (.existsSet (.existsSet (.bounded (.conj (CheckFormula.graph 2 1 0 5) | |
| (.conj (.member 4 2) (.conj (.member 3 1) (.pairMem 4 3 0))))))) | |
| noncomputable def checkedMembershipSigma : SigmaFormula := | |
| .existsSet (.conj | |
| (checkedValueSigma.rename (fun i => match i with | 0 => 0 | 1 => 1 | _ => 6)) | |
| (BoundedForcing.SigmaCode.forcing (.bounded (.member 0 1)) 2 3 4 | |
| (fun i => match i with | 0 => 0 | _ => 5))) | |
| theorem checkedMembershipSigma_spec (M : ZFSet.{u}) (e : β β ZFSet.{u}) : | |
| checkedMembershipSigma.Realize M e β checkedMembershipFormula.Sat (M : Set ZFSet) e := by | |
| change (β z β M, (SigmaFormula.conj _ _).Realize M (cons z e)) β | |
| β z β M, (SentenceForm.conj _ _).Sat (M : Set ZFSet) (cons z e) | |
| apply exists_congr; intro z | |
| apply and_congr_right; intro _ | |
| rw [SigmaFormula.realize_conj] | |
| change (_ β§ _) β (_ β§ _) | |
| rw [SigmaFormula.realize_rename,sat_rename] | |
| exact and_congr (sigma_sat checkedValueSigma M _).symm | |
| (sigma_sat (BoundedForcing.SigmaCode.forcing (.bounded (.member 0 1)) 2 3 4 | |
| (fun i => match i with | 0 => 0 | _ => 5)) M _).symm | |
| theorem internal_forced_members (M : ZFSet.{u}) (hM : Transitive M) (hT : SourceT M) | |
| (hc : c β M) {o a : ZFSet.{u}} | |
| (hoM : o β M) (ha : a β M) | |
| (ho : β r s : Conditions c, ZFSet.pair (label c r) (label c s) β o β r β€ s) | |
| (t : Name (Conditions c)) (ht : t.encode (label c) β M) (p : Conditions c) : | |
| β b β M, β x, x β b β x β a β§ MemForces (Name.check x) t p := by | |
| let e := cons c (cons o (cons (label c p) (cons (t.encode (label c)) (fun _ => label c β€)))) | |
| have he : β i, e i β M := by | |
| intro i; rcases i with _|_|_|_|i | |
| exact hc | |
| exact hoM | |
| exact hM c hc _ (label_mem c p) | |
| exact ht | |
| exact hM c hc _ (label_mem c β€) | |
| obtain β¨b,hb,hdefβ© := hT.separation.finitePrefix checkedMembershipSigma e he a ha | |
| have spec (x : ZFSet.{u}) (hx : x β M) := checkedMembership_spec M hM hT ho t p x | |
| (cons x e) (by intro i; cases i; exact hx; exact he _) rfl rfl rfl rfl rfl rfl | |
| refine β¨b,hb,fun x => ?_β© | |
| constructor | |
| Β· intro hx | |
| have hxM := hM b hb x hx | |
| obtain β¨hxa,hfβ© := (hdef x hxM).mp hx | |
| exact β¨hxa,(spec x hxM).mp ((checkedMembershipSigma_spec M _).mp hf)β© | |
| Β· rintro β¨hxa,hfβ© | |
| have hxM := hM a ha x hxa | |
| exact (hdef x hxM).mpr β¨hxa,(checkedMembershipSigma_spec M _).mpr ((spec x hxM).mpr hf)β© | |
| end TuringRigidity.FullSetForcing | |
| end OAI | |