Theorem rncmp 23694

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 488	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Comp)
2		eqid 2761	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
3		eqid 2761	. . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾
4	2, 3	cnf 23544	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
5	4	adantl 487	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶∪ 𝐾)
6	5	ffnd 6702	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 Fn ∪ 𝐽)
7		dffn4 6794	. . . 4 ⊢ (𝐹 Fn ∪ 𝐽 ↔ 𝐹:∪ 𝐽–onto→ran 𝐹)
8	6, 7	sylib 221	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽–onto→ran 𝐹)
9		cntop2 23539	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
10	9	adantl 487	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
11	5	frnd 6710	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ∪ 𝐾)
12	3	restuni 23460	. . . . 5 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
13	10, 11, 12	syl2anc 596	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹))
14		foeq3 6786	. . . 4 ⊢ (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:∪ 𝐽–onto→ran 𝐹 ↔ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹)))
15	13, 14	syl 18	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹:∪ 𝐽–onto→ran 𝐹 ↔ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹)))
16	8, 15	mpbid 235	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹))
17		simpr 490	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn 𝐾))
18		toptopon2 23216	. . . . 5 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
19	10, 18	sylib 221	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
20		ssidd 3954	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 ⊆ ran 𝐹)
21		cnrest2 23584	. . . 4 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
22	19, 20, 11, 21	syl3anc 1398	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))))
23	17, 22	mpbid 235	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))
24		eqid 2761	. . 3 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹)
25	24	cncmp 23690	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹:∪ 𝐽–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Comp)
26	1, 16, 23, 25	syl3anc 1398	1 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾 ↾t ran 𝐹) ∈ Comp)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  ∪ cuni 4867  ran crn 5652   Fn wfn 6526  ⟶wf 6527  –onto→wfo 6529  ‘cfv 6531  (class class class)co 7412   ↾_t crest 17571  Topctop 23191  TopOnctopon 23208   Cn ccn 23522  Compccmp 23684

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-1o 8460  df-map 8833  df-en 8958  df-dom 8959  df-fin 8961  df-fi 9387  df-rest 17573  df-topgen 17594  df-top 23192  df-topon 23209  df-bases 23244  df-cn 23525  df-cmp 23685

This theorem is used by:  imacmp  23695  kgencn2  23856  bndth  25259