| 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 6033 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 3 | cncfmptss.2 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
| 4 | cncff 25013 | . . . . . 6 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐹:𝐴⟶𝐵) | |
| 5 | 3, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| 6 | 5 | feqmptd 6939 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦))) |
| 7 | 6 | reseq1d 5968 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶)) |
| 8 | nfcv 2927 | . . . . . 6 ⊢ Ⅎ𝑦𝐹 | |
| 9 | nfcv 2927 | . . . . . 6 ⊢ Ⅎ𝑦𝑥 | |
| 10 | 8, 9 | nffv 6881 | . . . . 5 ⊢ Ⅎ𝑦(𝐹‘𝑥) |
| 11 | cncfmptss.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
| 12 | nfcv 2927 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
| 13 | 11, 12 | nffv 6881 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 14 | fveq2 6871 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 15 | 10, 13, 14 | cbvmpt 5207 | . . . 4 ⊢ (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦)) |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))) |
| 17 | 2, 7, 16 | 3eqtr4rd 2811 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝐹 ↾ 𝐶)) |
| 18 | rescncf 25017 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐹 ∈ (𝐴–cn→𝐵) → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵))) | |
| 19 | 1, 3, 18 | sylc 66 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵)) |
| 20 | 17, 19 | eqeltrd 2865 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 Ⅎwnfc 2912 ⊆ wss 3907 ↦ cmpt 5186 ↾ cres 5654 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 –cn→ccncf 24996 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-map 8814 df-cncf 24998 |
| This theorem is referenced by: cncfmptssg 46443 itgsin0pilem1 46522 ibliccsinexp 46523 itgsinexplem1 46526 itgsinexp 46527 |
| Copyright terms: Public domain | W3C validator |