math / data /lean /OAI /Computability /DegreeRigidity /Constructibility /ConstructibleSuccessorCode.lean
Download data/lean/OAI/Computability/DegreeRigidity/Constructibility/ConstructibleSuccessorCode.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.23 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ConstructibleSuccessorCode.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ConstructibleSuccessorCode.lean
-
curl -L -o ConstructibleSuccessorCode.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Constructibility/ConstructibleSuccessorCode.lean
2.23 kB
| import OAI.Computability.DegreeRigidity.Constructibility.ConstructibleSatisfaction | |
| import OAI.Computability.DegreeRigidity.Constructibility.ConstructibleStages | |
| namespace OAI | |
| namespace TuringRigidity.RelativeConstructible | |
| open ElementaryModel BoundedSetTheory TransitiveNameModel | |
| universe u | |
| theorem tupleEnv_cons {n : β} (x : ZFSet.{u}) (v : Fin n β ZFSet.{u}) : | |
| tupleEnv (Fin.cases x v) = cons x (tupleEnv v) := by | |
| funext i | |
| cases i with | |
| | zero => simp [tupleEnv,cons] | |
| | succ i => | |
| by_cases hi : i < n | |
| Β· simp only [tupleEnv,cons_succ,Nat.succ_lt_succ_iff,hi,dite_eq_left] | |
| rfl | |
| Β· simp [tupleEnv,cons_succ,hi] | |
| theorem definedSubset_record (A x : ZFSet.{u}) (p : SentenceForm) | |
| {n : β} (v : Fin n β ZFSet.{u}) (hv : β i, v i β A) (hb : p.bound β€ n+1) : | |
| x β definedSubset A p v β x β A β§ | |
| ZFSet.pair (natSet (Encodable.encode p)) (tupleCode (Fin.cases x v)) β satisfactionSet A := by | |
| rw [mem_definedSubset] | |
| apply and_congr_right; intro hx | |
| rw [satisfactionSet_spec A p _ (fun i => Fin.cases hx hv i) hb,tupleEnv_cons] | |
| theorem definablePower_records (A S : ZFSet.{u}) : | |
| S β definablePower A β | |
| β (n : β) (p : SentenceForm) (v : Fin n β ZFSet.{u}), | |
| p.bound β€ n+1 β§ (β i, v i β A) β§ β x, | |
| (x β S β x β A β§ ZFSet.pair (natSet (Encodable.encode p)) | |
| (tupleCode (Fin.cases x v)) β satisfactionSet A) := by | |
| rw [mem_definablePower] | |
| constructor | |
| Β· rintro β¨n,p,v,hb,hv,rflβ© | |
| exact β¨n,p,v,hb,hv,fun x => definedSubset_record A x p v hv hbβ© | |
| Β· rintro β¨n,p,v,hb,hv,hSβ© | |
| refine β¨n,p,v,hb,hv,?_β© | |
| apply ZFSet.ext; intro x | |
| exact (hS x).trans (definedSubset_record A x p v hv hb).symm | |
| theorem level_succ_records (R S : ZFSet.{u}) (o : Ordinal.{u}) : | |
| S β level R (o+1) β | |
| β (n : β) (p : SentenceForm) (v : Fin n β ZFSet.{u}), | |
| p.bound β€ n+1 β§ (β i, v i β level R o) β§ β x, | |
| (x β S β x β level R o β§ ZFSet.pair (natSet (Encodable.encode p)) | |
| (tupleCode (Fin.cases x v)) β satisfactionSet (level R o)) := by | |
| rw [level_succ,definablePower_records] | |
| end TuringRigidity.RelativeConstructible | |
| end OAI | |