| 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 5999 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 3 | cncfmptss.2 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
| 4 | cncff 24882 | . . . . . 6 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐹:𝐴⟶𝐵) | |
| 5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| 6 | 5 | feqmptd 6899 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦))) |
| 7 | 6 | reseq1d 5937 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶)) |
| 8 | nfcv 2903 | . . . . . 6 ⊢ Ⅎ𝑦𝐹 | |
| 9 | nfcv 2903 | . . . . . 6 ⊢ Ⅎ𝑦𝑥 | |
| 10 | 8, 9 | nffv 6841 | . . . . 5 ⊢ Ⅎ𝑦(𝐹‘𝑥) |
| 11 | cncfmptss.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
| 12 | nfcv 2903 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
| 13 | 11, 12 | nffv 6841 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 14 | fveq2 6831 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 15 | 10, 13, 14 | cbvmpt 5177 | . . . 4 ⊢ (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦)) |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 17 | 2, 7, 16 | 3eqtr4rd 2787 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝐹 ↾ 𝐶)) |
| 18 | rescncf 24886 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐹 ∈ (𝐴–cn→𝐵) → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵))) | |
| 19 | 1, 3, 18 | sylc 65 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵)) |
| 20 | 17, 19 | eqeltrd 2841 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 Ⅎwnfc 2888 ⊆ wss 3885 ↦ cmpt 5156 ↾ cres 5623 ⟶wf 6485 ‘cfv 6489 (class class class)co 7360 –cn→ccncf 24865 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3726 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8769 df-cncf 24867 |
| This theorem is referenced by: cncfmptssg 46328 itgsin0pilem1 46407 ibliccsinexp 46408 itgsinexplem1 46411 itgsinexp 46412 |
| Copyright terms: Public domain | W3C validator |