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

Theorem op2nda 4805
Description: Extract the second member of an ordered pair. (See op1sta 4802 to extract the first member and op2ndb 4804 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 4801 . . 3  |-  ran  { <. A ,  B >. }  =  { B }
32unieqi 3590 . 2  |-  U. ran  {
<. A ,  B >. }  =  U. { B }
4 cnvsn.2 . . 3  |-  B  e. 
_V
54unisn 3596 . 2  |-  U. { B }  =  B
63, 5eqtri 2060 1  |-  U. ran  {
<. A ,  B >. }  =  B
Colors of variables: wff set class
Syntax hints:    = wceq 1243    e. wcel 1393   _Vcvv 2557   {csn 3375   <.cop 3378   U.cuni 3580   ran crn 4346
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-xp 4351  df-rel 4352  df-cnv 4353  df-dm 4355  df-rn 4356
This theorem is referenced by:  elxp4  4808  elxp5  4809  op2nd  5774  fo2nd  5785  f2ndres  5787  xpassen  6304  xpdom2  6305
  Copyright terms: Public domain W3C validator