Users' Mathboxes Mathbox for Chen-Pang He < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onsucsuccmpi Structured version   Visualization version   GIF version

Theorem onsucsuccmpi 37323
Description: The successor of a successor ordinal number is a compact topology, proven without the Axiom of Regularity. (Contributed by Chen-Pang He, 18-Oct-2015.)
Hypothesis
Ref Expression
onsucsuccmpi.1 𝐴 ∈ On
Assertion
Ref Expression
onsucsuccmpi suc suc 𝐴 ∈ Comp

Proof of Theorem onsucsuccmpi
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 onsucsuccmpi.1 . . . 4 𝐴 ∈ On
21onsuci 7850 . . 3 suc 𝐴 ∈ On
3 onsuctop 37313 . . 3 (suc 𝐴 ∈ On → suc suc 𝐴 ∈ Top)
42, 3ax-mp 5 . 2 suc suc 𝐴 ∈ Top
51onirri 6477 . . . . . . 7 ¬ 𝐴 ∈ 𝐴
61, 1onsucssi 7852 . . . . . . 7 (𝐴 ∈ 𝐴 ↔ suc 𝐴 ⊆ 𝐴)
75, 6mtbi 325 . . . . . 6 ¬ suc 𝐴 ⊆ 𝐴
8 sseq1 3933 . . . . . 6 (suc 𝐴 = ∪ 𝑦 → (suc 𝐴 ⊆ 𝐴 ↔ ∪ 𝑦 ⊆ 𝐴))
97, 8mtbii 329 . . . . 5 (suc 𝐴 = ∪ 𝑦 → ¬ ∪ 𝑦 ⊆ 𝐴)
10 elpwi 4563 . . . . . . 7 (𝑦 ∈ 𝒫 suc 𝐴 → 𝑦 ⊆ suc 𝐴)
1110unissd 4876 . . . . . 6 (𝑦 ∈ 𝒫 suc 𝐴 → ∪ 𝑦 ⊆ ∪ suc 𝐴)
121onunisuci 6484 . . . . . 6 ∪ suc 𝐴 = 𝐴
1311, 12sseqtrdi 3948 . . . . 5 (𝑦 ∈ 𝒫 suc 𝐴 → ∪ 𝑦 ⊆ 𝐴)
149, 13nsyl 141 . . . 4 (suc 𝐴 = ∪ 𝑦 → ¬ 𝑦 ∈ 𝒫 suc 𝐴)
15 eldif 4049 . . . . . . 7 (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) ↔ (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴))
16 elpwunsn 4641 . . . . . . 7 (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) → suc 𝐴 ∈ 𝑦)
1715, 16sylbir 238 . . . . . 6 ((𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴) → suc 𝐴 ∈ 𝑦)
1817ex 418 . . . . 5 (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴 ∈ 𝑦))
19 df-suc 6368 . . . . . 6 suc suc 𝐴 = (suc 𝐴 ∪ {suc 𝐴})
2019pweqi 4572 . . . . 5 𝒫 suc suc 𝐴 = 𝒫 (suc 𝐴 ∪ {suc 𝐴})
2118, 20eleq2s 2878 . . . 4 (𝑦 ∈ 𝒫 suc suc 𝐴 → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴 ∈ 𝑦))
22 snelpwi 5411 . . . . 5 (suc 𝐴 ∈ 𝑦 → {suc 𝐴} ∈ 𝒫 𝑦)
23 snfi 9074 . . . . . . . 8 {suc 𝐴} ∈ Fin
2423jctr 534 . . . . . . 7 ({suc 𝐴} ∈ 𝒫 𝑦 → ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
25 elin 4093 . . . . . . 7 ({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ↔ ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
2624, 25sylibr 237 . . . . . 6 ({suc 𝐴} ∈ 𝒫 𝑦 → {suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin))
272elexi 3472 . . . . . . . 8 suc 𝐴 ∈ V
2827unisn 4885 . . . . . . 7 ∪ {suc 𝐴} = suc 𝐴
2928eqcomi 2769 . . . . . 6 suc 𝐴 = ∪ {suc 𝐴}
30 unieq 4877 . . . . . . 7 (𝑧 = {suc 𝐴} → ∪ 𝑧 = ∪ {suc 𝐴})
3130rspceeqv 3598 . . . . . 6 (({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ∧ suc 𝐴 = ∪ {suc 𝐴}) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
3226, 29, 31sylancl 598 . . . . 5 ({suc 𝐴} ∈ 𝒫 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
3322, 32syl 18 . . . 4 (suc 𝐴 ∈ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
3414, 21, 33syl56 37 . . 3 (𝑦 ∈ 𝒫 suc suc 𝐴 → (suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧))
3534rgen 3078 . 2 ∀𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
362onunisuci 6484 . . . 4 ∪ suc suc 𝐴 = suc 𝐴
3736eqcomi 2769 . . 3 suc 𝐴 = ∪ suc suc 𝐴
3837iscmp 23711 . 2 (suc suc 𝐴 ∈ Comp ↔ (suc suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)))
394, 35, 38mpbir2an 724 1 suc suc 𝐴 ∈ Comp
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   ∖ cdif 4045   ∩ cin 4089   ∪ cun 4149  𝒫 cpw 4556  {csn 4584  ∪ cuni 4866  Oncon0 6362  suc csuc 6364  Fincfn 8976  Topctop 23216  Compccmp 23709
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7878  df-1o 8479  df-en 8977  df-fin 8980  df-topgen 17619  df-top 23217  df-bases 23269  df-cmp 23710
This theorem is used by:  onsucsuccmp  37324
  Copyright terms: Public domain W3C validator