HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem op2nda 3448
Description: Extract the second member of an ordered pair. (See op1sta 3444 to extract the first member, op2ndb 3447 for an alternate version, and op2nd 4079 for the preferred version.)
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 df-rn 3185 . . . 4 |- ran {<.A, B>.} = dom `'{<.A, B>.}
2 cnvsn.1 . . . . . 6 |- A e. V
3 cnvsn.2 . . . . . 6 |- B e. V
42, 3cnvsn 3445 . . . . 5 |- `'{<.A, B>.} = {<.B, A>.}
54dmeqi 3308 . . . 4 |- dom `'{<.A, B>.} = dom {<.B, A>.}
61, 5eqtr 1493 . . 3 |- ran {<.A, B>.} = dom {<.B, A>.}
76unieqi 2507 . 2 |- U.ran {<.A, B>.} = U.dom {<.B, A>.}
83op1sta 3444 . 2 |- U.dom {<.B, A>.} = B
97, 8eqtr 1493 1 |- U.ran {<.A, B>.} = B
Colors of variables: wff set class
Syntax hints:   = wceq 955   e. wcel 957  Vcvv 1808  {csn 2406  <.cop 2408  U.cuni 2499  `'ccnv 3165  dom cdm 3166  ran crn 3167
This theorem is referenced by:  elxp4 3449  elxp5 3450  op2nd 4079  fo2nd 4085  f2ndres 4087  xpassen 4430  xpdom2 4431  xpmapenlem2 4486  xpmapenlem4 4488  xpmapenlem5 4489  mapunen 4491  xpnnen 7458
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-uni 2500  df-br 2616  df-opab 2663  df-xp 3180  df-rel 3181  df-cnv 3182  df-dm 3184  df-rn 3185
Copyright terms: Public domain