Theorem onsucconni 37005

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 37001	. . 3 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ Top)
3	1, 2	ax-mp 5	. 2 ⊢ suc 𝐴 ∈ Top
4		elin 3922	. . . 4 ⊢ (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ↔ (𝑥 ∈ suc 𝐴 ∧ 𝑥 ∈ (Clsd‘suc 𝐴)))
5		elsuci 6434	. . . . 5 ⊢ (𝑥 ∈ suc 𝐴 → (𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴))
6	1	onunisuci 6486	. . . . . . 7 ⊢ ∪ suc 𝐴 = 𝐴
7	6	eqcomi 2774	. . . . . 6 ⊢ 𝐴 = ∪ suc 𝐴
8	7	cldopn 23238	. . . . 5 ⊢ (𝑥 ∈ (Clsd‘suc 𝐴) → (𝐴 ∖ 𝑥) ∈ suc 𝐴)
9	1	onsuci 7841	. . . . . . . . . 10 ⊢ suc 𝐴 ∈ On
10	9	oneli 6480	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → (𝐴 ∖ 𝑥) ∈ On)
11		elndif 4087	. . . . . . . . . . . 12 ⊢ (∅ ∈ 𝑥 → ¬ ∅ ∈ (𝐴 ∖ 𝑥))
12		on0eln0 6422	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (∅ ∈ (𝐴 ∖ 𝑥) ↔ (𝐴 ∖ 𝑥) ≠ ∅))
13	12	biimprd 251	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∖ 𝑥) ∈ On → ((𝐴 ∖ 𝑥) ≠ ∅ → ∅ ∈ (𝐴 ∖ 𝑥)))
14	13	necon1bd 2978	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (¬ ∅ ∈ (𝐴 ∖ 𝑥) → (𝐴 ∖ 𝑥) = ∅))
15		ssdif0 4321	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑥 ↔ (𝐴 ∖ 𝑥) = ∅)
16	1	onssneli 6482	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑥 → ¬ 𝑥 ∈ 𝐴)
17	15, 16	sylbir 238	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑥) = ∅ → ¬ 𝑥 ∈ 𝐴)
18	11, 14, 17	syl56 37	. . . . . . . . . . 11 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (∅ ∈ 𝑥 → ¬ 𝑥 ∈ 𝐴))
19	18	con2d 135	. . . . . . . . . 10 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (𝑥 ∈ 𝐴 → ¬ ∅ ∈ 𝑥))
20	1	oneli 6480	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ On)
21		on0eln0 6422	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (∅ ∈ 𝑥 ↔ 𝑥 ≠ ∅))
22	21	biimprd 251	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
23	20, 22	syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ≠ ∅ → ∅ ∈ 𝑥))
24	23	necon1bd 2978	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (¬ ∅ ∈ 𝑥 → 𝑥 = ∅))
25	19, 24	sylcom 31	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑥) ∈ On → (𝑥 ∈ 𝐴 → 𝑥 = ∅))
26	10, 25	syl 18	. . . . . . . 8 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 = ∅))
27	26	orim1d 981	. . . . . . 7 ⊢ ((𝐴 ∖ 𝑥) ∈ suc 𝐴 → ((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴)))
28	27	impcom 413	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) ∧ (𝐴 ∖ 𝑥) ∈ suc 𝐴) → (𝑥 = ∅ ∨ 𝑥 = 𝐴))
29		vex 3461	. . . . . . 7 ⊢ 𝑥 ∈ V
30	29	elpr 4616	. . . . . 6 ⊢ (𝑥 ∈ {∅, 𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝐴))
31	28, 30	sylibr 237	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 = 𝐴) ∧ (𝐴 ∖ 𝑥) ∈ suc 𝐴) → 𝑥 ∈ {∅, 𝐴})
32	5, 8, 31	syl2an 608	. . . 4 ⊢ ((𝑥 ∈ suc 𝐴 ∧ 𝑥 ∈ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
33	4, 32	sylbi 220	. . 3 ⊢ (𝑥 ∈ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) → 𝑥 ∈ {∅, 𝐴})
34	33	ssriv 3942	. 2 ⊢ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}
35	7	isconn2 23621	. 2 ⊢ (suc 𝐴 ∈ Conn ↔ (suc 𝐴 ∈ Top ∧ (suc 𝐴 ∩ (Clsd‘suc 𝐴)) ⊆ {∅, 𝐴}))
36	3, 34, 35	mpbir2an 724	1 ⊢ suc 𝐴 ∈ Conn

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2146   ≠ wne 2960   ∖ cdif 3903   ∩ cin 3905   ⊆ wss 3906  ∅c0 4286  {cpr 4593  ∪ cuni 4874  Oncon0 6364  suc csuc 6366  ‘cfv 6540  Topctop 23100  Clsdccld 23223  Conncconn 23618

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548  df-topgen 17518  df-top 23101  df-bases 23153  df-cld 23226  df-conn 23619

This theorem is used by:  onsucconn  37006