Theorem conncn 23633

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 2765	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
4	2, 3	cnf 23453	. . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
5	1, 4	syl 18	. . 3 ⊢ (𝜑 → 𝐹:𝑋⟶∪ 𝐾)
6	5	ffnd 6710	. 2 ⊢ (𝜑 → 𝐹 Fn 𝑋)
7	5	frnd 6718	. . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ∪ 𝐾)
8		conncn.j	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Conn)
9		dffn4 6802	. . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
10	6, 9	sylib 221	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋–onto→ran 𝐹)
11		cntop2 23448	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
12	1, 11	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
13	3	restuni 23369	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
14	12, 7, 13	syl2anc 596	. . . . . 6 ⊢ (𝜑 → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
15		foeq3 6794	. . . . . 6 ⊢ (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
16	14, 15	syl 18	. . . . 5 ⊢ (𝜑 → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
17	10, 16	mpbid 235	. . . 4 ⊢ (𝜑 → 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹))
18		toptopon2 23125	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
19	12, 18	sylib 221	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
20		ssidd 3961	. . . . . 6 ⊢ (𝜑 → ran 𝐹 ⊆ ran 𝐹)
21		cnrest2 23493	. . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
22	19, 20, 7, 21	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
23	1, 22	mpbid 235	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24		eqid 2765	. . . . 5 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
25	24	cnconn 23629	. . . 4 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Conn)
26	8, 17, 23, 25	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝐾 ↾t ran 𝐹) ∈ Conn)
27		conncn.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝐾)
28		conncn.1	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈)
29		conncn.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
30		fnfvelrn 7079	. . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
31	6, 29, 30	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ran 𝐹)
32		inelcm 4425	. . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑈 ∧ (𝐹‘𝐴) ∈ ran 𝐹) → (𝑈 ∩ ran 𝐹) ≠ ∅)
33	28, 31, 32	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑈 ∩ ran 𝐹) ≠ ∅)
34		conncn.c	. . 3 ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾))
35	3, 7, 26, 27, 33, 34	connsubclo 23631	. 2 ⊢ (𝜑 → ran 𝐹 ⊆ 𝑈)
36		df-f 6544	. 2 ⊢ (𝐹:𝑋⟶𝑈 ↔ (𝐹 Fn 𝑋 ∧ ran 𝐹 ⊆ 𝑈))
37	6, 35, 36	sylanbrc 595	1 ⊢ (𝜑 → 𝐹:𝑋⟶𝑈)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146   ≠ wne 2960   ∩ cin 3905   ⊆ wss 3906  ∅c0 4286  ∪ cuni 4874  ran crn 5664   Fn wfn 6535  ⟶wf 6536  –onto→wfo 6538  ‘cfv 6540  (class class class)co 7419   ↾_t crest 17495  Topctop 23100  TopOnctopon 23117  Clsdccld 23223   Cn ccn 23431  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-rep 5240  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-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  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-int 4915  df-iun 4960  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-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-map 8832  df-en 8950  df-fin 8953  df-fi 9378  df-rest 17497  df-topgen 17518  df-top 23101  df-topon 23118  df-bases 23153  df-cld 23226  df-cn 23434  df-conn 23619

This theorem is used by:  pconnconn  35760  cvmliftmolem1  35810  cvmlift2lem9  35840  cvmlift3lem6  35853