| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cncfmptssg | Structured version Visualization version GIF version | ||
| Description: A continuous complex function restricted to a subset is continuous, using maps-to notation. This theorem generalizes cncfmptss 46331 because it allows to establish a subset for the codomain also. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| cncfmptssg.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐸) |
| cncfmptssg.3 | ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) |
| cncfmptssg.4 | ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
| cncfmptssg.5 | ⊢ (𝜑 → 𝐷 ⊆ 𝐵) |
| cncfmptssg.6 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐸 ∈ 𝐷) |
| Ref | Expression |
|---|---|
| cncfmptssg | ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cncfmptssg.6 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐸 ∈ 𝐷) | |
| 2 | 1 | fmpttd 7110 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸):𝐶⟶𝐷) |
| 3 | cncfmptssg.5 | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ 𝐵) | |
| 4 | cncfmptssg.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
| 5 | cncfrss2 25062 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ⊆ ℂ) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ ℂ) |
| 7 | 3, 6 | sstrd 3946 | . . 3 ⊢ (𝜑 → 𝐷 ⊆ ℂ) |
| 8 | cncfmptssg.4 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 9 | 8 | sselda 3936 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐴) |
| 10 | cncfmptssg.2 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐸) | |
| 11 | 10 | fvmpt2 7001 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐸 ∈ 𝐷) → (𝐹‘𝑥) = 𝐸) |
| 12 | 9, 1, 11 | syl2anc 595 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘𝑥) = 𝐸) |
| 13 | 12 | mpteq2dva 5203 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐶 ↦ 𝐸)) |
| 14 | nfmpt1 5209 | . . . . . 6 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐸) | |
| 15 | 10, 14 | nfcxfr 2922 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
| 16 | 15, 4, 8 | cncfmptss 46331 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| 17 | 13, 16 | eqeltrrd 2863 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐵)) |
| 18 | cncfcdm 25068 | . . 3 ⊢ ((𝐷 ⊆ ℂ ∧ (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐵)) → ((𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐷) ↔ (𝑥 ∈ 𝐶 ↦ 𝐸):𝐶⟶𝐷)) | |
| 19 | 7, 17, 18 | syl2anc 595 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐷) ↔ (𝑥 ∈ 𝐶 ↦ 𝐸):𝐶⟶𝐷)) |
| 20 | 2, 19 | mpbird 260 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ⊆ wss 3904 ↦ cmpt 5191 ⟶wf 6532 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 –cn→ccncf 25046 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-cj 15157 df-re 15158 df-im 15159 df-abs 15294 df-cncf 25048 |
| This theorem is used by: negcncfg 46623 itgsinexplem1 46696 itgiccshift 46722 itgperiod 46723 itgsbtaddcnst 46724 dirkeritg 46844 dirkercncflem2 46846 dirkercncflem4 46848 fourierdlem18 46867 fourierdlem23 46872 fourierdlem39 46888 fourierdlem40 46889 fourierdlem62 46910 fourierdlem73 46921 fourierdlem78 46926 fourierdlem83 46931 fourierdlem84 46932 fourierdlem93 46941 fourierdlem95 46943 fourierdlem101 46949 fourierdlem111 46959 etransclem46 47022 |
| Copyright terms: Public domain | W3C validator |