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 36767
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 7815 . . 3 suc 𝐴 ∈ On
3 onsuctop 36757 . . 3 (suc 𝐴 ∈ On → suc suc 𝐴 ∈ Top)
42, 3ax-mp 5 . 2 suc suc 𝐴 ∈ Top
51onirri 6456 . . . . . . 7 ¬ 𝐴𝐴
61, 1onsucssi 7817 . . . . . . 7 (𝐴𝐴 ↔ suc 𝐴𝐴)
75, 6mtbi 324 . . . . . 6 ¬ suc 𝐴𝐴
8 sseq1 3961 . . . . . 6 (suc 𝐴 = 𝑦 → (suc 𝐴𝐴 𝑦𝐴))
97, 8mtbii 328 . . . . 5 (suc 𝐴 = 𝑦 → ¬ 𝑦𝐴)
10 elpwi 4561 . . . . . . 7 (𝑦 ∈ 𝒫 suc 𝐴𝑦 ⊆ suc 𝐴)
1110unissd 4874 . . . . . 6 (𝑦 ∈ 𝒫 suc 𝐴 𝑦 suc 𝐴)
121onunisuci 6463 . . . . . 6 suc 𝐴 = 𝐴
1311, 12sseqtrdi 3976 . . . . 5 (𝑦 ∈ 𝒫 suc 𝐴 𝑦𝐴)
149, 13nsyl 140 . . . 4 (suc 𝐴 = 𝑦 → ¬ 𝑦 ∈ 𝒫 suc 𝐴)
15 eldif 3914 . . . . . . 7 (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) ↔ (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴))
16 elpwunsn 4642 . . . . . . 7 (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) → suc 𝐴𝑦)
1715, 16sylbir 237 . . . . . 6 ((𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴) → suc 𝐴𝑦)
1817ex 416 . . . . 5 (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴𝑦))
19 df-suc 6348 . . . . . 6 suc suc 𝐴 = (suc 𝐴 ∪ {suc 𝐴})
2019pweqi 4570 . . . . 5 𝒫 suc suc 𝐴 = 𝒫 (suc 𝐴 ∪ {suc 𝐴})
2118, 20eleq2s 2879 . . . 4 (𝑦 ∈ 𝒫 suc suc 𝐴 → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴𝑦))
22 snelpwi 5410 . . . . 5 (suc 𝐴𝑦 → {suc 𝐴} ∈ 𝒫 𝑦)
23 snfi 9020 . . . . . . . 8 {suc 𝐴} ∈ Fin
2423jctr 532 . . . . . . 7 ({suc 𝐴} ∈ 𝒫 𝑦 → ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
25 elin 3920 . . . . . . 7 ({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ↔ ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
2624, 25sylibr 236 . . . . . 6 ({suc 𝐴} ∈ 𝒫 𝑦 → {suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin))
272elexi 3475 . . . . . . . 8 suc 𝐴 ∈ V
2827unisn 4883 . . . . . . 7 {suc 𝐴} = suc 𝐴
2928eqcomi 2770 . . . . . 6 suc 𝐴 = {suc 𝐴}
30 unieq 4875 . . . . . . 7 (𝑧 = {suc 𝐴} → 𝑧 = {suc 𝐴})
3130rspceeqv 3604 . . . . . 6 (({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ∧ suc 𝐴 = {suc 𝐴}) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧)
3226, 29, 31sylancl 595 . . . . 5 ({suc 𝐴} ∈ 𝒫 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧)
3322, 32syl 17 . . . 4 (suc 𝐴𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧)
3414, 21, 33syl56 36 . . 3 (𝑦 ∈ 𝒫 suc suc 𝐴 → (suc 𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧))
3534rgen 3077 . 2 𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧)
362onunisuci 6463 . . . 4 suc suc 𝐴 = suc 𝐴
3736eqcomi 2770 . . 3 suc 𝐴 = suc suc 𝐴
3837iscmp 23428 . 2 (suc suc 𝐴 ∈ Comp ↔ (suc suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = 𝑧)))
394, 35, 38mpbir2an 721 1 suc suc 𝐴 ∈ Comp
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  cdif 3901  cun 3902  cin 3903  wss 3904  𝒫 cpw 4554  {csn 4581   cuni 4864  Oncon0 6342  suc csuc 6344  Fincfn 8923  Topctop 22933  Compccmp 23426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-om 7843  df-1o 8432  df-en 8924  df-fin 8927  df-topgen 17455  df-top 22934  df-bases 22986  df-cmp 23427
This theorem is referenced by:  onsucsuccmp  36768
  Copyright terms: Public domain W3C validator