Theorem connima 22576

Description: The image of a connected set is connected. (Contributed by Mario Carneiro, 7-Jul-2015.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypotheses

Ref	Expression
connima.x	⊢ 𝑋 = ∪ 𝐽
connima.f	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
connima.a	⊢ (𝜑 → 𝐴 ⊆ 𝑋)
connima.c	⊢ (𝜑 → (𝐽 ↾t 𝐴) ∈ Conn)

Assertion

Ref	Expression
connima	⊢ (𝜑 → (𝐾 ↾t (𝐹 “ 𝐴)) ∈ Conn)

Proof of Theorem connima

Step	Hyp	Ref	Expression
1		connima.c	. 2 ⊢ (𝜑 → (𝐽 ↾t 𝐴) ∈ Conn)
2		connima.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
3		connima.x	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
4		eqid 2738	. . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾
5	3, 4	cnf 22397	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
6	2, 5	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶∪ 𝐾)
7	6	ffund 6604	. . . 4 ⊢ (𝜑 → Fun 𝐹)
8		connima.a	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝑋)
9	6	fdmd 6611	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝑋)
10	8, 9	sseqtrrd 3962	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ dom 𝐹)
11		fores 6698	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴))
12	7, 10, 11	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴))
13		cntop2 22392	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
14	2, 13	syl 17	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ Top)
15		imassrn 5980	. . . . . 6 ⊢ (𝐹 “ 𝐴) ⊆ ran 𝐹
16	6	frnd 6608	. . . . . 6 ⊢ (𝜑 → ran 𝐹 ⊆ ∪ 𝐾)
17	15, 16	sstrid 3932	. . . . 5 ⊢ (𝜑 → (𝐹 “ 𝐴) ⊆ ∪ 𝐾)
18	4	restuni 22313	. . . . 5 ⊢ ((𝐾 ∈ Top ∧ (𝐹 “ 𝐴) ⊆ ∪ 𝐾) → (𝐹 “ 𝐴) = ∪ (𝐾 ↾t (𝐹 “ 𝐴)))
19	14, 17, 18	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐹 “ 𝐴) = ∪ (𝐾 ↾t (𝐹 “ 𝐴)))
20		foeq3 6686	. . . 4 ⊢ ((𝐹 “ 𝐴) = ∪ (𝐾 ↾t (𝐹 “ 𝐴)) → ((𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–onto→∪ (𝐾 ↾t (𝐹 “ 𝐴))))
21	19, 20	syl 17	. . 3 ⊢ (𝜑 → ((𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–onto→∪ (𝐾 ↾t (𝐹 “ 𝐴))))
22	12, 21	mpbid 231	. 2 ⊢ (𝜑 → (𝐹 ↾ 𝐴):𝐴–onto→∪ (𝐾 ↾t (𝐹 “ 𝐴)))
23	3	cnrest 22436	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ⊆ 𝑋) → (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn 𝐾))
24	2, 8, 23	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn 𝐾))
25		toptopon2 22067	. . . . 5 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
26	14, 25	sylib 217	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
27		df-ima 5602	. . . . 5 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
28		eqimss2 3978	. . . . 5 ⊢ ((𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴) → ran (𝐹 ↾ 𝐴) ⊆ (𝐹 “ 𝐴))
29	27, 28	mp1i 13	. . . 4 ⊢ (𝜑 → ran (𝐹 ↾ 𝐴) ⊆ (𝐹 “ 𝐴))
30		cnrest2 22437	. . . 4 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran (𝐹 ↾ 𝐴) ⊆ (𝐹 “ 𝐴) ∧ (𝐹 “ 𝐴) ⊆ ∪ 𝐾) → ((𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn 𝐾) ↔ (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn (𝐾 ↾t (𝐹 “ 𝐴)))))
31	26, 29, 17, 30	syl3anc 1370	. . 3 ⊢ (𝜑 → ((𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn 𝐾) ↔ (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn (𝐾 ↾t (𝐹 “ 𝐴)))))
32	24, 31	mpbid 231	. 2 ⊢ (𝜑 → (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn (𝐾 ↾t (𝐹 “ 𝐴))))
33		eqid 2738	. . 3 ⊢ ∪ (𝐾 ↾t (𝐹 “ 𝐴)) = ∪ (𝐾 ↾t (𝐹 “ 𝐴))
34	33	cnconn 22573	. 2 ⊢ (((𝐽 ↾t 𝐴) ∈ Conn ∧ (𝐹 ↾ 𝐴):𝐴–onto→∪ (𝐾 ↾t (𝐹 “ 𝐴)) ∧ (𝐹 ↾ 𝐴) ∈ ((𝐽 ↾t 𝐴) Cn (𝐾 ↾t (𝐹 “ 𝐴)))) → (𝐾 ↾t (𝐹 “ 𝐴)) ∈ Conn)
35	1, 22, 32, 34	syl3anc 1370	1 ⊢ (𝜑 → (𝐾 ↾t (𝐹 “ 𝐴)) ∈ Conn)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2106   ⊆ wss 3887  ∪ cuni 4839  dom cdm 5589  ran crn 5590   ↾ cres 5591   “ cima 5592  Fun wfun 6427  ⟶wf 6429  –onto→wfo 6431  ‘cfv 6433  (class class class)co 7275   ↾_t crest 17131  Topctop 22042  TopOnctopon 22059   Cn ccn 22375  Conncconn 22562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-map 8617  df-en 8734  df-fin 8737  df-fi 9170  df-rest 17133  df-topgen 17154  df-top 22043  df-topon 22060  df-bases 22096  df-cld 22170  df-cn 22378  df-conn 22563

This theorem is referenced by:  tgpconncompeqg  23263  tgpconncomp  23264