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

Theorem iscnp3 15304
Description: The predicate "the class  F is a continuous function from topology  J to topology  K at point  P". (Contributed by NM, 15-May-2007.)
Assertion
Ref Expression
iscnp3  |-  ( ( J  e.  (TopOn `  X )  /\  K  e.  (TopOn `  Y )  /\  P  e.  X
)  ->  ( F  e.  ( ( J  CnP  K ) `  P )  <-> 
( F : X --> Y  /\  A. y  e.  K  ( ( F `
 P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) ) ) )
Distinct variable groups:    x, y, F   
x, J, y    x, K, y    x, X, y   
x, Y, y    x, P, y

Proof of Theorem iscnp3
StepHypRef Expression
1 iscnp 15300 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  K  e.  (TopOn `  Y )  /\  P  e.  X
)  ->  ( F  e.  ( ( J  CnP  K ) `  P )  <-> 
( F : X --> Y  /\  A. y  e.  K  ( ( F `
 P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  ( F " x )  C_  y ) ) ) ) )
2 ffun 5536 . . . . . . . . . 10  |-  ( F : X --> Y  ->  Fun  F )
32ad2antlr 493 . . . . . . . . 9  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  Fun  F )
4 toponss 15127 . . . . . . . . . . 11  |-  ( ( J  e.  (TopOn `  X )  /\  x  e.  J )  ->  x  C_  X )
54adantlr 481 . . . . . . . . . 10  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  x  C_  X )
6 fdm 5539 . . . . . . . . . . 11  |-  ( F : X --> Y  ->  dom  F  =  X )
76ad2antlr 493 . . . . . . . . . 10  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  dom  F  =  X )
85, 7sseqtrrd 3287 . . . . . . . . 9  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  x  C_  dom  F )
9 funimass3 5825 . . . . . . . . 9  |-  ( ( Fun  F  /\  x  C_ 
dom  F )  -> 
( ( F "
x )  C_  y  <->  x 
C_  ( `' F " y ) ) )
103, 8, 9syl2anc 415 . . . . . . . 8  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  ( ( F "
x )  C_  y  <->  x 
C_  ( `' F " y ) ) )
1110anbi2d 468 . . . . . . 7  |-  ( ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  /\  x  e.  J )  ->  ( ( P  e.  x  /\  ( F
" x )  C_  y )  <->  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) )
1211rexbidva 2547 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  -> 
( E. x  e.  J  ( P  e.  x  /\  ( F
" x )  C_  y )  <->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) )
1312imbi2d 230 . . . . 5  |-  ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  -> 
( ( ( F `
 P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  ( F " x )  C_  y ) )  <->  ( ( F `  P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) ) )
1413ralbidv 2550 . . . 4  |-  ( ( J  e.  (TopOn `  X )  /\  F : X --> Y )  -> 
( A. y  e.  K  ( ( F `
 P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  ( F " x )  C_  y ) )  <->  A. y  e.  K  ( ( F `  P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) ) )
1514pm5.32da 456 . . 3  |-  ( J  e.  (TopOn `  X
)  ->  ( ( F : X --> Y  /\  A. y  e.  K  ( ( F `  P
)  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  ( F " x
)  C_  y )
) )  <->  ( F : X --> Y  /\  A. y  e.  K  (
( F `  P
)  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F " y ) ) ) ) ) )
16153ad2ant1 1049 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  K  e.  (TopOn `  Y )  /\  P  e.  X
)  ->  ( ( F : X --> Y  /\  A. y  e.  K  ( ( F `  P
)  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  ( F " x
)  C_  y )
) )  <->  ( F : X --> Y  /\  A. y  e.  K  (
( F `  P
)  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F " y ) ) ) ) ) )
171, 16bitrd 188 1  |-  ( ( J  e.  (TopOn `  X )  /\  K  e.  (TopOn `  Y )  /\  P  e.  X
)  ->  ( F  e.  ( ( J  CnP  K ) `  P )  <-> 
( F : X --> Y  /\  A. y  e.  K  ( ( F `
 P )  e.  y  ->  E. x  e.  J  ( P  e.  x  /\  x  C_  ( `' F "
y ) ) ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529    C_ wss 3220   `'ccnv 4773   dom cdm 4774   "cima 4777   Fun wfun 5371   -->wf 5373   ` cfv 5377  (class class class)co 6085  TopOnctopon 15111    CnP ccnp 15287
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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
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-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-top 15099  df-topon 15112  df-cnp 15290
This theorem is used by:  cncnpi  15329  cnpdis  15343
  Copyright terms: Public domain W3C validator