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

Theorem ressn 5079
Description: Restriction of a class to a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.)
Assertion
Ref Expression
ressn  |-  ( A  |`  { B } )  =  ( { B }  X.  ( A " { B } ) )

Proof of Theorem ressn
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 4847 . 2  |-  Rel  ( A  |`  { B }
)
2 relxp 4648 . 2  |-  Rel  ( { B }  X.  ( A " { B }
) )
3 ancom 264 . . . 4  |-  ( (
<. x ,  y >.  e.  A  /\  x  e.  { B } )  <-> 
( x  e.  { B }  /\  <. x ,  y >.  e.  A
) )
4 vex 2689 . . . . . . 7  |-  x  e. 
_V
5 vex 2689 . . . . . . 7  |-  y  e. 
_V
64, 5elimasn 4906 . . . . . 6  |-  ( y  e.  ( A " { x } )  <->  <. x ,  y >.  e.  A )
7 elsni 3545 . . . . . . . . 9  |-  ( x  e.  { B }  ->  x  =  B )
87sneqd 3540 . . . . . . . 8  |-  ( x  e.  { B }  ->  { x }  =  { B } )
98imaeq2d 4881 . . . . . . 7  |-  ( x  e.  { B }  ->  ( A " {
x } )  =  ( A " { B } ) )
109eleq2d 2209 . . . . . 6  |-  ( x  e.  { B }  ->  ( y  e.  ( A " { x } )  <->  y  e.  ( A " { B } ) ) )
116, 10syl5bbr 193 . . . . 5  |-  ( x  e.  { B }  ->  ( <. x ,  y
>.  e.  A  <->  y  e.  ( A " { B } ) ) )
1211pm5.32i 449 . . . 4  |-  ( ( x  e.  { B }  /\  <. x ,  y
>.  e.  A )  <->  ( x  e.  { B }  /\  y  e.  ( A " { B } ) ) )
133, 12bitri 183 . . 3  |-  ( (
<. x ,  y >.  e.  A  /\  x  e.  { B } )  <-> 
( x  e.  { B }  /\  y  e.  ( A " { B } ) ) )
145opelres 4824 . . 3  |-  ( <.
x ,  y >.  e.  ( A  |`  { B } )  <->  ( <. x ,  y >.  e.  A  /\  x  e.  { B } ) )
15 opelxp 4569 . . 3  |-  ( <.
x ,  y >.  e.  ( { B }  X.  ( A " { B } ) )  <->  ( x  e.  { B }  /\  y  e.  ( A " { B } ) ) )
1613, 14, 153bitr4i 211 . 2  |-  ( <.
x ,  y >.  e.  ( A  |`  { B } )  <->  <. x ,  y >.  e.  ( { B }  X.  ( A " { B }
) ) )
171, 2, 16eqrelriiv 4633 1  |-  ( A  |`  { B } )  =  ( { B }  X.  ( A " { B } ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    = wceq 1331    e. wcel 1480   {csn 3527   <.cop 3530    X. cxp 4537    |` cres 4541   "cima 4542
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-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-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930  df-opab 3990  df-xp 4545  df-rel 4546  df-cnv 4547  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator