Download data/lean/OAI/Computability/DegreeRigidity/SetModels/CountableNameAvoidance.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.1 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/SetModels/CountableNameAvoidance.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/SetModels/CountableNameAvoidance.lean
-
curl -L -o CountableNameAvoidance.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/SetModels/CountableNameAvoidance.lean
4.1 kB
| import OAI.Computability.DegreeRigidity.SetModels.NameDifferenceDense | |
| import OAI.Computability.DegreeRigidity.Representation.GroundGenericRequirements | |
| namespace OAI | |
| namespace TuringRigidity.FullSetForcing | |
| open RecursiveNames TransitiveNameModel BoundedSetTheory AtomicForcing CountableForcing | |
| universe u | |
| variable {c : ZFSet.{u}} [Preorder (Conditions c)] [OrderTop (Conditions c)] | |
| omit [Preorder (Conditions c)] [OrderTop (Conditions c)] in | |
| theorem ground_name_sequence (M N : ZFSet.{u}) [Countable (Conditions N)] (hMN : M β N) | |
| (tβ : Name (Conditions c)) (htβ : tβ.encode (label c) β M) : | |
| β ts : β β Name (Conditions c), (β n, (ts n).encode (label c) β M) β§ | |
| β t : Name (Conditions c), t.encode (label c) β M β | |
| β n, (ts n).encode (label c) = t.encode (label c) := by | |
| classical | |
| obtain β¨m,_β© := label_surjective N (hMN htβ) | |
| let _ : Nonempty (Conditions N) := β¨mβ© | |
| obtain β¨e,heβ© := exists_surjective_nat (Conditions N) | |
| have pick (n : β) : β s : Name (Conditions c), s.encode (label c) β M β§ | |
| β t : Name (Conditions c), t.encode (label c) β M β | |
| t.encode (label c) = label N (e n) β s.encode (label c) = t.encode (label c) := by | |
| by_cases h : β t : Name (Conditions c), t.encode (label c) β M β§ | |
| t.encode (label c) = label N (e n) | |
| Β· obtain β¨t,ht,heqβ© := h | |
| exact β¨t,ht,fun s _ hs => heq.trans hs.symmβ© | |
| Β· exact β¨tβ,htβ,fun t ht heq => False.elim (h β¨t,ht,heqβ©)β© | |
| choose ts hts using pick | |
| refine β¨ts,fun n => (hts n).1,?_β© | |
| intro t ht | |
| obtain β¨m,hmβ© := label_surjective N (hMN ht) | |
| obtain β¨n,rflβ© := he m | |
| exact β¨n,(hts n).2 t ht hm.symmβ© | |
| theorem exists_generic_omitting_subset (M N : ZFSet.{u}) [Countable (Conditions N)] | |
| (hM : Transitive M) (hT : SourceT M) (hMN : M β N) | |
| (hc : c β M) {o a S : ZFSet.{u}} (hoM : o β M) (ha : a β M) | |
| (hSa : S β a) (hSM : S β M) | |
| (ho : β r s : Conditions c, ZFSet.pair (label c r) (label c s) β o β r β€ s) | |
| (p : Conditions c) : | |
| β G : GenericFilter (Conditions c), p β G.carrier β§ GroundGeneric N G β§ | |
| S β genericExtensionSet M c G.carrier := by | |
| have htβ := encoded_check_mem M c hM hT.pairing hT.union hT.powerSet | |
| hT.separation.finitePrefix.bounded hT.replacement.finitePrefix hT.infinity hc hc | |
| obtain β¨ts,hts,hcoverβ© := ground_name_sequence M N hMN (Name.check c) htβ | |
| let E : β β Set (Conditions c) := fun n => NameDifference a S (ts n) | |
| have hE : β n, Dense (E n) := fun n => | |
| nameDifference_dense M hM hT hc hoM ha hSa hSM ho (ts n) (hts n) | |
| obtain β¨G,hp,hG,hGEβ© := ground_generic_with_requirements N β¨c,hMN hcβ© E hE p | |
| refine β¨G,hp,hG,?_β© | |
| intro hSG | |
| obtain β¨t,ht,hvalβ© := (mem_extensionSet M c G.carrier S).mp hSG | |
| obtain β¨n,hnβ© := hcover t ht | |
| obtain β¨q,hq,hqnβ© := hGE n | |
| have hGM : GroundGeneric M G := fun D hD hd => hG D (hMN hD) hd | |
| have hne := nameDifference_ne_value M hM hT hc hoM ha ho (ts n) (hts n) G hGM hq hqn | |
| apply hne | |
| exact (Name.val_eq_of_encode_eq (label c) (label_injective c) G.carrier (ts n) t hn).trans hval | |
| theorem subset_mem_iff_all_generic_extensions (M N : ZFSet.{u}) [Countable (Conditions N)] | |
| (hM : Transitive M) (hT : SourceT M) (hMN : M β N) | |
| (hc : c β M) {o a S : ZFSet.{u}} (hoM : o β M) (ha : a β M) (hSa : S β a) | |
| (ho : β r s : Conditions c, ZFSet.pair (label c r) (label c s) β o β r β€ s) | |
| (p : Conditions c) : | |
| S β M β β G : GenericFilter (Conditions c), GroundGeneric N G β p β G.carrier β | |
| S β genericExtensionSet M c G.carrier := by | |
| classical | |
| constructor | |
| Β· intro hSM G _ hp | |
| exact ground_inclusion_set M c hM hT.pairing hT.union hT.powerSet | |
| hT.separation.finitePrefix.bounded hT.replacement.finitePrefix hT.infinity hc | |
| G.carrier (G.upper le_top hp) hSM | |
| Β· intro h | |
| by_contra hSM | |
| obtain β¨G,hp,hG,hSGβ© := exists_generic_omitting_subset M N hM hT hMN hc hoM ha hSa hSM ho p | |
| exact hSG (h G hG hp) | |
| end TuringRigidity.FullSetForcing | |
| end OAI | |