Download data/lean/OAI/Computability/DegreeRigidity/Syntax/LevySigmaNormalization.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.42 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/LevySigmaNormalization.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Syntax/LevySigmaNormalization.lean
-
curl -L -o LevySigmaNormalization.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/LevySigmaNormalization.lean
3.42 kB
| import OAI.Computability.DegreeRigidity.Syntax.SigmaDisjunction | |
| namespace OAI | |
| namespace TuringRigidity.BoundedSetTheory | |
| open TransitiveNameModel | |
| universe u | |
| inductive LevySigma where | |
| | bounded (Ο : Formula) | |
| | conj (Ο Ο : LevySigma) | |
| | disj (Ο Ο : LevySigma) | |
| | existsSet (Ο : LevySigma) | |
| | existsMem (a : β) (Ο : LevySigma) | |
| | allMem (a : β) (Ο : LevySigma) | |
| namespace LevySigma | |
| def Realize (M : ZFSet.{u}) (e : β β ZFSet.{u}) : LevySigma β Prop | |
| | .bounded Ο => Ο.Realize M e | |
| | .conj Ο Ο => Ο.Realize M e β§ Ο.Realize M e | |
| | .disj Ο Ο => Ο.Realize M e β¨ Ο.Realize M e | |
| | .existsSet Ο => β x β M, Ο.Realize M (cons x e) | |
| | .existsMem a Ο => β x β M, x β e a β§ Ο.Realize M (cons x e) | |
| | .allMem a Ο => β x β M, x β e a β Ο.Realize M (cons x e) | |
| def normalize : LevySigma β SigmaFormula | |
| | .bounded Ο => .bounded Ο | |
| | .conj Ο Ο => .conj Ο.normalize Ο.normalize | |
| | .disj Ο Ο => .disj Ο.normalize Ο.normalize | |
| | .existsSet Ο => .existsSet Ο.normalize | |
| | .existsMem a Ο => .existsMem a Ο.normalize | |
| | .allMem a Ο => .allMem a Ο.normalize | |
| theorem normalize_correct (M : ZFSet.{u}) (hM : Transitive M) | |
| (hP : Pairing M) (hU : BoundedSetTheory.Union M) (hS : Separation M) | |
| (hR : SigmaReplacement M) (hI : Infinity M) (hC : SigmaCollection M) | |
| (Ο : LevySigma) (e : β β ZFSet.{u}) (he : β i, e i β M) : | |
| Ο.normalize.Realize M e β Ο.Realize M e := by | |
| have hΟ := omega_mem M hM hS hI | |
| have h0 := hM _ hΟ _ ZFSet.omega_zero | |
| induction Ο generalizing e with | |
| | bounded Ο => rfl | |
| | conj Ο Ο ihΟ ihΟ => exact (SigmaFormula.realize_conj _ _ _ _).trans (and_congr (ihΟ e he) (ihΟ e he)) | |
| | disj Ο Ο ihΟ ihΟ => exact (SigmaFormula.realize_disj M h0 _ _ _).trans (or_congr (ihΟ e he) (ihΟ e he)) | |
| | existsSet Ο ih => | |
| simp only [normalize,SigmaFormula.Realize,Realize] | |
| apply exists_congr; intro x | |
| apply and_congr_right; intro hx | |
| exact ih (cons x e) (by intro i; cases i <;> simp [cons,he,hx]) | |
| | existsMem a Ο ih => | |
| rw [normalize,SigmaFormula.realize_existsMem] | |
| change (β x β M, x β e a β§ _) β β x β M, x β e a β§ _ | |
| apply exists_congr; intro x | |
| apply and_congr_right; intro hx | |
| exact and_congr_right (fun _ => ih (cons x e) (by intro i; cases i <;> simp [cons,he,hx])) | |
| | allMem a Ο ih => | |
| rw [normalize,SigmaFormula.realize_allMem M hM hP hU hS hR hI hC _ _ _ he] | |
| change (β x β e a, _) β β x β M, x β e a β _ | |
| constructor | |
| Β· intro h x hx hxa | |
| exact (ih (cons x e) (by intro i; cases i <;> simp [cons,he,hx])).mp (h x hxa) | |
| Β· intro h x hxa | |
| have hx := hM _ (he a) x hxa | |
| exact (ih (cons x e) (by intro i; cases i <;> simp [cons,he,hx])).mpr (h x hx hxa) | |
| end LevySigma | |
| def LevySigmaSeparation (M : ZFSet.{u}) : Prop := | |
| β (Ο : LevySigma) (e : β β ZFSet.{u}), (β i, e i β M) β β a β M, | |
| β b β M, β x β M, x β b β x β a β§ Ο.Realize M (cons x e) | |
| def LevySigmaReplacement (M : ZFSet.{u}) : Prop := | |
| β (Ο : LevySigma) (e : β β ZFSet.{u}), (β i, e i β M) β β a β M, | |
| (β x β a, β y β M, Ο.Realize M (cons y (cons x e)) β§ | |
| β z β M, Ο.Realize M (cons z (cons x e)) β z = y) β | |
| β b β M, β y β M, y β b β β x β a, Ο.Realize M (cons y (cons x e)) | |
| end TuringRigidity.BoundedSetTheory | |
| end OAI | |