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

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

Proof of Theorem cncfrss
Dummy variables 𝑎 𝑏 𝑓 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cncf 14510 . . 3 cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏𝑚 𝑎) ∣ ∀𝑥𝑎𝑦 ∈ ℝ+𝑧 ∈ ℝ+𝑤𝑎 ((abs‘(𝑥𝑤)) < 𝑧 → (abs‘((𝑓𝑥) − (𝑓𝑤))) < 𝑦)})
21elmpocl1 6091 . 2 (𝐹 ∈ (𝐴cn𝐵) → 𝐴 ∈ 𝒫 ℂ)
32elpwid 3601 1 (𝐹 ∈ (𝐴cn𝐵) → 𝐴 ⊆ ℂ)
Colors of variables: wff set class
Syntax hints:  wi 4  wcel 2160  wral 2468  wrex 2469  {crab 2472  wss 3144  𝒫 cpw 3590   class class class wbr 4018  cfv 5235  (class class class)co 5895  𝑚 cmap 6673  cc 7838   < clt 8021  cmin 8157  +crp 9682  abscabs 11037  cnccncf 14509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-iota 5196  df-fun 5237  df-fv 5243  df-ov 5898  df-oprab 5899  df-mpo 5900  df-cncf 14510
This theorem is referenced by:  cncff  14516  cncfi  14517  rescncf  14520  cncfcdm  14521  cncfco  14530  cncfmpt2fcntop  14537  mulcncflem  14542  mulcncf  14543  cnlimci  14594
  Copyright terms: Public domain W3C validator