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

Theorem rncmp 22547
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 483 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Comp)
2 eqid 2738 . . . . . . 7 𝐽 = 𝐽
3 eqid 2738 . . . . . . 7 𝐾 = 𝐾
42, 3cnf 22397 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽 𝐾)
54adantl 482 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽 𝐾)
65ffnd 6601 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 Fn 𝐽)
7 dffn4 6694 . . . 4 (𝐹 Fn 𝐽𝐹: 𝐽onto→ran 𝐹)
86, 7sylib 217 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽onto→ran 𝐹)
9 cntop2 22392 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
109adantl 482 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
115frnd 6608 . . . . 5 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 𝐾)
123restuni 22313 . . . . 5 ((𝐾 ∈ Top ∧ ran 𝐹 𝐾) → ran 𝐹 = (𝐾t ran 𝐹))
1310, 11, 12syl2anc 584 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 = (𝐾t ran 𝐹))
14 foeq3 6686 . . . 4 (ran 𝐹 = (𝐾t ran 𝐹) → (𝐹: 𝐽onto→ran 𝐹𝐹: 𝐽onto (𝐾t ran 𝐹)))
1513, 14syl 17 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹: 𝐽onto→ran 𝐹𝐹: 𝐽onto (𝐾t ran 𝐹)))
168, 15mpbid 231 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽onto (𝐾t ran 𝐹))
17 simpr 485 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn 𝐾))
18 toptopon2 22067 . . . . 5 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
1910, 18sylib 217 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘ 𝐾))
20 ssidd 3944 . . . 4 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ran 𝐹)
21 cnrest2 22437 . . . 4 ((𝐾 ∈ (TopOn‘ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))))
2219, 20, 11, 21syl3anc 1370 . . 3 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))))
2317, 22mpbid 231 . 2 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹)))
24 eqid 2738 . . 3 (𝐾t ran 𝐹) = (𝐾t ran 𝐹)
2524cncmp 22543 . 2 ((𝐽 ∈ Comp ∧ 𝐹: 𝐽onto (𝐾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾t ran 𝐹))) → (𝐾t ran 𝐹) ∈ Comp)
261, 16, 23, 25syl3anc 1370 1 ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾t ran 𝐹) ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wss 3887   cuni 4839  ran crn 5590   Fn wfn 6428  wf 6429  ontowfo 6431  cfv 6433  (class class class)co 7275  t crest 17131  Topctop 22042  TopOnctopon 22059   Cn ccn 22375  Compccmp 22537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-1o 8297  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-fin 8737  df-fi 9170  df-rest 17133  df-topgen 17154  df-top 22043  df-topon 22060  df-bases 22096  df-cn 22378  df-cmp 22538
This theorem is referenced by:  imacmp  22548  kgencn2  22708  bndth  24121
  Copyright terms: Public domain W3C validator