MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ressnop0 Structured version   Unicode version

Theorem ressnop0 6059
Description: If  A is not in  C, then the restriction of a singleton of  <. A ,  B >. to  C is null. (Contributed by Scott Fenton, 15-Apr-2011.)
Assertion
Ref Expression
ressnop0  |-  ( -.  A  e.  C  -> 
( { <. A ,  B >. }  |`  C )  =  (/) )

Proof of Theorem ressnop0
StepHypRef Expression
1 opelxp1 5024 . . 3  |-  ( <. A ,  B >.  e.  ( C  X.  _V )  ->  A  e.  C
)
21con3i 135 . 2  |-  ( -.  A  e.  C  ->  -.  <. A ,  B >.  e.  ( C  X.  _V ) )
3 df-res 5004 . . . 4  |-  ( {
<. A ,  B >. }  |`  C )  =  ( { <. A ,  B >. }  i^i  ( C  X.  _V ) )
4 incom 3684 . . . 4  |-  ( {
<. A ,  B >. }  i^i  ( C  X.  _V ) )  =  ( ( C  X.  _V )  i^i  { <. A ,  B >. } )
53, 4eqtri 2489 . . 3  |-  ( {
<. A ,  B >. }  |`  C )  =  ( ( C  X.  _V )  i^i  { <. A ,  B >. } )
6 disjsn 4081 . . . 4  |-  ( ( ( C  X.  _V )  i^i  { <. A ,  B >. } )  =  (/) 
<->  -.  <. A ,  B >.  e.  ( C  X.  _V ) )
76biimpri 206 . . 3  |-  ( -. 
<. A ,  B >.  e.  ( C  X.  _V )  ->  ( ( C  X.  _V )  i^i 
{ <. A ,  B >. } )  =  (/) )
85, 7syl5eq 2513 . 2  |-  ( -. 
<. A ,  B >.  e.  ( C  X.  _V )  ->  ( { <. A ,  B >. }  |`  C )  =  (/) )
92, 8syl 16 1  |-  ( -.  A  e.  C  -> 
( { <. A ,  B >. }  |`  C )  =  (/) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1374    e. wcel 1762   _Vcvv 3106    i^i cin 3468   (/)c0 3778   {csn 4020   <.cop 4026    X. cxp 4990    |` cres 4994
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pr 4679
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-opab 4499  df-xp 4998  df-res 5004
This theorem is referenced by:  fvunsn  6084  fsnunres  6093  constr3pthlem1  24317  ex-res  24689  wfrlem14  28783
  Copyright terms: Public domain W3C validator