ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cncfval GIF version

Theorem cncfval 11932
Description: The value of the continuous complex function operation is the set of continuous functions from 𝐴 to 𝐵. (Contributed by Paul Chapman, 11-Oct-2007.) (Revised by Mario Carneiro, 9-Nov-2013.)
Assertion
Ref Expression
cncfval ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴cn𝐵) = {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
Distinct variable groups:   𝑤,𝑓,𝑥,𝑦,𝑧,𝐴   𝐵,𝑓,𝑤,𝑥,𝑦,𝑧

Proof of Theorem cncfval
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnex 7529 . . 3 ℂ ∈ V
21elpw2 4001 . 2 (𝐴 ∈ 𝒫 ℂ ↔ 𝐴 ⊆ ℂ)
31elpw2 4001 . 2 (𝐵 ∈ 𝒫 ℂ ↔ 𝐵 ⊆ ℂ)
4 mapvalg 6431 . . . . . 6 ((𝐵 ∈ 𝒫 ℂ ∧ 𝐴 ∈ 𝒫 ℂ) → (𝐵𝑚 𝐴) = {𝑓𝑓:𝐴𝐵})
54ancoms 265 . . . . 5 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵𝑚 𝐴) = {𝑓𝑓:𝐴𝐵})
6 mapex 6427 . . . . 5 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓𝑓:𝐴𝐵} ∈ V)
75, 6eqeltrd 2165 . . . 4 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐵𝑚 𝐴) ∈ V)
8 rabexg 3990 . . . 4 ((𝐵𝑚 𝐴) ∈ V → {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} ∈ V)
97, 8syl 14 . . 3 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} ∈ V)
10 oveq2 5676 . . . . 5 (𝑎 = 𝐴 → (𝑏𝑚 𝑎) = (𝑏𝑚 𝐴))
11 raleq 2565 . . . . . . . 8 (𝑎 = 𝐴 → (∀𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∀𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)))
1211rexbidv 2382 . . . . . . 7 (𝑎 = 𝐴 → (∃𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∃𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)))
1312ralbidv 2381 . . . . . 6 (𝑎 = 𝐴 → (∀𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∀𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)))
1413raleqbi1dv 2573 . . . . 5 (𝑎 = 𝐴 → (∀𝑥𝑎𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)))
1510, 14rabeqbidv 2617 . . . 4 (𝑎 = 𝐴 → {𝑓 ∈ (𝑏𝑚 𝑎) ∣ ∀𝑥𝑎𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} = {𝑓 ∈ (𝑏𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
16 oveq1 5675 . . . . 5 (𝑏 = 𝐵 → (𝑏𝑚 𝐴) = (𝐵𝑚 𝐴))
1716rabeqdv 2616 . . . 4 (𝑏 = 𝐵 → {𝑓 ∈ (𝑏𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} = {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
18 df-cncf 11931 . . . 4 cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏𝑚 𝑎) ∣ ∀𝑥𝑎𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
1915, 17, 18ovmpt2g 5795 . . 3 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ ∧ {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} ∈ V) → (𝐴cn𝐵) = {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
209, 19mpd3an3 1275 . 2 ((𝐴 ∈ 𝒫 ℂ ∧ 𝐵 ∈ 𝒫 ℂ) → (𝐴cn𝐵) = {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
212, 3, 20syl2anbr 287 1 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴cn𝐵) = {𝑓 ∈ (𝐵𝑚 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1290  wcel 1439  {cab 2075  wral 2360  wrex 2361  {crab 2364  Vcvv 2622  wss 3002  𝒫 cpw 3435   class class class wbr 3853  wf 5026  cfv 5030  (class class class)co 5668  𝑚 cmap 6421  cc 7411   < clt 7585  cmin 7716  +crp 9197  abscabs 10493  cnccncf 11930
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-sep 3965  ax-pow 4017  ax-pr 4047  ax-un 4271  ax-setind 4368  ax-cnex 7499
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-rab 2369  df-v 2624  df-sbc 2844  df-dif 3004  df-un 3006  df-in 3008  df-ss 3015  df-pw 3437  df-sn 3458  df-pr 3459  df-op 3461  df-uni 3662  df-br 3854  df-opab 3908  df-id 4131  df-xp 4460  df-rel 4461  df-cnv 4462  df-co 4463  df-dm 4464  df-rn 4465  df-iota 4995  df-fun 5032  df-fn 5033  df-f 5034  df-fv 5038  df-ov 5671  df-oprab 5672  df-mpt2 5673  df-map 6423  df-cncf 11931
This theorem is referenced by:  elcncf  11933
  Copyright terms: Public domain W3C validator