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

Theorem nfvres 5227
Description: The value of a non-member of a restriction is the empty set. (Contributed by NM, 13-Nov-1995.)
Assertion
Ref Expression
nfvres  |-  ( -.  A  e.  B  -> 
( ( F  |`  B ) `  A
)  =  (/) )

Proof of Theorem nfvres
Dummy variables  x  y  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-fv 4930 . . . . . . . . . 10  |-  ( ( F  |`  B ) `  A )  =  ( iota x A ( F  |`  B )
x )
2 df-iota 4887 . . . . . . . . . 10  |-  ( iota
x A ( F  |`  B ) x )  =  U. { y  |  { x  |  A ( F  |`  B ) x }  =  { y } }
31, 2eqtri 2101 . . . . . . . . 9  |-  ( ( F  |`  B ) `  A )  =  U. { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } }
43eleq2i 2145 . . . . . . . 8  |-  ( z  e.  ( ( F  |`  B ) `  A
)  <->  z  e.  U. { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } )
5 eluni 3604 . . . . . . . 8  |-  ( z  e.  U. { y  |  { x  |  A ( F  |`  B ) x }  =  { y } }  <->  E. w ( z  e.  w  /\  w  e. 
{ y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } ) )
64, 5bitri 182 . . . . . . 7  |-  ( z  e.  ( ( F  |`  B ) `  A
)  <->  E. w ( z  e.  w  /\  w  e.  { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } ) )
7 exsimpr 1549 . . . . . . 7  |-  ( E. w ( z  e.  w  /\  w  e. 
{ y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } )  ->  E. w  w  e. 
{ y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } )
86, 7sylbi 119 . . . . . 6  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E. w  w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } } )
9 df-clab 2068 . . . . . . . 8  |-  ( w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } }  <->  [ w  /  y ] {
x  |  A ( F  |`  B )
x }  =  {
y } )
10 nfv 1461 . . . . . . . . 9  |-  F/ y { x  |  A
( F  |`  B ) x }  =  {
w }
11 sneq 3409 . . . . . . . . . 10  |-  ( y  =  w  ->  { y }  =  { w } )
1211eqeq2d 2092 . . . . . . . . 9  |-  ( y  =  w  ->  ( { x  |  A
( F  |`  B ) x }  =  {
y }  <->  { x  |  A ( F  |`  B ) x }  =  { w } ) )
1310, 12sbie 1714 . . . . . . . 8  |-  ( [ w  /  y ] { x  |  A
( F  |`  B ) x }  =  {
y }  <->  { x  |  A ( F  |`  B ) x }  =  { w } )
149, 13bitri 182 . . . . . . 7  |-  ( w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } }  <->  { x  |  A ( F  |`  B ) x }  =  { w } )
1514exbii 1536 . . . . . 6  |-  ( E. w  w  e.  {
y  |  { x  |  A ( F  |`  B ) x }  =  { y } }  <->  E. w { x  |  A ( F  |`  B ) x }  =  { w } )
168, 15sylib 120 . . . . 5  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E. w { x  |  A
( F  |`  B ) x }  =  {
w } )
17 euabsn2 3461 . . . . 5  |-  ( E! x  A ( F  |`  B ) x  <->  E. w { x  |  A
( F  |`  B ) x }  =  {
w } )
1816, 17sylibr 132 . . . 4  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E! x  A ( F  |`  B ) x )
19 euex 1971 . . . 4  |-  ( E! x  A ( F  |`  B ) x  ->  E. x  A ( F  |`  B ) x )
20 df-br 3786 . . . . . . . 8  |-  ( A ( F  |`  B ) x  <->  <. A ,  x >.  e.  ( F  |`  B ) )
21 df-res 4375 . . . . . . . . 9  |-  ( F  |`  B )  =  ( F  i^i  ( B  X.  _V ) )
2221eleq2i 2145 . . . . . . . 8  |-  ( <. A ,  x >.  e.  ( F  |`  B )  <->  <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) ) )
2320, 22bitri 182 . . . . . . 7  |-  ( A ( F  |`  B ) x  <->  <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V )
) )
24 elin 3155 . . . . . . . 8  |-  ( <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) )  <-> 
( <. A ,  x >.  e.  F  /\  <. A ,  x >.  e.  ( B  X.  _V )
) )
2524simprbi 269 . . . . . . 7  |-  ( <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) )  ->  <. A ,  x >.  e.  ( B  X.  _V ) )
2623, 25sylbi 119 . . . . . 6  |-  ( A ( F  |`  B ) x  ->  <. A ,  x >.  e.  ( B  X.  _V ) )
27 opelxp1 4395 . . . . . 6  |-  ( <. A ,  x >.  e.  ( B  X.  _V )  ->  A  e.  B
)
2826, 27syl 14 . . . . 5  |-  ( A ( F  |`  B ) x  ->  A  e.  B )
2928exlimiv 1529 . . . 4  |-  ( E. x  A ( F  |`  B ) x  ->  A  e.  B )
3018, 19, 293syl 17 . . 3  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  A  e.  B )
3130con3i 594 . 2  |-  ( -.  A  e.  B  ->  -.  z  e.  (
( F  |`  B ) `
 A ) )
3231eq0rdv 3288 1  |-  ( -.  A  e.  B  -> 
( ( F  |`  B ) `  A
)  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    = wceq 1284   E.wex 1421    e. wcel 1433   [wsb 1685   E!weu 1941   {cab 2067   _Vcvv 2601    i^i cin 2972   (/)c0 3251   {csn 3398   <.cop 3401   U.cuni 3601   class class class wbr 3785    X. cxp 4361    |` cres 4365   iotacio 4885   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-xp 4369  df-res 4375  df-iota 4887  df-fv 4930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator