math / data /lean /OAI /Computability /DegreeRigidity /SetModels /CountedOriginalRealQuotient.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.43 kB
import OAI.Computability.DegreeRigidity.Representation.OriginalRealQuotientModel
import OAI.Computability.DegreeRigidity.CohenForcing.CountedCohenConditions
import OAI.Computability.DegreeRigidity.SetModels.InternalQuotientCountability
namespace OAI
namespace TuringRigidity.CountedOriginalRealQuotient
open TransitiveNameModel BoundedSetTheory CountableForcing RecursiveNames
open CohenGroundPoset InternalRegularOperations InternalRegularAlgebra InternalBooleanSyntax
open InternalProjectedGeneric
attribute [local instance] InternalCollapse.order InternalCollapse.collapsePreorder
CohenNiceNameConstruction.cohenTop
attribute [local instance] codeOrder codePreorder
theorem original_name_counted_quotient (M K : ZFSet.{0})
(hM : Transitive M) (hT : SourceT M) (hK : K ∈ M)
(Ο„ : Name (Conditions (conditions (ZFSet.prod K ZFSet.omega))))
(hΟ„ : Ο„.encode (label (conditions (ZFSet.prod K ZFSet.omega))) ∈ M) :
βˆƒ C ∈ M, βˆƒ _hCK : C βŠ† K, (C = βˆ… ∨ InternallyCountable M C) ∧
βˆƒ E : β„• β†’ ZFSet.{0}, orbitGraph E ∈ M ∧
(βˆ€ n, E n ∈ M ∧ E n βŠ† conditions (ZFSet.prod C ZFSet.omega)) ∧
βˆƒ B ∈ M, βˆƒ Q ∈ M, βˆƒ A ∈ M,
(βˆ€ U, U ∈ B ↔ U ∈ M ∧ IsCode (conditions (ZFSet.prod C ZFSet.omega)) U) ∧
(βˆ€ F, F ∈ Q ↔ F ∈ M ∧ F βŠ† B) ∧
A = InternalGeneratedAlgebra.generated (conditions (ZFSet.prod C ZFSet.omega)) B Q
(InternalBooleanBits.seeds (conditions (ZFSet.prod C ZFSet.omega)) B E) ∧
Closed (conditions (ZFSet.prod C ZFSet.omega)) B Q A ∧
βˆƒ Οƒ : Name (Conditions (positive A)), Οƒ.encode (label (positive A)) ∈ M ∧
βˆƒ hBA : ZFSet.prod C ZFSet.omega βŠ† ZFSet.prod K ZFSet.omega,
βˆ€ G : GenericFilter (Conditions (conditions (ZFSet.prod K ZFSet.omega))),
AtomicForcing.GroundGeneric M G β†’ Ο„.val G.carrier βŠ† ZFSet.omega β†’
let J := InternalCohenProjectedGeneric.projected _ _ hBA G
let X := Ο„.val G.carrier
βˆƒ H : GenericFilter (Conditions (positive A)), AtomicForcing.GroundGeneric M H ∧
Οƒ.val H.carrier = X ∧
genericExtensionSet M (positive A) H.carrier = RealGeneratedModel.hull M X ∧
RealGeneratedModel.Contains M X (RealGeneratedModel.hull M X) ∧
let q := InternalQuotientConditions.conditions (conditions (ZFSet.prod C ZFSet.omega)) A
(genericFilterSet (positive A) H.carrier)
q ∈ RealGeneratedModel.hull M X ∧ InternalCollapse.orderSet q ∈ RealGeneratedModel.hull M X ∧
InternallyCountable (RealGeneratedModel.hull M X) q ∧
βˆƒ Gq : GenericFilter (Conditions q), AtomicForcing.GroundGeneric (RealGeneratedModel.hull M X) Gq ∧
genericExtensionSet (RealGeneratedModel.hull M X) q Gq.carrier =
genericExtensionSet M (conditions (ZFSet.prod C ZFSet.omega)) J.carrier ∧
genericFilterSet q Gq.carrier =
genericFilterSet (conditions (ZFSet.prod C ZFSet.omega)) J.carrier ∧
genericExtensionSet (RealGeneratedModel.hull M X) q Gq.carrier βŠ†
genericExtensionSet M (conditions (ZFSet.prod K ZFSet.omega)) G.carrier ∧
βˆ€ p ∈ G.carrier, βˆƒ r ∈ Gq.carrier,
label q r = label _ (InternalCohenFactor.project _ _ hBA p) := by
obtain ⟨C,hC,hCK,hct,E,hgraph,hE,B,hBM,Q,hQM,A,hAM,hB,hQ,hAe,hA,Οƒ,hΟƒ,hBA,hall⟩ :=
OriginalRealQuotientModel.original_name_quotient M K hM hT hK Ο„ hΟ„
have hcM := (manyColumn_internal M C hM hT hC).1
have hcount := CountedCohenConditions.many_column_conditions_countable M C hM hT hC hct
refine ⟨C,hC,hCK,hct,E,hgraph,hE,B,hBM,Q,hQM,A,hAM,hB,hQ,hAe,hA,Οƒ,hΟƒ,hBA,?_⟩
intro G hG hreal
obtain ⟨H,hHG,hval,hHull,hprop,hq,ho,Gq,hGq,hext,hcode,hsub,hcond⟩ := hall G hG hreal
refine ⟨H,hHG,hval,hHull,hprop,hq,ho,?_,Gq,hGq,hext,hcode,hsub,hcond⟩
apply InternalCountableClosure.countable_subset _ _ _ hprop.1 hprop.2.1
(hprop.2.2.1 hcM) hq (InternalQuotientConditions.conditions_subset _ A _)
(InternalQuotientCountability.countability_upward M _ _ hprop.2.2.1 hcount)
obtain ⟨p,_⟩ := Gq.nonempty
exact ⟨label _ p,label_mem _ p⟩
end TuringRigidity.CountedOriginalRealQuotient
end OAI