File size: 3,467 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 | import OAI.Computability.DegreeRigidity.SetModels.InternalDenseFamily
import OAI.Computability.DegreeRigidity.SetModels.InternalCollapseExistence
namespace OAI
namespace TuringRigidity.BoundedSetTheory.InternalGeneric
open TransitiveNameModel CountableForcing
universe u
instance extension_countable (M c : ZFSet.{u}) [Countable (Conditions M)] (G : Set (Conditions c)) :
Countable (Conditions (genericExtensionSet M c G)) := by
have hM : (M : Set ZFSet.{u}).Countable := by
apply (Set.countable_range (label M)).mono
intro x hx
exact label_surjective M hx
have hE : (genericExtensionSet M c G : Set ZFSet.{u}).Countable := by
rw [genericExtensionSet_coe]
exact genericExtension_countable M c hM G
let : Countable (genericExtensionSet M c G : Set ZFSet.{u}) := hE.to_subtype
exact Function.Injective.countable (f := fun p : Conditions (genericExtensionSet M c G) =>
(β¨label _ p,label_mem _ pβ© : (genericExtensionSet M c G : Set ZFSet.{u})))
(fun x y h => label_injective _ (congrArg (fun z : (genericExtensionSet M c G : Set ZFSet.{u}) => z.val) h))
theorem counting_model_with_generic (M : ZFSet.{u}) [Countable (Conditions M)]
(hM : Transitive M) (hT : SourceT M) {c o : ZFSet.{u}} [Preorder (Conditions c)]
(hc : c β M) (hoM : o β M)
(ho : β p q : Conditions c, ZFSet.pair (label c p) (label c q) β o β p β€ q)
(pβ : Conditions c) :
β N : ZFSet.{u}, M β N β§ Transitive N β§ SourceT N β§ Countable (Conditions N) β§
β G : GenericFilter (Conditions c), pβ β G.carrier β§
genericFilterSet c G.carrier β N β§ AtomicForcing.GroundGeneric M G := by
obtain β¨D,hDM,hD,hcDβ© := dense_family M hM hT hc hoM ho
obtain β¨d,hd,_,_,H,_,hMN,hN,hTN,hcountβ© :=
InternalCollapse.exists_internal_counting_extension M hM hT hDM β¨c,hcDβ©
let : Preorder (Conditions d) := InternalCollapse.collapsePreorder d
let N := genericExtensionSet M d H.carrier
obtain β¨G,hp,hGN,hGβ© := internal_ground_generic M N hM hN hT hTN hMN hc hoM hDM ho hD hcount pβ
exact β¨N,hMN,hN,hTN,inferInstance,G,hp,hGN,hGβ©
theorem common_generic_model (M : ZFSet.{u}) [Countable (Conditions M)]
(hM : Transitive M) (hT : SourceT M)
{c o d v : ZFSet.{u}} [Preorder (Conditions c)] [Preorder (Conditions d)]
(hc : c β M) (hoM : o β M)
(ho : β p q : Conditions c, ZFSet.pair (label c p) (label c q) β o β p β€ q)
(hd : d β M) (hvM : v β M)
(hv : β p q : Conditions d, ZFSet.pair (label d p) (label d q) β v β p β€ q)
(pβ : Conditions c) (qβ : Conditions d) :
β N : ZFSet.{u}, M β N β§ Transitive N β§ SourceT N β§ Countable (Conditions N) β§
β G : GenericFilter (Conditions c), β H : GenericFilter (Conditions d),
pβ β G.carrier β§ qβ β H.carrier β§ genericFilterSet c G.carrier β N β§
genericFilterSet d H.carrier β N β§ AtomicForcing.GroundGeneric M G β§
AtomicForcing.GroundGeneric M H := by
obtain β¨N,hMN,hN,hTN,hcount,G,hp,hGN,hGβ© := counting_model_with_generic M hM hT hc hoM ho pβ
let : Countable (Conditions N) := hcount
obtain β¨K,hNK,hK,hTK,hcountK,H,hq,hHK,hHβ© :=
counting_model_with_generic N hN hTN (hMN hd) (hMN hvM) hv qβ
refine β¨K,fun _ hx => hNK (hMN hx),hK,hTK,hcountK,G,H,hp,hq,hNK hGN,hHK,hG,?_β©
intro E hEM hE
exact hH E (hMN hEM) hE
end TuringRigidity.BoundedSetTheory.InternalGeneric
end OAI
|