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 32767
 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 32763 . . 3 (𝐴 ∈ On → suc 𝐴 ∈ Top)
31, 2ax-mp 5 . 2 suc 𝐴 ∈ Top
4 elin 3945 . . . 4 (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ↔ (𝑥 ∈ suc 𝐴𝑥 ∈ (Clsd‘suc 𝐴)))
5 elsuci 5934 . . . . 5 (𝑥 ∈ suc 𝐴 → (𝑥𝐴𝑥 = 𝐴))
61onunisuci 5984 . . . . . . 7 suc 𝐴 = 𝐴
76eqcomi 2779 . . . . . 6 𝐴 = suc 𝐴
87cldopn 21055 . . . . 5 (𝑥 ∈ (Clsd‘suc 𝐴) → (𝐴𝑥) ∈ suc 𝐴)
91onsuci 7184 . . . . . . . . . 10 suc 𝐴 ∈ On
109oneli 5978 . . . . . . . . 9 ((𝐴𝑥) ∈ suc 𝐴 → (𝐴𝑥) ∈ On)
11 elndif 3883 . . . . . . . . . . . 12 (∅ ∈ 𝑥 → ¬ ∅ ∈ (𝐴𝑥))
12 on0eln0 5923 . . . . . . . . . . . . . 14 ((𝐴𝑥) ∈ On → (∅ ∈ (𝐴𝑥) ↔ (𝐴𝑥) ≠ ∅))
1312biimprd 238 . . . . . . . . . . . . 13 ((𝐴𝑥) ∈ On → ((𝐴𝑥) ≠ ∅ → ∅ ∈ (𝐴𝑥)))
1413necon1bd 2960 . . . . . . . . . . . 12 ((𝐴𝑥) ∈ On → (¬ ∅ ∈ (𝐴𝑥) → (𝐴𝑥) = ∅))
15 ssdif0 4087 . . . . . . . . . . . . 13 (𝐴𝑥 ↔ (𝐴𝑥) = ∅)
161onssneli 5980 . . . . . . . . . . . . 13 (𝐴𝑥 → ¬ 𝑥𝐴)
1715, 16sylbir 225 . . . . . . . . . . . 12 ((𝐴𝑥) = ∅ → ¬ 𝑥𝐴)
1811, 14, 17syl56 36 . . . . . . . . . . 11 ((𝐴𝑥) ∈ On → (∅ ∈ 𝑥 → ¬ 𝑥𝐴))
1918con2d 131 . . . . . . . . . 10 ((𝐴𝑥) ∈ On → (𝑥𝐴 → ¬ ∅ ∈ 𝑥))
201oneli 5978 . . . . . . . . . . . 12 (𝑥𝐴𝑥 ∈ On)
21 on0eln0 5923 . . . . . . . . . . . . 13 (𝑥 ∈ On → (∅ ∈ 𝑥𝑥 ≠ ∅))
2221biimprd 238 . . . . . . . . . . . 12 (𝑥 ∈ On → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
2320, 22syl 17 . . . . . . . . . . 11 (𝑥𝐴 → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
2423necon1bd 2960 . . . . . . . . . 10 (𝑥𝐴 → (¬ ∅ ∈ 𝑥𝑥 = ∅))
2519, 24sylcom 30 . . . . . . . . 9 ((𝐴𝑥) ∈ On → (𝑥𝐴𝑥 = ∅))
2610, 25syl 17 . . . . . . . 8 ((𝐴𝑥) ∈ suc 𝐴 → (𝑥𝐴𝑥 = ∅))
2726orim1d 946 . . . . . . 7 ((𝐴𝑥) ∈ suc 𝐴 → ((𝑥𝐴𝑥 = 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴)))
2827impcom 394 . . . . . 6 (((𝑥𝐴𝑥 = 𝐴) ∧ (𝐴𝑥) ∈ suc 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴))
29 vex 3352 . . . . . . 7 𝑥 ∈ V
3029elpr 4336 . . . . . 6 (𝑥 ∈ {∅, 𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝐴))
3128, 30sylibr 224 . . . . 5 (((𝑥𝐴𝑥 = 𝐴) ∧ (𝐴𝑥) ∈ suc 𝐴) → 𝑥 ∈ {∅, 𝐴})
325, 8, 31syl2an 575 . . . 4 ((𝑥 ∈ suc 𝐴𝑥 ∈ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
334, 32sylbi 207 . . 3 (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
3433ssriv 3754 . 2 (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}
357isconn2 21437 . 2 (suc 𝐴 ∈ Conn ↔ (suc 𝐴 ∈ Top ∧ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}))
363, 34, 35mpbir2an 682 1 suc 𝐴 ∈ Conn
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 382   ∨ wo 826   = wceq 1630   ∈ wcel 2144   ≠ wne 2942   ∖ cdif 3718   ∩ cin 3720   ⊆ wss 3721  ∅c0 4061  {cpr 4316  ∪ cuni 4572  Oncon0 5866  suc csuc 5868  ‘cfv 6031  Topctop 20917  Clsdccld 21040  Conncconn 21434 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3or 1071  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-sbc 3586  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-pss 3737  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-tp 4319  df-op 4321  df-uni 4573  df-br 4785  df-opab 4845  df-mpt 4862  df-tr 4885  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-ord 5869  df-on 5870  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-fv 6039  df-topgen 16311  df-top 20918  df-bases 20970  df-cld 21043  df-conn 21435 This theorem is referenced by:  onsucconn  32768
 Copyright terms: Public domain W3C validator