Theorem conncn 23459

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 2737	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
4	2, 3	cnf 23279	. . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝐹:𝑋⟶∪ 𝐾)
6	5	ffnd 6745	. 2 ⊢ (𝜑 → 𝐹 Fn 𝑋)
7	5	frnd 6752	. . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ∪ 𝐾)
8		conncn.j	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Conn)
9		dffn4 6834	. . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
10	6, 9	sylib 218	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋–onto→ran 𝐹)
11		cntop2 23274	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
12	1, 11	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
13	3	restuni 23195	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
14	12, 7, 13	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
15		foeq3 6826	. . . . . 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 22949	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
19	12, 18	sylib 218	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
20		ssidd 4022	. . . . . 6 ⊢ (𝜑 → ran 𝐹 ⊆ ran 𝐹)
21		cnrest2 23319	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
22	19, 20, 7, 21	syl3anc 1372	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
23	1, 22	mpbid 232	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24		eqid 2737	. . . . 5 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
25	24	cnconn 23455	. . . 4 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Conn)
26	8, 17, 23, 25	syl3anc 1372	. . 3 ⊢ (𝜑 → (𝐾 ↾t ran 𝐹) ∈ Conn)
27		conncn.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝐾)
28		conncn.1	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈)
29		conncn.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
30		fnfvelrn 7107	. . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
31	6, 29, 30	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ran 𝐹)
32		inelcm 4474	. . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑈 ∧ (𝐹‘𝐴) ∈ ran 𝐹) → (𝑈 ∩ ran 𝐹) ≠ ∅)
33	28, 31, 32	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑈 ∩ ran 𝐹) ≠ ∅)
34		conncn.c	. . 3 ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾))
35	3, 7, 26, 27, 33, 34	connsubclo 23457	. 2 ⊢ (𝜑 → ran 𝐹 ⊆ 𝑈)
36		df-f 6573	. 2 ⊢ (𝐹:𝑋⟶𝑈 ↔ (𝐹 Fn 𝑋 ∧ ran 𝐹 ⊆ 𝑈))
37	6, 35, 36	sylanbrc 583	1 ⊢ (𝜑 → 𝐹:𝑋⟶𝑈)

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1539   ∈ wcel 2108   ≠ wne 2940   ∩ cin 3965   ⊆ wss 3966  ∅c0 4342  ∪ cuni 4915  ran crn 5694   Fn wfn 6564  ⟶wf 6565  –onto→wfo 6567  ‘cfv 6569  (class class class)co 7438   ↾_t crest 17476  Topctop 22924  TopOnctopon 22941  Clsdccld 23049   Cn ccn 23257  Conncconn 23444

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5288  ax-sep 5305  ax-nul 5315  ax-pow 5374  ax-pr 5441  ax-un 7761

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3483  df-sbc 3795  df-csb 3912  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-pss 3986  df-nul 4343  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-int 4955  df-iun 5001  df-br 5152  df-opab 5214  df-mpt 5235  df-tr 5269  df-id 5587  df-eprel 5593  df-po 5601  df-so 5602  df-fr 5645  df-we 5647  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-ord 6395  df-on 6396  df-lim 6397  df-suc 6398  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-f1 6574  df-fo 6575  df-f1o 6576  df-fv 6577  df-ov 7441  df-oprab 7442  df-mpo 7443  df-om 7895  df-1st 8022  df-2nd 8023  df-map 8876  df-en 8994  df-fin 8997  df-fi 9458  df-rest 17478  df-topgen 17499  df-top 22925  df-topon 22942  df-bases 22978  df-cld 23052  df-cn 23260  df-conn 23445

This theorem is referenced by:  pconnconn  35229  cvmliftmolem1  35279  cvmlift2lem9  35309  cvmlift3lem6  35322