Download data/lean/OAI/Computability/DegreeRigidity/OrdinalCodes/CanonicalOmegaSyntax.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.99 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/OrdinalCodes/CanonicalOmegaSyntax.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/OrdinalCodes/CanonicalOmegaSyntax.lean
-
curl -L -o CanonicalOmegaSyntax.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/OrdinalCodes/CanonicalOmegaSyntax.lean
2.99 kB
| import OAI.Computability.DegreeRigidity.Syntax.SentenceInlining | |
| import OAI.Computability.DegreeRigidity.SetModels.SetModelAddition | |
| namespace OAI | |
| namespace TuringRigidity.RelativeConstructible | |
| open ElementaryModel BoundedSetTheory TransitiveNameModel | |
| universe u | |
| def inductiveSetFormula (w : β) : Formula := | |
| .conj (.existsMem w (.empty 0)) | |
| (.allMem w (.existsMem (w+1) (.successor 0 1))) | |
| theorem inductiveSetFormula_spec (w : β) (e : β β ZFSet.{u}) : | |
| (inductiveSetFormula w).Eval e β | |
| (β : ZFSet) β e w β§ β x β e w, insert x x β e w := by | |
| simp only [inductiveSetFormula,Formula.Eval,Formula.eval_empty, | |
| Formula.eval_allMem,Formula.eval_successor,cons_zero,cons_succ] | |
| simp only [exists_eq_right] | |
| theorem omega_subset_inductive {W : ZFSet.{u}} | |
| (h : (β : ZFSet) β W β§ β x β W, insert x x β W) : ZFSet.omega β W := by | |
| intro x hx | |
| obtain β¨n,rflβ© := (mem_omega x).mp hx | |
| clear hx | |
| induction n with | |
| | zero => exact h.1 | |
| | succ n ih => exact h.2 _ ih | |
| noncomputable def canonicalOmega (w : β) : SentenceForm := | |
| .conj (fromBounded (inductiveSetFormula w)) | |
| (SentenceForm.all (SentenceForm.imp (fromBounded (inductiveSetFormula 0)) | |
| (fromBounded (.subset (w+1) 0)))) | |
| theorem canonicalOmega_spec (M : ZFSet.{u}) (hM : Transitive M) | |
| (hΟ : ZFSet.omega.{u} β M) (w : β) (e : β β ZFSet.{u}) (he : β i, e i β M) : | |
| (canonicalOmega w).Sat (M : Set ZFSet) e β e w = ZFSet.omega := by | |
| have habs (p : Formula) (x : ZFSet.{u}) (hx : x β M) : | |
| (fromBounded p).Sat (M : Set ZFSet) (cons x e) β p.Eval (cons x e) := by | |
| rw [bounded_sat,Formula.absolute p M hM _ | |
| (by intro i; cases i; exact hx; exact he _)] | |
| have hw : (β : ZFSet.{u}) β ZFSet.omega β§ | |
| β x β ZFSet.omega.{u}, insert x x β ZFSet.omega := | |
| β¨(mem_omega _).mpr β¨0,rflβ©,SetModelArithmetic.setSucc_omegaβ© | |
| change ((fromBounded (inductiveSetFormula w)).Sat (M : Set ZFSet) e β§ | |
| (SentenceForm.all (SentenceForm.imp (fromBounded (inductiveSetFormula 0)) | |
| (fromBounded (.subset (w+1) 0)))).Sat (M : Set ZFSet) e) β _ | |
| simp only [SentenceForm.sat_all,SentenceForm.sat_imp] | |
| rw [bounded_sat,Formula.absolute _ M hM e he,inductiveSetFormula_spec] | |
| have hmin : (β x β (M : Set ZFSet), | |
| (fromBounded (inductiveSetFormula 0)).Sat (M : Set ZFSet) (cons x e) β | |
| (fromBounded (.subset (w+1) 0)).Sat (M : Set ZFSet) (cons x e)) β | |
| β x β M, ((β : ZFSet) β x β§ β y β x, insert y y β x) β e w β x := by | |
| apply forall_congr'; intro x | |
| apply forall_congr'; intro hx | |
| rw [habs _ x hx,habs _ x hx,inductiveSetFormula_spec,Formula.eval_subset] | |
| rfl | |
| rw [hmin] | |
| constructor | |
| Β· rintro β¨hi,hminimalβ© | |
| exact ZFSet.ext fun x => β¨fun hx => hminimal _ hΟ hw hx,fun hx => omega_subset_inductive hi hxβ© | |
| Β· intro h | |
| rw [h] | |
| exact β¨hw,fun _ _ hi => omega_subset_inductive hiβ© | |
| end TuringRigidity.RelativeConstructible | |
| end OAI | |