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

Theorem cncfrss2 23499
Description: Reverse closure of the continuous function predicate. (Contributed by Mario Carneiro, 25-Aug-2014.)
Assertion
Ref Expression
cncfrss2 (𝐹 ∈ (𝐴cn𝐵) → 𝐵 ⊆ ℂ)

Proof of Theorem cncfrss2
Dummy variables 𝑎 𝑏 𝑓 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cncf 23485 . . 3 cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏m 𝑎) ∣ ∀𝑥𝑎𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
21elmpocl2 7388 . 2 (𝐹 ∈ (𝐴cn𝐵) → 𝐵 ∈ 𝒫 ℂ)
32elpwid 4549 1 (𝐹 ∈ (𝐴cn𝐵) → 𝐵 ⊆ ℂ)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2110  wral 3138  wrex 3139  {crab 3142  wss 3935  𝒫 cpw 4538   class class class wbr 5065  cfv 6354  (class class class)co 7155  m cmap 8405  cc 10534   < clt 10674  cmin 10869  +crp 12388  abscabs 14592  cnccncf 23483
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-xp 5560  df-dm 5564  df-iota 6313  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-cncf 23485
This theorem is referenced by:  cncff  23500  cncfi  23501  rescncf  23504  climcncf  23507  cncfco  23514  cncfcnvcn  23528  cnlimci  24486  cncfmptssg  42151  cncfcompt  42164
  Copyright terms: Public domain W3C validator