Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cncfmptss Structured version   Visualization version   GIF version

Theorem cncfmptss 46543
Description: A continuous complex function restricted to a subset is continuous, using maps-to notation. (Contributed by Glauco Siliprandi, 29-Jun-2017.)
Hypotheses
Ref Expression
cncfmptss.1 Ⅎ𝑥𝐹
cncfmptss.2 (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵))
cncfmptss.3 (𝜑 → 𝐶 ⊆ 𝐴)
Assertion
Ref Expression
cncfmptss (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵))
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem cncfmptss
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cncfmptss.3 . . . 4 (𝜑 → 𝐶 ⊆ 𝐴)
21resmptd 6034 . . 3 (𝜑 → ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦)))
3 cncfmptss.2 . . . . . 6 (𝜑 → 𝐹 ∈ (𝐴–cn→𝐵))
4 cncff 25194 . . . . . 6 (𝐹 ∈ (𝐴–cn→𝐵) → 𝐹:𝐴⟶𝐵)
53, 4syl 18 . . . . 5 (𝜑 → 𝐹:𝐴⟶𝐵)
65feqmptd 6945 . . . 4 (𝜑 → 𝐹 = (𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)))
76reseq1d 5969 . . 3 (𝜑 → (𝐹 ↾ 𝐶) = ((𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)) ↾ 𝐶))
8 nfcv 2923 . . . . . 6 Ⅎ𝑦𝐹
9 nfcv 2923 . . . . . 6 Ⅎ𝑦𝑥
108, 9nffv 6887 . . . . 5 Ⅎ𝑦(𝐹‘𝑥)
11 cncfmptss.1 . . . . . 6 Ⅎ𝑥𝐹
12 nfcv 2923 . . . . . 6 Ⅎ𝑥𝑦
1311, 12nffv 6887 . . . . 5 Ⅎ𝑥(𝐹‘𝑦)
14 fveq2 6877 . . . . 5 (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
1510, 13, 14cbvmpt 5207 . . . 4 (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦))
1615a1i 11 . . 3 (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝑦 ∈ 𝐶 ↦ (𝐹‘𝑦)))
172, 7, 163eqtr4rd 2807 . 2 (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) = (𝐹 ↾ 𝐶))
18 rescncf 25198 . . 3 (𝐶 ⊆ 𝐴 → (𝐹 ∈ (𝐴–cn→𝐵) → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵)))
191, 3, 18sylc 66 . 2 (𝜑 → (𝐹 ↾ 𝐶) ∈ (𝐶–cn→𝐵))
2017, 19eqeltrd 2861 1 (𝜑 → (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) ∈ (𝐶–cn→𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908   ⊆ wss 3899   ↦ cmpt 5186   ↾ cres 5653  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  –cn→ccncf 25177
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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8833  df-cncf 25179
This theorem is used by:  cncfmptssg  46825  itgsin0pilem1  46904  ibliccsinexp  46905  itgsinexplem1  46908  itgsinexp  46909
  Copyright terms: Public domain W3C validator