| 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 46521 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 7103 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸):𝐶⟶𝐷) |
| 3 | cncfmptssg.5 | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ 𝐵) | |
| 4 | cncfmptssg.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵)) | |
| 5 | cncfrss2 25175 | . . . . 5 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ⊆ ℂ) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ ℂ) |
| 7 | 3, 6 | sstrd 3940 | . . 3 ⊢ (𝜑 → 𝐷 ⊆ ℂ) |
| 8 | cncfmptssg.4 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 9 | 8 | sselda 3930 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐴) |
| 10 | cncfmptssg.2 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐸) | |
| 11 | 10 | fvmpt2 6993 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐸 ∈ 𝐷) → (𝐹‘𝑥) = 𝐸) |
| 12 | 9, 1, 11 | syl2anc 596 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘𝑥) = 𝐸) |
| 13 | 12 | mpteq2dva 5197 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐶 ↦ 𝐸)) |
| 14 | nfmpt1 5203 | . . . . . 6 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐸) | |
| 15 | 10, 14 | nfcxfr 2920 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
| 16 | 15, 4, 8 | cncfmptss 46521 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵)) |
| 17 | 13, 16 | eqeltrrd 2861 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐵)) |
| 18 | cncfcdm 25181 | . . 3 ⊢ ((𝐷 ⊆ ℂ ∧ (𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐵)) → ((𝑥 ∈ 𝐶 ↦ 𝐸) ∈ (𝐶–cn→𝐷) ↔ (𝑥 ∈ 𝐶 ↦ 𝐸):𝐶⟶𝐷)) | |
| 19 | 7, 17, 18 | syl2anc 596 | . 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 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3898 ↦ cmpt 5185 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 ℂcc 11170 –cn→ccncf 25159 |
| 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 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11228 ax-resscn 11229 ax-1cn 11230 ax-icn 11231 ax-addcl 11232 ax-addrcl 11233 ax-mulcl 11234 ax-mulrcl 11235 ax-mulcom 11236 ax-addass 11237 ax-mulass 11238 ax-distr 11239 ax-i2m1 11240 ax-1ne0 11241 ax-1rid 11242 ax-rnegex 11243 ax-rrecex 11244 ax-cnre 11245 ax-pre-lttri 11246 ax-pre-lttrn 11247 ax-pre-ltadd 11248 ax-pre-mulgt0 11249 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-map 8827 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11317 df-mnf 11318 df-xr 11319 df-ltxr 11320 df-le 11321 df-sub 11515 df-neg 11516 df-div 11944 df-nn 12306 df-2 12375 df-cj 15234 df-re 15235 df-im 15236 df-abs 15371 df-cncf 25161 |
| This theorem is used by: negcncfg 46813 itgsinexplem1 46886 itgiccshift 46912 itgperiod 46913 itgsbtaddcnst 46914 dirkeritg 47034 dirkercncflem2 47036 dirkercncflem4 47038 fourierdlem18 47057 fourierdlem23 47062 fourierdlem39 47078 fourierdlem40 47079 fourierdlem62 47100 fourierdlem73 47111 fourierdlem78 47116 fourierdlem83 47121 fourierdlem84 47122 fourierdlem93 47131 fourierdlem95 47133 fourierdlem101 47139 fourierdlem111 47149 etransclem46 47212 |
| Copyright terms: Public domain | W3C validator |