MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  conncn Structured version   Visualization version   GIF version

Theorem conncn 23751
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
StepHypRef Expression
1 conncn.f . . . 4 (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
2 conncn.x . . . . 5 𝑋 = ∪ 𝐽
3 eqid 2760 . . . . 5 ∪ 𝐾 = ∪ 𝐾
42, 3cnf 23571 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
51, 4syl 18 . . 3 (𝜑 → 𝐹:𝑋⟶∪ 𝐾)
65ffnd 6713 . 2 (𝜑 → 𝐹 Fn 𝑋)
75frnd 6721 . . 3 (𝜑 → ran 𝐹 ⊆ ∪ 𝐾)
8 conncn.j . . . 4 (𝜑 → 𝐽 ∈ Conn)
9 dffn4 6805 . . . . . 6 (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
106, 9sylib 221 . . . . 5 (𝜑 → 𝐹:𝑋–onto→ran 𝐹)
11 cntop2 23566 . . . . . . . 8 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
121, 11syl 18 . . . . . . 7 (𝜑 → 𝐾 ∈ Top)
133restuni 23487 . . . . . . 7 ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
1412, 7, 13syl2anc 596 . . . . . 6 (𝜑 → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
15 foeq3 6797 . . . . . 6 (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
1614, 15syl 18 . . . . 5 (𝜑 → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)))
1710, 16mpbid 235 . . . 4 (𝜑 → 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹))
18 toptopon2 23243 . . . . . . 7 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
1912, 18sylib 221 . . . . . 6 (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
20 ssidd 3932 . . . . . 6 (𝜑 → ran 𝐹 ⊆ ran 𝐹)
21 cnrest2 23611 . . . . . 6 ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
2219, 20, 7, 21syl3anc 1398 . . . . 5 (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
231, 22mpbid 235 . . . 4 (𝜑 → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24 eqid 2760 . . . . 5 ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
2524cnconn 23747 . . . 4 ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Conn)
268, 17, 23, 25syl3anc 1398 . . 3 (𝜑 → (𝐾 ↾t ran 𝐹) ∈ Conn)
27 conncn.u . . 3 (𝜑 → 𝑈 ∈ 𝐾)
28 conncn.1 . . . 4 (𝜑 → (𝐹‘𝐴) ∈ 𝑈)
29 conncn.a . . . . 5 (𝜑 → 𝐴 ∈ 𝑋)
30 fnfvelrn 7083 . . . . 5 ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹)
316, 29, 30syl2anc 596 . . . 4 (𝜑 → (𝐹‘𝐴) ∈ ran 𝐹)
32 inelcm 4417 . . . 4 (((𝐹‘𝐴) ∈ 𝑈 ∧ (𝐹‘𝐴) ∈ ran 𝐹) → (𝑈 ∩ ran 𝐹) ≠ ∅)
3328, 31, 32syl2anc 596 . . 3 (𝜑 → (𝑈 ∩ ran 𝐹) ≠ ∅)
34 conncn.c . . 3 (𝜑 → 𝑈 ∈ (Clsd‘𝐾))
353, 7, 26, 27, 33, 34connsubclo 23749 . 2 (𝜑 → ran 𝐹 ⊆ 𝑈)
36 df-f 6545 . 2 (𝐹:𝑋⟶𝑈 ↔ (𝐹 Fn 𝑋 ∧ ran 𝐹 ⊆ 𝑈))
376, 35, 36sylanbrc 595 1 (𝜑 → 𝐹:𝑋⟶𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3896   ∩ cin 4088  ∅c0 4277  ∪ cuni 4866  ran crn 5651   Fn wfn 6536  ⟶wf 6537  –onto→wfo 6539  ‘cfv 6541  (class class class)co 7422   ↾t crest 17598  Topctop 23218  TopOnctopon 23235  Clsdccld 23341   Cn ccn 23549  Conncconn 23736
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-om 7880  df-1st 8003  df-2nd 8004  df-map 8854  df-en 8979  df-fin 8982  df-fi 9408  df-rest 17600  df-topgen 17621  df-top 23219  df-topon 23236  df-bases 23271  df-cld 23344  df-cn 23552  df-conn 23737
This theorem is used by:  pconnconn  36084  cvmliftmolem1  36134  cvmlift2lem9  36164  cvmlift3lem6  36177
  Copyright terms: Public domain W3C validator