Theorem rncmp 23436

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

Step	Hyp	Ref	Expression
1		simpl 486	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Comp)
2		eqid 2761	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
3		eqid 2761	. . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾
4	2, 3	cnf 23286	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
5	4	adantl 485	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶∪ 𝐾)
6	5	ffnd 6688	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 Fn ∪ 𝐽)
7		dffn4 6780	. . . 4 ⊢ (𝐹 Fn ∪ 𝐽 ↔ 𝐹:∪ 𝐽–onto→ran 𝐹)
8	6, 7	sylib 220	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽–onto→ran 𝐹)
9		cntop2 23281	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
10	9	adantl 485	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
11	5	frnd 6696	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ∪ 𝐾)
12	3	restuni 23202	. . . . 5 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
13	10, 11, 12	syl2anc 593	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
14		foeq3 6772	. . . 4 ⊢ (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:∪ 𝐽–onto→ran 𝐹 ↔ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹)))
15	13, 14	syl 17	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹:∪ 𝐽–onto→ran 𝐹 ↔ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹)))
16	8, 15	mpbid 234	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹))
17		simpr 488	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn 𝐾))
18		toptopon2 22958	. . . . 5 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
19	10, 18	sylib 220	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
20		ssidd 3959	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ran 𝐹)
21		cnrest2 23326	. . . 4 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
22	19, 20, 11, 21	syl3anc 1389	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
23	17, 22	mpbid 234	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24		eqid 2761	. . 3 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
25	24	cncmp 23432	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Comp)
26	1, 16, 23, 25	syl3anc 1389	1 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾 ↾t ran 𝐹) ∈ Comp)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141   ⊆ wss 3904  ∪ cuni 4864  ran crn 5646   Fn wfn 6512  ⟶wf 6513  –onto→wfo 6515  ‘cfv 6517  (class class class)co 7392   ↾_t crest 17432  Topctop 22933  TopOnctopon 22950   Cn ccn 23264  Compccmp 23426

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-om 7843  df-1st 7966  df-2nd 7967  df-1o 8432  df-map 8805  df-en 8924  df-dom 8925  df-fin 8927  df-fi 9354  df-rest 17434  df-topgen 17455  df-top 22934  df-topon 22951  df-bases 22986  df-cn 23267  df-cmp 23427

This theorem is referenced by:  imacmp  23437  kgencn2  23597  bndth  25000