File size: 2,990 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 | 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
|