| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cncfmptss | Structured version Visualization version GIF version | ||
| Description: A continuous complex function restricted to a subset is continuous, using maps-to notation. (Contributed by Glauco Siliprandi, 29-Jun-2017.) |
| Ref | Expression |
|---|---|
| cncfmptss.1 | ⊢ Ⅎ𝑥𝐹 |
| cncfmptss.2 | ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) |
| cncfmptss.3 | ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
| Ref | Expression |
|---|---|
| cncfmptss | ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cncfmptss.3 | . . . 4 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 2 | 1 | resmptd 6044 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 3 | cncfmptss.2 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
| 4 | cncff 25244 | . . . . . 6 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐹:𝐴⟶𝐵) | |
| 5 | 3, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| 6 | 5 | feqmptd 6976 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦))) |
| 7 | 6 | reseq1d 5980 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶)) |
| 8 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑦𝐹 | |
| 9 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑦𝑥 | |
| 10 | 8, 9 | nffv 6918 | . . . . 5 ⊢ Ⅎ𝑦(𝐹‘𝑥) |
| 11 | cncfmptss.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
| 12 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
| 13 | 11, 12 | nffv 6918 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 14 | fveq2 6908 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 15 | 10, 13, 14 | cbvmpt 5210 | . . . 4 ⊢ (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦)) |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 17 | 2, 7, 16 | 3eqtr4rd 2809 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝐹 ↾ 𝐶)) |
| 18 | rescncf 25248 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐹 ∈ (𝐴–cn→𝐵) → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵))) | |
| 19 | 1, 3, 18 | sylc 66 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵)) |
| 20 | 17, 19 | eqeltrd 2864 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Ⅎwnfc 2911 ⊆ wss 3900 ↦ cmpt 5189 ↾ cres 5657 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 –cn→ccncf 25227 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-map 8877 df-cncf 25229 |
| This theorem is used by: cncfmptssg 47086 itgsin0pilem1 47165 ibliccsinexp 47166 itgsinexplem1 47169 itgsinexp 47170 |
| Copyright terms: Public domain | W3C validator |