Theorem onsucconni 34553

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.

Step	Hyp	Ref	Expression
1		onsucconni.1	. . 3 ⊢ 𝐴 ∈ On
2		onsuctop 34549	. . 3 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ Top)
3	1, 2	ax-mp 5	. 2 ⊢ suc 𝐴 ∈ Top
4		elin 3899	. . . 4 ⊢ (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ↔ (𝑥 ∈ suc 𝐴 ∧ 𝑥 ∈ (Clsd‘suc 𝐴)))
5		elsuci 6317	. . . . 5 ⊢ (𝑥 ∈ suc 𝐴 → (𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴))
6	1	onunisuci 6365	. . . . . . 7 ⊢ ∪ suc 𝐴 = 𝐴
7	6	eqcomi 2747	. . . . . 6 ⊢ 𝐴 = ∪ suc 𝐴
8	7	cldopn 22090	. . . . 5 ⊢ (𝑥 ∈ (Clsd‘suc 𝐴) → (𝐴 ∖ 𝑥) ∈ suc 𝐴)
9	1	onsuci 7660	. . . . . . . . . 10 ⊢ suc 𝐴 ∈ On
10	9	oneli 6359	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → (𝐴 ∖ 𝑥) ∈ On)
11		elndif 4059	. . . . . . . . . . . 12 ⊢ (∅ ∈ 𝑥 → ¬ ∅ ∈ (𝐴 ∖ 𝑥))
12		on0eln0 6306	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (∅ ∈ (𝐴 ∖ 𝑥) ↔ (𝐴 ∖ 𝑥) ≠ ∅))
13	12	biimprd 247	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ 𝑥) ∈ On → ((𝐴 ∖ 𝑥) ≠ ∅ → ∅ ∈ (𝐴 ∖ 𝑥)))
14	13	necon1bd 2960	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (¬ ∅ ∈ (𝐴 ∖ 𝑥) → (𝐴 ∖ 𝑥) = ∅))
15		ssdif0 4294	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑥 ↔ (𝐴 ∖ 𝑥) = ∅)
16	1	onssneli 6361	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑥 → ¬ 𝑥 ∈ 𝐴)
17	15, 16	sylbir 234	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑥) = ∅ → ¬ 𝑥 ∈ 𝐴)
18	11, 14, 17	syl56 36	. . . . . . . . . . 11 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (∅ ∈ 𝑥 → ¬ 𝑥 ∈ 𝐴))
19	18	con2d 134	. . . . . . . . . 10 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (𝑥 ∈ 𝐴 → ¬ ∅ ∈ 𝑥))
20	1	oneli 6359	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On)
21		on0eln0 6306	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (∅ ∈ 𝑥 ↔ 𝑥 ≠ ∅))
22	21	biimprd 247	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
23	20, 22	syl 17	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
24	23	necon1bd 2960	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (¬ ∅ ∈ 𝑥 → 𝑥 = ∅))
25	19, 24	sylcom 30	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (𝑥 ∈ 𝐴 → 𝑥 = ∅))
26	10, 25	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 = ∅))
27	26	orim1d 962	. . . . . . 7 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → ((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴)))
28	27	impcom 407	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) ∧ (𝐴 ∖ 𝑥) ∈ suc 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴))
29		vex 3426	. . . . . . 7 ⊢ 𝑥 ∈ V
30	29	elpr 4581	. . . . . 6 ⊢ (𝑥 ∈ {∅, 𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝐴))
31	28, 30	sylibr 233	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) ∧ (𝐴 ∖ 𝑥) ∈ suc 𝐴) → 𝑥 ∈ {∅, 𝐴})
32	5, 8, 31	syl2an 595	. . . 4 ⊢ ((𝑥 ∈ suc 𝐴 ∧ 𝑥 ∈ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
33	4, 32	sylbi 216	. . 3 ⊢ (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
34	33	ssriv 3921	. 2 ⊢ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}
35	7	isconn2 22473	. 2 ⊢ (suc 𝐴 ∈ Conn ↔ (suc 𝐴 ∈ Top ∧ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}))
36	3, 34, 35	mpbir2an 707	1 ⊢ suc 𝐴 ∈ Conn

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 843   = wceq 1539   ∈ wcel 2108   ≠ wne 2942   ∖ cdif 3880   ∩ cin 3882   ⊆ wss 3883  ∅c0 4253  {cpr 4560  ∪ cuni 4836  Oncon0 6251  suc csuc 6253  ‘cfv 6418  Topctop 21950  Clsdccld 22075  Conncconn 22470

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-topgen 17071  df-top 21951  df-bases 22004  df-cld 22078  df-conn 22471

This theorem is referenced by:  onsucconn  34554