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

Theorem rncmp 21998
Description: The image of a compact set under a continuous function is compact. (Contributed by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
rncmp ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾t ran 𝐹) ∈ Comp)

Proof of Theorem rncmp
StepHypRef Expression
1 simpl 485 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Comp)
2 eqid 2821 . . . . . . 7 𝐽 = 𝐽
3 eqid 2821 . . . . . . 7 𝐾 = 𝐾
42, 3cnf 21848 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽 𝐾)
54adantl 484 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽 𝐾)
65ffnd 6509 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 Fn 𝐽)
7 dffn4 6590 . . . 4 (𝐹 Fn 𝐽𝐹: 𝐽onto→ran 𝐹)
86, 7sylib 220 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽onto→ran 𝐹)
9 cntop2 21843 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
109adantl 484 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
115frnd 6515 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 𝐾)
123restuni 21764 . . . . 5 ((𝐾 ∈ Top ∧ ran 𝐹 𝐾) → ran 𝐹 = (𝐾t ran 𝐹))
1310, 11, 12syl2anc 586 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 = (𝐾t ran 𝐹))
14 foeq3 6582 . . . 4 (ran 𝐹 = (𝐾t ran 𝐹) → (𝐹: 𝐽onto→ran 𝐹𝐹: 𝐽onto (𝐾t ran 𝐹)))
1513, 14syl 17 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹: 𝐽onto→ran 𝐹𝐹: 𝐽onto (𝐾t ran 𝐹)))
168, 15mpbid 234 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽onto (𝐾t ran 𝐹))
17 simpr 487 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn 𝐾))
18 toptopon2 21520 . . . . 5 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
1910, 18sylib 220 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘ 𝐾))
20 ssidd 3989 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ran 𝐹)
21 cnrest2 21888 . . . 4 ((𝐾 ∈ (TopOn‘ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))))
2219, 20, 11, 21syl3anc 1367 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))))
2317, 22mpbid 234 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹)))
24 eqid 2821 . . 3 (𝐾t ran 𝐹) = (𝐾t ran 𝐹)
2524cncmp 21994 . 2 ((𝐽 ∈ Comp ∧ 𝐹: 𝐽onto (𝐾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))) → (𝐾t ran 𝐹) ∈ Comp)
261, 16, 23, 25syl3anc 1367 1 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾t ran 𝐹) ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  wss 3935   cuni 4831  ran crn 5550   Fn wfn 6344  wf 6345  ontowfo 6347  cfv 6349  (class class class)co 7150  t crest 16688  Topctop 21495  TopOnctopon 21512   Cn ccn 21826  Compccmp 21988
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-en 8504  df-dom 8505  df-fin 8507  df-fi 8869  df-rest 16690  df-topgen 16711  df-top 21496  df-topon 21513  df-bases 21548  df-cn 21829  df-cmp 21989
This theorem is referenced by:  imacmp  21999  kgencn2  22159  bndth  23556
  Copyright terms: Public domain W3C validator