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

Theorem op2nda 5095
Description: Extract the second member of an ordered pair. (See op1sta 5092 to extract the first member and op2ndb 5094 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 5091 . . 3  |-  ran  { <. A ,  B >. }  =  { B }
32unieqi 3806 . 2  |-  U. ran  {
<. A ,  B >. }  =  U. { B }
4 cnvsn.2 . . 3  |-  B  e. 
_V
54unisn 3812 . 2  |-  U. { B }  =  B
63, 5eqtri 2191 1  |-  U. ran  {
<. A ,  B >. }  =  B
Colors of variables: wff set class
Syntax hints:    = wceq 1348    e. wcel 2141   _Vcvv 2730   {csn 3583   <.cop 3586   U.cuni 3796   ran crn 4612
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-xp 4617  df-rel 4618  df-cnv 4619  df-dm 4621  df-rn 4622
This theorem is referenced by:  elxp4  5098  elxp5  5099  op2nd  6126  fo2nd  6137  f2ndres  6139  ixpsnf1o  6714  xpassen  6808  xpdom2  6809
  Copyright terms: Public domain W3C validator