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

Theorem onsucconni 32969
Description: A successor ordinal number is a connected topology. (Contributed by Chen-Pang He, 16-Oct-2015.)
Hypothesis
Ref Expression
onsucconni.1 𝐴 ∈ On
Assertion
Ref Expression
onsucconni suc 𝐴 ∈ Conn

Proof of Theorem onsucconni
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 onsucconni.1 . . 3 𝐴 ∈ On
2 onsuctop 32965 . . 3 (𝐴 ∈ On → suc 𝐴 ∈ Top)
31, 2ax-mp 5 . 2 suc 𝐴 ∈ Top
4 elin 4023 . . . 4 (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ↔ (𝑥 ∈ suc 𝐴𝑥 ∈ (Clsd‘suc 𝐴)))
5 elsuci 6029 . . . . 5 (𝑥 ∈ suc 𝐴 → (𝑥𝐴𝑥 = 𝐴))
61onunisuci 6076 . . . . . . 7 suc 𝐴 = 𝐴
76eqcomi 2834 . . . . . 6 𝐴 = suc 𝐴
87cldopn 21206 . . . . 5 (𝑥 ∈ (Clsd‘suc 𝐴) → (𝐴𝑥) ∈ suc 𝐴)
91onsuci 7299 . . . . . . . . . 10 suc 𝐴 ∈ On
109oneli 6070 . . . . . . . . 9 ((𝐴𝑥) ∈ suc 𝐴 → (𝐴𝑥) ∈ On)
11 elndif 3961 . . . . . . . . . . . 12 (∅ ∈ 𝑥 → ¬ ∅ ∈ (𝐴𝑥))
12 on0eln0 6018 . . . . . . . . . . . . . 14 ((𝐴𝑥) ∈ On → (∅ ∈ (𝐴𝑥) ↔ (𝐴𝑥) ≠ ∅))
1312biimprd 240 . . . . . . . . . . . . 13 ((𝐴𝑥) ∈ On → ((𝐴𝑥) ≠ ∅ → ∅ ∈ (𝐴𝑥)))
1413necon1bd 3017 . . . . . . . . . . . 12 ((𝐴𝑥) ∈ On → (¬ ∅ ∈ (𝐴𝑥) → (𝐴𝑥) = ∅))
15 ssdif0 4171 . . . . . . . . . . . . 13 (𝐴𝑥 ↔ (𝐴𝑥) = ∅)
161onssneli 6072 . . . . . . . . . . . . 13 (𝐴𝑥 → ¬ 𝑥𝐴)
1715, 16sylbir 227 . . . . . . . . . . . 12 ((𝐴𝑥) = ∅ → ¬ 𝑥𝐴)
1811, 14, 17syl56 36 . . . . . . . . . . 11 ((𝐴𝑥) ∈ On → (∅ ∈ 𝑥 → ¬ 𝑥𝐴))
1918con2d 132 . . . . . . . . . 10 ((𝐴𝑥) ∈ On → (𝑥𝐴 → ¬ ∅ ∈ 𝑥))
201oneli 6070 . . . . . . . . . . . 12 (𝑥𝐴𝑥 ∈ On)
21 on0eln0 6018 . . . . . . . . . . . . 13 (𝑥 ∈ On → (∅ ∈ 𝑥𝑥 ≠ ∅))
2221biimprd 240 . . . . . . . . . . . 12 (𝑥 ∈ On → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
2320, 22syl 17 . . . . . . . . . . 11 (𝑥𝐴 → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
2423necon1bd 3017 . . . . . . . . . 10 (𝑥𝐴 → (¬ ∅ ∈ 𝑥𝑥 = ∅))
2519, 24sylcom 30 . . . . . . . . 9 ((𝐴𝑥) ∈ On → (𝑥𝐴𝑥 = ∅))
2610, 25syl 17 . . . . . . . 8 ((𝐴𝑥) ∈ suc 𝐴 → (𝑥𝐴𝑥 = ∅))
2726orim1d 995 . . . . . . 7 ((𝐴𝑥) ∈ suc 𝐴 → ((𝑥𝐴𝑥 = 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴)))
2827impcom 398 . . . . . 6 (((𝑥𝐴𝑥 = 𝐴) ∧ (𝐴𝑥) ∈ suc 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴))
29 vex 3417 . . . . . . 7 𝑥 ∈ V
3029elpr 4420 . . . . . 6 (𝑥 ∈ {∅, 𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝐴))
3128, 30sylibr 226 . . . . 5 (((𝑥𝐴𝑥 = 𝐴) ∧ (𝐴𝑥) ∈ suc 𝐴) → 𝑥 ∈ {∅, 𝐴})
325, 8, 31syl2an 591 . . . 4 ((𝑥 ∈ suc 𝐴𝑥 ∈ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
334, 32sylbi 209 . . 3 (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
3433ssriv 3831 . 2 (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}
357isconn2 21588 . 2 (suc 𝐴 ∈ Conn ↔ (suc 𝐴 ∈ Top ∧ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}))
363, 34, 35mpbir2an 704 1 suc 𝐴 ∈ Conn
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 386  wo 880   = wceq 1658  wcel 2166  wne 2999  cdif 3795  cin 3797  wss 3798  c0 4144  {cpr 4399   cuni 4658  Oncon0 5963  suc csuc 5965  cfv 6123  Topctop 21068  Clsdccld 21191  Conncconn 21585
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127  ax-un 7209
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3or 1114  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-pss 3814  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-tp 4402  df-op 4404  df-uni 4659  df-br 4874  df-opab 4936  df-mpt 4953  df-tr 4976  df-id 5250  df-eprel 5255  df-po 5263  df-so 5264  df-fr 5301  df-we 5303  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-ord 5966  df-on 5967  df-suc 5969  df-iota 6086  df-fun 6125  df-fn 6126  df-fv 6131  df-topgen 16457  df-top 21069  df-bases 21121  df-cld 21194  df-conn 21586
This theorem is referenced by:  onsucconn  32970
  Copyright terms: Public domain W3C validator