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

Theorem elcncf1di 15805
Description: Membership in the set of continuous complex functions from 
A to  B. (Contributed by Paul Chapman, 26-Nov-2007.)
Hypotheses
Ref Expression
elcncf1d.1  |-  ( ph  ->  F : A --> B )
elcncf1d.2  |-  ( ph  ->  ( ( x  e.  A  /\  y  e.  RR+ )  ->  Z  e.  RR+ ) )
elcncf1d.3  |-  ( ph  ->  ( ( ( x  e.  A  /\  w  e.  A )  /\  y  e.  RR+ )  ->  (
( abs `  (
x  -  w ) )  <  Z  -> 
( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) ) )
Assertion
Ref Expression
elcncf1di  |-  ( ph  ->  ( ( A  C_  CC  /\  B  C_  CC )  ->  F  e.  ( A -cn-> B ) ) )
Distinct variable groups:    x, w, y, A    w, B, x, y    w, F, x, y    ph, w, x, y   
w, Z
Allowed substitution hints:    Z( x,  y)

Proof of Theorem elcncf1di
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 elcncf1d.1 . . 3  |-  ( ph  ->  F : A --> B )
2 elcncf1d.2 . . . . . 6  |-  ( ph  ->  ( ( x  e.  A  /\  y  e.  RR+ )  ->  Z  e.  RR+ ) )
32imp 124 . . . . 5  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  RR+ ) )  ->  Z  e.  RR+ )
4 an32 568 . . . . . . . . 9  |-  ( ( ( x  e.  A  /\  w  e.  A
)  /\  y  e.  RR+ )  <->  ( ( x  e.  A  /\  y  e.  RR+ )  /\  w  e.  A ) )
54anbi2i 461 . . . . . . . 8  |-  ( (
ph  /\  ( (
x  e.  A  /\  w  e.  A )  /\  y  e.  RR+ )
)  <->  ( ph  /\  ( ( x  e.  A  /\  y  e.  RR+ )  /\  w  e.  A ) ) )
6 anass 405 . . . . . . . 8  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  RR+ ) )  /\  w  e.  A
)  <->  ( ph  /\  ( ( x  e.  A  /\  y  e.  RR+ )  /\  w  e.  A ) ) )
75, 6bitr4i 187 . . . . . . 7  |-  ( (
ph  /\  ( (
x  e.  A  /\  w  e.  A )  /\  y  e.  RR+ )
)  <->  ( ( ph  /\  ( x  e.  A  /\  y  e.  RR+ )
)  /\  w  e.  A ) )
8 elcncf1d.3 . . . . . . . 8  |-  ( ph  ->  ( ( ( x  e.  A  /\  w  e.  A )  /\  y  e.  RR+ )  ->  (
( abs `  (
x  -  w ) )  <  Z  -> 
( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) ) )
98imp 124 . . . . . . 7  |-  ( (
ph  /\  ( (
x  e.  A  /\  w  e.  A )  /\  y  e.  RR+ )
)  ->  ( ( abs `  ( x  -  w ) )  < 
Z  ->  ( abs `  ( ( F `  x )  -  ( F `  w )
) )  <  y
) )
107, 9sylbir 135 . . . . . 6  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  RR+ ) )  /\  w  e.  A
)  ->  ( ( abs `  ( x  -  w ) )  < 
Z  ->  ( abs `  ( ( F `  x )  -  ( F `  w )
) )  <  y
) )
1110ralrimiva 2623 . . . . 5  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  RR+ ) )  ->  A. w  e.  A  ( ( abs `  (
x  -  w ) )  <  Z  -> 
( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) )
12 breq2 4135 . . . . . 6  |-  ( z  =  Z  ->  (
( abs `  (
x  -  w ) )  <  z  <->  ( abs `  ( x  -  w
) )  <  Z
) )
1312rspceaimv 2938 . . . . 5  |-  ( ( Z  e.  RR+  /\  A. w  e.  A  (
( abs `  (
x  -  w ) )  <  Z  -> 
( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) )  ->  E. z  e.  RR+  A. w  e.  A  ( ( abs `  ( x  -  w
) )  <  z  ->  ( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) )
143, 11, 13syl2anc 415 . . . 4  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  RR+ ) )  ->  E. z  e.  RR+  A. w  e.  A  ( ( abs `  ( x  -  w ) )  < 
z  ->  ( abs `  ( ( F `  x )  -  ( F `  w )
) )  <  y
) )
1514ralrimivva 2632 . . 3  |-  ( ph  ->  A. x  e.  A  A. y  e.  RR+  E. z  e.  RR+  A. w  e.  A  ( ( abs `  ( x  -  w
) )  <  z  ->  ( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) )
161, 15jca 306 . 2  |-  ( ph  ->  ( F : A --> B  /\  A. x  e.  A  A. y  e.  RR+  E. z  e.  RR+  A. w  e.  A  ( ( abs `  (
x  -  w ) )  <  z  -> 
( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) ) )
17 elcncf 15799 . 2  |-  ( ( A  C_  CC  /\  B  C_  CC )  ->  ( F  e.  ( A -cn-> B )  <->  ( F : A --> B  /\  A. x  e.  A  A. y  e.  RR+  E. z  e.  RR+  A. w  e.  A  ( ( abs `  ( x  -  w
) )  <  z  ->  ( abs `  (
( F `  x
)  -  ( F `
 w ) ) )  <  y ) ) ) )
1816, 17syl5ibrcom 157 1  |-  ( ph  ->  ( ( A  C_  CC  /\  B  C_  CC )  ->  F  e.  ( A -cn-> B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    e. wcel 2209   A.wral 2528   E.wrex 2529    C_ wss 3220   class class class wbr 4131   -->wf 5376   ` cfv 5380  (class class class)co 6088   CCcc 8183    < clt 8366    - cmin 8504   RR+crp 10071   abscabs 11785   -cn->ccncf 15796
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-map 6928  df-cncf 15797
This theorem is used by:  elcncf1ii  15806  cncfmptc  15822  cncfmptid  15823  addccncf  15826  negcncf  15831
  Copyright terms: Public domain W3C validator