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

Theorem nfvres 5454
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 5131 . . . . . . . . . 10  |-  ( ( F  |`  B ) `  A )  =  ( iota x A ( F  |`  B )
x )
2 df-iota 5088 . . . . . . . . . 10  |-  ( iota
x A ( F  |`  B ) x )  =  U. { y  |  { x  |  A ( F  |`  B ) x }  =  { y } }
31, 2eqtri 2160 . . . . . . . . 9  |-  ( ( F  |`  B ) `  A )  =  U. { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } }
43eleq2i 2206 . . . . . . . 8  |-  ( z  e.  ( ( F  |`  B ) `  A
)  <->  z  e.  U. { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } )
5 eluni 3739 . . . . . . . 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 183 . . . . . . 7  |-  ( z  e.  ( ( F  |`  B ) `  A
)  <->  E. w ( z  e.  w  /\  w  e.  { y  |  {
x  |  A ( F  |`  B )
x }  =  {
y } } ) )
7 exsimpr 1597 . . . . . . 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 120 . . . . . 6  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E. w  w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } } )
9 df-clab 2126 . . . . . . . 8  |-  ( w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } }  <->  [ w  /  y ] {
x  |  A ( F  |`  B )
x }  =  {
y } )
10 nfv 1508 . . . . . . . . 9  |-  F/ y { x  |  A
( F  |`  B ) x }  =  {
w }
11 sneq 3538 . . . . . . . . . 10  |-  ( y  =  w  ->  { y }  =  { w } )
1211eqeq2d 2151 . . . . . . . . 9  |-  ( y  =  w  ->  ( { x  |  A
( F  |`  B ) x }  =  {
y }  <->  { x  |  A ( F  |`  B ) x }  =  { w } ) )
1310, 12sbie 1764 . . . . . . . 8  |-  ( [ w  /  y ] { x  |  A
( F  |`  B ) x }  =  {
y }  <->  { x  |  A ( F  |`  B ) x }  =  { w } )
149, 13bitri 183 . . . . . . 7  |-  ( w  e.  { y  |  { x  |  A
( F  |`  B ) x }  =  {
y } }  <->  { x  |  A ( F  |`  B ) x }  =  { w } )
1514exbii 1584 . . . . . 6  |-  ( E. w  w  e.  {
y  |  { x  |  A ( F  |`  B ) x }  =  { y } }  <->  E. w { x  |  A ( F  |`  B ) x }  =  { w } )
168, 15sylib 121 . . . . 5  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E. w { x  |  A
( F  |`  B ) x }  =  {
w } )
17 euabsn2 3592 . . . . 5  |-  ( E! x  A ( F  |`  B ) x  <->  E. w { x  |  A
( F  |`  B ) x }  =  {
w } )
1816, 17sylibr 133 . . . 4  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  E! x  A ( F  |`  B ) x )
19 euex 2029 . . . 4  |-  ( E! x  A ( F  |`  B ) x  ->  E. x  A ( F  |`  B ) x )
20 df-br 3930 . . . . . . . 8  |-  ( A ( F  |`  B ) x  <->  <. A ,  x >.  e.  ( F  |`  B ) )
21 df-res 4551 . . . . . . . . 9  |-  ( F  |`  B )  =  ( F  i^i  ( B  X.  _V ) )
2221eleq2i 2206 . . . . . . . 8  |-  ( <. A ,  x >.  e.  ( F  |`  B )  <->  <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) ) )
2320, 22bitri 183 . . . . . . 7  |-  ( A ( F  |`  B ) x  <->  <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V )
) )
24 elin 3259 . . . . . . . 8  |-  ( <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) )  <-> 
( <. A ,  x >.  e.  F  /\  <. A ,  x >.  e.  ( B  X.  _V )
) )
2524simprbi 273 . . . . . . 7  |-  ( <. A ,  x >.  e.  ( F  i^i  ( B  X.  _V ) )  ->  <. A ,  x >.  e.  ( B  X.  _V ) )
2623, 25sylbi 120 . . . . . 6  |-  ( A ( F  |`  B ) x  ->  <. A ,  x >.  e.  ( B  X.  _V ) )
27 opelxp1 4573 . . . . . 6  |-  ( <. A ,  x >.  e.  ( B  X.  _V )  ->  A  e.  B
)
2826, 27syl 14 . . . . 5  |-  ( A ( F  |`  B ) x  ->  A  e.  B )
2928exlimiv 1577 . . . 4  |-  ( E. x  A ( F  |`  B ) x  ->  A  e.  B )
3018, 19, 293syl 17 . . 3  |-  ( z  e.  ( ( F  |`  B ) `  A
)  ->  A  e.  B )
3130con3i 621 . 2  |-  ( -.  A  e.  B  ->  -.  z  e.  (
( F  |`  B ) `
 A ) )
3231eq0rdv 3407 1  |-  ( -.  A  e.  B  -> 
( ( F  |`  B ) `  A
)  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1331   E.wex 1468    e. wcel 1480   [wsb 1735   E!weu 1999   {cab 2125   _Vcvv 2686    i^i cin 3070   (/)c0 3363   {csn 3527   <.cop 3530   U.cuni 3736   class class class wbr 3929    X. cxp 4537    |` cres 4541   iotacio 5086   ` cfv 5123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-xp 4545  df-res 4551  df-iota 5088  df-fv 5131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator