Theorem conncn 23329

Description: A continuous function from a connected topology with one point in a clopen set must lie entirely within the set. (Contributed by Mario Carneiro, 16-Feb-2015.)

Hypotheses

Ref	Expression
conncn.x	⊢ 𝑋 = ∪ 𝐽
conncn.j	⊢ (𝜑 → 𝐽 ∈ Conn)
conncn.f	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
conncn.u	⊢ (𝜑 → 𝑈 ∈ 𝐾)
conncn.c	⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾))
conncn.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
conncn.1	⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈)

Assertion

Ref	Expression
conncn	⊢ (𝜑 → 𝐹:𝑋⟶𝑈)

Proof of Theorem conncn

Step	Hyp	Ref	Expression
1		conncn.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
2		conncn.x	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3		eqid 2729	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
4	2, 3	cnf 23149	. . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝐹:𝑋⟶∪ 𝐾)
6	5	ffnd 6657	. 2 ⊢ (𝜑 → 𝐹 Fn 𝑋)
7	5	frnd 6664	. . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ∪ 𝐾)
8		conncn.j	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Conn)
9		dffn4 6746	. . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
10	6, 9	sylib 218	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋–onto→ran 𝐹)
11		cntop2 23144	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
12	1, 11	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
13	3	restuni 23065	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
14	12, 7, 13	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
15		foeq3 6738	. . . . . 6 ⊢ (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
16	14, 15	syl 17	. . . . 5 ⊢ (𝜑 → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
17	10, 16	mpbid 232	. . . 4 ⊢ (𝜑 → 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹))
18		toptopon2 22821	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
19	12, 18	sylib 218	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
20		ssidd 3961	. . . . . 6 ⊢ (𝜑 → ran 𝐹 ⊆ ran 𝐹)
21		cnrest2 23189	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
22	19, 20, 7, 21	syl3anc 1373	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
23	1, 22	mpbid 232	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24		eqid 2729	. . . . 5 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
25	24	cnconn 23325	. . . 4 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Conn)
26	8, 17, 23, 25	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝐾 ↾t ran 𝐹) ∈ Conn)
27		conncn.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝐾)
28		conncn.1	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈)
29		conncn.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
30		fnfvelrn 7018	. . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
31	6, 29, 30	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ran 𝐹)
32		inelcm 4418	. . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑈 ∧ (𝐹‘𝐴) ∈ ran 𝐹) → (𝑈 ∩ ran 𝐹) ≠ ∅)
33	28, 31, 32	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑈 ∩ ran 𝐹) ≠ ∅)
34		conncn.c	. . 3 ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾))
35	3, 7, 26, 27, 33, 34	connsubclo 23327	. 2 ⊢ (𝜑 → ran 𝐹 ⊆ 𝑈)
36		df-f 6490	. 2 ⊢ (𝐹:𝑋⟶𝑈 ↔ (𝐹 Fn 𝑋 ∧ ran 𝐹 ⊆ 𝑈))
37	6, 35, 36	sylanbrc 583	1 ⊢ (𝜑 → 𝐹:𝑋⟶𝑈)

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1540   ∈ wcel 2109   ≠ wne 2925   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  ∪ cuni 4861  ran crn 5624   Fn wfn 6481  ⟶wf 6482  –onto→wfo 6484  ‘cfv 6486  (class class class)co 7353   ↾_t crest 17342  Topctop 22796  TopOnctopon 22813  Clsdccld 22919   Cn ccn 23127  Conncconn 23314

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-map 8762  df-en 8880  df-fin 8883  df-fi 9320  df-rest 17344  df-topgen 17365  df-top 22797  df-topon 22814  df-bases 22849  df-cld 22922  df-cn 23130  df-conn 23315

This theorem is referenced by:  pconnconn  35206  cvmliftmolem1  35256  cvmlift2lem9  35286  cvmlift3lem6  35299