MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elcncf Structured version   Visualization version   GIF version

Theorem elcncf 25013
Description: Membership in the set of continuous complex functions from 𝐴 to 𝐵. (Contributed by Paul Chapman, 11-Oct-2007.) (Revised by Mario Carneiro, 9-Nov-2013.)
Assertion
Ref Expression
elcncf ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐹 ∈ (𝐴cn𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦))))
Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝐴   𝑤,𝐹,𝑥,𝑦,𝑧   𝑤,𝐵,𝑥,𝑦,𝑧

Proof of Theorem elcncf
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 cncfval 25012 . . . 4 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴cn𝐵) = {𝑓 ∈ (𝐵m 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
21eleq2d 2855 . . 3 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐹 ∈ (𝐴cn𝐵) ↔ 𝐹 ∈ {𝑓 ∈ (𝐵m 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)}))
3 fveq1 6878 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
4 fveq1 6878 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑓𝑤) = (𝐹𝑤))
53, 4oveq12d 7426 . . . . . . . . 9 (𝑓 = 𝐹 → ((𝑓𝑥) − (𝑓𝑤)) = ((𝐹𝑥) − (𝐹𝑤)))
65fveq2d 6883 . . . . . . . 8 (𝑓 = 𝐹 → (abs‘((𝑓𝑥) − (𝑓𝑤))) = (abs‘((𝐹𝑥) − (𝐹𝑤))))
76breq1d 5120 . . . . . . 7 (𝑓 = 𝐹 → ((abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦 ↔ (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦))
87imbi2d 343 . . . . . 6 (𝑓 = 𝐹 → (((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦)))
98rexralbidv 3237 . . . . 5 (𝑓 = 𝐹 → (∃𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∃𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦)))
1092ralbidv 3235 . . . 4 (𝑓 = 𝐹 → (∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦) ↔ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦)))
1110elrab 3659 . . 3 (𝐹 ∈ {𝑓 ∈ (𝐵m 𝐴) ∣ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)} ↔ (𝐹 ∈ (𝐵m 𝐴) ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦)))
122, 11bitrdi 290 . 2 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐹 ∈ (𝐴cn𝐵) ↔ (𝐹 ∈ (𝐵m 𝐴) ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦))))
13 cnex 11177 . . . . 5 ℂ ∈ V
1413ssex 5289 . . . 4 (𝐵 ⊆ ℂ → 𝐵 ∈ V)
1513ssex 5289 . . . 4 (𝐴 ⊆ ℂ → 𝐴 ∈ V)
16 elmapg 8832 . . . 4 ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐹 ∈ (𝐵m 𝐴) ↔ 𝐹:𝐴𝐵))
1714, 15, 16syl2anr 608 . . 3 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐹 ∈ (𝐵m 𝐴) ↔ 𝐹:𝐴𝐵))
1817anbi1d 642 . 2 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → ((𝐹 ∈ (𝐵m 𝐴) ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦)) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦))))
1912, 18bitrd 282 1 ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐹 ∈ (𝐴cn𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝐴 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝐹𝑥) − (𝐹𝑤))) < 𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  wrex 3095  {crab 3423  Vcvv 3463  wss 3913   class class class wbr 5110  wf 6529  cfv 6533  (class class class)co 7408  m cmap 8820  cc 11094   < clt 11239  cmin 11437  +crp 13012  abscabs 15281  cnccncf 25000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7411  df-oprab 7412  df-mpo 7413  df-map 8822  df-cncf 25002
This theorem is referenced by:  elcncf2  25014  cncff  25017  elcncf1di  25019  rescncf  25021  cncfmet  25033  cncfshift  46473  cncfperiod  46478
  Copyright terms: Public domain W3C validator