Theorem conncompconn 23570

Description: The connected component containing 𝐴 is connected. (Contributed by Mario Carneiro, 19-Mar-2015.)

Hypothesis

Ref	Expression
conncomp.2	⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}

Assertion

Ref	Expression
conncompconn	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t 𝑆) ∈ Conn)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐽   𝑥,𝑋

Allowed substitution hint:   𝑆(𝑥)

Proof of Theorem conncompconn

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		conncomp.2	. . . 4 ⊢ 𝑆 = ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}
2		uniiun 5024	. . . 4 ⊢ ∪ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} = ∪ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}𝑦
3	1, 2	eqtri 2786	. . 3 ⊢ 𝑆 = ∪ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}𝑦
4	3	oveq2i 7423	. 2 ⊢ (𝐽 ↾t 𝑆) = (𝐽 ↾t ∪ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}𝑦)
5		simpl 487	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
6		eleq2w 2847	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑦))
7		oveq2 7420	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐽 ↾t 𝑥) = (𝐽 ↾t 𝑦))
8	7	eleq1d 2848	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝐽 ↾t 𝑥) ∈ Conn ↔ (𝐽 ↾t 𝑦) ∈ Conn))
9	6, 8	anbi12d 643	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn) ↔ (𝐴 ∈ 𝑦 ∧ (𝐽 ↾t 𝑦) ∈ Conn)))
10	9	elrab 3651	. . . . . 6 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)} ↔ (𝑦 ∈ 𝒫 𝑋 ∧ (𝐴 ∈ 𝑦 ∧ (𝐽 ↾t 𝑦) ∈ Conn)))
11	10	bilani 509	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → (𝑦 ∈ 𝒫 𝑋 ∧ (𝐴 ∈ 𝑦 ∧ (𝐽 ↾t 𝑦) ∈ Conn)))
12	11	simpld 499	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → 𝑦 ∈ 𝒫 𝑋)
13	12	elpwid 4572	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → 𝑦 ⊆ 𝑋)
14	11	simprd 500	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → (𝐴 ∈ 𝑦 ∧ (𝐽 ↾t 𝑦) ∈ Conn))
15	14	simpld 499	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → 𝐴 ∈ 𝑦)
16	14	simprd 500	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}) → (𝐽 ↾t 𝑦) ∈ Conn)
17	5, 13, 15, 16	iunconn 23566	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t ∪ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ (𝐽 ↾t 𝑥) ∈ Conn)}𝑦) ∈ Conn)
18	4, 17	eqeltrid 2867	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐽 ↾t 𝑆) ∈ Conn)

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {crab 3416  𝒫 cpw 4563  ∪ cuni 4873  ∪ ciun 4957  ‘cfv 6538  (class class class)co 7412   ↾_t crest 17474  TopOnctopon 23048  Conncconn 23549

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  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-rn 5674  df-res 5675  df-ima 5676  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-en 8945  df-fin 8948  df-fi 9372  df-rest 17476  df-topgen 17497  df-top 23032  df-topon 23049  df-bases 23084  df-cld 23157  df-conn 23550

This theorem is referenced by:  conncompcld  23572  conncompclo  23573  tgpconncompeqg  24250  tgpconncomp  24251