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

Theorem op2nda 5247
Description: Extract the second member of an ordered pair. (See op1sta 5244 to extract the first member and op2ndb 5246 for an alternate version.) (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Hypotheses
Ref Expression
cnvsn.1  |-  A  e. 
_V
cnvsn.2  |-  B  e. 
_V
Assertion
Ref Expression
op2nda  |-  U. ran  {
<. A ,  B >. }  =  B

Proof of Theorem op2nda
StepHypRef Expression
1 cnvsn.1 . . . 4  |-  A  e. 
_V
21rnsnop 5243 . . 3  |-  ran  { <. A ,  B >. }  =  { B }
32unieqi 3924 . 2  |-  U. ran  {
<. A ,  B >. }  =  U. { B }
4 cnvsn.2 . . 3  |-  B  e. 
_V
54unisn 3930 . 2  |-  U. { B }  =  B
63, 5eqtri 2253 1  |-  U. ran  {
<. A ,  B >. }  =  B
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2203   _Vcvv 2813   {csn 3689   <.cop 3692   U.cuni 3914   ran crn 4750
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-xp 4755  df-rel 4756  df-cnv 4757  df-dm 4759  df-rn 4760
This theorem is referenced by:  elxp4  5250  elxp5  5251  op2nd  6341  fo2nd  6352  f2ndres  6354  ixpsnf1o  6971  xpassen  7081  xpdom2  7082
  Copyright terms: Public domain W3C validator